Premium
Affinity propagation‐based interference‐free clustering for wireless sensor networks
Author(s) -
Lin Hai,
Chen Zhihong,
Li June
Publication year - 2019
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.4273
Subject(s) - computer science , cluster analysis , wireless sensor network , energy consumption , schedule , reliability (semiconductor) , affinity propagation , interference (communication) , distributed computing , wireless , computer network , energy (signal processing) , real time computing , efficient energy use , telecommunications , correlation clustering , channel (broadcasting) , cure data clustering algorithm , artificial intelligence , ecology , power (physics) , physics , statistics , mathematics , quantum mechanics , biology , operating system , electrical engineering , engineering
Summary Wireless sensor networks (WSNs), eg, industrial WSNs, require reliability and real‐time communication. Clustering technique together with schedule‐based access can provide the benefits, such as energy saving, reliability, and timeliness. However, integrating above two technologies into WSNs requires sophistical time slot allocation mechanism. To simplify the time slot allocation, the paper proposes a distributed interference‐free clustering algorithm for WSNs. The algorithm is inspired by affinity propagation (AP) clustering algorithm. By adapting and improving the original AP algorithm, the proposed clustering algorithm aims to jointly optimize energy saving and coverage issues while providing interference free between clusters. The performance analysis demonstrates that it can achieve high receiving rate (reliability), low delay (real time), and low‐energy consumption.