Centrality based congestion controlled routing protocol for social opportunistic networks

Opportunistic networks (Oppnets) use the Store, Carry, and Forward technique for routing of messages. This technique can increase the prospects of message delivery but it is resource intensive as messages are kept in node's buffer until an appropriate next hop node is find out. This may lead to increased overhead and buffer overflow that causes congestion. In view of this, a scheme based on centrality and message parameters named as Centrality based Congestion Controlled Routing Protocol (CCCRP) has been proposed in this paper. It allows a receiver node to accept the message of a sender node whose centrality is high and to-be-sent message carries an "importance" as compared to others from a set of neighbouring sender nodes. The CCCRP is compared with Epidemic protocol in respect of messages dropped and overhead ratio parameters. Results obtained indicate that CCCRP outperforms Epidemic protocol in terms of the aforementioned parameters.