Communication scheduling in data gathering networks with limited memory

Abstract In this paper scheduling communications in data gathering networks is analyzed. We study collecting information by a set of sensors, each of which stores the data in its memory buffer and then passes them to a base station. The network lifetime ends as soon as the first node is out of memory. We use a divisible load model to propose a communication scheduling algorithm that maximizes the system lifetime, and hence, the total amount of gathered information. The influence of the sensor communication rates on the obtained schedules is exposed in a series of computational experiments.

[1]  M. Moges,et al.  Wireless sensor networks: scheduling for measurement and data reporting , 2006, IEEE Transactions on Aerospace and Electronic Systems.

[2]  Siddhartha Chauhan,et al.  A Survey on Scheduling Algorithms for Wireless Sensor Networks , 2011 .

[3]  Joanna Berlinska,et al.  Heuristics for multi-round divisible loads scheduling with limited memory , 2010, Parallel Comput..

[4]  Thomas G. Robertazzi,et al.  Distributed computation with communication delay (distributed intelligent sensor networks) , 1988 .

[5]  Joanna Berlinska,et al.  Experimental study of scheduling with memory constraints using hybrid methods , 2009, J. Comput. Appl. Math..

[6]  Pravin Varaiya,et al.  TDMA scheduling algorithms for wireless sensor networks , 2010, Wirel. Networks.

[7]  Chi-kin Lee.  Distributed image processing on a network of workstations , 1994 .

[8]  Pawel Wolniewicz,et al.  Experiments with Scheduling Divisible Tasks in Clusters of Workstations , 2000, Euro-Par.

[9]  Maciej Drozdowski,et al.  Scheduling divisible loads in a three-dimensional mesh of processors , 1999, Parallel Comput..

[10]  Kerstin Kleese van Dam,et al.  Data-Intensive Science , 2013 .

[11]  Thomas G. Robertazzi,et al.  Divisible Load Scheduling inWireless Sensor Networks with Information Utility , 2008, 2008 IEEE International Performance, Computing and Communications Conference.

[12]  Yunhao Liu,et al.  Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation , 2010, IEEE Transactions on Parallel and Distributed Systems.

[13]  Bharadwaj Veeravalli,et al.  Divisible load scheduling on single-level tree networks with buffer constraints , 2000, IEEE Trans. Aerosp. Electron. Syst..

[14]  Ramalingam Sugumar.  TDMA SCHEDULING WITH OPTIMIZED ENERGY EFFICIENCY AND MINIMUM DELAY IN CLUSTERED WIRELESS SENSOR NETWORKS. , 2013 .

[15]  Henri Casanova,et al.  Practical divisible load scheduling on grid platforms with APST-DV , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[16]  Jacek Blazewicz,et al.  Scheduling Divisible Jobs on Hypercubes , 1995, Parallel Comput..

[17]  Thomas G. Robertazzi,et al.  Distributed computation for a tree network with communication delays , 1990 .

[18]  Thomas G. Robertazzi,et al.  Optimizing Computing Costs Using Divisible Load Analysis , 1998, IEEE Trans. Parallel Distributed Syst..

[19]  Joanna Berlinska,et al.  Scheduling divisible MapReduce computations , 2011, J. Parallel Distributed Comput..

[20]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[21]  H. V. Jagadish,et al.  Partitioning Techniques for Large-Grained Parallelism , 1988, IEEE Trans. Computers.

[22]  T.G. Robertazzi,et al.  Efficient Parallel Video Processing Through Concurrent Communication on a Multi-port Star Network , 2006, 2006 40th Annual Conference on Information Sciences and Systems.