The performance impact of traffic patterns on routing protocols in mobile ad hoc networks

As mobile ad hoc network (MANET) systems research has matured and several testbeds have been built to study MANETs, research has focused on developing new MANET applications such as collaborative games, collaborative computing, messaging systems, distributed security schemes, MANET middleware, peer-to-peer file sharing systems, voting systems, resource management and discovery, vehicular computing and collaborative education systems. The growing set of diverse applications developed for MANETs pose far more complex traffic patterns than the simple one-to-one traffic pattern, and hence the one-to-one traffic pattern widely used in previous protocol studies has become inadequate in reflecting the relative performance of these protocols when deployed to support these emerging applications. As a first step towards effectively supporting newly developed and future diverse MANET applications, this paper studies the performance impact of diverse traffic patterns on routing protocols in MANETs. Specifically, we propose a new communication model that extends the previous communication model to include a more general traffic pattern that varies the number of connections per source node. We study the performance impact of traffic patterns on various routing protocols via detailed simulations of an ad hoc network of 112 mobile nodes. Our simulation results show that many of the conclusions drawn in previous protocol comparison studies no longer hold under the new traffic patterns. These results motivate the need for performance evaluation of ad hoc networks to not only include rich and diverse mobility models as has been done in the past but also include diverse traffic patterns that stress a wide set of protocol design issues.

[1]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[2]  Samir Ranjan Das,et al.  Comparative performance evaluation of routing protocols for mobile, ad hoc networks , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[3]  Samir R. Das,et al.  Comparative Performance Evaluation of Routing Protocols for Mobile, Ad hoc. , 1998 .

[4]  Deborah Estrin,et al.  Advances in network simulation , 2000, Computer.

[5]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[6]  Françoise Sailhan,et al.  Group management for mobile Ad Hoc networks: design, implementation and experiment , 2005, MDM '05.

[7]  Daniel Saffioti,et al.  Distributed, collaborative learning environments using ad hoc networks , 2004, IEEE International Conference on Advanced Learning Technologies, 2004. Proceedings..

[8]  Stefan Penz,et al.  SLP-based service management for dynamic ad-hoc networks , 2005, MPAC '05.

[9]  Samir Ranjan Das,et al.  Simulation‐based performance evaluation of routing protocols for mobile ad hoc networks , 2000, Mob. Networks Appl..

[10]  Matthew Chalmers,et al.  Three applications for mobile epidemic algorithms , 2005, Mobile HCI.

[11]  Antonio Corradi,et al.  A context-aware group management middleware to support resource sharing in MANET environments , 2005, MDM '05.

[12]  Himabindu Pucha,et al.  The performance impact of traffic patterns on routing protocols in mobile ad hoc networks , 2004, MSWiM '04.

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

[14]  Mingyan Liu,et al.  Sound mobility models , 2003, MobiCom '03.

[15]  Vana Kalogeraki,et al.  Data dissemination in mobile peer-to-peer networks , 2005, MDM '05.

[16]  Valérie Issarny,et al.  AdHocFS: sharing files in WLANs , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[17]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[18]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Cecilia Mascolo,et al.  Adapting asynchronous messaging middleware to ad hoc networking , 2004, MPAC '04.

[20]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[21]  Liviu Iftode,et al.  VITP: an information transfer protocol for vehicular computing , 2005, VANET '05.

[22]  Matthew Chalmers,et al.  Picking Pockets on the Lawn: The Development of Tactics and Strategies in a Mobile Game , 2005, UbiComp.

[23]  Yih-Chun Hu,et al.  Caching strategies in on-demand routing protocols for wireless ad hoc networks , 2000, MobiCom '00.

[24]  Charles E. Perkins,et al.  AODV-PA: AODV with path accumulation , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[25]  Sung-Ju Lee,et al.  AODV-BR: backup routing in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[26]  Michel Banâtre,et al.  Collaborative backup for dependable mobile applications , 2004, MPAC '04.

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

[28]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

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

[30]  Zongpeng Li,et al.  iFlow: Middleware-assisted Rendezvous-based Information Access for Mobile Ad Hoc Applications , 2003, MobiSys '03.

[31]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[32]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[33]  Rimon Barr,et al.  Design and implementation of a single system image operating system for ad hoc networks , 2005, MobiSys '05.

[34]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[35]  Kevin C. Almeroth,et al.  Towards realistic mobility models for mobile ad hoc networks , 2003, MobiCom '03.

[36]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[37]  Xiaoyan Hong,et al.  LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[38]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[39]  Giuseppe Di Modica,et al.  Expeerience: a JXTA middleware for mobile ad-hoc networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[40]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[41]  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.