Exact and approximate algorithms for clustering problem in wireless sensor networks

Clustering is an effective method for improving the network lifetime and the overall scalability of a wireless sensor network. The problem of balancing the load of the cluster heads is called load-balanced clustering problem (LBCP), which is an NP-hard problem. In this study, the authors use paramet...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IET communications Jg. 14; H. 4; S. 580 - 587
Hauptverfasser: Yarinezhad, Ramin, Hashemi, Seyed Naser
Format: Journal Article
Sprache:Englisch
Veröffentlicht: The Institution of Engineering and Technology 03.03.2020
Schlagworte:
approximation theory
communication complexity
FPT algorithm
k‐additive approximation algorithm
LBCP
load‐balanced clustering problem
network lifetime
NP‐hard problem
optimisation
parameterised complexity
pattern clustering
Research Article
resource allocation
telecommunication network reliability
wireless sensor network
wireless sensor networks
LBCP
approximation theory
load-balanced clustering problem
wireless sensor networks
wireless sensor network
communication complexity
parameterised complexity
optimisation
resource allocation
NP-hard problem
pattern clustering
telecommunication network reliability
k-additive approximation algorithm
FPT algorithm
network lifetime
ISSN:1751-8628, 1751-8636
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Clustering is an effective method for improving the network lifetime and the overall scalability of a wireless sensor network. The problem of balancing the load of the cluster heads is called load-balanced clustering problem (LBCP), which is an NP-hard problem. In this study, the authors use parameterised complexity to cope with this NP-hard problem. The authors show that LBCP can be solved by a k-additive approximation algorithm with a running time of $ 2^{O({k}/{\log k})}+O(n) $2O(k/log⁡k)+O(n), where k is an upper bound on the maximum load assigned to the cluster heads and n is the input size. Also, LBCP is FPT with respect to the maximum load of the sensor nodes and the number of sensor nodes. The authors propose an fpt-algorithm with respect to these parameters for this problem. In addition, they prove that LBCP is $ W[1]\mbox {-}{\rm hard} $W[1]-hard when the number of the cluster heads is selected as the parameter.
ISSN:1751-8628
1751-8636
DOI:10.1049/iet-com.2019.0510