Abstract
This paper proposes Synchronised Hyperedge Replacement (SHR) as a suitable modelling framework for Wireless Sensor Networks (WSN). SHR facilitates explicit modelling of WSN applications environmental conditions (that greatly affect the applications performance) while providing a sufficiently high level of abstraction for the specification of the adopted clustering mechanism. We model with SHR few communication and coordination aspects of a new algorithm, Balanced Minimum Radius Clustering (BMRC), for solving the balanced clustering problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abbasi, A.A., Younis, M.: A survey on clustering algorithms for wireless sensor networks. Comput. Commun. 30(14-15), 2826–2841 (2007)
Tuosto, E.: Tarzan: Communicating and Moving in Wireless Jungles. In: Cerone, A., Di Pierro, A. (eds.) 2nd Workshop on Quantitative Aspects of Programming Languages. ENTCS, vol. 112, pp. 77–94. Elsevier, Amsterdam (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hammoudeh, M. (2008). Modelling Clustering of Sensor Networks with Synchronised Hyperedge Replacement. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-87405-8_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87404-1
Online ISBN: 978-3-540-87405-8
eBook Packages: Computer ScienceComputer Science (R0)