Scheduling Algorithms for Sensor Networks

In developing algorithms for scheduling TDMA transmission s in multi-hop networks, the problem is usually to determine t h smallest length conflict-free assignment of slots where eac h link or node is activated at least once. This is based on the as sumption that there are many independent point-to-point flo ws in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine t he smallest length conflict-free assignment of slots during wh ich the packets generated at each node reach their destination. We show that this problem is NP-complete. We first propose two centralized heuristic algorithms for solving the problem: One is based on direct scheduling of the nodes, node based schedu ling, whereas the other is based on scheduling the levels in th e routing tree before scheduling the nodes, level based sched uling. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10 − 70 over centralized algorithms for 1000 nodes. We also obtain upper bound for these schedules as a function of the total number of packets generated in the network.

[1]  Pravin Varaiya,et al.  On multi-hop routing for energy efficiency , 2005, IEEE Communications Letters.

[2]  P. R. Kumar,et al.  Power Control in Ad-Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol , 2002 .

[3]  Goutam Chakraborty,et al.  Genetic algorithm to solve optimum TDMA transmission schedule in broadcast packet radio networks , 2004, IEEE Transactions on Communications.

[4]  Keshab K. Parhi,et al.  Distributed scheduling of broadcasts in a radio network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[6]  Kuldip Singh,et al.  An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[7]  Victor O. K. Li,et al.  Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms , 2003, IEEE Trans. Commun..

[8]  Pravin Varaiya,et al.  PEDAMACS: power efficient and delay aware medium access protocol for sensor networks , 2004, IEEE Transactions on Mobile Computing.

[9]  Sinem Coleri,et al.  Traffic Measurement and Vehicle Classification with a Single Magnetic Sensor , 2004 .

[10]  Elif Uysal-Biyikoglu,et al.  Energy-efficient packet transmission over a wireless link , 2002, TNET.

[11]  Dipankar Raychaudhuri,et al.  D-LSMA: distributed link scheduling multiple access protocol for QoS in ad-hoc networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[12]  David E. Culler,et al.  The mote revolution: low power wireless sensor network devices , 2004 .

[13]  Milind Dawande,et al.  Link scheduling in sensor networks: distributed edge coloring revisited , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Stephen B. Wicker,et al.  Phase transition phenomena in wireless ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[15]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[16]  W.B. Heinzelman,et al.  PN-TRACE: plain network-wide broadcasting through time reservation using adaptive control for energy efficiency , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..

[17]  Pradip K. Srimani,et al.  Fault tolerant distributed coloring algorithms that stabilize in linear time , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.