Abstract—Opportunistic networks exploit human mobility and consequent device-to-device contacts to opportunistically create data paths over time. Identifying influential nodes as relay is a crucial problem for efficient routing in opportunistic networks. The degree centrality method is very simple but of little relevance. Although closeness centrality and betweenness centrality can effectively identify influential nodes, they are incapable to be applied in large-scale networks due to the high computational complexity. In this paper, we focus on designing an effective centrality ranking metric with low computational complexity in opportunistic networks. We propose the semi locally evaluated centrality metric to identify influential nodes for message forwarding in opportunistic networks. We also present a simple message forwarding algorithm, and employ real world mobility traces and synthetic mobility traces to evaluate the benefits of the proposed semi locally evaluated centrality metric. Results demonstrate the efficiency of the proposed metric in opportunistic networks.

Index Terms—Opportunistic networks, semi locally evaluated centrality metric, efficient routing.

Cite: Zhenxiang Gao, Yan Shi, and Shanzhi Chen, "Identifying Influential Nodes for Efficient Routing in Opportunistic Networks," Journal of Communications, vol. 10, no. 1, pp. 48-54, 2015. Doi: 10.12720/jcm.10.1.48-54