Abstract
The capacity per unit cost, or, equivalently, the minimum cost to transmit one bit, is a well-studied quantity under the assumption of full synchrony between the transmitter and the receiver. In many applications, such as sensor networks, transmissions are very bursty, with amounts of bits arriving infrequently at random times. In such scenarios, the cost of acquiring synchronization is significant and one is interested in the fundamental limits on communication without assuming a priori synchronization. In this paper, 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. This result holds when the transmitter can stay idle at no cost and is a particular case of a general result which holds for arbitrary cost functions.
| Original language | English |
|---|---|
| Article number | 6397617 |
| Pages (from-to) | 1213-1226 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 59 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 20 Feb 2013 |
Keywords
- Asynchronous communication
- bursty communication
- capacity
- capacity per unit cost
- energy
- error exponents
- large deviations
- sequential decoding
- sparse communication
- synchronization