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

Full description

Saved in:

Bibliographic Details
Published in:	IET communications Vol. 14; no. 4; pp. 580 - 587
Main Authors:	Yarinezhad, Ramin, Hashemi, Seyed Naser
Format:	Journal Article
Language:	English
Published:	The Institution of Engineering and Technology 03.03.2020
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!