Simple and efficient geographic routing around obstacles for wireless sensor networks

摘要: Geographic routing is becoming the protocol of choice for many sensor network applications. The current state art unsatisfactory: some algorithms are very efficient, however they require a preliminary planarization communication graph. Planarization induces overhead and thus not realistic scenarios such as case highly dynamic topologies. On other hand, georouting which do rely on have fairly low success rates fail to route messages around all but simplest obstacles. To overcome these limitations, we propose GRIC geographic algorithm. It has absolutely no topology maintenance overhead, almost 100% delivery (when obstacles added), bypasses large convex obstacles, finds short paths destination, resists link failure simple implement. hard concave also studied; instances performance diminishes.