Paolo Santi
Skip Abstract Section
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.
- Aldous, D. and Steele, J. 1992. Asymptotics for euclidean minimal spanning trees on random points. Probab. Theo. Relat. Fields 92, 247--258.]]Google Scholar
- 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.]]Google Scholar
- 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.]]Google Scholar
- Bao, L. and Garcia-Luna-Aceves, J. 2001. Channel access scheduling in ad hoc networks with unidirectional links. In Proceedings of Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM). 9--18.]] Google Scholar
- Basagni, S., Bruschi, D., and Chlamtac, I. 1999. A mobility-transparent deterministic broadcast mechanism for ad hoc networks. IEEE Trans. Netw. 7, 6, 799--807.]] Google Scholar
- Bettstetter, C. 2001. Smooth is better than sharp: A random mobility model for simulation of wireless networks. In Proceedings of the ACM Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM). 19--27.]] Google Scholar
- 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.]]Google Scholar
- Bettstetter, C. 2002b. On the minimum node degree and connectivity of a wireless multihop network. In Proceedings of the ACM MobiHoc 02. 80--91.]] Google Scholar
- 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).]]Google Scholar
- Bettstetter, C., Resta, G., and Santi, P. 2003. The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans. Mobile Comput. 2, 3, 257--269.]] Google Scholar
- Blough, D., Leoncini, M., Resta, G., and Santi, P. 2002. On the symmetric range assignment problem in wireless ad hoc networks. In Proceedings of the IFIP Conference on Theoretical Computer Science. 71--82.]] Google Scholar
- Blough, D., Leoncini, M., Resta, G., and Santi, P. 2003. The k-neighbors protocol for symmetric topology control in ad hoc networks. In Proceedings of the ACM MobiHoc 03. 141--152.]] Google Scholar
- Blough, D., Resta, G., and Santi, P. 2002. A statistical analysis of the long-run node spatial distribution in mobile ad hoc networks. In Proceedings of the ACM Workshop on Modeling, Analysis, and Simulation of Wireless and Mobile Systems (MSWiM). 30--37.]] Google Scholar
- Bollobás, B. 1985. Random Graphs. Academic Press, London, UK.]]Google Scholar
- 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).]]Google Scholar
- 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.]]Google Scholar
- 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.]]Google Scholar
- Burkhart, M., Rickenbach, P. V., Wattenhofer, R., and Zollinger, A. 2004. Does topology control reduce interference? In Proceedings of ACM MobiHoc 04. 9--19.]] Google Scholar
- Cagali, M., Hubaux, J., and Enz, C. 2002. Minimum-energy broadcast in all-wireless networks: Np-completeness and distribution issues. In Proceedings of the ACM Mobicom 02. 172--182.]] Google Scholar
- Calinescu, G., Mandoiu, I., and Zelikovsky, A. 2002. Symmetric connectivity with minimum power consumption in radio networks. In Proceedings of the IFIP Conference on Theoretical Computer Science. 119--130.]] Google Scholar
- 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.]]Google Scholar
- 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.]]Google Scholar
- Chlamtac, I. and Faragó, A. 1999. A new approach to the design and analysis of peer-to-peer mobile networks. ACM/Baltzer Wirel. Netw. 5, 149--156.]] Google Scholar
- Cisco. 2004. Aironet data sheets. Available at http://www.cisco.com/en/US/products/hw//wireless.]]Google Scholar
- Clementi, A., Ferreira, A., Penna, P., Perennes, S., and Silvestri, R. 2000a. The minimum range assignment problem on linear radio networks. In Proceedings of the 8th European Symposium on Algorithms (ESA). 143--154.]] Google Scholar
- Clementi, A., Penna, P., and Silvestri, R. 1999. Hardness results for the power range assignment problem in packet radio networks. In Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX). 197--208.]] Google Scholar
- Clementi, A., Penna, P., and Silvestri, R. 2000b. The power range assignment problem in radio networks on the plane. In Proceedings of the 17th Symposium on Theoretical Aspects of Computer Science (STACS). 651--660.]] Google Scholar
- 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.]]Google Scholar
- Diaz, J., Penrose, M., Petita, J., and Serna, M. 2000. Convergence theorems for some layout measures on random lattice and random geometric graphs. Combin., Probab., Comput. 6, 489--511.]] Google Scholar
- Dousse, O., Baccelli, F., and Thiran, P. 2003. Impact of interferences on connectivity in ad hoc networks. In Proceedings of IEEE Infocom. 1724--1733.]]Google Scholar
- Dousse, O., Thiran, P., and Hasler, M. 2002. Connectivity in ad hoc and hybrid networks. In Proceedings of IEEE Infocom. 1079--1088.]]Google Scholar
- Estrin, D., Govindan, R., Heidemann, J., and Kumar, S. 1999. Next century challenges: Scalable coordination in sensor networks. In Proceedings of the ACM Mobicom. 263--270.]] Google Scholar
- Faragó, A. 2002. Scalable analysis and design of ad hoc networks via random graph theory. In Proceedings of ACM Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM). 43--50.]] Google Scholar
- Gao, J., Guibas, L., Hershberger, J., Zhang, L., and Zhu, A. 2001. Geometric spanners for routing in mobile networks. In Proceedings of the ACM MobiHoc. 45--55.]] Google Scholar
- Gerla, M. and Tsai, J. T.-C. 1995. Multicluster, mobile, multimedia radio networks. ACM/Baltzer Wirel. Netw. 1, 255--265.]] Google Scholar
- Goodman, J. and O'Rourke, J. 1997. Handbook of Discrete and Computational Geometry. CRC Press, New York, NY.]] Google Scholar
- Grossglauser, M. and Tse, D. 2001. Mobility increases the capacity of ad hoc wireless networks. In Proceedings of IEEE Infocom. 1360--1369.]]Google Scholar
- 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.]]Google Scholar
- Gupta, P. and Kumar, P. 2000. The capacity of wireless networks. IEEE Trans. Inf. Theo. 46, 2, 388--404.]]Google Scholar
- Heinzelman, W., Kulik, J., and Balakrishnan, H. 1999. Adaptive protocols for information dissemination in wireless sensor networks. In Proceedings of ACM Mobicom. 174--185.]] Google Scholar
- Holst, L. 1980. On multiple covering of a circle with random arcs. J. Appl. Probab. 16, 284--290.]]Google Scholar
- 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.]]Google Scholar
- IEEE. 1999. Wireless lan medium access control and physical layer specifications. In IEEE 802.11 Standard (IEEE Computer Society LAN MAN Standards Committee).]]Google Scholar
- Janson, S., Knuth, D., Luczak, T., and Pittel, B. 1993. The birth of the giant component. Rand. Struct. Algor. 4, 3, 233--359.]]Google Scholar
- Johnson, D. and Maltz, D. 1996. Dynamic source routing in ad hoc wireless networks. In Mobile Computing. Kluwer Academic Publishers. 153--181.]]Google Scholar
- Khan, J., Katz, R., and Pister, K. 2000. Emerging challenges: Mobile networking for smart dust. J. Comm. Netw. 2, 3, 186--196.]]Google Scholar
- Kim, D., Toh, C., and Choi, Y. 2001. On supporting link asymmetry in mobile ad hoc networks. In Proceedings of IEEE Globecom. 2798--2803.]]Google Scholar
- Kirousis, L., Kranakis, E., Krizanc, D., and Pelc, A. 2000. Power consumption in packet radio networks. Theoret. Comput. Sci. 243, 289--305.]] Google Scholar
- Ko, Y. and Vaidya, N. 1998. Location-aided routing (lar) in mobile ad hoc networks. In Proceedings of ACM Mobicom. 66--75.]] Google Scholar
- Kolchin, V., Sevast'yanov, B., and Chistyakov, V. 1978. Random Allocations. V.H. Winston and Sons, Washington D.C.]]Google Scholar
- Li, J., Blake, C., Couto, D. D., Lee, H. I., and Morris, R. 2001. Capacity of ad hoc wireless networks. In Proceedings of ACM Mobicom. 61--69.]] Google Scholar
- Li, L., Halpern, J., Bahl, P., Wang, Y., and Wattenhofer, R. 2001. Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. In Proceedings of ACM Principles of Distributed Company (PODC). 264--273.]] Google Scholar
- Li, N. and Hou, J. 2004. Flss: a fault-tolerant topology control algorithm for wireless networks. In Proceedings of ACM Mobicom. 275--286.]] Google Scholar
- 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.]]Google Scholar
- Li, X. and Wan, P. 2001. Constructing minimum energy mobile wireless networks. In Proceedings of ACM Mobihoc. 283--286.]] Google Scholar
- Li, X., Wan, P., Wang, Y., and Frieder, O. 2002. Sparse power efficient topology for wireless networks. In Proceedings of the IEEE Hawaii International Conference on System Sciences (HICSS).]] Google Scholar
- Li, X., Wang, Y., and Song, W. 2004. Applications of k-local mst for topology control and broadcasting in wireless ad hoc networks. IEEE Trans. Paral. Distr. Syst. 15, 12, 1057--1069.]] Google Scholar
- Liang, W. 2002. Constructing minimum-energy broadcast trees in wireless ad hoc networks. In Proceedings of ACM Mobihoc. 112--122.]] Google Scholar
- 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.]]Google Scholar
- Loyd, E., Liu, R., Marathe, M., Ramanathan, R., and Ravi, S. 2002. Algorithmic aspects of topology control problems for ad hoc networks. In Proceedings of ACM Mobihoc. 123--134.]] Google Scholar
- Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D., and Anderson, J. 2002. Wireless sensor networks for habitat monitoring. In Proceedings of ACM Wireless Sensor Networks and Applications (WSNA). 88--97.]] Google Scholar
- Marina, M. and Das, S. 2002. Routing performance in the presence of unidirectional links in multihop wireless networks. In Proceedings of ACM Mobihoc. 12--23.]] Google Scholar
- Meester, R. and Roy, R. 1996. Continuum Percolation. Cambridge University Press, Cambridge, U.K.]]Google Scholar
- Michail, A. and Ephremides, A. 2003. Energy-efficient routing for connection-oriented traffic in wireless ad hoc networks. Mobile Netw. Appl. 8, 5, 517--533.]] Google Scholar
- Moaveni-Nejad, K. and Li, X. 2005. Low-interference topology control for wireless ad hoc networks. Ad Hoc Sensor Netw.: Int. J. To appear.]]Google Scholar
- Murthy, S. and Garcia-Luna-Aceves, J. 1996. An efficient routing protocol for wireless networks. Mobile Netw. Appls. 1, 2, 183--197.]] Google Scholar
- 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.]]Google Scholar
- Palmer, E. 1985. Graphical Evolution. John Wiley and Sons, New York, NY.]]Google Scholar
- Panchapakesan, P. and Manjunath, D. 2001. On the transmission range in dense ad hoc radio networks. In Proceedings of IEEE Signal Processing Communication (SPCOM).]]Google Scholar
- Papadimitriou, I. and Georgiadis, L. 2004. Energy-aware broadcast trees in wireless networks. Mobile Netw. Appls. 9, 6, 567--581.]] Google Scholar
- 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.]]Google Scholar
- Penrose, M. 1997. The longest edge of the random minimal spanning tree. Annals Appl. Probab. 7, 2, 340--361.]]Google Scholar
- Penrose, M. 1998. Extremes for the minimal spanning tree on normally distributed points. Advances Appl. Probab. 30, 628--639.]]Google Scholar
- Penrose, M. 1999a. On k-connectivity for a geometric random graph. Rand. Struct. Algori. 15, 2, 145--164.]] Google Scholar
- Penrose, M. 1999b. A strong law for the largest nearest-neighbour link between random points. J. London Math. Soci. 60, 2, 951--960.]]Google Scholar
- Penrose, M. 1999c. A strong law for the longest edge of the minimal spanning tree. The Annals Probab. 27, 1, 246--260.]]Google Scholar
- Philips, T., Panwar, S., and Tantawi, A. 1989. Connectivity properties of a packet radio network model. IEEE Trans. Inform. Theo. 35, 5, 1044--1047.]]Google Scholar
- Piret, P. 1991. On the connectivity of radio networks. IEEE Trans. Inform. Theo. 37, 5, 1490--1492.]]Google Scholar
- Pottie, G. and Kaiser, W. 2000. Wireless integrated network sensors. Comm. ACM 43, 5, 51--58.]] Google Scholar
- Prakash, R. 2001. A routing algorithm for wireless ad hoc networks with unidirectional links. ACM/Kluwer Wirel. Netw. 7, 6, 617--625.]] Google Scholar
- Rajaraman, R. 2002. Topology control and routing in ad hoc networks: A survey. SIGACT News 33, 2, 60--73.]] Google Scholar
- 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.]]Google Scholar
- Ramasubramanian, V., Chandra, R., and Mosse, D. 2002. Providing a bidirectional abstraction for unidirectional ad hoc networks. In Proceedings of IEEE Infocom. 1258--1267.]]Google Scholar
- Rappaport, T. 2002. Wireless Communications: Principles and Practice, 2nd Ed. Prentice Hall, Upper Saddle River, NJ.]] Google Scholar
- Rodoplu, V. and Meng, T. 1999. Minimum energy mobile wireless networks. IEEE J. Select. Areas Comm. 17, 8, 1333--1344.]]Google Scholar
- 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.]]Google Scholar
- Sadler, C., Zhang, P., Martonosi, M., and Lyon, S. 2004. Hardware design experiences in zebranet. In Proceedings of ACM SenSys. 227--238.]] Google Scholar
- 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.]]Google Scholar
- Santi, P. 2005. The critical transmitting range for connectivity in mobile ad hoc networks. IEEE Trans. Mobile Comput. 4, 3, 310--317.]] Google Scholar
- Santi, P. and Blough, D. 2002. An evaluation of connectivity in mobile wireless ad hoc networks. In Proceedings of IEEE Dependable Systems and Networks (DSN). 89--98.]] Google Scholar
- Santi, P. and Blough, D. 2003. The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Trans. Mobile Comput. 2, 1, 25--39.]] Google Scholar
- Santi, P., Blough, D., and Vainstein, F. 2001. A probabilistic analysis for the range assignment problem in ad hoc networks. In Proceedings of ACM Mobihoc. 212--220.]] Google Scholar
- Schwiebert, L., Gupta, S., and Weinmann, J. 2001. Research challenges in wireless networks of biomedical sensors. In Proceedings of ACM Mobicom. 151--165.]] Google Scholar
- Seada, K., Zuniga, M., Helmy, A., and Krishnamachari, B. 2004. Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks. In Proceedings of ACM SenSys. 108--121.]] Google Scholar
- Sen, A. and Huson, M. 1996. A new model for scheduling packet radio networks. In Proceedings of IEEE Infocom. 1116--1124.]]Google Scholar
- Song, W., Wang, Y., Li, X., and Frieder, O. 2004. Localized algorithms for energy efficient topology in wireless ad hoc networks. In Proceedings of ACM MobiHoc. 98--108.]] Google Scholar
- Srivastava, M., Muntz, R., and Potkonjak, M. 2001. Smart kindergarten: Sensor-based wireless networks for smart developmental problem-solving environments. In Proceedings of ACM Mobicom. 132--138.]] Google Scholar
- Steele, J. 1988. Growth rates of euclidean minimal spanning trees with power weighted edges. Annals Probab. 16, 1767--1787.]]Google Scholar
- Steere, D., Baptista, A., McNamee, D., Pu, C., and Walpole, J. 2000. Research challenges in environmental observation and forecasting systems. In Proceedings of ACM Mobicom. 292-- 299.]] Google Scholar
- Szewczyk, R., Mainwairing, A., Polastre, J., and Culler, D. 2004. An analysis of a large scale habitat monitoring application. In Proceedings of ACM SenSys. 214--226.]] Google Scholar
- Wan, P., Calinescu, G., Li, X., and Frieder, O. 2002. Minimum energy broadcasting in static ad hoc wireless networks. ACM/Kluwer Wirel. Netw. 8, 6, 607--617.]] Google Scholar
- Wan, P. and Yi, C. 2004. Asymptotical critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks. In Proceedings of ACM MobiHoc. 1--8.]] Google Scholar
- Wang, W., Li, X., MoaveniNejad, K., Wang, Y., and Song, W. 2003. The spanning ratio of β-skeletons.]]Google Scholar
- 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.]]Google Scholar
- 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.]]Google Scholar
- 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).]]Google Scholar
- 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.]]Google Scholar
- Xue, F. and Kumar, P. 2004. The number of neighbors needed for connectivity of wireless networks. ACM/Kluwer Wirel. Netw. 10, 2, 169--181.]] Google Scholar
- 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.]]Google Scholar
- 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.]]Google Scholar
- Yukich, J. 2000. Asymptotics for weighted minimal spanning trees on random points. Stochastic Proc. Appl. 85, 123--128.]]Google Scholar
Index Terms
- Topology control in wireless ad hoc and sensor networks
Recommendations
Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks
In most existing localized topology control protocols for mobile ad hoc networks (MANETs), each node selects a few logical neighbors based on location information and uses a small transmission range to cover those logical neighbors. Transmission range ...
Energy-efficient topology control in wireless ad hoc networks with selfish nodes
In wireless ad hoc networks there is no fixed infrastructure or centralized controller to enforce cooperation between nodes. Therefore, nodes may act selfishly in running network protocols for conserving their own energy resources. In this paper, we ...
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
In this paper, we analyze the critical transmitting range for connectivity in wireless ad hoc networks. More specifically, we consider the following problem: Assume n nodes, each capable of communicating with nodes within a radius of r, are randomly and ...
Reviews
Ami Marowka
This survey reviews one of the major research disciplines in the area of wireless ad hoc and sensor networks: topology control. The goal of topology control is to dynamically change the nodes' transmitting range, in order to maintain the network's connectivity, while reducing the energy consumed by node transceivers. Many solutions, theoretical and practical, have been proposed to compete with the range assignment problem. The survey starts by introducing a commonly used model of a wireless ad hoc network, and then classifying the various approaches to the topology control problem into to two classes: homogeneous and nonhomogeneous approaches. In the first case, it is assumed that all nodes in the network use the same transmitting range. In the second case, nodes are allowed to choose different transmitting ranges. The paper reviews theoretical and simulation results, in the cases of stationary and mobile networks, and discusses their advantages and disadvantages. The last section summarizes the open issues in the field. The survey is written well, and the author succeeds in arranging so many research works into an organized and clear view. However, this survey does not cover (and cannot cover) all of the various aspects of research in this field. Thus, readers should consult other papers as well [1]. Online Computing Reviews Service
Mariusz A. Fecko
An excellent critical survey of techniques for topology control (TC) in wireless ad hoc networks is provided in this paper. TC is interpreted in the paper as a way for nodes to adjust their transmit power in order to maintain a certain network-wide property (for example, connectivity). Typically, this property needs to be satisfied while minimizing the power expended in the network. The author gives a thorough overview of the field. The number of references is extensive, and the scope of the coverage of the theoretical aspects of TC is broad. The paper discusses the graph-theoretic approaches to network modeling, and then proceeds to survey both homogeneous and nonhomogeneous TC in stationary networks. Various classes of TC protocols for building and maintaining a desired topology are also described. Homogeneous and nonhomogeneous approaches to TC in mobile networks are reviewed next. The paper concludes with a discussion of current TC challenges: designing TC to explicitly reduce interference, making TC based on network models more realistic than point graphs with uniform node distribution, getting a more accurate analysis of TC in mobile networks, and providing experimental evidence of the effectiveness of TC in practice. Despite the impressive breadth of this survey, it has to be pointed out that the author's interpretation of TC is not the only one: TC may be affected by choosing to activate only certain links to nodes within a transmission range. TC for directional antennas, which has a unique set of challenges, is not mentioned in the paper. Finally, the survey is very theoretical, with no examples of real systems where TC is deployed. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments