An Improved Geographic Routing Algorithm Based on Hole Modeling
Min Fan · Chuangan jishu xuebao · 2012
In current Geographic routing protocols for wireless sensor networks,redundant routing paths will be produced when routing holes are encountered.This paper presents an improved segmented greedy routing algorithm called EMGR(Easy Modeling Greedy Routing).Firstly,this algorithm introduces the virtual coordinate conception,uses Holes Boundary Detection(HBD) packet to find out all nodes on the boundary of the hole,then maps these nodes to virtual coordinate.According to the different distribution of hole boundary nodes in the virtual coordinate,it defines concave domain and convex domain to describe the shape of different holes,then finds the appropriate relay node according to the different shape of the holes.At last it uses the segmented greedy routing mode to transmit data packets.Compared to GPSR algorithm,simulation results show that EMGR algorithm could reduce 35% path hops with less network energy consumption,decrease routing path expansion rate and shorten network delay.