Group aware cooperative routing for opportunistic networks under resource constraints

Opportunistic networks are a new evolution of mobile ad hoc networks composed of intermittently connected nodes, in which the routing for the dynamic topology is a challenging issue. In opportunistic networks, the mobile nodes with common interest or close relationship may form into groups and move together, which brings us a good feature to employ when designing the routing protocol for opportunistic networks under resource constraints. Our main idea in this paper is to maximize the message delivery probability in a group-aware opportunistic network under the constraints of bandwidth and buffer space. Embedded this idea, we propose a cooperative routing protocol using the group feature, which includes the cooperative message transfer scheme and the buffer management strategy. In the cooperative message transfer scheme, the limited bandwidth is considered and the message transfer priorities are designed to maximize the delivery probability. In the buffer management strategy, by considering the constraint of buffer space, we propose the cooperative message caching scheme and the dropping order of the messages is designed to minimize the reduced delivery probability. Finally, we conduct the simulations to demonstrate the effectiveness of our proposed routing protocol.

[1]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[2]  Guohong Cao,et al.  On exploiting transient contact patterns for data forwarding in Delay Tolerant Networks , 2010, The 18th IEEE International Conference on Network Protocols.

[3]  Qinghua Li,et al.  Routing in Socially Selfish Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[4]  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).

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

[6]  Sudha Krishnamurthy,et al.  CREST: An Opportunistic Forwarding Protocol Based on Conditional Residual Time , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

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

[8]  Li Li,et al.  Practical Routing in Delay-Tolerant Networks , 2007, IEEE Trans. Mob. Comput..

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

[10]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

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

[12]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[13]  Thrasyvoulos Spyropoulos,et al.  Optimal Buffer Management Policies for Delay Tolerant Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[14]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[15]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[16]  Jie Wu,et al.  Predict and relay: an efficient routing in disruption-tolerant networks , 2009, MobiHoc '09.

[17]  Robin Kravets,et al.  Encounter-Based Routing in DTNs , 2009, INFOCOM.

[18]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[19]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.