# Diamond Networks With Bursty Traffic: Bounds on the Minimum Energy-Per-Bit

@article{Shomorony2012DiamondNW, title={Diamond Networks With Bursty Traffic: Bounds on the Minimum Energy-Per-Bit}, author={Ilan Shomorony and Ra{\'u}l H. Etkin and Farzad Parvaresh and Amir Salman Avestimehr}, journal={IEEE Transactions on Information Theory}, year={2012}, volume={60}, pages={461-493} }

When data traffic in a wireless network is bursty, small amounts of data sporadically become available for transmission, at times that are unknown at the receivers, and an extra amount of energy must be spent at the transmitters to overcome this lack of synchronization between the network nodes. In practice, predefined header sequences are used with the purpose of synchronizing the different network nodes. However, in networks where relays must be used for communication, the overhead required…

## 3 Citations

### Energy-Efficient Communication Over the Unsynchronized Gaussian Diamond Network

- Computer ScienceIEEE Trans. Inf. Theory
- 2014

A distributed relaying scheme is proposed that does not require tight synchronization but nevertheless achieves most of the energy gains of coherent combining and is motivated by a recent result showing that near-optimal energy efficiency can be achieved over the AWGN channel without requiring tight synchronization.

### Minimum-Energy and Error-Rate for URLLC Networks over Nakagami-m Channels: A Finite-Blocklength Analysis

- Computer Science2019 IEEE Global Communications Conference (GLOBECOM)
- 2019

This paper model and analyze the packet-block error rate for URLLC under the Nakagamim fading channel in the finite blocklength regime, and derives the minimum energy per bit for data transmissions in the Nakagi-m fading channel under the constraint of block error rate.

### Energy-efficient communication over the unsynchronized Gaussian diamond network

- Computer Science2014 IEEE International Symposium on Information Theory
- 2014

A distributed relaying scheme is proposed that does not require tight synchronization but nevertheless achieves most of the energy gains of coherent combining and is motivated by a recent result showing that near-optimal energy efficiency can be achieved over the point-to-point AWGN channel.

## References

SHOWING 1-10 OF 17 REFERENCES

### Bounds on the minimum energy-per-bit for bursty traffic in diamond networks

- Computer Science2012 IEEE International Symposium on Information Theory Proceedings
- 2012

It is shown that, for symmetric diamond networks, by performing the tasks of synchronization and communication separately, it is possible to achieve the minimum energy-per-bit to within a factor that ranges from 2 in the synchronous case to 1 in the highly asynchronous regime.

### Wireless Network Information Flow: A Deterministic Approach

- Computer ScienceIEEE Transactions on Information Theory
- 2011

An exact characterization of the capacity of a network with nodes connected by deterministic channels is obtained, a natural generalization of the celebrated max-flow min-cut theorem for wired networks.

### Asynchronous Capacity per Unit Cost

- Computer ScienceIEEE Transactions on Information Theory
- 2013

The minimum cost to transmit B bits of information asynchronously is shown to be equal to (B +H̅) ksync, where ksync is the synchronous minimum cost per bit and H̅ is a measure of timing uncertainty equal to the entropy for most reasonable arrival time distributions.

### Asynchronous Communication: Exact Synchronization, Universality, and Dispersion

- Computer ScienceIEEE Transactions on Information Theory
- 2013

It is shown that the capacity region remains unchanged under the exact synchronization requirement, and asynchronous capacity can be achieved by universal (channel independent) codes, and Comparisons with earlier results on another (delay compensated) definition of rate are made.

### Bounds on capacity and minimum energy-per-bit for AWGN relay channels

- Computer ScienceIEEE Transactions on Information Theory
- 2006

Two coding schemes that do not require the relay to decode any part of the message are investigated and it is shown that the "side-information coding scheme" can outperform the block-Markov coding scheme and the achievable rate of the side- information coding scheme can be improved via time sharing.

### Using Superposition Codebooks and Partial Decode-and-Forward in Low-SNR Parallel Relay Networks

- Computer ScienceIEEE Transactions on Information Theory
- 2013

The asymptotic low-signal-to-noise-ratio regime is studied and it is shown that the new scheme outperforms all previously known schemes for some channels and parameter ranges.

### Error exponents in asynchronous communication

- Computer Science2011 IEEE International Symposium on Information Theory Proceedings
- 2011

This paper proposes a slotted asynchronous channel model, proposes coding schemes that are suitable for various asynchronous communication scenarios, and quantifies more precisely the suboptimality of training-based schemes, i.e., communication strategies that separate synchronization from information transmission.

### On channel capacity per unit cost

- Computer ScienceIEEE Trans. Inf. Theory
- 1990

It is shown that, if the input alphabet contains a zero-cost symbol, then the capacity per unit cost admits a simple expression as the maximum normalized divergence between two conditional output distributions.

### A Novel Asynchronous Communication Paradigm: Detection, Isolation, and Coding

- Computer Science
- 2009

A notion of capacity is defined and corresponding upper and lower bounds are derived and a simple theoretical framework for asynchronous point-to-point communication is developed.

### Communication Under Strong Asynchronism

- Computer ScienceIEEE Transactions on Information Theory
- 2009

The use of generalized constant-composition codebooks and sequential decoding is shown to be sufficient for achieving reliable communication under strictly positive asynchronism exponents at all rates less than the capacity of the synchronized channel.