Local solutions for global problems in wireless networks

In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is one in which any node of a network only has information on nodes at distance at most k from itself, for a constant k. For example, given a unit distance wireless network N, we want to obtain a planar subnetwork of N by means of an algorithm in which all nodes can communicate only with their neighbors in N, perform some operations, and then halt. We review algorithms for obtaining planar subnetworks, approximations to minimum weight spanning trees, Delaunay triangulations, and relative neighbor graphs. Given a unit distance wireless network N, we present new local algorithms to solve the following problems:1.Calculate small dominating sets (not necessarily connected) of N. 2.Extract a bounded degree planar subgraph H of N and obtain a proper edge coloring of H with at most 12 colors. The second of these algorithms can be used in the channel assignment problem.

[1]  Martin Mauve,et al.  Position-based routing in ad hoc wireless networks , 2003 .

[2]  L. Devroye.  THE EXPECTED SIZE OF SOME GRAPHS IN COMPUTATIONAL GEOMETRY , 1988 .

[3]  Lata Narayanan,et al.  A generalization of the FACE ROUTING algorithm to a class of non-planar networks , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[4]  Yu-Chee Tseng,et al.  Fully power-aware and location-aware protocols for wireless multi-hop ad hoc networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

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

[6]  Murat Yuksel,et al.  An implementation framework for trajectory-based routing in ad-hoc networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[7]  Ivan Stojmenovic,et al.  Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy , 2004 .

[8]  Xiang-Yang Li,et al.  Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[9]  Jorge Urrutia,et al.  Distributed Dynamic Storage in Wireless Networks , 2005, Int. J. Distributed Sens. Networks.

[10]  Anish Arora,et al.  Reliable MAC layer multicast in IEEE 802.11 wireless networks , 2002, Proceedings International Conference on Parallel Processing.

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

[12]  Roger Wattenhofer,et al.  Theoretical aspects of connectivity-based multi-hop positioning , 2005, Theor. Comput. Sci..

[13]  Anish Arora,et al.  Reliable MAC Layer Multicast in IEEE 802.11 Wireless Networks , 2002, ICPP.

[14]  Ivan Stojmenovic,et al.  Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks , 2003, J. Parallel Distributed Comput..

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

[16]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[17]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

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

[19]  Ahmed Helmy,et al.  Efficient geocasting with perfect delivery in wireless networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[20]  Xiang-Yang Li,et al.  Localized routing for wireless ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

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

[22]  Michael Segal,et al.  A simple improved distributed algorithm for minimum CDS in unit disk graphs , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[23]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[24]  Edoardo S. Biagioni,et al.  An approach to data visualization and interpretation for sensor networks , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[25]  Michael Segal,et al.  A simple improved distributed algorithm for minimum CDS in unit disk graphs , 2005, WiMob.

[26]  Jean-Yves Le Boudec,et al.  Self Organized Terminode Routing , 2002, Cluster Computing.

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

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

[29]  W..  Relative Neighborhood Graphs and Their Relatives , 2004 .

[30]  Xiaoyang Guan,et al.  Face traversal routing on edge dynamic graphs , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[31]  Martin Mauve,et al.  A comparison of routing strategies for vehicular ad-hoc networks , 2002, MobiCom 2002.

[32]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[33]  Himabindu Pucha,et al.  Performance comparison of scalable location services for geographic ad hoc routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[35]  Samir Ranjan Das,et al.  Dead reckoning in mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[36]  James Newsome,et al.  GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information , 2003, SenSys '03.

[37]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[38]  R. Govindan,et al.  On the effect of localization errors on geographic face routing in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[39]  Ahmed Helmy,et al.  Modeling and analyzing the impact of location inconsistencies on geographic routing in wireless networks , 2004, MOCO.

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

[41]  Ivan Stojmenovic,et al.  Position-based routing in ad hoc networks , 2002, IEEE Commun. Mag..

[42]  Jörg Widmer,et al.  Beaconless Position-Based Routing for Mobile Ad-Hoc Networks , 2003 .

[43]  Jean-Yves Le Boudec,et al.  A Scalable Routing Scheme for Self-Organized Terminode Network , 2002 .

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

[45]  Ahmed Helmy,et al.  On the effect of localization errors on geographic face routing in sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[46]  Pat Morin,et al.  Improving Distance Based Geographic Location Techniques in Sensor Networks , 2004, ADHOC-NOW.

[47]  Jorge Urrutia,et al.  Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks , 2004, SIROCCO.

[48]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[49]  Roger Wattenhofer,et al.  Unit disk graph approximation , 2004, DIALM-POMC '04.

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

[51]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[52]  H. T. Mouftah,et al.  Characterizing the impact of routing holes on geographic routing , 2005, 2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05).

[53]  Kenneth J. Supowit,et al.  The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.

[54]  Jaroslav Opatrny,et al.  Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks , 2005, CCCG.

[55]  D. Matula,et al.  Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .

[56]  Guy Pujolle,et al.  Geographical Routing for Heterogeneous Wireless Systems , 2002 .

[57]  OPHIR FRIEDER,et al.  Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks , 2003, Int. J. Found. Comput. Sci..

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

[59]  Ivan Stojmenovic,et al.  Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks , 2005, Ad Hoc Networks.

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

[61]  Jie Wu,et al.  New metrics for dominating set based energy efficient activity scheduling in ad hoc networks , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[62]  Xiang-Yang Li,et al.  Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks , 2003, DIALM-POMC '03.

[63]  Torsten Braun.  Optimizing Neighbor Table Accuracy of Position-Based Routing Algorithms , 2005, INFOCOM 2005.

[64]  Leonidas J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2005 .

[65]  N. Zaguia,et al.  Bluetooth scatternet formation in ad hoc wireless networks , 2004 .

[66]  Fabian Kuhn,et al.  Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.

[67]  Ivan Stojmenovic,et al.  Localized network layer protocols in wireless sensor networks based on optimizing cost over progress ratio , 2006, IEEE Network.

[68]  Alaa Eddien Abdallah,et al.  Randomized AB-Face-AB Routing Algorithms in Mobile Ad Hoc Networks , 2005, ADHOC-NOW.