By Topic

Adaptive Distributed Randomized TDMA Scheduling For Clustered Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shihan Li ; Sino-German Joint Software Inst., Beihang Univ., Beijing ; Depei Qian ; Yi Liu ; Jie Tong

This paper presents an adaptive distributed TDMA slot assignment algorithm, called A-DRAND, which is an improved version of DRAM) in clustered wireless sensor networks where cluster heads need more slots and will be alternated afterwards by other cluster members for energy balance reason. It utilizes cluster info to allocate slots discriminately for different kind of sensor node and adapts its operation depending on the requirements of the application. The overhead is reduced significantly by reserving a special slot number range for slot reassignment. Simulation results show that running time and transmission cost of slot reassignment is only at most 1/m of that of all-participating assignment, where m is the proportion of cluster heads and other sensors with changing slots demanding in the network.

Published in:

Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on

Date of Conference:

21-25 Sept. 2007