Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks

We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm referred to as convergecast. We are interested in determining a TDMA schedule that minimizes the total time required to complete the convergecast. We consider a simple version of the problem wherein every node generates exactly one packet. We propose a distributed convergecast scheduling algorithm that requires at most 3N timeslots, where N represents the number of nodes in the network. Through extensive simulations, we demonstrate that actual number of timeslots needed is around 1.5N. In addition to time efficiency, we prove that our convergecast scheduling algorithm requires the nodes to buffer no more than two packets at any instance. We propose a sleep schedule that conserves more than 50% of the energy. We present simulation results for a real application scenario to show that our convergecast scheduling algorithm performs significantly better than existing convergecast algorithms.

[1]  Ju Wang,et al.  Scheduling on sensor hybrid network , 2005, Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005..

[2]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[3]  Gyula Simon,et al.  Sensor network-based countersniper system , 2004, SenSys '04.

[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]  Robert J. McEliece,et al.  Packets distribution algorithms for sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Miklós Maróti,et al.  Directed Flood-Routing Framework for Wireless Sensor Networks , 2004, Middleware.

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

[8]  Ying Zhang,et al.  Radial coordination for convergecast in wireless sensor networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[9]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[10]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[11]  Dariusz R. Kowalski,et al.  Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks , 2005, Second Annual Conference on Wireless On-demand Network Systems and Services.

[12]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[14]  S. Ramanathan,et al.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[15]  Peter Drake,et al.  Data structures and algorithms in Java , 2005 .

[16]  Igor Potapov,et al.  Gossiping with Unit Messages in Known Radio Networks , 2002, IFIP TCS.