Home > Publications > Conferences > Greedy geographic routing algorithms in real environment

Milan Lukic, Bogdan Pavkovic, Nathalie Mitton, Ivan Stojmenovic

Greedy geographic routing algorithms in real environment

In proceedings of the 5th International Conference on Mobile Ad Hoc and Sensor Networks (MSN’09). Wu Yi Mountain, China, December 14-16, 2009

Monday 14 December 2009

Existing theoretical and simulation studies on georouting appear detached from experimental studies in real environments. We set up our test environment by using WSN430 wireless sensor nodes. To overcome the need for significant number of wireless nodes required to perform a realistic experiment in high density network, we introduce a novel approach - emulation by using relatively small number of nodes in 1-hop experimental setup. Source node is a fixed sensor, all available sensors are candidate forwarding neighbors with virtual destination. Source node makes one forwarding step, destination position is adjusted, and the same source again searches for best forwarder. We compare three georouting algorithms. We introduce here Greedy geographical routing Algorithms in a REal environment (GARE) which builds a RNG by using ETX(uv)/|uv| as edge weight (ETX(uv) counts all transmissions and possibly acknowledgments between two nodes until message is received), and selects RNG neighbor with greatest progress toward destination (if none of RNG neighbors has progress, all neighbors are considered). Our experiments show that GARE is significantly more efficient than existing XTC algorithm (applying RNG on ETX(uv)) in energy consumption. COP_GARE selects neighbor with progress that minimizes ETX(uv)/|uv|, and outperforms both algorithms.

titre documents joints:

1996-2017 Drakkar | Site Map | | Contact | RSS 2.0 | SPIP