Efficient Active Clustering of Mobile Ad-Hoc Networks
- 1.6k Downloads
Mobile ad hoc networks comprise a collection of wireless nodes that dynamically create a network among themselves without using any pre-existing infrastructure. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to answer the organization, scalability and routing problems of mobile ad hoc networks. In this work, we propose an efficient distributed clustering algorithm that uses both location and energy metrics for stable cluster formation. Unlike existing active clustering methods, out algorithm relieves the network from the unnecessary burden of control messages broadcasting. This is achieved through adapting broadcast period according to mobile nodes mobility pattern. For relative static network topologies, broadcast period is lengthened. In contrast, broadcast period is shortened to meet the requirements of highly dynamic networks for consistent cluster configurations.
KeywordsCluster Head Control Message Battery Power Active Cluster Control Overhead
Unable to display preview. Download preview PDF.
- 1.Chen, Y.P., Liestman, A.L., Liu, J.: Clustering Algorithms for Ad Hoc Wireless Networks. In: Pan, Y., Xiao, Y. (eds.) Ad Hoc and Sensor Networks. Nova Science Publishers, Bombay (2004)Google Scholar
- 5.Perkins, C.: Ad Hoc Networking. Addison-Wesley, Reading (2001)Google Scholar
- 6.Yi, Y., Gerla, M., Kwon, T.: Efficient Flooding in Ad hoc Networks: a Comparative Performance Study. In: Proceedings of the IEEE International Conference on Communications, ICC 2003 (2003)Google Scholar