Approximate MST for UDG Locally

We consider a wireless network composed of a set of n wireless nodes distributed in a two dimensional plane. The signal sent by a node can be received by all nodes within its transmission region, which is a unit disk centered at this node. The nodes together define a unit disk graph (UDG) with edge uv iff ||uv|| ≤ 1. We present the first localized method to construct a bounded degree planar connected structure for UDG whose total edge length is within a constant factor of the minimum spanning tree. The total communication cost of our method is O(n), and every node only uses its two-hop information to construct such structure. We show that some two-hop information is necessary to construct any low-weighted structure. We also study the application of this structure in efficient broadcasting in wireless ad hoc networks.We prove that this structure uses only O(1/n) of the total energy of the previously best-known light weighted structure RNG.

[1]  Xiang-Yang Li,et al.  Efficient construction of low weighted bounded degree planar spanner , 2004, Int. J. Comput. Geom. Appl..

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

[3]  Michalis Faloutsos,et al.  Optimal distributed algorithm for minimum spanning trees revisited , 1995, PODC '95.

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

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

[6]  Michalis Faloutsos.  Creating Optimal Distributed Algorithms for Minimum Spanning Trees , 1995 .

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

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

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

[10]  Giri Narasimhan,et al.  A new way to weigh Malnourished Euclidean graphs , 1995, SODA '95.

[11]  RNG and internal node based broadcasting algorithms for wireless one-to-one networks , 2001, MOCO.

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

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

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

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

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

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

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

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