A Novel Social-Based Clustering and Routing Scheme in Mobile Opportunistic Networks

In this paper, we take a real-life example to show that social relationship among nodes consists of explicit and implicit parts. Explicit social relationship comes from direct contact among nodes, and implicit social relationship can be measured through the "circle of friends". Based on effective measurement of social relationship, we propose a novel social-based clustering and routing scheme. Each node selects the nodes with close social relationship to form a local cluster, and self-control method is used to keep all cluster members always having close relationship with each other. Cluster-based message forwarding mechanism is designed for opportunistic routing, in which each node only forwards the copy of the message to nodes with the destination node as a member of local cluster. Simulation results show that the proposed social-based clustering and routing outperforms the other two classic routing algorithms.

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

[2]  Song Guo,et al.  On Social Delay-Tolerant Networking: Aggregation, Tie Detection, and Routing , 2014, IEEE Transactions on Parallel and Distributed Systems.

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

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

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

[6]  Jie Wu,et al.  Universal opportunistic routing scheme using network coding , 2012, 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[7]  Marco Conti,et al.  Impact of Social Mobility on Routing Protocols for Opportunistic Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[8]  Baochun Li,et al.  CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding , 2008, 2008 IEEE International Conference on Network Protocols.

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

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

[11]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

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

[13]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Jie Wu,et al.  Geocommunity-Based Broadcasting for Data Dissemination in Mobile Social Networks , 2012 .

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