Topology control in heterogeneous wireless networks: Problems and solutions

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 232-243

  Li, Ning ^a   Hou, Jennifer C ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED LOCAL MINIMUM SPANNING TREE (DLMST); NETWORK CONNECTIVITY; TOPOLOGY CONTROL; WIRELESS NETWORKS;

ALGORITHMS; GRAPH THEORY; PROBABILITY; TELECOMMUNICATION NETWORKS; TOPOLOGY;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 8344232302     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. C. E. Jones, K. M. Sivalingam, P. Agrawal, and J. C. Chen, "A survey of energy efficient network protocols for wireless networks," Wireless Networks, vol. 7. no. 4, pp. 343-358, Aug. 2001.
2. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 388-404. Mar. 2000.
3. S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar, "Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol," in Proc. of European Wireless 2002. Next Generation Wireless Networks: Technologies, Protocols, Services and Applications. Florence. Italy. Feb. 2002, pp. 156-162.
4. V. Rodoplu and T. H. Meng, "Minimum energy mobile wireless networks," IEEE J. Select. Areas Commun., vol. 17. no. 8, pp. 1333-1344, Aug. 1999.
5. R. Ramanathan and R. Rosales-Hain, "Topology control of multihop wireless networks using transmit power adjustment," in Proc. IEEE INFOCOM 2000. Tel Aviv. Israel, Mar. 2000, pp. 404-413.
6. L. Li, J. Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks," in Proc. ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, US, Aug. 2001. pp. 264-273.
7. V. Kawadia and P. Kumar, "Power control and clustering in ad hoc networks," in Proc. IEEE INFOCOM 2003. San Francisco. California, US, Apr. 2003.
8. S. A. Borbash and E. H. Jennings, "Distributed topology control algorithm for multihop wireless networks," in Proc. 2002 World Congress on Computational Intelligence (WCCI 2002). Honolulu, Hawaii, US, May 2002.
9. X.-Y. Li, G. Calinescu, and P.-J. Wan, "Distributed construction of planar spanner and routing for ad hoc networks," in Proc. IEEE INFOCOM 2002, New York. New York, US, June 2002.
10. N. Li, J. C. Hou, and L. Sha, "Design and analysis of an MST-based topology control algorithm," in Proc. IEEE INFOCOM 2003. San Francisco, California, US, Apr. 2003.
11. C. Kee, H. Jun, D. Yun, B. Kim, Y. Kim, B. W. Parkinson, T. Langenstein, S. Pullen, and J. Lee, "Development of indoor navigation system using asynchronous pseudolites," in Proc. 13th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION CPS 2000), Salt Lake City, Utah, US, Sept. 2000, pp. 1038-1045.
12. T. He, C. Huang, B. M. Blum, J. A. Stankovic, and T. Abdelzaher, "Range-free localization schemes for large scale sensor networks," in Proc. ACM MOBICOM 2003. San Diego, California, United States, Sept. 2003, pp. 81-95.
13. G. Toussaint, "The relative neighborhood graph of a finite planar set," Pattern Recognition, vol. 12. pp. 261-268, 1980.
14. K. J. Supowit, "The relative neighborhood graph, with an application to minimum spanning trees," Journal of the ACM, vol. 30, no. 3, pp. 428-448, July 1983.
15. P. Santi, D. M. Blough, and F. Vainstein, "A probabilistic analysis for the range assignment problem in ad hoc networks," in Proc. ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC) 2001, Long Beach, California, US, Aug. 2000, pp. 212-220.
16. S. Basagni, D. Turgut, and S. K. Das, "Mobility-adaptive protocols for managing large ad hoc networks," in Proc. IEEE International Conference on Communications (ICC) 2002, Helsinki, Finland, June 2001, pp. 1539-1543.
17. M. G. J. Wu and I. Stojmenovic, "On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks," in Proc. International Conference on Parallel Processing, Vancouver, British Columbia, Canada, Aug. 2002, pp. 346-354.
18. Y. J. Chu and T. H. Liu, "On the shortest arborescence of a directed graph," Science Sinica, vol. 14, pp. 1396-1400, 1965.
19. J. Edmonds, "Optimum branchings," Journal of Research of the National Bureau of Standards, vol. 71B, pp. 233-240, 1967.
20. F. Bock, "An algorithm to construct a minimum spanning tree in a directed network," in Developments in Operations Research. New York. New York. US: Gordon and Breach Science Publishers. 1971. pp. 29-44.
21. R. E. Tarjan, "Finding optimum branchings," Networks, vol. 7. pp. 25-35, 1977.
22. P. Camerini, L. Fratta, and F. Maffioli, "A note on finding optimum branchings," Networks, vol. 9, pp. 309-312, 1979.
23. C. Monma and S. Suri, "Transitions in geometric minimum spanning trees," in Proc. ACM Symposium on Computational Geometry, North Conway, New Hampshire. United States. 1991, pp. 239-249.