Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2011-09-19
Computer Science
Distributed, Parallel, and Cluster Computing
7 pages, 9 figures; IEEE International Conference on Communications, 2006. ICC '06
Scientific paper
10.1109/ICC.2006.255712
Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to address those issues. In this work, we introduce an efficient distributed clustering algorithm that uses both location and energy metrics for cluster formation. Our proposed solution mainly addresses cluster stability, manageability and energy efficiency issues. Also, unlike existing active clustering methods, our algorithm relieves the network from the unnecessary burden of control messages broadcasting, especially for relatively static network topologies. This is achieved through adapting broadcast period according to mobile nodes mobility pattern. The efficiency, scalability and competence of our algorithm against alternative approaches have been demonstrated through simulation results.
Gavalas Damianos
Konstantopoulos Charalampos
Mamalis Basilis
Pantziou Grammati
No associations
LandOfFree
Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-96572