Abstract
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a fixed infrastructure. Fast self-reconfiguration and power efficiency are very important property on any sensor network management. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. Clustering increases the scalability and the energy efficiency of communication among the sensors. A self-stabilizing algorithm, regardless of the initial system state, converges to a set of states that satisfy the problem specification without external intervention. Due to this property, self-stabilizing algorithms are adapted highly dynamic networks. In this paper we present a Self-stabilizing Clustering Algorithm for Ad hoc sensor network. Our algorithm adapts faster than other algorithms to topology changes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banerjee, S., Khuller, S.: A clustering scheme for hierarchical control in multi-hop wireless networks. In: INFOCOM 2001: The 20th Conference of the IEEE Communications Society, pp. 1028–1037 (2001)
Basagni, S.: Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks. In: VTC 1999: Proceedings of the IEEE 50th International Vehicular Technology Conference, pp. 889–893 (1999)
Basagni, S.: Distributed clustering for ad hoc networks. In: ISPAN 1999 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms, and Networks, pp. 310–315 (1999)
Chatterjee, M., Das, S., Turgut, D.: WCA: A weighted clustering algorithm for mobile ad hoc networks. Journal of Cluster Computing, Special issue on Mobile Ad hoc Networking 5, 193–204 (2002)
Fernandess, Y., Malkhi, D.: K-clustering in wireless ad hoc networks. In: POMC 2002: Proceedings of the second ACM international workshop on Principles of mobile computing, pp. 31–37 (2002)
Gerla, M., Tsai, J.T.: Multicluster, mobile, multimedia radio network. Wireless Networks 1, 255–265 (1995)
Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15, 1265–1275 (1997)
Bettstetter, C., Friedrich, B.: Time and message complexities of the generalized distributed mobility-adaptive clustering (GDMAC) algorithm in wireless multihop networks. In: VTC 2003: Proceedings IEEE Vehicular Technology Conference, pp. 176–180 (2003)
Bettstetter, C., Krausser, R.: Scenario-based stability analysis of the distributed mobility-adaptive clustering (DMAC) algorithm. In: MobiHoc 2001: Proceedings of the 2nd ACM Symposium on Mobile Ad Hoc Networking & Computing, pp. 232–241 (2001)
Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless communications 1, 660–670 (2002)
Younis, O., Fahmy, S.: Distributed clustering for ad-hoc sensor networks: A hybrid, energy-efficient approach. In: IEEE INFOCOM 2004: Proceedings of The 23rd Conference of the IEEE Communications Society (2004)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Schneider, M.: Self-stabilization. ACM Symposium Computing Surveys 25, 45–67 (1993)
Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: WAPDCM 2003: 5th IPDPS Workshop on Advances in Parallel and Distributed Computational Models (2003)
Xu, Z., Hedetniemi, S.T., Goddard, W., Srimani, P.K.: A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph. In: IWDC 2003. LNCS, vol. 2918. Springer, Heidelberg (2003)
Bein, D., Datta, A.K., Jagganagari, C.R., Villain, V.: A self-stabilizing link-cluster algorithm in mobile ad hoc networks. In: ISPAN 2005: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 436–441 (2005)
Mitton, N., Fleury, E., Lassous, I.G., Tixeuil, S.: Self-stabilization in self-organized multihop wireless networks. In: WWAN 2005: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops, pp. 909–915 (2005)
Mitton, N., Busson, A., Fleury, E.: Self-organization in large scale ad hoc networks. In: MED-HOC-NET 2004: Third Annual Mediterranean Ad Hoc Networking Workshop (2004)
Beauquier, J., Gradinariu, M., Johnen, C.: Memory space requirements for self-stabilizing leader election protocols. In: PODC 1999: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pp. 199–207 (1999)
Johnen, C.: Service time optimal self-stabilizing token circulation protocol on anonymous unidirectional rings. In: SRDS 2002: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pp. 80–89 (2002)
Johnen, C., Alima, L.O., Tixeuil, S., Datta, A.K.: Self-stabilizing neighborhood synchronizer in tree networks. In: ICDCS 1999: Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, p. 487 (1999)
Johnen, C., Tixeuil, S.: Route preserving stabilization. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 184–198. Springer, Heidelberg (2003)
Johnen, C., Nguyen, L.: Self-stabilizing clustering algorithm for ad hoc networks. Technical Report no. 1357, L.R.I, Université de Paris Sud, vol.1429 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johnen, C., Nguyen, L.H. (2006). Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2006. Lecture Notes in Computer Science, vol 4240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963271_8
Download citation
DOI: https://doi.org/10.1007/11963271_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69085-6
Online ISBN: 978-3-540-69087-0
eBook Packages: Computer ScienceComputer Science (R0)