Performance study of ad hoc routing protocols with gossip-based approach

A variety of ad hoc routing protocols based on a simple flooding routing method have been developed under the constraints of the limited transmission range of wireless network interfaces and other limited mobility resources in MANETs. In this paper we discuss the performance of a gossip-based routing and flooding protocol based on ad hoc on-demand routing protocols in order to identify the strengths and weaknesses of each protocol and suggest appropriate MANET environments for each routing protocol. To accomplish our goals, we selected six performance metrics: packet delivery fraction, average end-to-end delay of data packets, routing overhead, normalized routing load, throughput, and average node energy used. We performed simulations of three ad hoc routing protocols: AODV+G, AODV, and DSR, using the ns-2 network simulation tool.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[3]  Sugata Sanyal,et al.  Analysis of Dynamic Source Routing and Destination-Sequenced Distance-Vector Protocols for Different Mobility Models , 2007, First Asia International Conference on Modelling & Simulation (AMS'07).

[4]  Ahmed Helmy,et al.  IMPORTANT: a framework to systematically analyze the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Joseph P. Macker,et al.  Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations , 1999, RFC.

[6]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[7]  Roland Sauerbrey,et al.  Biography , 1992, Ann. Pure Appl. Log..

[8]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[9]  H. Poincaré,et al.  Percolation ? , 1982 .

[10]  Michele Zorzi,et al.  Performance comparison of routing protocols for ad hoc networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[12]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[13]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[14]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[15]  Ahmed Helmy,et al.  The IMPORTANT framework for analyzing the Impact of Mobility on Performance Of RouTing protocols for Adhoc NeTworks , 2003, Ad Hoc Networks.

[16]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[17]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[18]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.