Efficient localized topology control for wireless ad hoc networks

While many fundamental ideas existed about twenty to thirty years ago, recent years we see tremendous research activity in wireless ad hoc networks due to its applications in various situations such as battlefield, emergency relief, and so on. Mobile wireless networking enjoys a great advantage over the wired networking counterpart because it can be formed in a spontaneous way for various applications. There are no wired infrastructures or cellular networks in wireless ad hoc network. Each mobile node has an adjustable transmission range. The nodes within each other's transmission ranges can communicate directly. Otherwise, two nodes have to communicate through multi-hop ad hoc wireless links by using intermediate nodes to relay the message. In this thesis, I focus on discussing one of the central challenges in the design of wireless ad hoc networks: efficient localized topology control. I study how to construct a sparse spanner efficiently as the network topology for a set of static or quasi-static wireless nodes such that, for any given pair of nodes, there is a power-efficient path. I first review previous results for topology control when the network is modeled by unit disk graph. Then, I propose several new localized structures: some bounded degree structures (Chapter 3), one planar spanner (Chapter 4), and one planar spanner with bounded degree (Chapter 5). All of these new topologies can be constructed efficiently and dynamically in wireless ad hoc networks. Moreover, they have some nice properties in improving the performance of the networks. Finally, I also show some simulation results and discuss the possible future works as a conclusion of this thesis.

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

[2]  Xiang-Yang Li,et al.  Power efficient and sparse spanner for wireless ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[3]  Jie Wu,et al.  Domination and its applications in ad hoc wireless networks with unidirectional links , 2000, Proceedings 2000 International Conference on Parallel Processing.

[4]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

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

[6]  Tamás Lukovszki,et al.  New Results of Fault Tolerant Geometric Spanners , 1999, WADS.

[7]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

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

[9]  Santosh S. Vempala,et al.  Approximation algorithms for minimum-cost k-vertex connected subgraphs , 2002, STOC '02.

[10]  Wen-Tsuen Chen,et al.  The strongly connecting problem on multihop packet radio networks , 1989, IEEE Trans. Commun..

[11]  S. Ramanathan,et al.  A survey of routing techniques for mobile communications networks , 1996, Mob. Networks Appl..

[12]  Ivan Stojmenovic,et al.  Bluetooth scatternet formation for single-hop ad hoc networks based on virtual positions , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[13]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

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

[15]  Ravi Prakash,et al.  Load-balancing clusters in wireless ad hoc networks , 2000, Proceedings 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology.

[16]  Xiang-Yang Li,et al.  Localized low-weight graph and its applications in wireless ad hoc networks , 2004, IEEE INFOCOM 2004.

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

[18]  Madhav V. Marathe,et al.  Topology Control Problems under Symmetric and Asymmetric Power Thresholds , 2003, ADHOC-NOW.

[19]  Ivan Stojmenovic,et al.  Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation , 2004, IEEE Transactions on Parallel and Distributed Systems.

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

[21]  Xiang-Yang Li,et al.  Efficient Construction of Low Weight Bounded Degree Planar Spanner , 2003, COCOON.

[22]  Vahab S. Mirrokni,et al.  Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks , 2006, Wirel. Networks.

[23]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[24]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[25]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[26]  Joachim Gudmundsson,et al.  Fast Greedy Algorithms for Constructing Sparse Geometric Spanners , 2002, SIAM J. Comput..

[27]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[28]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[29]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[30]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[31]  Imrich Chlamtac,et al.  Bluetrees-scatternet formation to enable Bluetooth-based ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[32]  Limin Hu,et al.  A novel topology control for multihop packet radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[33]  Gruia Calinescu.  Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks , 2003, ADHOC-NOW.

[34]  Afonso Ferreira,et al.  The Minimum Range Assignment Problem on Linear Radio Networks , 2002, Algorithmica.

[35]  Carl Gutwin,et al.  Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..

[36]  Xin Li,et al.  Localized delaunay triangulation with application in wireless ad hoc networks , 2002 .

[37]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 2001, Wirel. Networks.

[38]  Christian Scheideler,et al.  On local algorithms for topology control and routing in ad hoc networks , 2003, SPAA '03.

[39]  Xiang-Yang Li,et al.  Approximate MST for UDG Locally , 2003, COCOON.

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

[41]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

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

[43]  Yu Wang,et al.  Minimum power assignment in wireless ad hoc networks with spanner property , 2004 .

[44]  Wen-Zhan Song,et al.  The spanning ratios of -Skeletons , 2003 .

[45]  Xiang-Yang Li,et al.  Distributed spanner with bounded degree for wireless ad hoc networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[46]  David A. Maltz,et al.  The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[47]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[48]  Joachim Gudmundsson,et al.  Ordered theta graphs , 2004, CCCG.

[49]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[50]  Maw-Sheng Chern,et al.  An efficient distributed algorithm for minimal connected dominating set problem , 1991, [1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications.

[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 A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[53]  Xiang Li,et al.  Lo-calized minimum spanning tree and its applications in wireless ad hoc networks , 2004, INFOCOM 2004.

[54]  Young Ko,et al.  Using Location Information to Improve Routing in Ad Hoc Networks , 1997 .

[55]  J. Mark Keil,et al.  Approximating the Complete Euclidean Graph , 1988, Scandinavian Workshop on Algorithm Theory.

[56]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[57]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[59]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[60]  Prosenjit Bose,et al.  Online Routing in Triangulations , 2004, SIAM J. Comput..

[61]  Peng-Jun Wan,et al.  New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

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

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

[64]  David G. Kirkpatrick,et al.  On the Spanning Ratio of Gabriel Graphs and beta-skeletons , 2002, LATIN.

[65]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

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

[67]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

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

[69]  Pietro Manzoni,et al.  Determination of Critical Transmission Range in Ad-Hoc Networks , 1999 .

[70]  Tamás Lukovszki,et al.  Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper) , 2002, Euro-Par.

[71]  Michiel H. M. Smid,et al.  Euclidean spanners: short, thin, and lanky , 1995, STOC '95.

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

[73]  Godfried T. Toussaint,et al.  Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.

[74]  Eytan Modiano,et al.  Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.

[75]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[76]  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).

[77]  P. Bose,et al.  Online routing in geometric graphs , 2001 .

[78]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[79]  Jerzy W. Jaromczyk,et al.  Constructing the relative neighborhood graph in 3-dimensional Euclidean space , 1991, Discret. Appl. Math..

[80]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[81]  Mauro Leoncini,et al.  On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks , 2002, IFIP TCS.

[82]  Limin Hu,et al.  Topology control for multihop packet radio networks , 1993, IEEE Trans. Commun..

[83]  Prosenjit Bose,et al.  Online Routing in Convex Subdivisions , 2000, ISAAC.

[84]  Vahab S. Mirrokni,et al.  Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[85]  Christian Schindelhauer,et al.  Performance of distributed algorithms for topology control in wireless networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

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

[87]  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).

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

[89]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[90]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

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

[92]  Leonidas J. Guibas,et al.  Discrete mobile centers , 2001, SCG '01.

[93]  Yu Wang,et al.  Wireless Sensor Networks and Computational Geometry , 2004, Handbook of Sensor Networks.

[94]  Xiang-Yang Li,et al.  Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks , 2002, DIALM '02.

[95]  Xiang-Yang Li,et al.  The spanning ratios of beta-Skeleton , 2003, CCCG.

[96]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1990, Discret. Comput. Geom..

[97]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[98]  Joachim Gudmundsson,et al.  Constructing Plane Spanners of Bounded Degree and Low Weight , 2005, Algorithmica.