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
Wireless Networks
Erschienen in: Wireless Networks 2/2011

01.02.2011

Quasi-tree mobility management for internet connectivity of mobile ad hoc networks

verfasst von: Trung-Dinh Han, Hoon Oh

Erschienen in: Wireless Networks | Ausgabe 2/2011

Einloggen

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

search-config
loading …

Abstract

The location of mobile nodes must be managed to enable Internet connectivity of mobile ad hoc networks. Node mobility can be managed efficiently using a tree topology in which a mobile node registers with an Internet gateway along a tree path without using flooding. However, a node that loses connectivity to its parent has to find and connect to a new parent through a join-handshaking process. This tends to increase control overhead and impose some delay on on-going communication. Furthermore, the node may join its descendant because of the synchronization delay in updating topology change, creating a loop that significantly increases control overhead. We improve these problems by maintaining a quasi-tree topology in which a node maintains multiple parents. We also present a technique for detection and resolution of loops. The simulation results show that the quasi-tree mobility management approach far outperforms the traditional approaches and is highly robust against the significant increases in tree size and node mobility.
Vorheriger Artikel Optimal channel access for TCP performance improvement in cognitive radio networks
Nächster Artikel Short-range cognitive radio network: system architecture and MAC protocol for coexistence with legacy WLAN

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
Fußnoten
1
The “logically leave” means that a node removes a tree-link to its parent, but still maintain a link as a neighbor.
 
2
Synchronization delay indicates that if a link between any two nodes comes to existing or is broken, the other nodes know the change only after some time interval, but not immediately.
 
Literatur
1.
Perkins, C. (1996). “IP mobility support,” request for comments (Standard) 2002, Internet Engineering Task Force, Oct 1996.
2.
Broch, J., Maltz, D. A., & Johnson, D. B. (1999). Supporting hierarchy and heterogeneous interfaces in multi-hop wireless ad hoc networks. In Proc. Int’l. Symp. Parallel Architecture, Algorithms, and Networks, Perth, Australia (pp. 370–375), June 1999.
3.
Jonsson, D., Alriksson, F., Larsson, T., Johansson, P., & Maguire, J. G. (2000). MIPMANET—mobile IP for mobile ad hoc networks. In Proceedings of IEEE/ACM workshop on mobile and ad hoc networking and computing (MobiHoc’00), Boston, MA, USA, pp. 75–85, Aug 2000.
4.
Sun, Y., Belding-Royer, E. M., & Perkins, C. E. (2002). Internet connectivity for ad hoc mobile networks. International Journal of Wireless Information Networks special issue on Mobile Ad Hoc Networks (MANETs): Standards, Research, and Applications, 9(2), 75–88.
5.
Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on-demand distance vector routing. In Second IEEE workshop on mobile computing systems and applications (pp. 90–100), Feb 1999.
6.
Ratanchandani, P., Kravets, R. (2003). A hybrid approach to Internet connectivity for mobile ad hoc networks. In Proceeding of IEEE WCNC 2003 (pp. 1522–1527), March 2003.
7.
Ammari, H., & El-Rewini, H. (2004). Integration of mobile ad hoc networks and the Internet using mobile gateways. In Proceedings of 18th international symposium of parallel and distributed processing, vol. 13 (pp. 218b), April 2004.
8.
Perkins, C. E., & Bhagwat, P. (1994). Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. ACM SIGCOMM: Computer Communications Review, 24(4), 234–244.
9.
El-Moshrify, H., Mangoud, M. A., Rizk, M. (2007). Gateway discovery in ad hoc ondemand distance vector (AODV) routing for Internet connectivity. In Radio science conference, NRSC 2007 (pp. 1–8), March 2007.
10.
Ruiz, P., Gomez-Skarmeta, A. (2004). Enhanced internet connectivity for hybrid ad hoc networks through adaptive gateway discovery. In Proceedings of the 29th annual IEEE international conference on local computer networks (LCN’04), IEEE computer society, Los Alamitos, CA, USA (pp. 370–377), Nov 2004.
11.
Oh, H. (2009). A tree-based approach for the Internet connectivity of mobile ad hoc networks. Journal of Communications and Networks, 11(3), 261–270.
12.
Han, T. D., Oh, H. (2009). A topology management routing protocol for mobile IP support of mobile ad hoc networks. In 8th international conference on ad hoc networks and wireless, Ad Hoc Now 2009, Murcia, Spain, LNCS 5793 (pp. 341–346), Sep 2009.
13.
Helder, D. A., & Jamin, S. (2000). Banana tree protocol (BTP), an end-host multicast protocol. University of Michigan, Technical Report CSE-TR-429-00, July 2000.
14.
Jubin, J., & Tornow, J. D. (1987). The DARPA packet radio network protocols. Proceedings of the IEEE, 75(1), 21–32.
Metadaten
Titel
Quasi-tree mobility management for internet connectivity of mobile ad hoc networks
verfasst von
Trung-Dinh Han
Hoon Oh
Publikationsdatum
01.02.2011
Verlag
Springer US
Erschienen in
Wireless Networks / Ausgabe 2/2011
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-010-0293-8

Weitere Artikel der Ausgabe 2/2011

Wireless Networks 2/2011 Zur Ausgabe

OriginalPaper

Distributed algorithms for resource allocation of physical and transport layers in wireless cognitive ad hoc networks

OriginalPaper

Application layer QoS optimization for multimedia transmission over cognitive radio networks

OriginalPaper

Model-based object tracking in wireless sensor networks

OriginalPaper

Optimal channel access for TCP performance improvement in cognitive radio networks

OriginalPaper

Short-range cognitive radio network: system architecture and MAC protocol for coexistence with legacy WLAN

OriginalPaper

Near-zero triangular location through time-slotted mobility prediction

Neuer Inhalt

    Bildnachweise