Loading...
Notice of violation of IEEE publication principles: a new automatic clustering algorithm via deadline timer for wireless ad-hoc sensor networks
Bazregar, A ; Sharif University of Technology | 2008
502
Viewed
- Type of Document: Article
- DOI: 10.1109/ICTTA.2008.4530187
- Publisher: 2008
- Abstract:
- This paper proposes a decentralized algorithm to organize an ad-hoc sensor network into clusters. Each sensor operates independently, monitoring communication among others. Those sensors which have many neighbors that are not already part of a cluster are likely candidates to creating a new cluster by declaring themselves to be a new cluster-head. The Clustering Algorithm via Deadline Timer (CADT) provides a protocol whereby this can be achieved and the process continues until all sensors are part of a cluster. Because of the difficulty of analyses simplified models are used to study and abstract its performance. A simple formula to estimate the number of clusters which will be formed in an ad-hoc network is derived based on the analysis, and the results are compared to the behavior of the algorithm in a number of settings
- Keywords:
- Boolean functions ; Chlorine compounds ; Clustering algorithms ; Communication ; Flow of solids ; Sensor networks ; Sensors ; Technology ; Wireless sensor networks ; Ad-hoc sensor networks ; Automatic clustering ; Averaged model ; Cluster ; Cluster-head ; Deadline timer ; Decentralized algorithms ; Density ; Information and communication technologies ; International conferences ; Number of clusters ; Sensor ; Simplified models ; Wireless ad-hoc sensor networks ; Ad-hoc networks
- Source: 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA, 7 April 2008 through 11 April 2008, Damascus ; 2008 ; 9781424417513 (ISBN)
- URL: https://ieeexplore.ieee.org/document/4530187