Domain-epidemic spray and forward routing algorithm of opportunistic networks

Authors:
Deng-yin Zhang;Lei Cui
Affiliations:
Key Lab of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Ministry of Education, Nanjing, 210003, China;Key Lab of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Ministry of Education, Nanjing, 210003, China
Venue:
International Journal of Information and Communication Technology
Year:
2013

Citing 6
Cited 0

Probabilistic routing in intermittently connected networks

ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility

PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Fast track article: Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution

Pervasive and Mobile Computing
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the current opportunistic networks routing algorithms, their message arrival rate is not high and the delivery delay is large. This paper proposes a domain-epidemic spray and forward routing algorithm. The algorithm integrates redundancy and encounter prediction strategy. According to the probability of encounters between nodes, the nodes are divided into different domains. The spray and forward strategy is used between domains and the epidemic strategy is used to forward messages within a domain. Using the message confirmation mechanism and a list which is used to record the messages that have arrived to their destination, the new algorithm can effectively reduce redundant messages. Simulation results show our algorithm can effectively improve message arrival rate and reduce end-to-end delay to some extent.