Performance analysis of epidemic routing in DTNs with limited forwarding times and selfish nodes

Authors:
Yahui Wu;Su Deng;Hongbin Huang
Affiliations:
Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410073, China;Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410073, China;Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410073, China
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2013

Citing 18
Cited 0

The Spatial Node Distribution of the Random Waypoint Mobility Model

Mobile Ad-Hoc Netzwerke, 1. deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002
A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Performance modeling of epidemic routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Power law and exponential decay of inter contact times between mobile devices

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Multicasting in delay tolerant networks: a social network perspective

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
The ONE simulator for DTN protocol evaluation

Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Deep-Space Transport Protocol: A novel transport scheme for Space DTNs

Computer Communications
Crossing over the bounded domain: from exponential to power-law intermeeting time in mobile ad hoc networks

IEEE/ACM Transactions on Networking (TON)
The effects of node cooperation level on routing performance in delay tolerant networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Selfishness, altruism and message spreading in mobile social networks

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Pi: a practical incentive protocol for delay tolerant networks

IEEE Transactions on Wireless Communications
Vector routing protocols for Delay Tolerant Networks

International Journal of Ad Hoc and Ubiquitous Computing
Recognizing exponential inter-contact time in VANETs

INFOCOM'10 Proceedings of the 29th conference on Information communications
Routing in socially selfish delay tolerant networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks

IEEE Communications Letters
Overlapping communities in dynamic networks: their detection and mobile applications

MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Building routing overlays in disrupted networks: inferring contacts in challenged sensor internetworks

International Journal of Ad Hoc and Ubiquitous Computing
Enabling delay-tolerant communications for partially connected vehicular ad hoc networks

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

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..