Sparse power efficient topology for wireless networks

We consider how to construct power efficient wireless ad hoc networks. We propose two different methods combining several well-known proximity graphs including the Gabriel graph and the Yao graph, which can be constructed locally and efficiently. Firstly, we combine the Gabriel structure and the Yao structure. The constructed topology has at most O(n) edges and each node has a bounded out-degree. Secondly, we use the Yao structure and then use the reverse of the Yao structure. The constructed topology is guaranteed to be connected if the original unit disk graph is connected. Every node has a bounded degree. The experimental results show that it has a bounded unicasting and broadcasting power stretch factor in practice.

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

[2]  Paramvir Bahl,et al.  Distributed Topology Control for Wireless Multihop Ad-hoc Networks , 2001, INFOCOM.

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

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

[5]  Xiangyang Li,et al.  Constructing minimum energy mobile wireless networks , 2001, MobiHoc '01.

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

[7]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[8]  Ivan Stojmenovic,et al.  Power and cost aware localized routing with guaranteed delivery in wireless networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[9]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[11]  M. Lynn.  Hawaii International Conference on System Sciences , 1996 .

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

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

[14]  Ivan Stojmenovic,et al.  Power-Aware Localized Routing in Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[15]  Xiang-Yang Li,et al.  Constructing minimum energy mobile wireless networks , 2001, MOCO.

[16]  Jyrki Katajaien,et al.  The region approach for computing relative neighborhood graphs in the L p metric , 1988 .

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

[18]  L. Devroye,et al.  ON THE SPANNING RATIO OF GABRIEL GRAPHS AND β-SKELETONS , 2002 .

[19]  Ivan Stojmenovic,et al.  Power-aware localized routing in wireless networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

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

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

[22]  Jie Wu,et al.  Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks , 2004, Cluster Computing.

[23]  Prosenjit Bose,et al.  Routing with Guaranteed Deliveryin ad ho Wireless Networks , 1999 .

[24]  Ivan Stojmenovic,et al.  Voronoi diagram and convex hull based geocasting and routing in wireless networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.