Localized topology control for unicast and broadcast in wireless ad hoc networks

We propose a novel localized topology-control algorithm for each wireless node to locally select communication neighbors and adjust its transmission power accordingly such that all nodes together self-form a topology that is energy efficient simultaneously for both unicast and broadcast communications. We theoretically prove that the proposed topology is planar, which meets the requirement of certain localized routing methods to guarantee packet delivery; it is power-efficient for unicast - the energy needed to connect any pair of nodes is within a small constant factor of the minimum; it is also asymptotically optimum for broadcast - the energy consumption for broadcasting data on top of it is asymptotically the best among all structures constructed using only local information; it has a constant bounded logical degree, which will potentially save the cost of updating routing tables if used. We further prove that the expected average physical degree of all nodes is a small constant. To the best of our knowledge, this is the first localized topology-control strategy for all nodes to maintain a structure with all these desirable properties. Previously, only a centralized algorithm was reported. Moreover, by assuming that the node ID and its position can be represented in O(log n) bits for a wireless network of n nodes, the total number of messages by our methods is in the range of theoretical results are corroborated in the simulations.

[1]  Roger Wattenhofer,et al.  Does topology control reduce interference? , 2004, MobiHoc '04.

[2]  Carl Gutwin,et al.  The Delauney Triangulation Closely Approximates the Complete Euclidean Graph , 1989, WADS.

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

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

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

[6]  Ivan Stojmenovic,et al.  Localized minimum-energy broadcasting in ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[8]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

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

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

[11]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[12]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

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

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

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

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

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

[18]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

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

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

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

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

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

[24]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

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

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

[27]  M. Kaufmann What Can Be Computed Locally ? , 2003 .

[28]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..

[29]  John A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

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

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

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

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

[34]  Jan M. Rabaey,et al.  Energy aware routing for low energy ad hoc sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

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

[36]  David Evans,et al.  Localization for mobile sensor networks , 2004, MobiCom '04.

[37]  Xiuzhen Cheng,et al.  TPS: a time-based positioning scheme for outdoor wireless sensor networks , 2004, IEEE INFOCOM 2004.

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

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

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

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

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

[43]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[44]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

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

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