An Efficient Message Routing Algorithm Using Overhearing in Community Opportunistic Networks

For the Opportunistic networks composed by mobile devices, which carried by people and have short-range wireless communication interface, its nodes movement reflects the characteristics of community. When nodes use wireless communication interface to broadcast information, other nodes within its sending range can overhear the sending information. The characteristic of broadcast is rarely used by the routing algorithms of the community opportunistic networks, so we present an efficient message routing algorithm using overhearing in community opportunistic networks. The algorithm divides the message routing into two phases: entering the destination community of message and reaching its destination node. The algorithm selects relay nodes for message based on the community attribute of nodes. At the same time, each node uses the overhearing information to advance the progress of message forwarding and clear redundant messages copies. Experiments result shows that it improves message delivery ratio effectively and reduce network overhead compared with some classic opportunistic networks routing algorithms.

[1]  Insoo Koo,et al.  EECOR: An Energy-Efficient Cooperative Opportunistic Routing Protocol for Underwater Acoustic Sensor Networks , 2017, IEEE Access.

[2]  Xin Wang,et al.  Secure Routing Based on Social Similarity in Opportunistic Networks , 2016, IEEE Transactions on Wireless Communications.

[3]  Xiang Li,et al.  Structural Vulnerability Assessment of Community-Based Routing in Opportunistic Networks , 2016, IEEE Transactions on Mobile Computing.

[4]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .

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

[6]  M. Newman Analysis of weighted networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Jianhua Lu,et al.  Contact-Aware Optimal Resource Allocation for Mobile Data Offloading in Opportunistic Vehicular Networks , 2017, IEEE Transactions on Vehicular Technology.

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

[9]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[10]  M. Markus,et al.  Fluctuation theorem for a deterministic one-particle system. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.