Topology control in wireless ad hoc and sensor networks

ABSTRACT

Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and radio interference (with a positive effect on the network traffic carrying capacity). The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes' transmitting range. In this article, we state several problems related to topology control in wireless ad hoc and sensor networks, and we survey state-of-the-art solutions which have been proposed to tackle them. We also outline several directions for further research which we hope will motivate researchers to undertake additional studies in this field.

REFERENCES

• 1: Aldous, D. and Steele, J. 1992. Asymptotics for euclidean minimal spanning trees on random points. Probab. Theo. Relat. Fields 92, 247--258.
• 2: Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., and Zelikovsky, A. 2003. Power efficient range assignment in ad hoc wireless networks. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC)'03.
• 3: Bahramgiri, M., Hajiaghayi, M., and Mirrokni, V. 2002. Fault-tolerant ad 3-dimensional distributed topology control algorithms in wireless multihop networks. In Proceedings of the IEEE International Conference on Computer Communications and Networks. 392--397.
• 4: Lichun Bao , J. J. Garcia-Luna-Aceves, Channel access scheduling in Ad Hoc networks with unidirectional links, Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications, p.9-18, July 2001, Rome, Italy [doi>10.1145/381448.381450]
• 5: Stefano Basagni , Imrich Chlamtac , Danilo Bruschi, A mobility-transparent deterministic broadcast mechanism for ad hoc networks, IEEE/ACM Transactions on Networking (TON), v.7 n.6, p.799-807, Dec. 1999 [doi>10.1109/90.811446]
• 6: Christian Bettstetter, Smooth is better than sharp: a random mobility model for simulation of wireless networks, Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, p.19-27, July 2001, Rome, Italy [doi>10.1145/381591.381600]
• 7: Bettstetter, C. 2002a. On the connectivity of wireless multihop networks with homogeneous and inhomogeneous range assignment. In Proceedings of the 56th IEEE Vehicular Technology Conference (VTC). 1706--1710.
• 8: Christian Bettstetter, On the minimum node degree and connectivity of a wireless multihop network, Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, June 09-11, 2002, Lausanne, Switzerland [doi>10.1145/513800.513811]
• 9: Bettstetter, C. and Krause, O. 2001. On border effects in modeling and simulation of wireless ad hoc networks. In Proceedings of the IEEE International Conference on Mobile and Wireless Communication Network (MWCN).
• 10: Christian Bettstetter , Giovanni Resta , Paolo Santi, The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks, IEEE Transactions on Mobile Computing, v.2 n.3, p.257-269, March 2003 [doi>10.1109/TMC.2003.1233531]
• 11: Douglas M. Blough , Mauro Leoncini , Giovanni Resta , Paolo Santi, On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks, Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing, p.71-82, August 25-30, 2002
• 12: Douglas M. Blough , Mauro Leoncini , Giovanni Resta , Paolo Santi, The lit K-neigh protocol for symmetric topology control in ad hoc networks, Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, June 01-03, 2003, Annapolis, Maryland, USA [doi>10.1145/778415.778433]
• 13: Douglas M. Blough , Giovanni Resta , Paolo Santi, A statistical analysis of the long-run node spatial distribution in mobile ad hoc networks, Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems, September 28-28, 2002, Atlanta, Georgia, USA [doi>10.1145/570758.570765]
• 14: Bollobás, B. 1985. Random Graphs. Academic Press, London, UK.
• 15: Booth, L., Bruck, J., Cook, M., and Franceschetti, M. 2003. Ad hoc wireless networks with noisy links. In Proceedings of the IEEE International Symposium on Information Theory (ISIT).
• 16: Borbash, S. and Jennings, E. 2002. Distributed topology control algorithm for multihop wireless networks. In Proceedings of the IEEE International Joint Conference on Neural Networks. 355--360.
• 17: Bruck, J., Franceschetti, M., and Schulman, L. 2002. Microcellular systems, random walks, and wave propagation. In Proceedings of the IEEE Symposium on Antennas and Propagation. 220--223.
• 18: Martin Burkhart , Pascal von Rickenbach , Roger Wattenhofer , Aaron Zollinger, Does topology control reduce interference?, Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, May 24-26, 2004, Roppongi Hills, Tokyo, Japan [doi>10.1145/989459.989462]
• 19: Mario Ζagalj , Jean-Pierre Hubaux , Christian Enz, Minimum-energy broadcast in all-wireless networks:: NP-completeness and distribution issues, Proceedings of the 8th annual international conference on Mobile computing and networking, September 23-28, 2002, Atlanta, Georgia, USA [doi>10.1145/570645.570667]
• 20: Gruia Calinescu , Ion I. Mandoiu , Alexander Zelikovsky, Symmetric Connectivity with Minimum Power Consumption in Radio Networks, Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing, p.119-130, August 25-30, 2002
• 21: Calinescu, G. and Wan, P. 2003. Range assignment for high connectivity in wireless ad hoc networks. In Proceedings of the Ad Hoc Networks and Wireless. 235--246.
• 22: Camp, T., Boleng, J., and Davies, V. 2002. A survey of mobility models for ad hoc network research. Wirel. Comm. Mobile Comput. 2, 5, 483--502.
• 23: Imrich Chlamtac , András Faragó, A new approach to the design and analysis of peer-to-peer mobile networks, Wireless Networks, v.5 n.3, p.149-156, May 1999 [doi>10.1023/A:1019186624837 ]
• 24: Cisco. 2004. Aironet data sheets. Available at http://www.cisco.com/en/US/products/hw//wireless.
• 25: Andrea E. F. Clementi , Afonso Ferreira , Paolo Penna , Stephane Perennes , Riccardo Silvestri, The Minimum Range Assignment Problem on Linear Radio Networks, Proceedings of the 8th Annual European Symposium on Algorithms, p.143-154, September 05-08, 2000
• 26: Andrea E. F. Clementi , Paolo Penna , Riccardo Silvestri, Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks, Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques, p.197-208, August 08-11, 1999
• 27: Andrea E. F. Clementi , Paolo Penna , Riccardo Silvestri, The Power Range Assignment Problem in Radio Networks on the Plane, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, p.651-660, February 01, 2000
• 28: Dette, H. and Henze, N. 1989. The limit distribution of the largest nearest-neighbor link in the unit d-cube. J. Appl. Probab. 26, 67--80.
• 29: Josep Díaz , Mathew D. Penrose , Jordi Petit , María Serna, Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs, Combinatorics, Probability and Computing, v.9 n.6, p.489-511, November 2000 [doi>10.1017/S0963548300004454]
• 30: Dousse, O., Baccelli, F., and Thiran, P. 2003. Impact of interferences on connectivity in ad hoc networks. In Proceedings of IEEE Infocom. 1724--1733.
• 31: Dousse, O., Thiran, P., and Hasler, M. 2002. Connectivity in ad hoc and hybrid networks. In Proceedings of IEEE Infocom. 1079--1088.
• 32: Deborah Estrin , Ramesh Govindan , John Heidemann , Satish Kumar, Next century challenges: scalable coordination in sensor networks, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.263-270, August 15-19, 1999, Seattle, Washington, United States [doi>10.1145/313451.313556]
• 33: András Faragó, Scalable analysis and design of ad hoc networks via random graph theory, Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications, September 28-28, 2002, Atlanta, Georgia, USA [doi>10.1145/570810.570816]
• 34: Jie Gao , Leonidas J. Guibas , John Hershberger , Li Zhang , An Zhu, Geometric spanner for routing in mobile networks, Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, October 04-05, 2001, Long Beach, CA, USA [doi>10.1145/501422.501424]
• 35: Mario Gerla , Jack Tzu-Chieh Tsai, Multicluster, mobile, multimedia radio network, Wireless Networks, v.1 n.3, p.255-265, 1995 [doi>10.1007/BF01200845]
• 36: Jacob E. Goodman , Joseph O'Rourke, Handbook of discrete and computational geometry, CRC Press, Inc., Boca Raton, FL, 1997
• 37: Grossglauser, M. and Tse, D. 2001. Mobility increases the capacity of ad hoc wireless networks. In Proceedings of IEEE Infocom. 1360--1369.
• 38: Gupta, P. and Kumar, P. 1998. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications. Birkpauser, Boston, MA. 547--566.
• 39: Gupta, P. and Kumar, P. 2000. The capacity of wireless networks. IEEE Trans. Inf. Theo. 46, 2, 388--404.
• 40: Wendi Rabiner Heinzelman , Joanna Kulik , Hari Balakrishnan, Adaptive protocols for information dissemination in wireless sensor networks, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.174-185, August 15-19, 1999, Seattle, Washington, United States [doi>10.1145/313451.313529]
• 41: Holst, L. 1980. On multiple covering of a circle with random arcs. J. Appl. Probab. 16, 284--290.
• 42: Huang, Z., Shen, C., Srisathapornphat, C., and Jaikaeo, C. 2002. Topology control for ad hoc networks with directional antennas. In Proceedings of the IEEE International Conference on Computer Communications and Networks. 16--21.
• 43: IEEE. 1999. Wireless lan medium access control and physical layer specifications. In IEEE 802.11 Standard (IEEE Computer Society LAN MAN Standards Committee).
• 44: Janson, S., Knuth, D., Luczak, T., and Pittel, B. 1993. The birth of the giant component. Rand. Struct. Algor. 4, 3, 233--359.
• 45: Johnson, D. and Maltz, D. 1996. Dynamic source routing in ad hoc wireless networks. In Mobile Computing. Kluwer Academic Publishers. 153--181.
• 46: Khan, J., Katz, R., and Pister, K. 2000. Emerging challenges: Mobile networking for smart dust. J. Comm. Netw. 2, 3, 186--196.
• 47: Kim, D., Toh, C., and Choi, Y. 2001. On supporting link asymmetry in mobile ad hoc networks. In Proceedings of IEEE Globecom. 2798--2803.
• 48: Lefteris M. Kirousis , Evangelos Kranakis , Danny Krizanc , Andrzej Pelc, Power consumption in packet radio networks, Theoretical Computer Science, v.243 n.1-2, p.289-305, July 28, 2000 [doi>10.1016/S0304-3975(98)00223-0 ]
• 49: Young-Bae Ko , Nitin H. Vaidya, Location-aided routing (LAR) in mobile ad hoc networks, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, p.66-75, October 25-30, 1998, Dallas, Texas, United States [doi>10.1145/288235.288252]
• 50: Kolchin, V., Sevast'yanov, B., and Chistyakov, V. 1978. Random Allocations. V.H. Winston and Sons, Washington D.C.
• 51: Jinyang Li , Charles Blake , Douglas S.J. De Couto , Hu Imm Lee , Robert Morris, Capacity of Ad Hoc wireless networks, Proceedings of the 7th annual international conference on Mobile computing and networking, p.61-69, July 2001, Rome, Italy [doi>10.1145/381677.381684]
• 52: Li Li , Joseph Y. Halpern , Paramvir Bahl , Yi-Min Wang , Roger Wattenhofer, Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.264-273, August 2001, Newport, Rhode Island, United States [doi>10.1145/383962.384043]
• 53: Ning Li , Jennifer C. Hou, FLSS: a fault-tolerant topology control algorithm for wireless networks, Proceedings of the 10th annual international conference on Mobile computing and networking, September 26-October 01, 2004, Philadelphia, PA, USA [doi>10.1145/1023720.1023747]
• 54: Li, N., Hou, J., and Sha, L. 2003. Design and analysis of an mst-based topology control algorithm. In Proceedings of the IEEE Infocom. 1702--1712.
• 55: Xiang-Yang Li , Peng-Jun Wan, Constructing minimum energy mobile wireless networks, Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, October 04-05, 2001, Long Beach, CA, USA [doi>10.1145/501449.501460]
• 56: X.-Y. Li , P.-J. Wan , Y. Wang , O. Frieder, Sparse Power Efficient Topology for Wireless Networks, Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9, p.296.2, January 07-10, 2002
• 57: Xiang-Yang Li , Yu Wang , Wen-Zhan Song, Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks, IEEE Transactions on Parallel and Distributed Systems, v.15 n.12, p.1057-1069, December 2004 [doi>10.1109/TPDS.2004.77]
• 58: Weifa Liang, Constructing minimum-energy broadcast trees in wireless ad hoc networks, Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, June 09-11, 2002, Lausanne, Switzerland [doi>10.1145/513800.513815]
• 59: Liu, J. and Li, B. 2002. Mobilegrid: Capacity-aware topology control in mobile ad hoc networks. In Proceedings of the IEEE International Conference on Computer Communications and Networks. 570--574.
• 60: Errol L. Lloyd , Rui Liu , Madhav V. Marathe , Ram Ramanathan , S. S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, June 09-11, 2002, Lausanne, Switzerland [doi>10.1145/513800.513816]
• 61: Alan Mainwaring , David Culler , Joseph Polastre , Robert Szewczyk , John Anderson, Wireless sensor networks for habitat monitoring, Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, September 28-28, 2002, Atlanta, Georgia, USA [doi>10.1145/570738.570751]
• 62: Mahesh K. Marina , Samir R. Das, Routing performance in the presence of unidirectional links in multihop wireless networks, Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, June 09-11, 2002, Lausanne, Switzerland [doi>10.1145/513800.513803]
• 63: Meester, R. and Roy, R. 1996. Continuum Percolation. Cambridge University Press, Cambridge, U.K.
• 64: Anastassios Michail , Anthony Ephremides, Energy-efficient routing for connection-oriented traffic in wireless ad-hoc networks, Mobile Networks and Applications, v.8 n.5, p.517-533, October 2003 [doi>10.1023/A:1025137811334]
• 65: Moaveni-Nejad, K. and Li, X. 2005. Low-interference topology control for wireless ad hoc networks. Ad Hoc Sensor Netw.: Int. J. To appear.
• 66: Shree Murthy , J. J. Garcia-Luna-Aceves, An efficient routing protocol for wireless networks, Mobile Networks and Applications, v.1 n.2, p.183-197, Oct. 1996 [doi>10.1007/BF01193336]
• 67: Narayanaswamy, S., Kawadia, V., Sreenivas, R., and Kumar, P. 2002. Power control in ad hoc networks: Theory, architecture, algorithm and implementation of the compow protocol. In Proceedings of European Wireless. 156--162.
• 68: Palmer, E. 1985. Graphical Evolution. John Wiley and Sons, New York, NY.
• 69: Panchapakesan, P. and Manjunath, D. 2001. On the transmission range in dense ad hoc radio networks. In Proceedings of IEEE Signal Processing Communication (SPCOM).
• 70: Ioannis Papadimitriou , Leonidas Georgiadis, Energy-aware broadcast trees in wireless networks, Mobile Networks and Applications, v.9 n.6, p.567-581, December 2004 [doi>10.1145/1035715.1035718]
• 71: Pearlman, M., Haas, Z., and Manvell, B. 2000. Using multi-hop acknowledgements to discover and reliably communicate over unidirectional links in ad hoc networks. In Proceedings of Wireless Communications and Networking Conference (WCNC). 532--537.
• 72: Penrose, M. 1997. The longest edge of the random minimal spanning tree. Annals Appl. Probab. 7, 2, 340--361.
• 73: Penrose, M. 1998. Extremes for the minimal spanning tree on normally distributed points. Advances Appl. Probab. 30, 628--639.
• 74: Mathew D. Penrose, On k-connectivity for a geometric random graph, Random Structures & Algorithms, v.15 n.2, p.145-164, Sept.1999 [doi>10.1002/(SICI)1098-2418(199909)15:2<145::AID-RSA2>3.0.CO;2-G ]
• 75: Penrose, M. 1999b. A strong law for the largest nearest-neighbour link between random points. J. London Math. Soci. 60, 2, 951--960.
• 76: Penrose, M. 1999c. A strong law for the longest edge of the minimal spanning tree. The Annals Probab. 27, 1, 246--260.
• 77: Philips, T., Panwar, S., and Tantawi, A. 1989. Connectivity properties of a packet radio network model. IEEE Trans. Inform. Theo. 35, 5, 1044--1047.
• 78: Piret, P. 1991. On the connectivity of radio networks. IEEE Trans. Inform. Theo. 37, 5, 1490--1492.
• 79: G. J. Pottie , W. J. Kaiser, Wireless integrated network sensors, Communications of the ACM, v.43 n.5, p.51-58, May 2000 [doi>10.1145/332833.332838]
• 80: Ravi Prakash, A routing algorithm for wireless ad hoc networks with unidirectional links, Wireless Networks, v.7 n.6, p.617-625, November 2001 [doi>10.1023/A:1012371402221 ]
• 81: Rajmohan Rajaraman, Topology control and routing in ad hoc networks: a survey, ACM SIGACT News, v.33 n.2, June 2002 [doi>10.1145/564585.564602]
• 82: Ramanathan, R. and Rosales-Hain, R. 2000. Topology control of multihop wireless networks using transmit power adjustment. In Proceedings of IEEE Infocom 00. 404--413.
• 83: Ramasubramanian, V., Chandra, R., and Mosse, D. 2002. Providing a bidirectional abstraction for unidirectional ad hoc networks. In Proceedings of IEEE Infocom. 1258--1267.
• 84: Theodore Rappaport, Wireless Communications: Principles and Practice, Prentice Hall PTR, Upper Saddle River, NJ, 2001
• 85: Rodoplu, V. and Meng, T. 1999. Minimum energy mobile wireless networks. IEEE J. Select. Areas Comm. 17, 8, 1333--1344.
• 86: Royer, E., Melliar-Smith, P., and Moser, L. 2001. An analysis of the optimum node density for ad hoc mobile networks. In Proceedings of the IEEE International Conference on Communications. 857--861.
• 87: Pei Zhang , Christopher M. Sadler , Stephen A. Lyon , Margaret Martonosi, Hardware design experiences in ZebraNet, Proceedings of the 2nd international conference on Embedded networked sensor systems, November 03-05, 2004, Baltimore, MD, USA [doi>10.1145/1031495.1031522]
• 88: Sanchez, M., Manzoni, P., and Haas, Z. 1999. Determination of critical transmitting range in ad hoc networks. In Proceedings of Multiaccess, Mobility and Teletraffic for Wireless Communications Conference.
• 89: Paolo Santi, The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks, IEEE Transactions on Mobile Computing, v.4 n.3, p.310-317, May 2005 [doi>10.1109/TMC.2005.45]
• 90: Paolo Santi , Douglas M. Blough, An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks, Proceedings of the 2002 International Conference on Dependable Systems and Networks, p.89-102, June 23-26, 2002
• 91: Paolo Santi , Douglas M. Blough, The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks, IEEE Transactions on Mobile Computing, v.2 n.1, p.25-39, January 2003 [doi>10.1109/TMC.2003.1195149]
• 92: Paolo Santi , Douglas M. Blough , Feodor Vainstein, A probabilistic analysis for the range assignment problem in ad hoc networks, Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, October 04-05, 2001, Long Beach, CA, USA [doi>10.1145/501445.501446]
• 93: Loren Schwiebert , Sandeep K.S. Gupta , Jennifer Weinmann, Research challenges in wireless networks of biomedical sensors, Proceedings of the 7th annual international conference on Mobile computing and networking, p.151-165, July 2001, Rome, Italy [doi>10.1145/381677.381692]
• 94: Karim Seada , Marco Zuniga , Ahmed Helmy , Bhaskar Krishnamachari, Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks, Proceedings of the 2nd international conference on Embedded networked sensor systems, November 03-05, 2004, Baltimore, MD, USA [doi>10.1145/1031495.1031509]
• 95: Sen, A. and Huson, M. 1996. A new model for scheduling packet radio networks. In Proceedings of IEEE Infocom. 1116--1124.
• 96: Wen-Zhan Song , Yu Wang , Xiang-Yang Li , Ophir Frieder, Localized algorithms for energy efficient topology in wireless ad hoc networks, Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, May 24-26, 2004, Roppongi Hills, Tokyo, Japan [doi>10.1145/989459.989473]
• 97: Mani Srivastava , Richard Muntz , Miodrag Potkonjak, Smart kindergarten: sensor-based wireless networks for smart developmental problem-solving enviroments, Proceedings of the 7th annual international conference on Mobile computing and networking, p.132-138, July 2001, Rome, Italy [doi>10.1145/381677.381690]
• 98: Steele, J. 1988. Growth rates of euclidean minimal spanning trees with power weighted edges. Annals Probab. 16, 1767--1787.
• 99: David C. Steere , Antonio Baptista , Dylan McNamee , Calton Pu , Jonathan Walpole, Research challenges in environmental observation and forecasting systems, Proceedings of the 6th annual international conference on Mobile computing and networking, p.292-299, August 06-11, 2000, Boston, Massachusetts, United States [doi>10.1145/345910.345961]
• 100: Robert Szewczyk , Alan Mainwaring , Joseph Polastre , John Anderson , David Culler, An analysis of a large scale habitat monitoring application, Proceedings of the 2nd international conference on Embedded networked sensor systems, November 03-05, 2004, Baltimore, MD, USA [doi>10.1145/1031495.1031521]
• 101: P. J. Wan , G. Călinescu , X. Y. Li , O. Frieder, Minimum-energy broadcasting in static ad hoc wireless networks, Wireless Networks, v.8 n.6, p.607-617, November 2002 [doi>10.1023/A:1020381720601 ]
• 102: Peng-Jun Wan , Chih-Wei Yi, Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks, Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, May 24-26, 2004, Roppongi Hills, Tokyo, Japan [doi>10.1145/989459.989461]
• 103: Wang, W., Li, X., MoaveniNejad, K., Wang, Y., and Song, W. 2003. The spanning ratio of β-skeletons.
• 104: Wang, Y., Li, X., and Frieder, O. 2002. Distributed spanners with bounded degree for wireless ad hoc networks. Int. J. Found. Comput. Sci. To appear.
• 105: Wattenhofer, R., Li, L., Bahl, P., and Wang, Y. 2001. Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In Proceedings of IEEE Infocom. 1388--1397.
• 106: Wattenhofer, R. and Zollinger, A. 2004. Xtc: A practical topology control algorithm for ad hoc networks. In the 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN).
• 107: Wieselthier, J., Nguyen, G., and Ephremides, A. 2000. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proceedings of IEEE Infocom. 585--594.
• 108: Feng Xue , P. R. Kumar, The number of neighbors needed for connectivity of wireless networks, Wireless Networks, v.10 n.2, p.169-181, March 2004 [doi>10.1023/B:WINE.0000013081.09837.c0]
• 109: Yi, C. and Wan, P. 2005. Asymptotic critical transmission ranges for connectivity in wireless ad hoc networks with bernoulli nodes. In Proceedings of IEEE Wireless Communications and Networking Conference (WCNC) To appear.
• 110: Yi, C., Wan, P., Li, X., and Frieder, O. 2003. Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with bernoulli nodes. In Proceedings of IEEE Wireless Communications and Networking Conference (WCNC). 1585--1590.
• 111: Yukich, J. 2000. Asymptotics for weighted minimal spanning trees on random points. Stochastic Proc. Appl. 85, 123--128.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Network topology

Keywords:
Connectivity, energy consumption, sensor networks, topology control, wireless ad hoc networks