Real-time data gathering in sensor networks

Wireless sensor networks represent a new generation of real-time traffic communications and high data rate sensor applications, such as structural health monitoring and control. We study some problems related to data gathering in sensor networks when the sensors collect the sensed data about their environment and this information should be delivered to a collecting central Base Station. We prove that scheduling messages through the network to minimize the maximal delivery time with restrictions on the total idle time allowed is NP-hard. We also refer to a special case of linear network topology for which we present two polynomial time optimization algorithms: One is for minimizing the maximal lateness and maximal delay, while the other is for minimizing the number of tardy messages.

[1]  Stéphane Pérennes,et al.  Hardness and approximation of gathering in static radio networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[2]  Luisa Gargano.  Time Optimal Gathering in Sensor Networks , 2007, SIROCCO.

[3]  Michael Segal,et al.  Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies , 2009, Int. J. Distributed Sens. Networks.

[4]  Chenyang Lu,et al.  RAP: a real-time communication architecture for large-scale wireless sensor networks , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Robert E. Hiromoto,et al.  On-demand routing using directional antennas in mobile ad hoc networks , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[7]  Luisa Gargano,et al.  Optimally Fast Data Gathering in Sensor Networks , 2006, MFCS.

[8]  Michele Garetto,et al.  Modeling the performance of wireless sensor networks , 2004, IEEE INFOCOM 2004.

[9]  Massimo Franceschetti,et al.  Lower bounds on data collection time in sensory networks , 2004, IEEE Journal on Selected Areas in Communications.

[10]  Nitin H. Vaidya,et al.  Medium access control protocols using directional antennas in ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Michael Segal,et al.  Improved Lower Bounds for Data-Gathering Time in Sensor Networks , 2007, International Conference on Networking and Services (ICNS '07).

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

[13]  Anura P. Jayasumana,et al.  Impact of Network Dynamics on Tardiness of Data in Sensor Networks , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[14]  Costas P. Pappis,et al.  Single Machine Scheduling with Flow Allowances , 1996 .

[15]  Prashant J. Shenoy,et al.  Scheduling messages with deadlines in multi-hop real-time sensor networks , 2005, 11th IEEE Real Time and Embedded Technology and Applications Symposium.

[16]  Paul C. Richardson,et al.  FT-LAN, a fault tolerant local area network architecture for mobile mission critical systems , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[17]  H. Balakrishnan,et al.  Mitigating congestion in wireless sensor networks , 2004, SenSys '04.

[18]  Michael Segal,et al.  Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies , 2007, International Conference on Networking and Services (ICNS '07).

[19]  Stéphane Pérennes,et al.  Hardness and approximation of Gathering in static radio networks , 2006, PerCom Workshops.

[20]  Ramesh Govindan,et al.  Packet Delivery Performance in Dense Wireless Sensor Networks , 2003 .