Energy-based Performance Evaluation of Various Routing Protocols in Infrastructure-less Opportunistic Networks

Opportunistic Networks (Oppnets) provide the communication facilities in the network scenarios where the end-to-end path between the source and the destination never exists or may last only for an unpredictable and very short period of time. The disconnections and re-connections between the nodes are very common in Oppnets. Therefore, routing in these types of networks is a very challenging task and it is different from that in Mobile Ad hoc Networks (MANETs), which assumes a complete path from the source to the destination before the delivery of a message. As the nodes does all the computations for next hop selection in infrastructure-less Oppnets, a lot of battery power gets consumed which reduces the network lifetime. Thus a proper energy efficient routing protocol should be selected for message passing in these types of networks. In this paper, we have simulated, investigated and compared the performance of various already existing routing protocols for infrastructure-less Oppnets in terms of energy consumption. These protocols have been compared with each other by using various performance evaluating factors like average residual energy, number of nodes that become dead after the simulation run of the protocol.

[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]  Ari Keränen.  Opportunistic Network Environment simulator , 2008 .

[3]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[4]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[5]  Kun-Chan Lan,et al.  A Survey of Opportunistic Networks , 2008, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008).

[6]  J. Ott,et al.  Increasing Reality for DTN Protocol Simulations , 2007 .

[7]  Hassan Artail,et al.  Adaptive Fuzzy Spray and Wait: Efficient routing for Opportunistic Networks , 2011, 2011 International Conference on Selected Topics in Mobile and Wireless Networking (iCOST).

[8]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[9]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[10]  Isaac Woungang,et al.  Performance evaluation of various routing protocols in Opportunistic Networks , 2011, 2011 IEEE GLOBECOM Workshops (GC Wkshps).

[11]  Ling-Jyh Chen,et al.  A content-centric framework for effective data dissemination in opportunistic networks , 2008, IEEE Journal on Selected Areas in Communications.

[12]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[13]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[14]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

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