DocumentCode :
108581
Title :
Asynchronous Capacity per Unit Cost
Author :
Chandar, Venkat ; Tchamkerten, Aslan ; Tse, David
Author_Institution :
MIT Lincoln Lab., Lexington, MA, USA
Volume :
59
Issue :
3
fYear :
2013
fDate :
Mar-13
Firstpage :
1213
Lastpage :
1226
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.
Keywords :
entropy; synchronisation; arbitrary cost function; asynchronous capacity; communication; entropy; full synchrony; synchronization; timing uncertainty; unit cost; Decoding; Delay; Receivers; Synchronization; Transmitters; Uncertainty; Asynchronous communication; bursty communication; capacity; capacity per unit cost; energy; error exponents; large deviations; sequential decoding; sparse communication; synchronization;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2012.2236914
Filename :
6397617
Link To Document :
بازگشت