On Performance Modeling of Ad Hoc Opportunistic Routing Protocols

Since the inception of opportunistic routing in ad hoc networks, a number of OR protocols have been proposed. The performance measure of these protocols is predominantly based on simulation. Although simulation provides a simple and economical mechanism to test complex routing algorithms, they have been reported to produce inconsistent results. Simulation-based evaluation of ad hoc routing protocols should, therefore, be complemented with mathematical modeling and verification. OR protocols try to restrict the number of transmissions, therefore, the most important performance evaluation metric of OR protocols is packet transmission. In this chapter we examine the various mathematical evaluation models available in literature. During our study we found that these models do not consider retransmitted packets. We, therefore, propose an analytical model which account for packet retransmissions. The mathematical models are validated using prominent OR protocols. The performance of OR protocols depend not only on design issues like candidate selection and forwarder prioritization but also on network parameters like node topology, node density, etc. While the user has no control on the network parameters the performance of the protocol can be improved by carefully tuning the design issues. As a proof of concept we propose an OR protocol that minimizes packet retransmissions.

[1]  Vicent Pla,et al.  Modeling and comparison of candidate selection algorithms in opportunistic routing , 2011, Comput. Networks.

[2]  Feng Xia,et al.  QoS Challenges and Opportunities in Wireless Sensor/Actuator Networks , 2008, Sensors.

[3]  Cédric Westphal,et al.  Opportunistic Routing in Dynamic Ad Hoc Networks: the OPRAH protocol , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[4]  A.P. Subramanian,et al.  Interference aware routing in multi-radio wireless mesh networks , 2006, 2006 2nd IEEE Workshop on Wireless Mesh Networks.

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

[6]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[7]  A. S. Sairam,et al.  PBFS: A technique to select forwarders in Opportunistic Routing , 2011, TENCON 2011 - 2011 IEEE Region 10 Conference.

[8]  Tzu-Chieh Tsai,et al.  A Cross-Layer Routing Design for Multi-Interface Wireless Mesh Networks , 2009, EURASIP J. Wirel. Commun. Netw..

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

[10]  N. Santhapuri,et al.  On Bit-Rate Selection for Opportunistic Routing , 2008, 2008 5th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops.

[11]  Srihari Nelakuditi,et al.  On the Efficacy of Opportunistic Routing , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[12]  Tracy Camp,et al.  MANET simulation studies: the incredibles , 2005, MOCO.

[13]  Xiang-Yang Li,et al.  Energy efficient opportunistic routing in wireless networks , 2009, MSWiM '09.

[14]  Dimitrios Koutsonikolas,et al.  CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments , 2010, 2010 Proceedings IEEE INFOCOM.

[15]  Wei Chen,et al.  Optimal forwarder list selection in opportunistic routing , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[16]  Rudolf Hornig,et al.  An overview of the OMNeT++ simulation environment , 2008, Simutools 2008.

[17]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[18]  Dimitrios Koutsonikolas,et al.  CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments , 2010, INFOCOM 2010.

[19]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..

[20]  Robert Tappan Morris,et al.  Opportunistic routing in multi-hop wireless networks , 2004, Comput. Commun. Rev..

[21]  Binoy Ravindran,et al.  Opportunistic real-time routing in multi-hop wireless sensor networks , 2009, SAC '09.

[22]  Priyank Kalla,et al.  Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies , 2005, SAT.

[23]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.