Stable and Energy Efficient Clustering of Wireless Ad-Hoc Networks with LIDAR Algorithm

  • Damianos Gavalas
  • Grammati Pantziou
  • Charalampos Konstantopoulos
  • Basilis Mamalis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4217)


The main objective of clustering in mobile ad-hoc network environments is to identify suitable node representatives, i.e. cluster heads (CHs) to store routing and topology information; CHs should be elected so as to maximize clusters stability, that is to prevent frequent cluster re-structuring. A popular clustering algorithm (LID) suggests CH election based on node IDs (nodes with locally lowest ID value become CHs). Although fast and simple, this method is biased against nodes with low IDs, which are likely to serve as CHs for long periods and are therefore prone to rapid battery exhaustion. Herein, we propose LIDAR, a novel clustering method which represents a major improvement over traditional LID algorithm: node IDs are periodically re-assigned so that nodes with low mobility rate and high energy capacity are assigned low ID values and, therefore, are likely to serve as CHs. Our protocol also greatly reduces control traffic volume of existing algorithms during clustering maintenance phase, while not risking the energy availability of CHs. Simulation results demonstrate the efficiency, scalability and stability of our protocol against alternative approaches.


Mobile Node Cluster Head Mobility Rate Ordinary Node Transmission Request 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Basagni, S.: Distributed and Mobility-Adaptive Clustering for Multimedia Support in Multi-Hop Wireless Networks. In: Proceedings of the 50th IEEE Vehicular Technology Conference (VTS 1999), pp. 889–893 (1999)Google Scholar
  2. 2.
    Chatterjee, M., Das, S.K., Turgut, D.: WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks. Cluster Computing 5, 193–204 (2002)CrossRefGoogle Scholar
  3. 3.
    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 (2004)Google Scholar
  4. 4.
    Chiang, C.-C., et al.: Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel. Proceedings of IEEE SICON 1997, 197–211 (1997)Google Scholar
  5. 5.
    “Cisco Aironet 1230AG Series 802.11a/b/g Access Point Data Sheet”, Cisco Systems (2004)Google Scholar
  6. 6.
    Gavalas, D., Pantziou, G., Konstantopoulos, C., Mamalis, B.: An Efficient and Scalable Clustering Algorithm of Wireless Ad Hoc Networks. In: Proceedings of the 1st International Workshop on Distributed Algorithms and Applications for Wireless and Mobile Systems (DAAWMS 2005), pp. 761–766 (2005)Google Scholar
  7. 7.
    Gavalas, D., Pantziou, G., Konstantopoulos, C., Mamalis, B.: Lowest-ID with Adaptive ID Reassignment: A Novel Mobile Ad-Hoc Network Clustering Algorithm. In: Proceedings of the 1st IEEE International Symposium on Wireless Pervasive Computing (ISWPC 2006) (January 2006)Google Scholar
  8. 8.
    Li, F., Zhang, S., Wang, X., Xue, X.-Y., Shen, H.: Vote-Based Clustering Algorithm in Mobile Ad Hoc Networks. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 13–23. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Gerla, M., Tsai, J.T.C.: Multicluster, mobile, multimedia radio network. Wireless Networks 1(3), 255–265 (1995)CrossRefGoogle Scholar
  10. 10.
    Hong, X., Xu, K., Gerla, M.: Scalable Routing Protocols for Mobile Ad Hoc Networks. IEEE Network 16(4), 11–21 (2002)CrossRefGoogle Scholar
  11. 11.
    Li, C.R., Gerla, M.: Adaptive Clustering for Mobile Wireless Networks. IEEE Journal of Selected Areas in Communications 15(7), 1265–1275 (1997)CrossRefGoogle Scholar
  12. 12.
    McDonald, B., Znati, F.: A Mobility-Based Framework for Adaptive Clustering in Wireless Ad Hoc Networks. IEEE Journal on Selected Areas in Communications 17, 1466–1487 (1999)CrossRefGoogle Scholar
  13. 13.
    McDonald, B., Znati, F.: Design and Performance of a Distributed Dynamic Clustering Algorithm for Ad-Hoc Networks. In: Proceedings of the 34th Annual Simulation Symposium, pp. 27–35 ( April 2001)Google Scholar
  14. 14.
    Network Simulator - NS-2,
  15. 15.
    Perkins, C.: Ad Hoc Networking, January 2001. Addison-Wesley, Reading (2001)Google Scholar
  16. 16.
    Sivavakeesar, S., Pavlou, G., Liotta, A.: Stable Clustering Through Mobility Prediction for Large-Scale Multihop Ad Hoc Networks. In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC 2004), March 2004. IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  17. 17.
    Yu, J., Chong, P.: A Survey of Clustering Schemes for Mobile Ad Hoc Networks. IEEE Communications Surveys 7(1), 32–48 (2005)CrossRefGoogle Scholar
  18. 18.
    Zheng, R., Kravets, R.: On-demand Power Management for Ad Hoc Networks. In: Proceedings of the IEEE Infocom 2003, pp. 481–491. IEEE Computer Society Press, Los Alamitos (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Damianos Gavalas
    • 1
  • Grammati Pantziou
    • 2
  • Charalampos Konstantopoulos
    • 3
  • Basilis Mamalis
    • 2
  1. 1.Department of Cultural Technology and CommunicationUniversity of the AegeanGreece
  2. 2.Department of InformaticsTechnological Education Institute of AthensGreece
  3. 3.Computer Technology InstitutePatrasGreece

Personalised recommendations