Abstract

In this paper, we present a forwarding algorithm for mobile social opportunistic networks which is both centrality-based and energy-aware. In opportunistic networks, the nodes usually exploit a contact opportunity to perform hop-by-hop routing, since an end-to-end path between the source node and destination node may not exist. Centrality-based forwarding schemes use the structurally important nodes (i.e. nodes having many contacts with neighbors) as message relays and have been shown to be good candidates for social forwarding in opportunistic network environments. However, the most central nodes which are structurally more important than other network nodes, have the disadvantage to be used very frequently as message relays, thus consuming their energy very quickly. Here, we exploit the advantage of using a centrality-based scheme which is distributed and needs only the history of contacts as social information. In addition, we modulate the computed node centrality value using the node energy level in order to avoid transmissions in nodes more central but with a limited energy budget. Simulating three real-world mobility traces, we show that our scheme is able to achieve better delivery ratio and overhead ratio while sensibly reducing the energy consumption of nodes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call