Image from Google Jackets

Distributed Network Structure Estimation Using Consensus Methods / by Sai Zhang, Cihan Tepedelenlioglu, Andreas Spanias, Mahesh Banavar

By: Zhang, Sai, (Electrical engineer), autor
Contributor(s): Tepedelenlioğlu, Cihan, autor | Spanias, Andreas, autor | Banavar, Mahesh K., autor
Material type: materialTypeLabelE-bookSeries: (Synthesis Lectures on Communications, 1932-1708).Publisher: Cham : Springer International Publishing, 2018Edition: 1st edition 2018.Description: 1 recurso en línea (XI, 76 páginas).ISBN: 9783031016844.Subject: Redes de sensores inalámbricas | Proceso distribuido (Informática) | Internet de los objetosOnline resources: Acceso a este recurso digital (usuarios Universidad Europea de Madrid)Digital Resources
Contents:
Preface -- Acknowledgments -- Introduction -- Review of Consensus and Network Structure Estimation -- Distributed Node Counting in WSNs -- Noncentralized Estimation of Degree Distribution -- Network Center and Coverage Region Estimation -- Conclusions -- Bibliography -- Authors' Biographies.
Summary: The area of detection and estimation in a distributed wireless sensor network (WSN) has several applications, including military surveillance, sustainability, health monitoring, and Internet of Things (IoT). Compared with a wired centralized sensor network, a distributed WSN has many advantages including scalability and robustness to sensor node failures. In this book, we address the problem of estimating the structure of distributed WSNs. First, we provide a literature review in: (a) graph theory; (b) network area estimation; and (c) existing consensus algorithms, including average consensus and max consensus. Second, a distributed algorithm for counting the total number of nodes in a wireless sensor network with noisy communication channels is introduced. Then, a distributed network degree distribution estimation (DNDD) algorithm is described. The DNDD algorithm is based on average consensus and in-network empirical mass function estimation. Finally, a fully distributed algorithm for estimating the center and the coverage region of a wireless sensor network is described. The algorithms introduced are appropriate for most connected distributed networks. The performance of the algorithms is analyzed theoretically, and simulations are performed and presented to validate the theoretical results. In this book, we also describe how the introduced algorithms can be used to learn global data information and the global data region.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
LIBRO-E NO PRÉSTAMO LIBRO-E NO PRÉSTAMO Madrid Digital Acceso Electrónico (UEM) Ciencias e Ingeniería TK7872.D48 2018 EB (Browse shelf(Opens below)) Acceso electrónico eBook.01112936
Total holds: 0

Preface -- Acknowledgments -- Introduction -- Review of Consensus and Network Structure Estimation -- Distributed Node Counting in WSNs -- Noncentralized Estimation of Degree Distribution -- Network Center and Coverage Region Estimation -- Conclusions -- Bibliography -- Authors' Biographies.

The area of detection and estimation in a distributed wireless sensor network (WSN) has several applications, including military surveillance, sustainability, health monitoring, and Internet of Things (IoT). Compared with a wired centralized sensor network, a distributed WSN has many advantages including scalability and robustness to sensor node failures. In this book, we address the problem of estimating the structure of distributed WSNs. First, we provide a literature review in: (a) graph theory; (b) network area estimation; and (c) existing consensus algorithms, including average consensus and max consensus. Second, a distributed algorithm for counting the total number of nodes in a wireless sensor network with noisy communication channels is introduced. Then, a distributed network degree distribution estimation (DNDD) algorithm is described. The DNDD algorithm is based on average consensus and in-network empirical mass function estimation. Finally, a fully distributed algorithm for estimating the center and the coverage region of a wireless sensor network is described. The algorithms introduced are appropriate for most connected distributed networks. The performance of the algorithms is analyzed theoretically, and simulations are performed and presented to validate the theoretical results. In this book, we also describe how the introduced algorithms can be used to learn global data information and the global data region.

There are no comments on this title.

to post a comment.
Share