DiCDU: distributed clustering with decreased uncovered nodes for WSNs

Autor: İpek Abasıkeleş-Turgut
Přispěvatelé: Mühendislik ve Doğa Bilimleri Fakültesi -- Bilgisayar Mühendisliği Bölümü, Turgut, İpek Abasıkeleş
Rok vydání: 2020
Předmět:
Clustering algorithms
Computer science
Static clustering
02 engineering and technology
Distributed clustering with decreased uncovered nodes
Distributed clustering
Engineering
0203 mechanical engineering
Node (computer science)
Protocol
0202 electrical engineering
electronic engineering
information engineering
Hierarchy (mathematics)
Low-energy adaptive clustering hierarchies
Telecommunication power management
020302 automobile design & engineering
Computer Science Applications
Algorithm
Schema (genetic algorithms)
Selection algorithm
Distributed cluster-based routing algorithm
Isolated nodes
Electrical & Electronic
DiCDU
Lifetime
Computer network
Coverage
Energy conservation
Control messages
Energy saving mode
Cluster radius
Cluster (physics)
Electrical and Electronic Engineering
Telecommunication network routing
Cluster analysis
Energy saving modes
Power management (telecommunication)
Routing Protocol | Network Lifetime | Wireless Sensor Network
business.industry
Distributed clusters
020206 networking & telecommunications
Pattern clustering
Cluster-head elections
WSN
Energy-effıcient
Wireless sensor networks
Energy-based cluster head election
Extensive simulations
Network lifetime
business
Wireless sensor network
Energy (signal processing)
Zdroj: IET Communications. 14:974-981
ISSN: 1751-8636
DOI: 10.1049/iet-com.2019.0629
Popis: WOS: 000526412600010
This study proposes a distributed cluster-based routing algorithm, distributed clustering with decreased uncovered nodes (DiCDU), alleviating the uncovered node problem occurring after the election of cluster heads. For the purpose of increasing the performance of the system in terms of the lifetime of the network, an energy-based cluster head election without requiring any extra control message is used. Moreover, an energy saving mode is proposed, in which the nodes perform static clustering controlled by predefined thresholds to conserve batteries. Extensive simulations are conducted for different values of cluster radius and the number of nodes and proposed schema is compared with similar methods, including a time-based cluster-head selection algorithm for low-energy adaptive clustering hierarchy, a clustering algorithm based on time delay, and regional energy aware clustering with the isolated nodes, for the death of the first, the half and the last nodes with the number of uncovered nodes. The results show that DiCDU outperforms compared approaches for all values of cluster radius and the number of nodes.
Databáze: OpenAIRE
Externí odkaz: