loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
24th International Conference on Distributed Computing Systems Workshops - W5: ADSN (ICDCSW'04)
TDMA Service for Sensor Networks
Hachioji, Tokyo, Japan
March 23-March 24
ISBN: 0-7695-2087-1
Sandeep S. Kulkarni, Michigan State University
Mahesh (Umamaheswaran) Arumugam, Michigan State University
Sensors networks are often constrained by limited power and limited communication range. If a sensor receives two messages simultaneously then they collide and both messages become incomprehensible. In this paper, we present a simple time division multiple access (TDMA) algorithm for assigning time slots to sensors and show that it provides a significant reduction in the number of collisions incurred during communication. We present TDMA algorithms customized for different communication patterns, namely, broadcast, convergecast and local gossip, that occur commonly in sensor networks. Our algorithms are self-stabilizing, i.e., TDMA is restored even if the system reaches an arbitrary state where the sensors are corrupted or improperly initialized.
Index Terms:
Sensor Networks, Time Division Multiple Access (TDMA), Broadcast, Convergecast, Local Gossip
Citation:
Sandeep S. Kulkarni, Mahesh (Umamaheswaran) Arumugam, "TDMA Service for Sensor Networks," icdcsw, vol. 5, pp.604-609, 24th International Conference on Distributed Computing Systems Workshops - W5: ADSN (ICDCSW'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.