Close category search window
 

A distributed multiple-slot assignment algorithm for 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

2 Author(s)
Sinha, A. ; Adv. Comput. & Microelectron. Unit, Indian Stat. Inst., Kolkata, India ; Das, N.

In this paper, a distributed scheduling algorithm is proposed for multiple slot assignment in wireless sensor networks for TDMA scheduling that attempts to minimize the frame length, ensuring at least one conflict-free slot for each node. Simulation studies have been done to compare the performance of the proposed algorithm with earlier ones that shows improvement in terms of frame length and message overhead indicating that the proposed algorithm will perform better for dense network.

Published in:
Computers and Devices for Communication, 2009. CODEC 2009. 4th International Conference on

Date of Conference: 14-16 Dec. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.