Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Cluster Computing
Erschienen in: Cluster Computing 5/2019

03.02.2018

Minimum connected dominating set based RSU allocation for smartCloud vehicles in VANET

verfasst von: A. Chinnasamy, B. Sivakumar, P. Selvakumari, A. Suresh

Erschienen in: Cluster Computing | Sonderheft 5/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Nodes (smartCloud vehicles) of minimum connected dominating set form a virtual backbone in a wireless vehicular ad hoc network. A minimum connected dominating set is a minimum set of connected nodes such that every other node in the network is one hop connected with a node in this set. A smartCloud vehicle sends periodic beacon messages (Coordinates) to nearest roadside unit. Every time check smartCloud vehicle or Star whether it belongs to a connected dominating set (CDS). SmartCloud Vehicles in the CDS use a shorter waiting period and retransmit coordinates to same RSU. At time-out expiration, a smartCloud vehicle to address next RSU connectivity and appearance of new neighbors transmits the coordinates. In general, the problem is proved to be NP-hard. In this paper we find a minimum connected dominating set for certain vehicular ad hoc networks. Simulation-based performance evaluation for improving speed, transmission range, processing power, delay using graphs.
Vorheriger Artikel A robust wavelet based decomposition of facial images to improve recognition accuracy in standard appearance based statistical face recognition methods
Nächster Artikel Hybrid Lempel–Ziv–Welch and clipped histogram equalization based medical image compression

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
1.
Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst. 15(10), 908–920 (2004)CrossRef
2.
Misra, R., Mandal, C.: Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks. IEEE Trans. Parallel Distrib. Syst. 21, 292–302 (2010)CrossRef
3.
Xu, J.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht (2001)CrossRefMATH
4.
Kim, D., Wu, Y., Li, Y., Zou, F., Du, D.Z.: Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans. Parallel Distrib. Syst. 20, 147–157 (2009)CrossRef
5.
Dimokas, N., Katsaros, D., Manolopoulos, Y.: Energy-efficient distributed clustering in wireless sensor networks. J. Parallel Distrib. Comput. 70, 371–383 (2010)CrossRefMATH
6.
Rai, M., Verma, S., Tapaswi, S.: A power aware minimum connected dominating set for wireless sensor networks. J. Netw. 4(6), 511–519 (2009)
7.
Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: IEEE INFOCOM, pp. 1597–1604 (2002)
8.
Bharghavan, V., Das, B.: Routing in ad hoc networks using minimum connected dominating set. In: Proceedings of International Conference on Communications’97, Montreal, Canada (1997)
9.
Wu, J., Li, H.L.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14 (1999)
10.
11.
12.
Fernandes, L.M., Gouveia, L.: Minimal spanning trees with a constraint on the number of leaves. Eur. J. Oper. Res. 104, 250–261 (1998)CrossRefMATH
13.
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)MATH
14.
Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Raible, D., Rossmanith, P.: An exact algorithm for the maximum leaf spanning tree problem. Theoret. Comput. Sci. 412, 6290–6302 (2011)MathSciNetCrossRefMATH
15.
16.
Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2n. Algorithmica 52(2), 153–166 (2008)MathSciNetCrossRefMATH
17.
18.
19.
Tsai, Y.T., Lin, Y.L., Hsu, F.R.: Efficient algorithms for the minimum connected domination on trapezoid graphs. Inf. Sci. 177(12), 2405–2417 (2007)MathSciNetCrossRefMATH
20.
Li, P.C., Toulouse, M.: Maximum leaf spanning trees for grid graphs. J. Comb. Math. Comb. Comput. 73, 181–193 (2010)MathSciNetMATH
21.
Chen, Y.C., Syu, Y.L.: Connected dominating set of hypercubes and star graphs. In: International conference on software and computer applications, vol. 41 (2012)
22.
23.
Aslam, B., Wang, P., Zou, C.: An economical, deployable and secure vehicular ad hoc network. In: Proc, Military Communication Conf., San Diego, CA, pp. 1–7 (2008)
24.
Kafsi, M., Papadimitratos, P., Doussey, O., Alpcanz, T., Hubaux, J.P.: VANET connectivity analysis. Tech. Rep., EPFL/T-Labs, Lausanne, Switzerland (2008)
25.
Mohandas, B.K., Nayak, A., Naik, K., Goel, N.: ABSRP-A service discovery approach for vehicular ad-hoc networks. In: Proc. 3rd IEEE Asia-Pacific Services Computing Conf., Pisa, Italy, pp. 1590–1594 (2008)
26.
Wong, G.K., Coppersmith, D.A.: A combinatorial problem related to multi module memory organization. J. Assoc. Comput. Mach. 21, 392–401 (1974)MathSciNetCrossRefMATH
27.
Boesch, F.T., Wang, J.: Reliable circulant networks with minimum transmission delay. IEEE Trans. Circ. Syst. 32(12), 1286–1291 (1985)MathSciNetCrossRefMATH
28.
Bermond, J.C., Comellas, F., Hsu, D.F.: Distributed loop computer networks, a survey. J. Parallel Distrib. Comput. 24(1), 2–10 (1995)CrossRef
29.
Mershad, K., Artail, H., Gerla, M.: We can deliver messages to far vehicles. IEEE Trans. Intell. Transp. Syst. 13(3), 1099–1115 (2012)CrossRef
30.
Rajasingh, I., Rajan, B., Rajan, R.S.: Combinatorial properties of circulant networks. Int. J. Appl. Math. 41(4), 349–351 (2011)MathSciNet
Metadaten
Titel
Minimum connected dominating set based RSU allocation for smartCloud vehicles in VANET
verfasst von
A. Chinnasamy
B. Sivakumar
P. Selvakumari
A. Suresh
Publikationsdatum
03.02.2018
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe Sonderheft 5/2019
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-018-1760-8

Weitere Artikel der Sonderheft 5/2019

Cluster Computing 5/2019 Zur Ausgabe

OriginalPaper

IoT based industrial safety measures monitoring and reporting system using accident reduction model (ARM) control algorithm

OriginalPaper

Mitigation of mutual exclusion problem in 5G new radio standards by token and non token based algorithms

OriginalPaper

Escalating quality of services with channel assignment and traffic scheduling in wireless mesh networks

OriginalPaper

Sorted or pooled? Optimal tournament design for heterogeneous contestants

OriginalPaper

A framework for recommending health-related topics based on topic modeling in conversational data (Twitter)

OriginalPaper

EEG seizure classification based on exploiting phase space reconstruction and extreme learning