Topology Control for Wireless Sensor Networks

Part of the Signals and Communication Technology book series (SCT)

Due to its potential applications in various situations such as battlefield, emergency relief, environment monitoring, and so on, wireless sensor networks have recently emerged as a premier research topic. Sensor networks consist of a set of sensor nodes which are spread over a geographical area. These nodes are able to perform processing as well as sensing and are additionally capable of communicating with each other. With coordination among these sensor nodes, the network together will achieve a larger sensing task both in urban environments and in inhospitable terrain. The sheer numbers of these sensors, the limited resources on each sensor, and the expected dynamics in these environments present unique challenges in the design of wireless sensor networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gang Zhou, Tian He, Sudha Krishnamurthy, and John A. Stankovic, “Impact of radio irregularity on wireless sensor networks,” in Proc. of 2nd international conference on Mobile systems, applications, and services (MobiSys). 2004.Google Scholar
  2. 2.
    Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger, “Ad-hoc networks beyond unit disk graphs,” in Proc. of 1st ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), 2003.Google Scholar
  3. 3.
    Xiang-Yang Li, Wen-Zhan Song, and Yu Wang, “Efficient topology control for wireless ad hoc networks with non-uniform transmission ranges,” ACM Springer Wireless Networks (WINET), vol. 11, no. 3, pp. 255-264, 2005.Google Scholar
  4. 4.
    Srdjan Capkun, Maher Hamdi, and Jean-Pierre Hubaux, “GPS-free positioning in mobile ad-hoc networks,” in Proc. Hawaii Int. Conf. on System Sciences, 2001.Google Scholar
  5. 5.
    Jinyang Li, Jannotti Jannotti, Douglas S. J. De Couto, David R. Karger, and Robert Morris, “A scalable location service for geographic ad-hoc routing,” in Proc. of ACM International Conference on Mobile Computing and Networking, 2000, pp. 120-130.Google Scholar
  6. 6.
    Xiang Ji and Hongyuan Zha, “Sensor positioning in wireless ad-hoc sensor networks with multidimensional scaling,” in IEEE INFOCOM 2004 - The Conference on Computer Communications, 2004, pp. 2652-2661.Google Scholar
  7. 7.
    Sunil Arya, Gautam Das, David Mount, Jeffrey Salowe, and Michiel Smid, “Euclidean spanners: short, thin, and lanky,” in Proc. 27th ACM STOC, 1995, pp. 489-498.Google Scholar
  8. 8.
    Sunil Arya and Michiel Smid, “Efficient construction of a bounded degree spanner with low weight,” in Proc. 2nd Annu. European Sympos. Algorithms (ESA), volume 855 of Lecture Notes in Computer Science, 1994, pp. 48-59.Google Scholar
  9. 9.
    Prosenjit Bose, Luc Devroye, William Evans, and David Kirkpatrick, “On the spanning ratio of Gabriel graphs and Beta-skeletons,” in Proceedings of the Latin American Theoretical Infocomatics (LATIN), 2002.Google Scholar
  10. 10.
    Barun Chandra, Gautam Das, Giri Narasimhan, and Jose Soares, “New sparse-ness results on graph spanners,” in Proc. 8th Annual ACM Symposium on Computational Geometry, 1992, pp. 192-201.Google Scholar
  11. 11.
    Menelaos I. Karavelas and Leonidas J. Guibas, “Static and kinetic geometric spanners with applications,” in Proceeding of the Twelfth Annual Symposium on Discrete algorithms, 2001, pp. 168-176.Google Scholar
  12. 12.
    Christos Levcopoulos, Giri Narasimhan, and Michiel Smid, “Efficient algorithms for constructing fault-tolerant geometric spanners,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing, 1998.Google Scholar
  13. 13.
    Andrew C.-C. Yao, “On constructing minimum spanning trees in k-dimensional spaces and related problems,” SIAM J. Computing, vol. 11, pp. 721-736, 1982.MATHCrossRefGoogle Scholar
  14. 14.
    Brad Karp and H.T. Kung, “GPSR: Greedy perimeter stateless routing for wireless networks,” in Proc. of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), 2000.Google Scholar
  15. 15.
    Prosenjit Bose, Pat Morin, Ivan Stojmenovic, and Jorge Urrutia,“Routing with guaranteed delivery in ad hoc wireless networks,” ACM/Kluwer Wireless Networks, vol. 7, no. 6, 2001.Google Scholar
  16. 16.
    Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger, “Asymptotically opti-mal geometric mobile ad-hoc routing,” in Proc. of ACM international workshop on Discrete algorithms and methods for mobile computing and communications (Dial-M). 2002, pp. 24-33.Google Scholar
  17. 17.
    Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger,“Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing,” in Proc. 4 th ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc), 2003.Google Scholar
  18. 18.
    Jerzy W. Jaromczyk and Godfried T. Toussaint,“Relative neighborhood graphs and their relatives,” Proceedings of IEEE, vol. 80, no. 9, pp. 1502-1517, 1992.CrossRefGoogle Scholar
  19. 19.
    Godfried T. Toussaint,“The relative neighborhood graph of a finite planar set,” Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980.MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    K. Ruben Gabriel and Robert R. Sokal, “A new statistical approach to geo-graphic variation analysis,” Systematic Zoology, vol. 18, pp. 259-278, 1969.CrossRefGoogle Scholar
  21. 21.
    Susanta Datta, Ivan Stojmenovic, and Jie Wu, “Internal node and shortcut based routing with guaranteed delivery in wireless networks,” Cluster Computing, vol. 5, no. 2, pp. 169-178, 2002.CrossRefGoogle Scholar
  22. 22.
    Mahtab Seddigh, Julio Solano Gonzalez, and Ivan Stojmenovic,“RNG and internal node based broadcasting algorithms for wireless one-to-one networks,”ACM Mobile Computing & Communications Review, vol. 5, no. 2, pp. 37-44, 2002.Google Scholar
  23. 23.
    Weizhao Wang, Xiang-Yang Li, Kousha Moaveni-Nejad, Yu Wang, and Wen-Zhan Song, “The spanning ratios of beta-skeletons,” in Canadian Conference on Computational Geomety (CCCG 2003), 2003.Google Scholar
  24. 24.
    Xiang-Yang Li, Peng-Jun Wan, and Yu Wang, “Power efficient and sparse spanner for wireless ad hoc networks,” in IEEE Int. Conf. on Computer Communications and Networks (ICCCN01), 2001, pp. 564-567.Google Scholar
  25. 25.
    David P. Dobkin, Steven J. Friedman, and Kenneth J. Supowit,“Delaunay graphs are almost as good as complete graphs,” Discrete Computational Geometry, 1990.Google Scholar
  26. 26.
    J. Mark Keil and Carl A. Gutwin, “Classes of graphs which approximate the complete euclidean graph,” Discrete Computational Geometry, vol. 7, 1992.Google Scholar
  27. 27.
    Xiang-Yang. Li, Gruia Calinescu, and Peng-Jun Wan, “Distributed construc-tion of planar spanner and routing for ad hoc wireless networks,” in 21st IEEE INFOCOM, 2002, vol. 3.Google Scholar
  28. 28.
    Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan, and Yu Wang,“Localized delaunay triangulation with application in wireless ad hoc networks,” IEEE Transaction on Parallel and Distributed Processing, vol. 14, no. 10, pp. 1035-1047,2003.CrossRefGoogle Scholar
  29. 29.
    Jie Gao, Leonidas J. Guibas, John Hershburger, Li Zhang, and An Zhu, “Ge-ometric spanner for routing in mobile networks,” in Proc. of 2nd ACM Sym-posium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2001.Google Scholar
  30. 30.
    Xiang-Yang Li and Ivan Stojmenovic, “Partial delaunay triangulation and degree limited localized bluetooth scatternet formation,” in AdHocNow, 2002.Google Scholar
  31. 31.
    Gruia Cǎlinescu, “Computing 2-hop neighborhoods in ad hoc wireless networks,” in AdHoc-Now 03, 2003.Google Scholar
  32. 32.
    Khaled M. Alzoubi, Peng-Jun Wan, and Ophir Frieder,“Message-optimal connected dominating sets in mobile ad hoc networks,” in Proc. of .3rd ACM international symposium on Mobile ad hoc networking & computing. 2002, pp. 157-164.Google Scholar
  33. 33.
    Yu Wang and Xiang-Yang Li, “Localized construction of bounded degree pla-nar spanner for wireless networks,” in ACM DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003.Google Scholar
  34. 34.
    Tamas Lukovszki, New Results on Geometric Spanners and Their Applications, Ph.D. thesis, University of Paderborn, 1999.Google Scholar
  35. 35.
    Xiang-Yang Li, Peng-Jun Wan, Yu Wang, and Ophir Frieder, “Sparse power efficient topology for wireless networks,” in IEEE Hawaii Int. Conf. on System Sciences (HICSS), 2002.Google Scholar
  36. 36.
    Roger Wattenhofer, Li Li, Paramvir Bahl, and Yi-Min Wang,“Distributed topology control for wireless multihop ad-hoc networks,” in IEEE INFOCOM’01, 2001.Google Scholar
  37. 37.
    Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, and Roger Watten-hofer, “Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks,” in ACM Symposium on Principle of Distributed Computing (PODC), 2001.Google Scholar
  38. 38.
    Matthias Grünewald, Tamas Lukovszki, Christian Schindelhauer, and Klaus Volbert, “Distributed maintenance of resource efficient wireless network topolo-gies,” in Proc. of the 8th European Conference on Parallel Computing (Euro-Par’02), 2002.Google Scholar
  39. 39.
    Stefan Rührup, Christian Schindelhauer, Klaus Volbert, and Matthias Grünewald, “Performance of distributed algorithms for topology control in wireless networks,” in Proc. of 17th Intl. Parallel and Distributed Processing Symposium (IPDPS), 2003.Google Scholar
  40. 40.
    Yu Wang, Xiang-Yang Li, and Ophir Frieder, “Distributed spanner with bounded degree for wireless networks,” International Journal of Foundations of Computer Science, vol. 14, no. 2, pp. 183-200, 2003.MATHCrossRefMathSciNetGoogle Scholar
  41. 41.
    Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, and Richard E. Stearns , “NC-approximation schemes for NP- and PSPACE -hard problems for geometric graphs,” Journal of Algo-rithms, vol. 26, no. 2, pp. 238-274, 1998.MATHCrossRefMathSciNetGoogle Scholar
  42. 42.
    Lujun Jia, Rajmohan Rajaraman, and Christian Scheideler,“On local algorithms for topology control and routing in ad hoc networks,” in Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, 2003.Google Scholar
  43. 43.
    Christian Schindelhauer, Klaus Volbert, and Martin Ziegler, “Geometric span-ners with applications in wireless networks,” Computational Geometry: Theory and Applications, 2005.Google Scholar
  44. 44.
    Xiang-Yang Li, Ivan Stojmenovic, and Yu Wang, “Partial delaunay triangu-lation and degree limited localized Bluetooth multihop scatternet formation,” IEEE Trans. on Parallel and Distributed Systems, vol. 15, no. 4, pp. 350-361, 2004.CrossRefGoogle Scholar
  45. 45.
    Prosenjit Bose, Joachim Gudmundsson, and Pat Morin,“Ordered theta graphs,” in Proc. of the Canadian Conference on Computational Geometry (CCCG), 2002.Google Scholar
  46. 46.
    Wen-Zhan Song, Yu Wang, Xiang-Yang Li, and Ophir Frieder, “Localized algorithms for energy efficient topology in wireless ad hoc networks,” in 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2004), Tokyo, Japan, 2004.Google Scholar
  47. 47.
    .  Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, and Ophir Frieder, “Minimum-energy broadcast routing in static ad hoc wireless networks,” ACM Wireless Networks, 2002, Preliminary version appeared in IEEE INFOCOM 2000.Google Scholar
  48. 48.
    Xiang-Yang Li, Yu Wang, and Wen-Zhan Song, “Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks,” IEEE Trans. on Parallel and Distributed Systems, vol. 15, no. 12, pp. 1057- 1069, 2004.CrossRefGoogle Scholar
  49. 49.
    Xiang-Yang Li, “Approximate MST for UDG locally,” in The 9th Annual International Computing and Combinatorics Conference COCOON 2003, 2003.Google Scholar
  50. 50.
    Xiang-Yang Li, Yu Wang, Peng-Jun Wan, Wen-Zhan Song, and Ophir Frieder, “Localized low weight graph and its applications in wireless ad hoc networks,” in IEEE INFOCOM, 2004.Google Scholar
  51. 51.
    Gautam Das, Giri Narasimhan, and Jeffrey Salowe,“A new way to weigh malnourished euclidean graphs,” in ACM Symposium of Discrete Algorithms, 1995.Google Scholar
  52. 52.
    Ning Li, Jennifer C. Hou, and Lui Sha, “Design and analysis of a MST-based topology control algorithm,” in Proc. of IEEE INFOCOM 2003, 2003.Google Scholar
  53. 53.
    Prosenjit Bose, Joachim Gudmundsson, and Michiel Smid, “Constructing plane spanners of bounded degree and low weight,” in Proceedings of the European Symposium on Algorithms (ESA), 2002.Google Scholar
  54. 54.
    Joachim Gudmundsson, Christos Levcopoulos, and Giri Narasimhan, “Improved greedy algorithms for constructing sparse geometric spanners,” in Scandinavian Workshop on Algorithm Theory, 2000, pp. 314-327.Google Scholar
  55. 55.
    Xiang-Yang Li and Yu Wang, “Efficient construction of low weight bounded degree planar spanner,” in International Journal of Computational Geometry and Applications, vol. 14, np.1-2, pp.69-84, 2004.Google Scholar
  56. 56.
    Xiang-Yang Li, Wen-Zhan Song, and Wu Wang, “A unified energy efficient topology for unicast and broadcast,” in 11th ACM Annual International Conference on Mobile Computing and Networking (MobiCom 2005), 2005.Google Scholar
  57. 57.
    Bevan Das and Vaduvur Bharghavan, “Routing in ad-hoc networks using minimum connected dominating sets,” in 1997 IEEE International Conference on on Communications (ICC’97), 1997, vol. 1, pp. 376-380.Google Scholar
  58. 58.
    Raghupathy Sivakumar, Prasun Sinha, and Vaduvur Bharghavan, “CEDAR: Core extraction distributed ad hoc routing algorithm,” IEEE Journal on Se-lected Areas in Communications, vol. 17, no. 8, pp. 1454-1465, 1999.CrossRefGoogle Scholar
  59. 59.
    Ivan Stojmenovic, Mahtab Seddigh, and Jovisa Zunic, “Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks,” IEEE Trans. on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, 2002.CrossRefGoogle Scholar
  60. 60.
    Jie Wu and Hailan Li, “A dominating-set-based routing scheme in ad hoc wireless networks,” the special issue on Wireless Networks in the Telecommunication Systems Journal, vol. 3, pp. 63-84, 2001.Google Scholar
  61. 61.
    V. Chvátal, “A greedy heuristic for the set-covering problem,” Mathematics of Operations Research, vol. 4, no. 3, pp. 233-235, 1979.MATHCrossRefMathSciNetGoogle Scholar
  62. 62.
    Madhav V. Marathe, H. Breu, Harry B. Hunt III, S. S. Ravi, and Daniel J. Rosenkrantz, “Simple heuristics for unit disk graphs,” Networks, vol. 25, pp. 59-68, 1995.MATHCrossRefMathSciNetGoogle Scholar
  63. 63.
    Sudipto Guha and Samir Khuller, “Approximation algorithms for connected dominating sets,” in European Symposium on Algorithms, 1996, pp. 179-193.Google Scholar
  64. 64.
    Gabriel Robins and Alexander Zelikovsky, “Improved steiner tree approxima-tion in graphs,” in Proc. of ACM/SIAM Symposium on Discrete Algorithms, 2000.Google Scholar
  65. 65.
    Dorit S. Hochbaum and Wolfgang Maass, “Approximation schemes for covering and packing problems in image processing and vlsi,” Journal of ACM, vol. 32, pp. 130-136, 1985.MATHCrossRefGoogle Scholar
  66. 66.
    Yu Wang and Xiang-Yang Li, “Geometric spanners for wireless ad hoc net-works,” in Proc. of 22nd IEEE International Conference on Distributed Com-puting Systems (ICDCS), 2002.Google Scholar
  67. 67.
    Piotr Berman, Matin Furer, and Alexander Zelikovsky, “Applications of ma-troid parity problem to approximating steiner trees,” Tech. Rep. 980021, Com-puter Science, UCLA, 1998.Google Scholar
  68. 68.
    Xiuzhen Cheng, Xiao Huang, Deying Li, and Ding-Zhu Du,“Polynomial time approximation scheme for minimum connected dominating set in ad hoc wireless networks,” Networks, vol. 42, no. 4, pp. 202-208, 2003.MATHCrossRefMathSciNetGoogle Scholar
  69. 69.
    Khaled M. Alzoubi, Peng-Jun Wan, and Ophir Frieder, “New distributed al-gorithm for connected dominating set in wireless ad hoc networks,” in HICSS, Hawaii, 2002.Google Scholar
  70. 70.
    Alan D. Amis and Ravi Prakash, “Load-balancing clusters in wireless ad hoc networks,” in Proc. of the 3rd IEEE Symposium on Application-Specific Sys-tems and Software Engineering Technology, 2000.Google Scholar
  71. 71.
    .Alan D. Amis, Ravi Prakash, Dung Huynh, and Thai Vuong,“Max-min d cluster formation in wireless ad hoc networks,” in Proc. of 19th Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, 2000.Google Scholar
  72. 72.
    Imrich Chlamtac and Andras Farago, “A new approach to design and analysis of peer to peer mobile networks,” Wireless Networks, vol. 5, pp. 149-156, 1999.Google Scholar
  73. 73.
    Chunhung R. Lin and Mario Gerla, “Adaptive clustering for mobile wireless networks,” IEEE Journal of Selected Areas in Communications, vol. 15, no. 7, pp. 1265-1275, 1997.CrossRefGoogle Scholar
  74. 74.
    Ji-Cheng Lin, Shi-Nine Yang, and Maw-Sheng Chern, “An efficient distributed algorithm for minimal connected dominating set problem,” in Proc. of 10th Annual International Phoenix Conference on Computers and Communications, 1991.Google Scholar
  75. 75.
    Lujun Jia, Rajmohan Rajaraman, and Torsten Suel, “An efficient distributed algorithm for constructing small dominating sets,” in ACM PODC, 2000.Google Scholar
  76. 76.
    Raghupathy Sivakumar, Bevan Das, and Vaduvur Bharghavan, “The clade vertebrata: spines and routing in ad hoc networks,” in IEEE Symposium on Computers and Communications (ISCC98), Athens, Greece, June 1998.Google Scholar
  77. 77.
    Jie Wu and Hailan Li, “Domination and its applications in ad hoc wireless networks with unidirectional links,” in Proc. of the International Conference on Parallel Processing 2000, 2000, pp. 189-197.Google Scholar
  78. 78.
    Geng Chen, Fabian Garcia, Julio Solano, and Ivan Stojmenovic, “Connectivity based k-hop clustering in wireless networks,” in CD Proc. IEEE Hawaii Int. Conf. System Science, 2002.Google Scholar
  79. 79.
    Stefano Basagni, “Distributed clustering for ad hoc networks,” in Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), 1999, pp. 310-315.Google Scholar
  80. 80.
    Peng-Jun Wan, Khaled M. Alzoubi, and Ophir Frieder, “Distributed construction of connected dominating set in wireless ad hoc networks,” in INFOCOM, 2002.Google Scholar
  81. 81.
    Khaled Alzoubi, Xiang-Yang Li, Yu Wang, Peng-Jun Wan, and Ophir Frieder, “Geometric spanners for wireless ad hoc networks,” IEEE Transactions on Parallel and Distributed Processing, vol. 14, no. 4, pp. 408-421, 2003.CrossRefGoogle Scholar
  82. 82.
    Sudipto Guha and Samir Khuller, “Approximation Algorithms for Connected Dominating Sets,” Algorithmica, vol. 20, no. 4, pp. 374-387, 1998.CrossRefMathSciNetGoogle Scholar
  83. 83.
    Sudipto Guha and Samir Khuller, “Improved methods for approximating node weighted steiner trees and connected dominating sets,” Information and Computation, vol. 150, no. 1, pp. 57-74, 1999.CrossRefMathSciNetGoogle Scholar
  84. 84.
    Damla Turgut. Sajal K. Das, Ramez Elmasri and Begumhan Turgut, “Optimiz-ing clustering algorithm in mobile ad hoc networks using genetic algorithmic approach,” in IEEE GLOBECOM 2002, 2002.Google Scholar
  85. 85.
    Mainak Chatterjee,Sajal K. Das, and Damla Turgut, “WCA: A weighted clus-tering algorithm for mobile ad hoc networks,” Journal of Cluster Computing, vol. 5, no. 2, pp. 193-204, 2002.CrossRefGoogle Scholar
  86. 86.
    Christian Bettstetter and Roland Krausser, “Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm,” in 2nd ACM international symposium on Mobile ad hoc networking & computing. 2001.Google Scholar
  87. 87.
    Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” in Proc. of 33rd IEEE Hawaii International Conference on System Sciences. 2000.Google Scholar
  88. 88.
    Georgios Smaragdakis, Ibrahim Matta, and Azer Bestavros, “SEP: A stable election protocol for clustered heterogeneous wireless sensor networks,” in 2nd International Workshop on Sensor and Actor Network Protocols and Applications (SANPA), 2004.Google Scholar
  89. 89.
    Manki Min, Feng Wang, Ding-Zhu Du, and Panos M. Pardalos, “A reliable virtual backbone scheme in mobile ad-hoc networks,” in 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004.Google Scholar
  90. 90.
    Lichun Bao and J. J. Garcia-Luna-Aceves, “Topology management in ad hoc networks,” in Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing. 2003, pp. 129-140, ACM Press.Google Scholar
  91. 91.
    Yu Wang, WeiZhao Wang, and Xiang-Yang Li, “Efficient distributed lowcost backbone formation for wireless networks,” in 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2005.Google Scholar
  92. 92.
    Bevan Das, Raghupathy Sivakumar, and Vaduvur Bharghavan, “Routing in ad hoc networks using a spine,” in IEEE Sixth International Conference on Computer Communications and Networks (ICCCN97), 1997.Google Scholar
  93. 93.
    Mathew Penrose, “The longest edge of the random minimal spanning tree,” Annals of Applied Probability, vol. 7, pp. 340-361, 1997.MATHCrossRefMathSciNetGoogle Scholar
  94. 94.
    Mathew Penrose, “On k-connectivity for a geometric random graph,” Random Structures and Algorithms, vol. 15, pp. 145-164, 1999.MATHCrossRefMathSciNetGoogle Scholar
  95. 95.
    Christian Bettstetter, “On the minimum node degree and connectivity of a wireless multihop network,” in 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’02), June 2002.Google Scholar
  96. 96.
    Xiang-Yang Li, Peng-Jun Wan, Yu Wang, and Chih-Wei Yi, “Fault tolerant deployment and topology control for wireless ad hoc networks,” in 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mo-biHoc), 2003.Google Scholar
  97. 97.
    Christos Levcopoulos, Giri Narasimhan, and Michiel Smid ,“Improved algorithms for constructing fault tolerant geometric spanners,” Algorithmica, 2000.Google Scholar
  98. 98.
    MohammadTaghi Hajiaghayi, Nicole Immorlica, and Vahab S. Mirrokni, “Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks,” in Procd. of 9th ACM international conference on Mobile computing and networking. 2003.Google Scholar
  99. 99.
    Ram Ramanathan and Regina Hain, “Topology control of multihop wireless networks using transmit power adjustment,” in IEEE INFOCOM (2), 2000, pp. 404-413.Google Scholar
  100. 100.
    Martin Burkhart, Pascal von Rickenbach, Roger Wattenhofer, and Aaron Zollinger, “Does topology control reduce interference?,” in Proc. of 5th ACM international symposium on Mobile ad hoc networking and computing (MobiHoc). 2004.Google Scholar
  101. 101.
    Miguel Snchez, Pietro Manzoni, and Zygmunt J. Haas, “Determination of critical transmission range in ad-hoc networks,” in Multiaccess, Mobility and Teletraffic for Wireless Communications (MMT’99), 1999.Google Scholar
  102. 102.
    Andrea E. F. Clementi, Paolo Penna, and Riccardo Silvestri, “On the power assignment problem in radio networks,” ACM/Kluwer Mobile Networks and Applications (MONET), vol. 9, no. 2, pp. 125-140, 2004.CrossRefMathSciNetGoogle Scholar
  103. 103.
    Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ramanathan, and S. S. Ravi, “Algorithmic aspects of topology control problems for ad hoc networks,” in ACM MOBIHOC, 2002.Google Scholar
  104. 104.
    Xiuzhen Cheng, Bhagirath Narahari, Rahul Simha, Maggie X. Cheng, and Dan Liu, “Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics,” IEEE Trans. on Mobile Computing, vol. 2, no. 3, 2003.Google Scholar
  105. 105.
    YYu-Chee Tseng, Yen-Ning Chang, and Bour-Hour Tzeng, “Energy-efficient topology control for wireless ad hoc sensor networks,” in Proc. Int. Conf. Parallel and Distributed Systems (ICPADS), 2002.Google Scholar
  106. 106.
    Curt Schurgers. Vlasios Tsiatsis. and Mani B. Srivastava, “STEM: Topology management for energy efficient sensor networks,” in IEEE Aerospace Conference ’02, 2002.Google Scholar
  107. 107.
    Alberto Cerpa and Deborah Estrin, “Ascent: Adaptive self-configuring sensor network topologies,” SIGCOMM Comput. Commun. Rev., vol. 32, no. 1, pp. 62-62, 2002.CrossRefGoogle Scholar
  108. 108.
    Benjie Chen, Kyle Jamieson, Hari Balakrishnan, and Robert Morris, “Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks,” Wireless Network, vol. 8, no. 5, pp. 481-494, 2002.MATHCrossRefGoogle Scholar
  109. 109.
    Jianping Pan, Thomas Hou, Lin Cai, Yi Shi, and Sherman Shen, “Topology control for wireless sensor networks,” in Proc. of 9th annual international conference on Mobile computing and networking (MobiCom). 2003.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Yu Wang
    • 1
  1. 1.Department of Computer ScienceUniversity of North Carolina at CharlotteCharlotteUSA

Personalised recommendations