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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IET communications Ročník 14; číslo 4; s. 580 - 587
Hlavní autoři:	Yarinezhad, Ramin, Hashemi, Seyed Naser
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	The Institution of Engineering and Technology 03.03.2020
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!