Contention-based georouting with guaranteed delivery, minimal communication overhead, and shorter paths in wireless sensor networks

@article{Rhrup2010ContentionbasedGW,
  title={Contention-based georouting with guaranteed delivery, minimal communication overhead, and shorter paths in wireless sensor networks},
  author={Stefan R{\"u}hrup and Ivan Stojmenovic},
  journal={2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)},
  year={2010},
  pages={1-9}
}
Nodes in contention-based (beaconless) georouting forward packets towards a known destination position without the knowledge of the neighborhood. The only existing methods that guarantee delivery in unit disk graphs (UDG) require runtime planarization of the communication graph with either unbounded message overhead per hop while preserving the Gabriel graph property of the subgraph, or a constant overhead per hop with up to 13 control messages. In this paper we show that the next hop can be… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Similar Papers

Loading similar papers…