Affiliations: State Key Laboratory of Software Development
Environment, Beihang University, Beijing, China | Institute of Computer Science and Information,
National Ilan University, I-Lan, Taiwan
Note: [] Corresponding author: Jianwei Niu, State Key Laboratory of
Software Development Environment, Beihang University, Beijing 100191, China.
E-mail: [email protected]
Abstract: With the proliferation of high-end mobile devices that feature
wireless interfaces, many promising applications are enabled in opportunistic
networks. In contrary to traditional networks, opportunistic networks utilize
the mobility of nodes to relay messages in a store-carry-forward paradigm.
Thus, the relay process in opportunistic networks faces several practical
challenges in terms of delay and delivery rate. In this paper, we propose a
novel P2P Query algorithm, namely Betweenness Centrality Forwarding (PQBCF),
for opportunistic networking. PQBCF adopts a forwarding metric called
Betweenness Centrality (BC), which is borrowed from social network, to quantify
the active degree of nodes in the networks. In PQBCF, nodes with a higher BC
are preferable to serve as relays, leading to higher query success rate and
lower query delay. A comparison with the state-of-the-art algorithms reveals
that PQBCF can provide better performance on both the query success Ratio and
query delay, and approaches the performance of Epidemic Routing (ER) with much
less resource consumption.
Keywords: Opportunistic networks, P2P Query, betweenness centrality, social networks, mobile devices, epidemic routing
