Load-balanced route discovery for mobile ad hoc networks

• Autorzy: Abolhasan M. , Lipman J. , Wysocki T. A.
• Języki publikacji: EN

Abstrakty

EN

This paper presents flow-aware routing protocol (FARP), a new routing strategy designed to improve load balancing and scalability in mobile ad hoc networks. FARP is a hop-by-hop routing protocol, which introduces a flow-aware route discovery strategy to reduce the number of control overheads propagating through the network and distributes the flow of data through least congested nodes to balance the network traffic. FARP was implemented in GloMoSim and compared with AODV. To investigate the load distribution capability of FARP new performance metrics were introduced to measure the data packet flow distribution capability of the each routing protocol. The simulation results obtained illustrate that FARP achieves high levels of throughput, reduces the level of control overheads during route discovery and distributes the network load more evenly between nodes when compared to AODV. This paper also describes a number of alternative strategies and improvements for the FARP.

Słowa kluczowe

EN

ad hoc routing; MANET; load balancing; on-demand routing; protocols

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2006
• Tom: nr 1
• Strony: 38--45
• Opis fizyczny: Bibliogr. 15 poz., il.

Twórcy

autor

Abolhasan M.

autor

Lipman J.

autor

Wysocki T. A.

• Telecommunications and IT Research Institute (TITR), University of Wollongong, Northfields Ave, Wollongong, NSW 2522, Australia,

Bibliografia

• [1] M. Abolhasan, T. A. Wysocki, and E. Dutkiewicz, “LPAR: an adap-tive routing strategy for MANETs”, J. Telecommun. Inform. Technol., no. 2, pp. 28–37, 2003.
• [2] G. Aggelou and R. Tafazolli, “RDMAR: a bandwidth-efficient rout-ing protocol for mobile ad hoc networks”, in ACM Int. Worksh. Wirel. Mob. Multimed. WoWMoM, Seattle, USA, 1999, pp. 26–33.
• [3] B. Bellur, R. G. Ogier, and F. L. Templin, “Topology broadcast based on reverse-path forwarding routing protocol (tbrpf)”, Internet Draft, 2003, draft-ietf-manet-tbrpf-06.txt
• [4] T.-W. Chen and M. Gerla, “Global state routing: a new routing scheme for ad hoc wireless networks”, in Proc. IEEE ICC, Atlanta, USA, 1998.
• [5] S. Das, C. Perkins, and E. Royer, “Ad hoc on demand distance vector (AODV) routing”, Internet Draft, 2002, draft-ietf-manet-aodv-11.txt
• [6] H. Hassanein and A. Zhou, “Routing with load balancing in wireless ad hoc networks”, in Proc. ACM MSWiM, Rome, Italy, 2001.
• [7] P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot, “Optimized link state routing protocol for ad hoc net-works”, in Proc. IEEE INMIC, Orlando, USA, 2001.
• [8] 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.
• [9] UCLA Parallel Computing Laboratory and Wireless Adaptive Mo-bility Laboratory, “Glomosim scalable simulation environment for wireless and wired network systems”, 2003, http://pcl.cs.ucla.edu/projects/glomosim/
• [10] S. J. Lee and M. Gerla, “Dynamic load-aware routing in ad hoc networks”, in Proc. ICC 2001, Helsinki, Finland, 2001.
• [11] S. J. Lee and M. Gerla, “SMR: split multipath routing with max-imally disjoint paths in ad hoc networks”, in Proc. ICC 2001, Helsinki, Finland, 2001.
• [12] Lucent, “Orinoco PC card”, 2003, http://www.lucent.com/orinoco
• [13] 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.
• [14] J. H. Song, V. Wong, and V. Leung, “Load-aware on-demand routing (laor) protocol for mobile ad hoc networks”, in IEEE Veh. Technol. Conf. VTC-Spring, Jeju, Korea, 2003, pp. 1753–1757.
• [15] K. Wu and J. Harms, “Load-sensative routing for mobile ad hoc networks”, in Proc. IEEE ICCCN’01, Scottsdale, USA, 2001.