Local Algorithms for Topology Control in Ad-Hoc Networks

Ad hoc wireless networks consist of a collection of hosts of limited power communicating with each other over a wireless medium without any pre-designed or fixed infrastructure. Topology control refers to the problem of maintaining a stable and connected infrastructure among the hosts of an ad hoc network. Effective use of topology control can reduce energy consumption and increase the capacity of the network, due to reduced contention to access the wireless channels. This is accomplished by having nodes in a wireless multi-hop network define collaboratively the network topology by forming the proper neighbor relation under certain criteria. Despite the fact that communication tasks must be resolved only by consulting nearby hosts, algorithmic solutions must solve global computational tasks, involving, e.g., the computation of dominating and independent sets, vertex and edge colorings, and spanners. Practical considerations inspire the additional requirement for algorithms to be local in the sense that each node of the network should make decisions based only on the information obtained from nodes located a constant (independent of the size of the network) number of steps away from it. Local topology control is vital for heterogeneous network environments affected by mobile hosts, variable neighbor density, AbstrAct

[1]  Maia Fraser.  Local Routing on Tori , 2008, Ad Hoc Sens. Wirel. Networks.

[2]  Evangelos Kranakis,et al.  Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs , 2009, WAOA.

[3]  Evangelos Kranakis,et al.  Constant memory routing in quasi-planar and quasi-polyhedral graphs , 2008, Discret. Appl. Math..

[4]  Jorge Urrutia,et al.  Local solutions for global problems in wireless networks , 2007, J. Discrete Algorithms.

[5]  Jorge Urrutia,et al.  Route discovery with constant memory in oriented planar geometric networks , 2006 .

[6]  David G. Kirkpatrick,et al.  On routing with guaranteed delivery in three-dimensional ad hoc wireless networks , 2010, Wirel. Networks.

[7]  Jorge Urrutia,et al.  Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs , 2011, TAMC.

[8]  Jorge Urrutia,et al.  Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes , 2008, LATIN.

[9]  Jorge Urrutia,et al.  Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges , 2006, LATIN.

[10]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[11]  Moni Naor,et al.  What Can be Computed Locally? , 1995, SIAM J. Comput..

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

[13]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[14]  Evangelos Kranakis,et al.  Online routing in quasi-planar and quasi-polyhedral graphs , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[15]  Jorge Urrutia,et al.  Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs , 2007, SIROCCO.

[16]  I. Chochliouros,et al.  An Introduction to Optical Access Networks: Technological Overview and Regulatory Issues for Large-Scale Deployment , 2010 .

[17]  Jorge Urrutia,et al.  Route Discovery with Constant Memory in Oriented Planar Geometric Networks , 2004, ALGOSENSORS.

[18]  Jorge Urrutia,et al.  Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph , 2005, OPODIS.

[19]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[20]  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.

[21]  Lali Barrière,et al.  Robust position-based routing in wireless ad hoc networks with irregular transmission ranges , 2003, Wirel. Commun. Mob. Comput..

[22]  Jorge Urrutia,et al.  Local 7-coloring for planar subgraphs of unit disk graphs , 2011, Theor. Comput. Sci..