Multi-hop Clustering Based on Neighborhood Benchmark in Mobile Ad-hoc Networks
- 70 Downloads
Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a technique is presented to construct multi-hop clusters with balanced sizes, based on the neighborhood benchmark (NB) to quantify the connectivity and link stability of mobile nodes. By exploiting autonomous clusterhead selection and a specialized handshake process with the clusterheads, the nodes with highest NB scores are selected as clusterheads and all the clusters constructed are connected. The deviation of cluster sizes is kept small using a partial probability-based approach. Our technique generates highly stable multi-hop clusters with low overhead, and provides the flexibility of controlling the cluster radius adaptively for various network applications.
Keywordsmobile ad-hoc networks multi-hop clusters neighborhood benchmark balanced sizes
This work was supported by the National Science Foundation under grant number ITR-CYBERTRUST 0430565.
- 1.Amis AD, Prakash R, Huynh D, Vuong T (2000) Max-min d-cluster formation in wireless ad hoc networks. In: Proc. 19th annual joint conference of the IEEE computer and communications societies (INFOCOM). IEEE, Piscataway, pp 32–41Google Scholar
- 6.Chiang C-C, Wu H-K, Liu W, Gerla M (1997) Routing in clustered multihop mobile wireless networks with fading channel. In: Proc. IEEE Singapore international conference on networks (SICON). IEEE, Piscataway, pp 197–211Google Scholar
- 8.Kim D, Ha S, Choi Y (1998) k-hop cluster-based dynamic source routing in wireless ad-hoc packet radio networks. In: Proc. IEEE vehicular technology conference (VTC). IEEE, Piscataway, pp 224–228Google Scholar
- 12.Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: Proc. ACM SIGCOMM. ACM, New York, pp 161–172Google Scholar
- 13.Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM. ACM, New York, pp 149–160Google Scholar
- 15.Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc. 3rd Int’l workshop on discrete algorithms and methods for mobile computing and communications (DIAL-M), Seattle, 20 August 1999, pp 7–14Google Scholar