A Taxonomic Approach to Topology Control in Ad Hoc and Wireless Networks

Topology control (TC) aims at tuning the topology of highly dynamic networks to provide better control over network resources and to increase the efficiency of communication. Recently, many TC protocols have been proposed. The protocols are designed for preserving connectivity, minimizing energy consumption, maximizing the overall network coverage or network capacity. Each TC protocol makes different assumptions about the network topology, environment detection resources, and control capacities. This circumstance makes it extremely difficult to comprehend the role and purpose of each protocol. To tackle this situation, a taxonomy for TC protocols is presented throughout this paper. Additionally, some TC protocols are classified based upon this taxonomy.

[1]  L.J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2001, IEEE Journal on Selected Areas in Communications.

[2]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[3]  Jennifer C. Hou,et al.  FLSS: a fault-tolerant topology control algorithm for wireless networks , 2004, MobiCom '04.

[4]  SantiPaolo,et al.  The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003 .

[5]  Daniel Mossé,et al.  Providing a bidirectional abstraction for unidirectional ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Zhu Pei-dong.  A Survey of Mobility Models for Ad Hoc Networks , 2005 .

[7]  Ernst Althaus,et al.  Power efficient range assignment in ad-hoc wireless networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[8]  Roger Wattenhofer.  Sensor Networks: Distributed Algorithms Reloaded - or Revolutions? , 2006, SIROCCO.

[9]  Andrea E. F. Clementi,et al.  Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks , 1999, RANDOM-APPROX.

[10]  Miodrag Potkonjak,et al.  Smart kindergarten: sensor-based wireless networks for smart developmental problem-solving environments , 2001, MobiCom '01.

[11]  M. Penrose.  A Strong Law for the Longest Edge of the Minimal Spanning Tree , 1999 .

[12]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[13]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[14]  Weifa Liang,et al.  Constructing minimum-energy broadcast trees in wireless ad hoc networks , 2002, MobiHoc '02.

[15]  Asser N. Tantawi,et al.  Connectivity properties of a packet radio network model , 1989, IEEE Trans. Inf. Theory.

[16]  Ahmed Helmy,et al.  Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks , 2004, SenSys '04.

[17]  Peng-Jun Wan,et al.  Asymptotic critical transmission ranges for connectivity in wireless ad hoc networks with Bernoulli nodes , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[18]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[19]  François Baccelli,et al.  Impact of interferences on connectivity in ad hoc networks , 2005, IEEE/ACM Transactions on Networking.

[20]  Pascal Lorenz,et al.  Proceedings of the 5th International Conference on Networking , 2006 .

[21]  Xiang-Yang Li,et al.  Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks , 2004, MobiHoc '04.

[22]  Jehoshua Bruck,et al.  Microcellular systems, random walks, and wave propagation , 2002, IEEE Antennas and Propagation Society International Symposium.

[23]  S. A. Borbash,et al.  Distributed topology control algorithm for multihop wireless networks , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[24]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[25]  Mathew D. Penrose.  A Strong Law for the Largest Nearest‐Neighbour Link between Random Points , 1999 .

[26]  Jens Peveling.  The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks , 2008 .

[27]  Philippe Piret.  On the connectivity of radio networks , 1991, IEEE Trans. Inf. Theory.

[28]  Xiang-Yang Li,et al.  Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[29]  N. Henze,et al.  The limit distribution of the largest nearest-neighbour link in the unit d-cube , 1989, Journal of Applied Probability.

[30]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[31]  Massimo Franceschetti,et al.  Ad hoc wireless networks with noisy links , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[32]  Marco Conti,et al.  Mobile Ad-hoc Networking - Minitrack Introduction , 2001, HICSS.

[33]  J. J. Garcia-Luna-Aceves,et al.  Channel access scheduling in Ad Hoc networks with unidirectional links , 2001, DIALM '01.

[34]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[36]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[37]  Roger Wattenhofer,et al.  XTC: a practical topology control algorithm for ad-hoc networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[38]  Srdjan Capkun,et al.  GPS-free Positioning in Mobile Ad Hoc Networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[39]  Imrich Chlamtac,et al.  A new approach to the design and analysis of peer‐to‐peer mobile networks , 1999, Wirel. Networks.

[40]  J. Steele.  Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .

[41]  Baochun Li,et al.  MobileGrid: capacity-aware topology control in mobile ad hoc networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[42]  Afonso Ferreira,et al.  The Minimum Range Assignment Problem on Linear Radio Networks , 2000, ESA.

[43]  Mathew D. Penrose,et al.  Extremes for the minimal spanning tree on normally distributed points , 1998, Advances in Applied Probability.

[44]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[45]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[46]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[47]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[48]  Wen-Zhan Song,et al.  The spanning ratio of β-Skeletons , 2003 .

[49]  J. Michael Steele,et al.  Asymptotics for Euclidean minimal spanning trees on random points , 1992 .

