Title: Domain-epidemic spray and forward routing algorithm of opportunistic networks

Authors: Deng-yin Zhang; Lei Cui

Addresses: 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

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.

Keywords: opportunistic networks; domain-epidemic spray; encounter probability; message confirmation; forward routing; simulation; redundant messages.

DOI: 10.1504/IJICT.2013.054935

International Journal of Information and Communication Technology, 2013 Vol.5 No.3/4, pp.332 - 342

Received: 13 Dec 2012
Accepted: 06 Jan 2013
Published online: 19 Dec 2013 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article