Elements of information theory
Elements of information theory
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Introduction to Algorithms
Multicasting in large random wireless networks: bounds on the minimum energy per bit
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Minimum energy per bit for Gaussian broadcast channels with common message and cooperating receivers
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Energy-efficient broadcasting with cooperative transmissions in wireless sensor networks
IEEE Transactions on Wireless Communications
Spectral efficiency in the wideband regime
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
Cooperative multihop broadcast for wireless networks
IEEE Journal on Selected Areas in Communications
On the power efficiency of cooperative broadcast in dense wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We study the minimum energy per bit required for communicating a message to all the destination nodes in a wireless network. The physical layer is modeled as an additive white Gaussian noise channel affected by circularly symmetric fading. The fading coefficients are known at neither transmitters nor receivers. We provide an information-theoretic lower bound on the energy requirement of multicasting in arbitrary wireless networks as the solution of a linear program. We study the broadcast performance of decode-and-forward operating in the non-coherent wideband scenario, and compare it with the lower bounds. For arbitrary networks with k nodes, the energy requirement of decode-and-forward is within a factor of k - 1 of the lower bound regardless of the magnitude of channel gains. We also show that decode-and-forward achieves the minimum energy per bit in networks that can be represented as directed acyclic graphs, thus establishing the exact minimum energy per bit for this class of networks. We also study regular networks where the area is divided into cells, each cell containing at least k and at most k nodes placed arbitrarily within the cell. A path loss model (with path loss exponent α 2) dictates the channel gains between the nodes. It is shown that the ratio between the upper bound using decode-and-forward based flooding, and the lower bound is at most a constant times kα+2/k.