Performance analysis of epidemic routing in DTNs with limited forwarding times and selfish nodes Online publication date: Mon, 29-Jul-2013
by Yahui Wu; Su Deng; Hongbin Huang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 13, No. 3/4, 2013
Abstract: Routing protocols in Delay-Tolerant Networks (DTNs) often need nodes serving as relays to carry and forward the messages. Because of the energy constraint, each node cannot forward too many times. Moreover, the maximal forwarding times may be heterogeneous for different nodes. In addition, nodes can form many communities according to certain social relations, and nodes in the same community can be seen as friends. Because of the selfish nature, one node may use its limited forwarding times to help its friends. This paper proposes a theoretical framework to evaluate the performance of the Epidemic Routing (ER) algorithm in DTNs in such complex environment for the first time. Simulations based on both synthetic and real motion traces show the accuracy of our framework. Numerical results show that ER algorithm is very robust to the forwarding times. Moreover, the impact of the selfish nature is related with many factors (e.g., number of nodes, number of communities, etc.).
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook