Abstract
A mobile ad-hoc network is an autonomous collection of wireless mobile nodes that organizes a temporary network without any network infrastructure. Due to node mobility, it is a challenging task to maintain the network topology. In this paper, we propose a stable clustering algorithm that uses node mobility for cluster formation. In the proposed algorithm, the node mobility is measured by counting the time of nodes entering into leaving from its transmission range. The node having the lowest mobility is selected as a cluster head. For topology maintenance with reduced control overhead, the cluster head adaptively controls the broadcasting period of hello message to the measured node mobility. Through computer simulations, it is verified that the proposed algorithm outperforms previous clustering algorithms in terms of control overhead, the rate of node mobility changes and the number of cluster head changes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hong, X., Xu, K., Gerla, M.: Scalable routing protocols for mobile ad hoc networks. IEEE Network 16(4), 11–21 (2002)
Chatterjee, M., Sas, S.K., Turqut, D.: An on-demand weighted clustering algorithm (WCA) for Ad Hoc Networks. In: Proc. of IEEE GLOBECOM, pp. 1697–1701 (2000)
Jiang, M., Li, J., Tay, Y.C.: Cluster Based Routing Protocol (CBRP). In: Internet Draft draft-ietf-manet-cbrp-spec-01.txt (1999)
Wei, D., Chan, H.A.: A Survey on Cluster Schemes in Ad Hoc Wireless Networks. In: Proc. of IEEE Mobility Conference, pp. 1–8 (2005)
Ephermides, A., Wieselthier, J.E., Baker, D.J.: A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling. Proc. IEEE 75, 56–73 (1987)
Wu, J., Li, H.L.: On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In: Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14 (1999)
Yu, Y.J., Chong, P.H.J.: A survey of clustering schemes for mobile Ad Hoc Networks. IEEE Communications Surveys 7(1), 32–48 (2005)
Cha, H.-J., Han, I.-S., Ryou, H.-B.: QoS routing mechanism using mobility prediction of node in ad-hoc network. In: ACM MOBIWAC 2008, New York, pp. 53–60 (2008)
Perkins, C., Royer, E.: Ad-hoc on-demand distance vector routing. In: IEEE WMCSA 1999, pp. 90–100 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cha, HJ., Kim, JM., Ryou, HB. (2014). A Study on the Clustering Scheme for Node Mobility in Mobile Ad-hoc Network. In: Jeong, H., S. Obaidat, M., Yen, N., Park, J. (eds) Advances in Computer Science and its Applications. Lecture Notes in Electrical Engineering, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41674-3_75
Download citation
DOI: https://doi.org/10.1007/978-3-642-41674-3_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41673-6
Online ISBN: 978-3-642-41674-3
eBook Packages: EngineeringEngineering (R0)