Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks
Richard J. Barton, Rong Zheng
Abstract
The predominate traffic patterns in a wireless sensor network are many-to-one and one-to-many communication. Hence, the performance of wireless sensor networks is characterized by the rate at which data can be disseminated from or aggregated to a data sink. In this paper, we consider the data aggregation problem. We demonstrate that a data aggregation rate of O(log(n)/n) is optimal and that this rate can be achieved in wireless sensor networks using a generalization of cooperative beamforming called cooperative time-reversal communication.
Create a lesson
Related papers
Deterministic Identification over Additive Gaussian Channels
Jonathan E. W. Huffmann, Holger Boche
Knowledge Distillation Driven Semantic NOMA with GAN Refinement for 6G Robotic Vehicle Networks
Qifei Wang, Zhen Gao, Li Qiao et al.
Real-Time Reconstruction of Markov Sources over MPR Channels
Pansee S. Elessawy, Nikolaos Pappas
Minimum Rate For Partially Observable Linear System with Side Information: LQG Plant and Gaussian-Markov Source
Sijie Li, Hyeji Kim
Spectral Approximation and Ergodic-Capacity Convergence of HMIMO Channels under Spatial-Wavenumber Domain Mismatch
Hangsong Yan, Hong Yang, Shu Sun
Sharp Minimax Regret for Infinite-Memory Logistic Prediction
Vaneet Aggarwal