[50]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[51]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[52]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[53]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[54]  Calton Pu,et al.  Research challenges in environmental observation and forecasting systems , 2000, MobiCom '00.

[55]  Xiang-Yang Li,et al.  Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with Bernoulli nodes , 2006, IEEE Transactions on Communications.

[56]  Mahesh K. Marina,et al.  Routing performance in the presence of unidirectional links in multihop wireless networks , 2002, MobiHoc '02.

[57]  Sandeep K. S. Gupta,et al.  Research challenges in wireless networks of biomedical sensors , 2001, MobiCom '01.

[58]  King Lun Yiu.  Ad-hoc positioning system , 2008 .

[59]  Paolo Santi.  The critical transmitting range for connectivity in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[60]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[61]  Xiang-Yang Li,et al.  Constructing minimum energy mobile wireless networks , 2001, MOCO.

[62]  Paolo Santi,et al.  The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[63]  Lars Holst,et al.  On multiple covering of a circle with random arcs , 1980, Journal of Applied Probability.

[64]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[65]  Randy H. Katz,et al.  Emerging challenges: Mobile networking for “Smart Dust” , 2000, Journal of Communications and Networks.

[66]  Ion I. Mandoiu,et al.  Symmetric Connectivity with Minimum Power Consumption in Radio Networks , 2002, IFIP TCS.

[67]  Yanghee Choi,et al.  On supporting link asymmetry in mobile ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[68]  Chien-Chung Shen,et al.  Topology control for ad hoc networks with directional antennas , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[69]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[70]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[71]  Leonidas Georgiadis,et al.  Energy-Aware Broadcast Trees in Wireless Networks , 2004, Mob. Networks Appl..

[72]  P. R. Kumar,et al.  Power Control in Ad-Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol , 2002 .

[73]  YU WANG,et al.  Distributed Spanners with Bounded Degree for Wireless Ad Hoc Networks , 2003, Int. J. Found. Comput. Sci..

[74]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[75]  Paolo Santi,et al.  A probabilistic analysis for the range assignment problem in ad hoc networks , 2001, MobiHoc '01.

[76]  Paolo Santi.  Topology control in wireless ad hoc and sensor networks , 2005 .

[77]  Andrea E. F. Clementi,et al.  The Power Range Assignment Problem in Radio Networks on the Plane , 2000, STACS.

[78]  András Faragó.  Scalable analysis and design of ad hoc networks via random graph theory , 2002, DIALM '02.

[79]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[80]  Vanessa Ann Davies,et al.  EVALUATING MOBILITY MODELS WITHIN AN AD HOC NETWORK , 2000 .

[81]  Joseph E. Yukich.  Asymptotics for weighted minimal spanning trees on random points , 2000 .

[82]  Christian Bettstetter,et al.  On the connectivity of wireless multihop networks with homogeneous and inhomogeneous range assignment , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[83]  Paolo Santi,et al.  A Statistical Analysis of the Long-Run Node Spatial Distribution in Mobile Ad Hoc Networks , 2002, MSWiM '02.

[84]  Margaret Martonosi,et al.  Hardware design experiences in ZebraNet , 2004, SenSys '04.

[85]  Peng-Jun Wan,et al.  Range Assignment for High Connectivity in Wireless Ad Hoc Networks , 2003, ADHOC-NOW.

[86]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[87]  Isaac Balberg.  Continuum Percolation , 2009, Encyclopedia of Complexity and Systems Science.

[88]  Ravi Prakash.  A Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links , 2001, Wirel. Networks.

[89]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[90]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[91]  John Anderson,et al.  An analysis of a large scale habitat monitoring application , 2004, SenSys '04.

[92]  Zygmunt J. Haas,et al.  Using multi-hop acknowledgements to discover and reliably communicate over unidirectional links in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[93]  Christian Bettstetter,et al.  Smooth is better than sharp: a random mobility model for simulation of wireless networks , 2001, MSWIM '01.

[94]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[95]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[96]  Xiang-Yang Li,et al.  Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[97]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[98]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

[99]  Louise E. Moser,et al.  An analysis of the optimum node density for ad hoc mobile networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[100]  Imrich Chlamtac,et al.  A mobility-transparent deterministic broadcast mechanism for ad hoc networks , 1999, TNET.

[101]  Paolo Santi,et al.  An evaluation of connectivity in mobile wireless ad hoc networks , 2002, Proceedings International Conference on Dependable Systems and Networks.

[102]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[103]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[104]  M. Foucault,et al.  The Order of Things , 2017 .

[105]  Maria J. Serna,et al.  Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs , 2000, Combinatorics, Probability and Computing.

[106]  Xiang-Yang Li,et al.  Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[107]  Christian Bettstetter,et al.  On border effects in modeling and simulation of wireless ad hoc networks , 2001 .

[108]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.

[109]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2002, MobiHoc '02.

[110]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.