Geographic routing is one of the most widely-accepted techniques to route information in wireless sensor networks. The main novelty is that the current node routes the packet to a neighbor which is located closer to the destination than itself. This process is called greedy routing. When the packet reaches a node that has no neighbors located closer to the destination than itself (a.k.a. local minimum) a recovery strategy is used to get to nodes that can again resume greedy routing. However, recent studies have proven that geographic routing may be ineffective in real deployments where location estimation systems introduce location errors. In this paper, we analyze in detail the problems induced by location errors in greedy routing and propose an Effective Greedy Routing supporting Location Errors (EGLE). Our simulation results show that EGLE is able to outperform existing solutions. It achieves nearly a 100% packet delivery ratio with very little additional overhead.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
- Effective Geographic Routing in Wireless Sensor Networks with Innacurate Location Information
Pedro Miguel Ruiz
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA