Topology control and geographic routing in realistic wireless networks

Ad-Hoc and Sensor Wireless Networks

Volumn 6, Issue 3-4, 2008, Pages 265-297

  Lillis, Kevin M ^a,b   Pemmaraju, Sriram V ^a   Pirwani, Imran A ^a  

^a University of Iowa   (United States)

^b ST AMBROSE UNIVERSITY   (United States)

Author keywords

Clustering; Geographic routing; Quasi unit disk graphs; Spanners; Topology control; Unit disk graphs; Wireless sensor networks

Indexed keywords

EID: 77249153459     PISSN: 15519899     EISSN: 15520633     Source Type: Journal    
DOI: 10.1007/978-3-540-74823-6_2     Document Type: Article

References (38)

1. K. M. Alzoubi, P.-J. Wan and O. Frieder. Message-optimal connected dominating sets in mobile ad hoc networks. In Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing (MobiHoc’02). ACM Press, New York, NY, USA, pp. 157–164, 2002.
2. Lali Barrière, Pierre Fraigniaud, Lata Narayanan and Jaroslav Opatrny. Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wireless Communications and Mobile Computing 3(2) (2003), 141–153.
3. P. Bose, L. Devroye, W. S. Evans and D. G. Kirkpatrick. On the spanning ratio of gabriel graphs and beta-skeletons. In Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN’02), 2002, pp. 479–493.
4. P. Bose and P. Morin. Online routing in triangulations. In Proceedings of the 10th International Symposium on Algorithms and Computation (ISAAC’99). Springer-Verlag, London, UK, pp. 113–122, 1999.
5. P. Bose, P. Morin, I. Stojmenović and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6) (2001), 609–616.
6. E. Chang. Echo algorithms: Depth parallel operations on general graphs. IEEE Transactions on Software Engineering 8(4) (1982), 391–401.
7. M. Damian, S. Pandit and S. Pemmaraju. Local approximation schemes for topology control. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (PODC’06). ACM Press, New York, NY, USA, 2006, pp. 208–217.
8. D. P. Dobkin, S. J. Friedman and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete and Computational Geometry 5(4) (1990), 399–407.
9. Stephane Durocher, David G. Kirkpatrick and Lata Narayanan. On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. In Shrisha Rao, Mainak Chatterjee, Prasad Jayanti, C. Siva Ram Murthy, and Sanjoy Kumar Saha, editors, ICDCN, vol. 4904 of Lecture Notes in Computer Science. Springer, pp. 546–557, 2008.
10. D. Eppstein. Spanning trees and spanners. In Jörg-Rudiger Sack and Jorge Urrutia, editors, Handbook of Computational Geometry. Elsevier, chapter 9, pp. 425–461. 2000.
11. Q. Fang, J. Gao, L. Guibas, V. Silva and L. Zhang. GLIDER: Gradient landmark-based distributed routing for sensor networks. In Proceedings of the 24th Conference of the IEEE Communication Society (INFOCOM’05), 1, 2005, pp. 339–350.
12. G. Finn. Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180, University of Southern California, Marina del Rey: Information Sciences Institute, March 1987.
13. S. Funke and N. Milosavljević. Guaranteed-delivery geographic routing under uncertain node locations. In Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’07), 2007.
14. J. Gao, L. J. Guibas, J. Hershberger, L. Zhang and A. Zhu. Geometric spanner for routing in mobile networks. In Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing (MobiHoc’01), 2001, pp. 45–55.
15. Y.-J. Kim R. Govindan, B. Karp and S. Shenker. Lazy cross-link removal for geographic routing. In Proceedings of the 4th international conference on Embedded networked sensor systems (SenSys’06). ACM Press, New York, NY, USA, 2006, pp. 112–124.
16. M. Grunewald, T. Lukovszki, C. Schindelhauer and K. Volbert. Distributed maintenance of resource efficient wireless network topologies. In Proceedings of the 8th European Conference on Parallel Computing (Euro-Par’02), pp. 935–946, 2002.
17. T. Hou and V. Li. Transmission range control in multihop packet radio networks. IEEE Transactions on Communications 34(1) (1986), 38–44.
18. B. Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’00), pp. 243–254, 2000.
19. Y.-J. Kim, R. Govindan, B. Karp and S. Shenker. On the pitfalls of geographic face routing. In Proceedings of the 2005 joint workshop on Foundations of mobile computing (DIALM-POMC’05). ACM Press, New York, NY, USA, 2005, pp. 34–43.
20. E. Kranakis, H. Singh and J. Urrutia. Compass routing on geometric networks. In Procceedings of the 11th Canadian Conference on Computational Geometry, 1999, pp. 51–54.
21. F. Kuhn, R. Wattenhofer, Y. Zhang and A. Zollinger. Geometric ad-hoc routing: Of theory and practice. In Proceedings of the twenty-second annual symposium on Principles of distributed computing (PODC’03). ACM Press, New York, NY, USA, 2003, pp. 63–72.
22. F. Kuhn, R. Wattenhofer and A. Zollinger. Asymptotically optimal geometric mobile ad-hoc routing. In 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’02). ACM Press, New York, NY, USA, September 2002, pp. 24–33.
23. F. Kuhn, R. Wattenhofer and A. Zollinger. Ad-hoc networks beyond unit disk graphs. In Proceedings of the 2003 joint workshop on Foundations of mobile computing (DIALM-POMC’03). ACM Press, New York, NY, USA, 2003, pp. 69–78.
24. F. Kuhn, R. Wattenhofer and A. Zollinger. Worst-case optimal and average-case efficient geometric ad-hoc routing. In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing (MobiHoc’03). ACM Press, New York, NY, USA, 2003, pp. 267–278.
25. B. Leong, S. Mitra and B. Liskov. Path vector face routing: Geographic routing with local face information. In Proceedings of the 13TH IEEE International Conference on Network Protocols (ICNP’05). IEEE Computer Society, Washington, DC, USA, 2005, pp. 147–158.
26. X.-Y. Li. Localized construction of low weighted structure and its applications in wireless ad hoc networks. Wireless Networks 11(6) (2005), 697–708.
27. X.-Y. Li, G. Calinescu and P. Wan. Distributed construction of planar spanner and routing for ad hoc wireless networks. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’02), 2002.
28. X.-Y. Li, G. Calinescu, P.-J. Wan and Y. Wang. Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 14(10) (2003), 1035–1047.
29. X.-Y. Li, W.-Z. Song and W. Wang. A unified energy-efficient topology for unicast and broadcast. In Proceedings of the 11th annual international conference on Mobile computing and networking (MobiCom’05). ACM Press, New York, NY, USA, 2005, pp. 1–15.
30. X.-Y. Li and Y. Wang. Efficient construction of low weight bounded degree planar spanner. In Proceedings of the 9th International Computing and Combinatorics Conference (COCOON’03), 2003.
31. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi and D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks 25 (1995), 59–68.
32. T. Moscibroda and R. Wattenhofer. Minimizing interference in ad hoc and sensor networks. In Proceedings of the 2005 joint workshop on Foundations of mobile computing (DIALM-POMC’05). ACM Press, New York, NY, USA, 2005, pp. 24–33.
33. Koji Nakano and Stephan Olariu. A survey on leader election protocols for radio networks. In ISPAN, 2002, pp. 71
34. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
35. I. Stojmenovic and X. Lin. Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transactions on Parallel and Distributed Systems 12(10) (2001), 1023–1032.
36. H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications 32(3) (1984), 246–257.
37. Y. Wang and X.-Y. Li. Localized construction of bounded degree and planar spanner for wireless ad hoc networks. In Proceedings of the Joint Workshop on Foundations of Mobile Computing (DIALM-POMC’03), 2003, pp. 59–68.
38. A. C.-C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing 11(4) (1982), 721–736.