PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

LPAR: an adaptive routing strategy for MANETs

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
This paper presents a new global positioning system (GPS)-based routing protocol, called location-based point-to-point adaptive routing (LPAR) for mobile ad hoc networks. This protocol utilises a 3-state route discovery strategy in a point-to-point manner to reduce routing overhead while maximising throughput in medium to large mobile ad hoc networks. In LPAR, data transmission is adaptable to changing network conditions. This is achieved by using a primary and a secondary data forwarding strategy to transfer data from the source to the destination when the condition of the route is changed during data transmission. A simulation study is performed to compare the performance of LPAR with a number of different exisiting routing algorithms. Our results indicate that LPAR produces less overhead than other simulated routing strategies, while maintains high levels of throughput.
Rocznik
Tom
Strony
28--37
Opis fizyczny
Bibliogr. 16 poz., rys.
Twórcy
autor
  • Telecommunication and Information Research Institute, University of Wollongong, Wollongong, Australia
  • Telecommunication and Information Research Institute University of Wollongong Wollongong, NSW 2522, Australia
  • Motorola Australia Research Centre 12 Lord St, Botany, NSW 2525, Australia
Bibliografia
  • [1] C. E. Perkins and T. J. Watson, “Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers”, in ACM SIGCOMM’94 Conf. Commun. Archit., London, UK, 1994.
  • [2] S. Murthy and J. J. Garcia-Luna-Aceves, “A routing protocol for packet radio networks”, in Mobile Computing and Networking. 1995, pp. 86–95.
  • [3] M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A review of current on-demand routing protocols”, in Netw. – ICN 2001, First Int. Conf., Colmar, France, 2001.
  • [4] D. Johnson, D. Maltz, and J. Jetcheva, “The dynamic source routing protocol for mobile ad hoc networks”, in Internet Draft, draft-ietf manet-dsr-07.txt, work in progress, 2002.
  • [5] S. Das, C. Perkins, and E. Royer, “Ad hoc on demand distance vector (AODV) routing”, in Internet Draft, draft-ietf-manet-aodv11.txt, work in progress, 2002.
  • [6] Z. J. Hass and R. Pearlman, “Zone routing protocol for ad-hoc networks”, in Internet Draft, draft-ietf-manet-zrp-02.txt, work In progress, 1999.
  • [7] M. Joa-Ng and I.-T. Lu, “A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks”, IEEE J. Selec. Areas Commun., vol. 17, no. 8, 1999.
  • [8] S.-Ch. Woo and S. Singh, “Scalable routing protocol for ad hoc networks”, accepted for publication in Journal of Wireless Networks (WINET).
  • [9] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, “The broadcast problem in a mobile ad hoc network”, in Fifth Ann. ACM/IEEE Int. Conf. Wirel. Netw., 2002.
  • [10] Y.-B. Ko and N. H. Vaidya, “Location-aided routing (LAR) in mobile ad hoc networks”, in Proc. Fourth Ann. ACM/IEEE Int. Conf. Mob. Comput. Netw. (Mobicom’98), Dallas, USA, 1998.
  • [11] G. Aggelou and R. Tafazolli, “RDMAR: a bandwidth-efficient routing protocol for mobile ad hoc networks”, in ACM Int. Works. Wirel. Mob. Multimed. (WoWMoM), 1999, pp. 26–33.
  • [12] S. Lee and M. Gerla, “Aodv-br: backup routing in ad hoc networks”, in Proc. IEEE Wirel. Commun. Netw. Conf. (WCNC), Chicago, USA, Sept. 2000.
  • [13] C. Toh, “A novel distributed routing protocol to support ad-hoc mobile computing”, in IEEE 15th Ann. Int. Pheonix Conf., 1996, pp. 480–486.
  • [14] R. Dube, C. Rais, K. Wang, and S. Tripathi, “Signal stability based adaptive routing (SSA) for ad hoc mobile networks”, in IEEE Pers. Commun., Feb. 1997, pp. 36–45.
  • [15] “Glomosim scalable simulation environment for wireless and wired network systems”, http://pcl.cs.ucla.edu/projects/glomosim/
  • [16] “Orinoco pc-card”, http://www.lucent.com/orinoco
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BPS2-0021-0020
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.