Affordable Access

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

IFIP Advances in Information and Communication Technology (AICT)
Publication Date
  • Computer Science


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.Full Text at Springer, may require registration or fee

There are no comments yet on this publication. Be the first to share your thoughts.