Self-stabilizing deterministic TDMA for sensor networks

Authors:
Mahesh Arumugam;Sandeep S. Kulkarni
Affiliations:
Software Engineering and Network Systems Laboratory, Department of Computer Science and Engineering, Michigan State University, East Lansing, MI;Software Engineering and Network Systems Laboratory, Department of Computer Science and Engineering, Michigan State University, East Lansing, MI
Venue:
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Year:
2005

Citing 16
Cited 8

Stabilizing Communication Protocols

IEEE Transactions on Computers - Special issue on protocol engineering
Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Models and approximation algorithms for channel assignment in radio networks

Wireless Networks
Stabilization-preserving atomicity refinement

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
On the Complexity of Distance-2 Coloring

ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
Self-Stabilizing Depth-First Token Passing on Rooted Networks

WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Transformations of Self-Stabilizing Algorithms

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
The alternator

ICDCS '99 Workshop on Self-stabilizing Systems
Fast Self-Stabilizing Depth-First Token Circulation

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Color Optimal Self-Stabilizing Depth-First Token Circulation

ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Self-stabilizing depth-first token circulation in arbitrary rooted networks

Distributed Computing
ExScal: Elements of an Extreme Scale Wireless Sensor Network

RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Transformations for write-all-with-collision model

Computer Communications

Evaluating Complex MAC Protocols for Sensor Networks with APMC

Electronic Notes in Theoretical Computer Science (ENTCS)
State space abstraction for parameterized self-stabilizing embedded systems

EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Energy efficiency in wireless sensor networks using sleep mode TDMA scheduling

Ad Hoc Networks
Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs

NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Minimum delay routing for wireless networks with STDMA

Wireless Networks
SFS3: a simulation framework for self-stabilizing systems

SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Chameleon-MAC: adaptive and self-algorithms for media access control in mobile ad hoc networks

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Deterministic collision free communication despite continuous motion

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.