Decentralised topology control algorithms for connectivity of distributed wireless sensor networks
by Usha Nandini Raghavan, Soundar R.T. Kumara
International Journal of Sensor Networks (IJSNET), Vol. 2, No. 3/4, 2007

Abstract: In this paper, we study the problem of maintaining the connectivity of a Wireless Sensor Network (WSN) using decentralised topology control protocols. Previous algorithms on topology control require the knowledge of the density of nodes (λ) in the sensing region. However, if λ varies continuously over time, updating this information, at all nodes is impractical. Therefore, in addition to efficient maintenance of connectivity, we also wish to reduce the control overhead of the topology control algorithm. In the absence of information regarding λ we study the connectivity properties of WSNs by means of giant components. We show that by maintaining the out-degree at each node as five will give rise to a giant connected component in the network. We also show that this is the smallest value that can maintain a giant connected component irrespective of how often or by how much λ changes.

Online publication date: Wed, 11-Apr-2007

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 Sensor Networks (IJSNET):
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