Activity-aware clustering algorithm for wireless sensor networks

Morteza Mohammadi Zanjireh, Hadi Larijani, Wasiu O. Popoola

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)


    In a Wireless Sensor Network (WSN) environment, there are many application cases that make use of unequally importance of the nature of distributed sensors. This paper proposes a clustering algorithm for these kinds of environments: prioritising the prolonging of active sensors by way of monitoring the important regions in a network environment. The results of our extensive study for this type of environment shows a considerable increase in the number of sensed events on average by 104.28%, 73.14%, and 50.97%, compared with those of Low Energy Adaptive Clustering Hierarchy (LEACH), Hybrid Energy-Efficient Distributed (HEED), and Avoid Near Cluster Head (ANCH) algorithms, respectively.
    Original languageEnglish
    Title of host publication2014 9th International Symposium on Communication Systems, Networks and Digital Signal Processing, CSNDSP 2014
    Place of PublicationManchester, UK
    Number of pages6
    ISBN (Electronic)9781479925810
    ISBN (Print)9781479925810
    Publication statusPublished - 16 Oct 2014


    • wireless sensor networks (WSN)
    • clustering algorithm
    • network environment
    • Energy efficiency
    • Active and inactive sensors
    • Clustering
    • Environmental monitoring
    • Wireless Sensor Networks
    • Algorithm


    Dive into the research topics of 'Activity-aware clustering algorithm for wireless sensor networks'. Together they form a unique fingerprint.

    Cite this