A Parallel Multi-Path Algorithm for Adaptive Routing in Wireless Sensor Networks
Shanping Li · Dianzi xuebao · 2007
Geographic routing in wireless sensor networks suffers from the local minimum phenomenon.To help packets get out of local minimum phenomenon,the long-known right-hand rule is used,which needs the graphs planarizing.It will lost many links and doesn't suit adaptive routing.Through studying the local minimum phenomenon deeply,we find out that greedy forwarding in restricting routing regions could deal with the local minimum phenomenon.Based on the observation,a new method Clockwise Rule was proposed,which does not lost any links and more suits adaptive routing.We also proposed an adaptive parallel multi-path routing algorithm(APMR) using Clockwise Rule,which can provide various routing strategies and switch these strategies at relay nodes freely.Simulations show that APMR can significantly improve the performance of wireless sensor networks.