Distributed node scheduling method for wireless sensor networks
by Lei Wang, Yimin Wang, Yaping Lin
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 3, No. 1, 2009

Abstract: For m-covered and connected sensor networks, a new distributed node scheduling algorithm is designed, which can allocate all the nodes in the sensor network into k (k ≤ m) different groups without requiring location information. Theoretical analysis and simulation results show that the newly proposed algorithm has better node scheduling performance and can prolong the lifetime of the sensor networks more effectively than the traditional random-based node scheduling scheme.

Online publication date: Wed, 16-Dec-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com