Distributed beamforming for information transfer in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Probability Distributions Involving Gaussian Random Variables: A Handbook for Engineers, Scientists and Mathematicians
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Collaborative beamforming for distributed wireless ad hoc sensor networks
IEEE Transactions on Signal Processing
The capacity of wireless networks
IEEE Transactions on Information Theory
On the scaling laws of dense wireless sensor networks: the data gathering channel
IEEE Transactions on Information Theory
Space-time diversity enhancements using collaborative communications
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Fading relay channels: performance limits and space-time signal design
IEEE Journal on Selected Areas in Communications
Computing and communicating functions over sensor networks
IEEE Journal on Selected Areas in Communications
A hierarchical back-end architecture for smartphone sensing
Proceedings of the 2012 ACM Research in Applied Computation Symposium
| Hi-index | 754.84 |
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, the problem of data aggregation at a single sink is considered. It is shown that a data aggregation rate of Θ(log n/n) per node is optimal and that this rate can be achieved in regular wireless sensor networks using a generalization of cooperative beamforming called cooperative time-reversal communication.