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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Das, B., Sivakumar, R., Bhargavan, V.: Routing in ad hoc networks using a spine. Proceedings of ICCCN. pp. 1-20 (1997).
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).
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).
Jemili, I., Belghith, A., Mosbah, M. : Algorithme Distribu de Clusterisation sans connaissance du voisinage : principe et valuation. Proceeding NOTERE’2007, Marrakech, June (2007).
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.
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.
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.
Wan, P.-J., Alzoubi, K., Frieder, O. : Distributed construction of connected dominating set in wireless ad hoc networks. In IEEE INFOCOM (2002).
Theoleyre, F., Valois, F. : A self-organization structure for hybrid networks, Ad Hoc. Netw. (2007). doi:10.1016/j.adhoc.2007.02.013
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).
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).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 International Federation for Information Processing
About this paper
Cite this paper
Jemili, I., Belghith, A., Mosbah, M. (2008). A Synchronous Tiered Based Clustering Algorithm for large-scale Ad hoc Networks. In: Mammeri, Z. (eds) Wireless and Mobile Networking. WMNC 2008. IFIP International Federation for Information Processing, vol 284. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-84839-6_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-84839-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-84838-9
Online ISBN: 978-0-387-84839-6
eBook Packages: Computer ScienceComputer Science (R0)