Distributed network structure estimation using consensus methods [electronic resource]
- 作者： Zhang, Sai.
- 其他作者：
- 其他題名：
- Synthesis Lectures on Communications ;
- 出版： San Rafael, California : Morgan & Claypool Publishers
- 版本：1st ed.
- 叢書名： Synthesis Lectures on Communications ;13.
- 主題： Wireless sensor networks. , Electronic data processing--Distributed processing. , Internet of things. , Networking.
- ISBN： 1681732904 、 1681732912 、 1681732920 、 9781681732909 、 9781681732916 、 9781681732923
-
FIND@SFXID:
CGU
- 資料類型: 電子書
- 內容註: Includes bibliographical references and index. Distributed network structure estimation using consensus methods -- Synthesis Lectures on Communications -- Abstract & Keywords -- Contents -- Preface -- Acknowledgments -- Chapter 1: Introduction -- Chapter 2: Review of Consensus and Network Structure Estimation -- Chapter 3: Distributed Node Counting in WSNs -- Chapter 4: Noncentralized Estimation of Degree Distribution -- Chapter 5: Network Center and Coverage Region Estimation -- Chapter 6: Conclusions -- Appendix A: Notation -- 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.
-
讀者標籤：
- 系統號： 005454852 | 機讀編目格式
館藏資訊
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.