Mobile Wireless Sensor Network Connectivity Repair with K-Redundancy

Connectivity is an important requirement for wireless sensor networks especially in real-time monitoring and data transfer applications. However, node movements and failures change the topology of the initial deployed network, which can result in partitioning of the communication graph. In this paper, we present a method for maintaining and repairing the communication network of a dynamic mobile wireless sensor network. We assume that we cannot control the motion of wireless sensor nodes, but there are robots whose motion can be controlled by the wireless sensor nodes to maintain and repair the connectivity of the network. At the heart of our method lies a novel graph property, k-redundancy, which is a measure of the importance of a node to the connectivity of a network.We first show that this property can be used to estimate repair time of a dynamic network. Then, we present a dynamic repair algorithm that minimizes expected repair time. Finally, we show the effectiveness of our method with extensive simulations and its feasibility with experiments on real robots and motes.

[1]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[2]  I. Norman Katz,et al.  Local convergence in Fermat's problem , 1974, Math. Program..

[3]  Chandrajit L. Bajaj,et al.  The algebraic degree of geometric optimization problems , 1988, Discret. Comput. Geom..

[4]  Wolfram Burgard,et al.  Emergent Task Allocation for Mobile Robots , 2008 .

[5]  M. Brandeau,et al.  SEQUENTIAL LOCATION AND ALLOCATION: WORST CASE PERFORMANCE AND STATISTICAL ESTIMATION. , 1993 .

[6]  R. Murray,et al.  Robust connectivity of networked vehicles , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[7]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[8]  Joel M. Esposito,et al.  Maintaining wireless connectivity constraints for swarms in the presence of obstacles , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[9]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[10]  Deborah Estrin,et al.  Controllably mobile infrastructure for low energy embedded networks , 2006, IEEE Transactions on Mobile Computing.

[11]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

[12]  R.M. Murray,et al.  Motion planning with wireless network constraints , 2005, Proceedings of the 2005, American Control Conference, 2005..

[13]  Nuzhet Atay,et al.  Emergent Task Allocation for Mobile Robots , 2007, Robotics: Science and Systems.

[14]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[15]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[16]  Jing Zhao,et al.  VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[18]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[19]  Peter I. Corke,et al.  Data muling over underwater wireless sensor networks using an autonomous underwater vehicle , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[20]  N. Li,et al.  Improving connectivity of wireless ad hoc networks , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[21]  J. Brimberg.  FURTHER NOTES ON CONVERGENCE OF THE WEISZFELD ALGORITHM , 2003 .

[22]  Mario Gerla,et al.  Ad-hoc Storage Overlay System (ASOS): A Delay-Tolerant Approach in MANETs , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[23]  Arie Tamir,et al.  Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem , 1989, Math. Program..

[24]  Gaurav S. Sukhatme,et al.  Adaptive teams of autonomous aerial and ground robots for situational awareness , 2007, J. Field Robotics.

[25]  Deborah Estrin,et al.  ASCENT : Adaptive Self-Configuring sEnsor Networks Topologies . , 2002 .

[26]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[27]  Kostas E. Bekris,et al.  A decentralized planner that guarantees the safety of communicating vehicles with complex dynamics that replan online , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[28]  Harold W. Kuhn,et al.  A note on Fermat's problem , 1973, Math. Program..

[29]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[30]  J. Jewkes,et al.  Theory of Location of Industries. , 1933 .

[31]  M. Ani Hsieh,et al.  Adaptive teams of autonomous aerial and ground robots for situational awareness: Field Reports , 2007 .

[32]  Sridhar Iyer,et al.  Characterization of a Connectivity Measure for Sparse Wireless Multi-hop Networks , 2006, 26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06).

[33]  Maja J. Mataric,et al.  Principled Communication for Dynamic Multi-robot Task Allocation , 2000, ISER.

[34]  S. Sitharama Iyengar,et al.  Connectivity-through-time protocols for dynamic wireless networks to support mobile robot teams , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[35]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[36]  Kamesh Munagala,et al.  Local search heuristic for k-median and facility location problems , 2001, STOC '01.

[37]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[38]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[39]  Jack Brimberg,et al.  The Fermat—Weber location problem revisited , 1995, Math. Program..

[40]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[41]  B. Harris,et al.  Algorithmic and technical improvements: Optimal solutions to the (Generalized) Multi-Weber Problem , 1992 .