Mobile Information Systems

Mobile Information Systems / 2013 / Article

Open Access

Volume 9 |Article ID 365497 | https://doi.org/10.1155/2013/365497

Jianwei Niu, Mingzhu Liu, Han-Chieh Chao, "A P2P Query Algorithm for Opportunistic Networks Utilizing betweenness Centrality Forwarding", Mobile Information Systems, vol. 9, Article ID 365497, 15 pages, 2013. https://doi.org/10.1155/2013/365497

A P2P Query Algorithm for Opportunistic Networks Utilizing betweenness Centrality Forwarding

Received11 Mar 2013
Accepted11 Mar 2013

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.

Copyright © 2013 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Order printed copiesOrder
Views249
Downloads279
Citations