Routing Scheme Based on Community Correlation in Socially Aware Networking

Abstract

Since most existing routings in socially aware networking only perform well in a certain statistic of network performance (e.g., Epidemic has high delivery rate but high network overhead, Direct Delivery has low network overhead but poor performance in latency and delivery rate), a new routing scheme: Community Correlation Based Routing (CCBR) is proposed in this paper to balance the delivery rate and network overhead. In CCBR, message forwarding is divided into two phases: in-community and across-community. We first define three new indicators by analyzing the social attributes of nodes: the social relationship between nodes, the active of node and the community correlation between communities. Then we use the three new indicators to form two functions: in-community forwarding utility and across-community forwarding utility. When messages are in the stage of in-community forwarding, we select the node with higher in-community forwarding utility as the relay node to make the messages deliver to the destination node faster. And when messages are in the across-community forwarding stage, the relay node with higher across-community forwarding utility is selected to avoid the messages being confined to the local community and make sure that the messages can always be transmitted to the destination community. Extensive simulations show that the proposed CCBR routing scheme can effectively improve the message delivery rate and greatly reduce the network overhead. And it can achieve better performance compared with the existing routing schemes even under the limited cache.