Opportunity-Based Topology Control in Wireless Sensor Networks

Topology control is an effective method to improve the energy efficiency of wireless sensor networks (WSNs). Traditional approaches are based on the assumption that a pair of nodes is either "connected" or "disconnected". These approaches are called connectivity-based topology control. In real environments however, there are many intermittently connected wireless links called lossy links. Taking a succeeded lossy link as an advantage, we are able to construct more energy-efficient topologies. Towards this end, we propose a novel opportunity-based topology control. We show that opportunity-based topology control is a problem of NPhard. To address this problem in a practical way, we design a fully distributed algorithm called CONREAP based on reliability theory. We prove that CONREAP has a guaranteed performance. The worst running time is O(jEj) where E is the link set of the original topology, and the space requirement for individual nodes is O(d) where d is the node degree. To evaluate the performance of CONREAP, we design and implement a prototype system consisting of 50 BerkeleyMica2 motes. We also conducted comprehensive simulations. Experimental results show that compared with the connectivity-based topology control algorithms, CONREAP can improve the energy efficiency of a network up to 6 times.

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

[2]  Ramesh Govindan,et al.  Understanding packet delivery performance in dense wireless sensor networks , 2003, SenSys '03.

[3]  Ram Ramanathan,et al.  Challenges: a radically new architecture for next generation mobile ad hoc networks , 2005, MobiCom '05.

[4]  Avinash Agrawal,et al.  A Survey of Network Reliability and Domination Theory , 1984, Oper. Res..

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

[6]  G. Galvin,et al.  Global connectivity from local geometric constraints for sensor networks with various wireless footprints , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[7]  Deborah Estrin,et al.  Temporal Properties of Low Power Wireless Links: Modeling and Implications on Multi-Hop Routing , 2005 .

[8]  David E. Culler,et al.  Telos: enabling ultra-low power wireless research , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[9]  Paramvir Bahl,et al.  A cone-based distributed topology-control algorithm for wireless multi-hop networks , 2005, IEEE/ACM Transactions on Networking.

[10]  Andrea E.F. Clementiy,et al.  A Worst-case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks , 2007 .

[11]  Santosh S. Vempala,et al.  Approximation algorithms for minimum-cost k-vertex connected subgraphs , 2002, STOC '02.

[12]  Jian Tang,et al.  Interference-aware topology control and QoS routing in multi-channel wireless mesh networks , 2005, MobiHoc '05.

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

[14]  Robert Tappan Morris,et al.  Opportunistic routing in multi-hop wireless networks , 2004, Comput. Commun. Rev..

[15]  Jie Wu,et al.  Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication , 2006, IEEE Transactions on Parallel and Distributed Systems.

[16]  Kwan-Wu Chin,et al.  Implementation experience with MANET routing protocols , 2002, CCRV.

[17]  Yunhao Liu,et al.  Iso-Map: Energy-Efficient Contour Mapping in Wireless Sensor Networks , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[18]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2005, IEEE Trans. Wirel. Commun..

[19]  Yunhao Liu,et al.  Rendered Path: Range-Free Localization in Anisotropic Sensor Networks With Holes , 2007, IEEE/ACM Transactions on Networking.

[20]  Deborah Estrin,et al.  Statistical model of lossy links in wireless sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[21]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[22]  Bhaskar Krishnamachari,et al.  Experimental study of concurrent transmission in wireless sensor networks , 2006, SenSys '06.

[23]  Paolo Santi Topology control in wireless ad hoc and sensor networks , 2005 .

[24]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[25]  Mohamed Hefeeda,et al.  Network Connectivity under Probabilistic Communication Models in Wireless Sensor Networks , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[26]  Roger Wattenhofer,et al.  XTC: a practical topology control algorithm for ad-hoc networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[27]  Nicole Immorlica,et al.  Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks , 2003, IEEE/ACM Transactions on Networking.

[28]  Marco Zuniga,et al.  Analyzing the transitional region in low power wireless links , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[29]  Gang Zhou,et al.  Impact of radio irregularity on wireless sensor networks , 2004, MobiSys '04.

[30]  David E. Culler,et al.  The dynamic behavior of a data dissemination protocol for network programming at scale , 2004, SenSys '04.

[31]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM '07.