Optimal Coverage in Wireless Sensor Networks (Hardcover, 1st ed. 2020)

This book will serve as a reference, presenting state-of-the-art research on theoretical aspects of optimal sensor coverage problems. Readers will find it a useful tool for furthering developments on theory and applications of optimal coverage; much of the content can serve as material for advanced topics courses at the graduate level. The book is well versed with the hottest research topics such as Lifetime of Coverage, Weighted Sensor Cover, k-Coverage, Heterogeneous Sensors, Barrier, Sweep and Partial Coverage, Mobile Sensors, Camera Sensors and Energy-Harvesting Sensors, and more. Topics are introduced in a natural order from simple covers to connected covers, to the lifetime problem. Later, the book begins revisiting earlier problems ranging from the introduction of weights to coverage by k sensors and partial coverage, and from sensor heterogeneity to novel problems such as the barrier coverage problem. The book ends with coverage of mobile sensors, camera sensors, energy-harvesting sensors, underwater sensors, and crowdsensing.

General

Imprint:	Springer Nature Switzerland AG
Country of origin:	Switzerland
Series:	Springer Optimization and Its Applications, 162
Release date:	October 2020
First published:	2020
Authors:	Weili Wu • Zhao Zhang • Wonjun Lee • Dingzhu Du
Dimensions:	235 x 155mm (L x W)
Format:	Hardcover
Pages:	297
Edition:	1st ed. 2020
ISBN-13:	978-3-03-052822-5
Categories:	Books > Computing & IT > Computer communications & networking > General Books > Science & Mathematics > Mathematics > Optimization > General Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematical modelling Promotions
LSN:	3-03-052822-7
Barcode:	9783030528225

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!