Dynamic Adjustment Strategy of n-Epidemic Routing Protocol for Opportunistic Networks: A Learning Automata Approach

• Feng Zhang,
• Xiaoming Wang,
• Lichen Zhang,
• Peng Li,
• Liang Wang,
• Wangyang Yu,

Vol. 11, No. 4, April 29, 2017
10.3837/tiis.2017.04.011, Download Paper (Free):

• Opportunistic networks
• Learning automata
• routing protocol
• n-Epidemic
• Energy Efficiency

Abstract

In order to improve the energy efficiency of n–Epidemic routing protocol in opportunistic networks, in which a stable end-to-end forwarding path usually does not exist, a novel adjustment strategy for parameter n is proposed using learning atuomata principle. First, nodes dynamically update the average energy level of current environment while moving around. Second, nodes with lower energy level relative to their neighbors take larger n avoiding energy consumption during message replications and vice versa. Third, nodes will only replicate messages to their neighbors when the number of neighbors reaches or exceeds the threshold n. Thus the number of message transmissions is reduced and energy is conserved accordingly. The simulation results show that, n-Epidemic routing protocol with the proposed adjustment method can efficiently reduce and balance energy consumption. Furthermore, the key metric of delivery ratio is improved compared with the original n-Epidemic routing protocol. Obviously the proposed scheme prolongs the network life time because of the equilibrium of energy consumption among nodes.

Statistics

Cite this article