Highly stable and adaptive clustering with efficient routing in wireless ad hoc networks
by Sanjay Kumar Dhurandher, G.V. Singh
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 3, No. 2, 2008

Abstract: The association and disassociation of mobile nodes to and from the clusters in wireless ad hoc networks disturb the stability of the network and, therefore, the reconfiguration of clusterheads is unavoidable. This paper proposes a Weight Based Adaptive Clustering Algorithm (WBACA) that leads to a high degree of stability in the network. Through simulations we have compared the performance of WBACA with that of the Lowest-ID algorithm and the Weighted Clustering Algorithm (WCA) in terms of the number of clusters formed, number of clusterhead changes, number of reaffiliations, control overheads, throughput, and average packet transfer delay in the network.

Online publication date: Mon, 04-Feb-2008

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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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