A distributed stabilised clustering algorithm for large-scale wireless ad hoc networks
by Reza Purtoosi, Hassan Taheri, Abbas Mohammadi, Foroohar Foroozan
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 2, No. 3, 2007

Abstract: A new distributed clustering algorithm for wireless ad hoc networks is presented. This algorithm reconfigures the clusters to deal with the dynamic behaviour of the ad hoc networks. In the proposed algorithm, the stability of the generated clusters has been taken into account. The mobile nodes compete with each other to become cluster-head based on the number of neighbours and stability. A number of simulations have been conducted in some large-scale mobile networks to investigate the performance of this algorithm. The simulation results show scalability and stability advantage of this algorithm in networks with large number of mobile nodes.

Online publication date: Mon, 12-Feb-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 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