Skip to main content

A Self-Organising Clustering Algorithm for Wireless Sensor Networks

Wokoma, I., Sacks, Lionel, Marshall, Ian W. (2004) A Self-Organising Clustering Algorithm for Wireless Sensor Networks. In: UNSPECIFIED, 2004, LCS-2004,.


This paper describes an application level, data-centric algorithm that creates clusters in a sensor network based on the changes of the signal being observed by the sensor nodes without any predetermination by the user. The algorithm was developed for the Self-Organising Collegiate Sensor Network (SECOAS) project and its design was influenced by biological examples of emergence in complex systems. Specifically, this paper refers to the processes Quorum Sensing (QS) and Local Activation and Lateral Inhibition (LALI). The former shows how bacterial cells get into clusters while the latter allows the sensors to recognise patterns in the environment that influences how the clusters are made. Testing the algorithm involved looking at the scalability and the tolerance of the algorithm with a simplified model of the signals to be monitored in SECOAS.

Item Type: Conference or workshop item (Paper)
Additional information: See:
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Computing Education Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:01 UTC
Last Modified: 28 May 2019 13:51 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year