Data relevance dynamic routing protocol for Wireless Visual Sensor Networks
Petros Spachos, Dimitrios Hatzinakos · 2013
Survivability is crucial in Wireless Visual Sensor Networks (WVSNs) especially when they are used for monitoring and tracking applications with limited available resources. In this paper we are proposing the use of a data relevance dynamic routing protocol that tries to keep a balance between the energy consumption and the packet delay in a WVSN. The proposed dynamic routing protocol follows opportunistic routing approaches. The next node selection criterion can change the routing path dynamically following the network conditions and the channel availability while the energy consumption per node is also considered. Simulation results are presented that show an increase in network lifetime of up to 30% compared with traditional routing while the overall packet delay remains similar.