Wokoma, I. and Sacks, L. and Marshall, I.W. (2003) Clustering in sensor networks using quorum sensing. In: LCS-2003.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
Scalability is a major issue in sensor networks since they will be expected to operate with up to millions of nodes. This will have implications particularly with energy which ideally should not be wasted on sending data to base stations that will potentially be far away. This can be prevented by separating the sensor networks into clusters and nominating nodes that will carry out aggregation and forward the data to the base station. This paper proposes that the clustering carried out could be based on the rate of change of the data that is measured through the application layer. The protocol developed was inspired by the bacterial signalling process called quorum sensing.
|Item Type:||Conference or workshop item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Computational Intelligence Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:00|
|Last Modified:||14 Mar 2009 18:32|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/13860 (The current URI for this page, for reference purposes)|
- Depositors only (login required):