On 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. In this work we study some problems of data gathering in sensor networks. The information that the sensor collect about their environment must be delivered in timely fashion to collecting central processing system. We prove in this research that finding the optimal schedule in order to minimize the maximal delivery time with restrictions on the total idle time allowed in a general network topology with a single designated destination base station is NP-hard. We also refer to a special case of linear network topology for which we present several optimization algorithms: First we present an algorithm to minimize the number of tardy messages. We then present an algorithm to minimize the maximal lateness. Finally, we present an algorithm to minimize the maximal completion time. All of the scheduling optimization algorithms.

[1]  Sang Hyuk Son,et al.  Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms* , 2001, Real-Time Systems.

[2]  Gruia-Catalin Roman,et al.  Real-Time Query Scheduling for Wireless Sensor Networks , 2007, RTSS 2007.

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

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

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

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

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

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

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

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

[11]  Gregory J. Pottie,et al.  Development platform for self-organizing wireless sensor networks , 1999, Defense, Security, and Sensing.

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

[13]  Stéphane Pérennes,et al.  Gathering in specific radio networks , 2006 .

[14]  Robert I. Davis,et al.  Robust Priority Assignment for Fixed Priority Real-Time Systems , 2007, RTSS 2007.

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

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

[17]  Jean-Claude Bermond,et al.  Gathering Algorithms on Paths Under Interference Constraints , 2006, CIAC.

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

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