Self-stabilizing Deterministic TDMA for Sensor Networks

An algorithm for time division multiple access (TDMA) is found to be applicable in converting existing distributed algorithms into a model that is consistent with sensor networks. Such a TDMA service needs to be self-stabilizing so that in the event of corruption of assigned slots and clock drift, it recovers to states from where TDMA slots are consistent. Previous self-stabilizing solutions for TDMA are either randomized or assume that the topology is known upfront and cannot change. Thus, the question of feasibility of self-stabilizing deterministic TDMA algorithm where topology is unknown remains open. In this paper, we present a self-stabilizing, deterministic algorithm for TDMA in networks where a sensor is aware of only its neighbors. This is the first such algorithm that achieves these properties. Moreover, this is the first algorithm that demonstrates the feasibility of stabilization-preserving, deterministic transformation of a shared memory distributed program on an arbitrary topology into a program that is consistent with the sensor network model.

[1]  Ajoy Kumar Datta,et al.  Self-Stabilizing Depth-First Token Passing on Rooted Networks , 1997, WDAG.

[2]  Kay Römer,et al.  BitMAC: a deterministic, collision-free, and robust MAC protocol for sensor networks , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..

[3]  Ajoy Kumar Datta,et al.  Self-stabilizing depth-first token circulation in arbitrary rooted networks , 2000, Distributed Computing.

[4]  Chen Zhang,et al.  ExScal: elements of an extreme scale wireless sensor network , 2005, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05).

[5]  Kleoni Ioannidou,et al.  Transformations of self-stabilizing algorithms , 2002, J. High Speed Networks.

[6]  Franck Petit,et al.  Color optimal self-stabilizing depth-first token circulation , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

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

[8]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[9]  Pradip K. Srimani,et al.  Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity , 1999, Euro-Par.

[10]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

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

[12]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[13]  Sandeep S. Kulkarni,et al.  CHAPTER 1 SS-TDMA : A SELF-STABILIZING MAC FOR SENSOR NETWORKS , 2022 .

[14]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[15]  Sandeep S. Kulkarni,et al.  Fast Abstract : Self-Stabilizing Deterministic TDMA for Sensor Networks ? , .

[16]  David E. Culler,et al.  Design of a wireless sensor network platform for detecting rare, random, and ephemeral events , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[17]  Mohamed G. Gouda,et al.  Stabilizing Communication Protocols , 1991, IEEE Trans. Computers.

[18]  Mohamed G. Gouda,et al.  The alternator , 2007, Distributed Computing.

[19]  Sébastien Tixeuil,et al.  A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks , 2004, ALGOSENSORS.

[20]  Ted Herman.  Models of Self-Stabilization and Sensor Networks , 2003, IWDC.

[21]  ardie Jules Verne.  Fast Self-Stabilizing Depth-First Token Circulation , 2001 .

[22]  Vinayak S. Naik,et al.  A line in the sand: a wireless sensor network for target detection, classification, and tracking , 2004, Comput. Networks.

[23]  Fikret Sivrikaya,et al.  Contention-Free MAC Protocols for Wireless Sensor Networks , 2004, DISC.

[24]  Neeraj Suri,et al.  Efficient TDMA synchronization for distributed embedded systems , 2001, Proceedings 20th IEEE Symposium on Reliable Distributed Systems.

[25]  Sandeep S. Kulkarni,et al.  Transformations for write-all-with-collision model, , 2006, Comput. Commun..

[26]  Anish Arora,et al.  Stabilization-Preserving Atomicity Refinement , 2002, J. Parallel Distributed Comput..

[27]  Gregory J. Pottie,et al.  Performance of a novel self-organization protocol for wireless ad-hoc sensor networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[28]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[29]  Subramanian Ramanathan,et al.  On the complexity of distance-2 coloring , 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.