An Enhanced Friendship-Based Routing Scheme Exploiting Regularity in an Opportunistic Network
Ji-Hyeun Yoon, Sun-Kyum Kim, Jun-Yeop Lee, Ki-Young Jang · 2016
An opportunistic network (OPPNET) is an alternative to a mobile ad-hoc network (MANET) in which no complete path is needed. If a complete path is unavailable, the source node sends the message through relay nodes until the message arrives at its destination. Friendship-Based Routing (FBR) is routing scheme for an OPPNET which uses the inter-contact time of each node to find a good relay node. Unfortunately, this method suffers from limitations, such as unreflecting regularity, and unefficient relative social pressure metric. We propose the enhanced Friendship-Based Routing (eFBR) scheme that overcomes the problems of the FBR scheme. In the proposed method, a node does not only utilize inter-contact time, but also consider a contact duration of nodes to select a relay node to reflecting regularity more correctly. The proposed method also simplifies the equation to get indirect relationship of nodes, which improves cost while it does not decrease the performance. Consequently, the proposed routing scheme achieves shorter delivery delay than previous method while reducing the communication cost. Extensive simulation results demonstrate that the proposed scheme improves delivery delay and reducing the communication cost over traditional schemes.