Discrete mobile centers

Discrete and Computational Geometry

Volumn 30, Issue 1, 2003, Pages 45-63

  Gao, Jie ^a   Guibas, Leonidas J ^a   Hershberger, John ^b   Zhang, Li ^c   Zhu, An ^a  

^a Stanford University   (United States)

^b MENTOR GRAPHICS CORPORATION   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037971851     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-2925-6     Document Type: Conference Paper

References (26)

1. P. K. Aganval, J. Basch, M. de Berg, L. J. Guibas, and J. Hershberger. Lower bounds for kinetic planar subdivisions. In Proceedings of the 15th ACM Symposium on Computational Geometry, pages 247-254, 1999.
2. A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-Min D-cluster formation in wireless ad hoc networks. In Proceedings of the 19th IEEE INFOCOM, pages 32-41, March 1999.
3. S. Basagni. Distributed clustering for ad hoc networks. In Proceedings of the '99 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN '99), pages 310-315, June 1999.
4. J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. Journal of Algebra, 31(1):1-28, 1999.
5. J. Basch, L. J. Guibas, and L. Zhang. Proximity problems on moving points. In Proceedings of the 13th Annual ACM Symposium on Computational Geometry, pages 344-351, 1997.
6. C. Chiang, H. Wu, W. Liu, and M. Gerla. Routing in clustered multihop, mobile wireless networks with fading channel. In Proceedings of IEEE SICON '97, pages 197-211, April 1997.
7. A. Ephremides, J. E. Wieselthier, and D. J. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proceedings of IEEE, 75(1):56-73, Jan. 1987.
8. U. Feige. A threshold of Inn for approximating set cover. In Proceedings of the ACM Symposium on Theory of Computing, pages 634-652, 1996.
9. R. J. Eowler, M. S. Paterson, and S. L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Information Processing Letters, 12(3):133-137, 1981.
10. M. Gerla and J. Tsai, Multicluster, mobile, multimedia radio network. ACM-Baltzer Journal of Wireless Networks, 1(3):255-265, 1995.
11. L. J. Guibas. Kinetic data structures - a state of the art report. In P. K. Agarwal, L. E. Kavraki, and M. Mason, editors, Proceedings of the Workshop on Algorithmic Foundations of Robotics, pages 191-209. Peters, Wellesley, MA, 1998.
12. J. Haartsen, M. Naghshineh, J. Inouye, O. Joeressen, and W. Allen. Bluetooth: vision, goals, and architecture. Mobile Computing and Communications Review, 2(4):38-45, Oct. 1998.
13. D. S. Hochbaum and W. Maas. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32:130-136, 1985.
14. H. B. Hunt, H. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Journal of Algorithms, 26(2):238-274, 1998.
15. R. Jain, A. Puri, and R. Sengupta. Geographical routing using partial information for wireless ad hoc networks. IEEE Personal Communications, 8(1):48-57, Feb. 2001.
16. B. Karp and H. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 243-254, 2000.
17. W.-H. Liao, J.-P. Sheu, and Y.-C. Tseng. GRID: a fully location-aware routing protocol for mobile ad hoc networks. Telecommunication Systems, 18(1-3):37-60, 2001.
18. S. Marti, T. J. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pages 255-265, 2000.
19. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
20. T. Rappaport. Wireless Communications: Principles and Practice. Prentice-Hall, Englewood Cliffs, NJ, 1996.
21. A. Savvides, C.-C. Han, and M. B. Strivastava. Dynamic fine-grained localization in ad-hoc networks of sensors. In Proceedings of the 7th ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 166-179, 2001.
22. J. Sharony. An architecture for mobile radio networks with dynamically changing topology using virtual subnets. ACM-Baltzer Mobile Networks and Applications Journal, 1(1):75-86, 1996.
23. C.-K. Toh. Ad Hoc Mobile Wireless Networks: Protocols and Systems. Prentice-Hall, Englewood Cliffs, NJ, 2002.
24. J. H. van Lint and R. M. Wilson. A Course in Combinatorics. Cambridge University Press, Cambridge, 1992.
25. A. Ward, A. Jones, and A. Hopper. A new location technique for the active office. IEEE Personnel Communications, 4(5):42-47, Oct. 1997.
26. J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing & Communications, pages 7-14, 1999.