A Synchronous Tiered Based Clustering Algorithm for large-scale Ad hoc Networks

  • Imen Jemili
  • Abdelfatteh Belghith
  • Mohamed Mosbah
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 284)

Relaying on a virtual backbone formed by the induced hierarchy of a connected dominating set is a widespread solution in ad hoc networks. However, the majority of existing approaches require gathering neighborhood information without considering the loss of information due to collision and the effect of wireless interference and its impact on the accuracy of information used during clustering process. In this paper, we present an improved version of our clustering algorithm, TBCA, operating in layered manner and exploiting the eventual collision to accelerate the clustering process. We prove through simulations that our mechanism outperforms other ones, in terms of effectiveness throughput and per-packet sojourn delay. Conducted simulations show also that it copes better with mobility.


Mobile Node Cluster Process Member Node Random Delay Cluster Period 
These keywords were added by machine and not by the authors.


  1. 1.
    Das, B., Sivakumar, R., Bhargavan, V.: Routing in ad hoc networks using a spine. Proceedings of ICCCN. pp. 1-20 (1997).Google Scholar
  2. 2.
    Chen, B., Jamieson, K. Balakrishnan, H., Morris, R.: Span: an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks. ACM Wireless Networks J. 8 (5). pp. 481-494 (2002).MATHCrossRefGoogle Scholar
  3. 3.
    Belghith, A. Jemili, I., Mosbah, M. : A Distributed Clustering Algorithm without an Explicit Neighborhood Knowledge. International Journal of Computing and Information Sciences, Vol. 5, number 1, pp. 24-34 (2007).Google Scholar
  4. 4.
    Jemili, I., Belghith, A., Mosbah, M. : Algorithme Distribu de Clusterisation sans connaissance du voisinage : principe et valuation. Proceeding NOTERE’2007, Marrakech, June (2007).Google Scholar
  5. 5.
    J. Wu, H..L. Li (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. PP 7-14.Google Scholar
  6. 6.
    I. Stojmenovic, M. Seddigh and J. Zunic (2001) Dominating sets and neighbor eliminationbased broadcastings in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 13(1):14-25, January 2001.CrossRefGoogle Scholar
  7. 7.
    J. Wu, M. Gao, I. Stojmenovic (2002) On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. Journal of Communication and Networks, March 2002.Google Scholar
  8. 8.
    Wan, P.-J., Alzoubi, K., Frieder, O. : Distributed construction of connected dominating set in wireless ad hoc networks. In IEEE INFOCOM (2002).Google Scholar
  9. 9.
    Theoleyre, F., Valois, F. : A self-organization structure for hybrid networks, Ad Hoc. Netw. (2007). doi:10.1016/j.adhoc.2007.02.013Google Scholar
  10. 10.
    Kuhn, F., Moscibroda, T., Wattenhofer, R. : Initializing newly deployed ad hoc and sensor networks, in: 10th Annual International Conference on Mobile Computing and Networking (MOBICOM), (2004).Google Scholar
  11. 11.
    Gandhi, R., Parthasarathy, S. : Distributed algorithms for connected domination in wireless networks. Journal of Parallel and Distributed Computing, Volume 67, Issue 7, pp. 848-862 July (2007).MATHCrossRefGoogle Scholar

Copyright information

© International Federation for Information Processing 2008

Authors and Affiliations

  • Imen Jemili
    • 1
    • 2
  • Abdelfatteh Belghith
    • 1
  • Mohamed Mosbah
    • 2
  1. 1.N. School of Computer SciencesHANA Lab.Tunisia
  2. 2.LaBRIUniversity of Bordeaux ITalenceFrance

Personalised recommendations