A New Relaying Scheme for Cheap Wireless Relay Nodes
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
IEEE Transactions on Information Theory
Variable-rate channel capacity
IEEE Transactions on Information Theory
Networking with secrecy constraints
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Robust transmission and interference management for femtocells with unreliable network access
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
| Hi-index | 754.96 |
Albanese et al. (see ibid. vol.42, p.1737-44, 1996) introduced priority encoding transmission (PET) for sending hierarchically organized messages over lossy packet-based computer networks. In a PET system, each symbol in the message is assigned a priority which determines the minimal number of codeword symbols that is required to recover that symbol. This article revisits the PET approach using tools from network information theory. We first show that priority encoding transmission is intimately related with the broadcast erasure channel with a degraded message set. Using the information spectrum approach, we provide an informational characterization of the capacity region of general broadcast channels with degraded message set. We show that the PET inequality has an information-theoretical counterpart. The inequality defining the capacity region of the broadcast erasure channel with degraded message sets. Hence the PET approach which consists in time-sharing and interleaving classical erasure-resilient codes achieves the capacity region of this channel. Moreover, we show that the PET approach may achieve the sphere packing exponents. Finally, we observe that on some simple nonstationary broadcast channels, time-sharing may be outperformed. The impact of memory on the optimality of the PET approach remains elusive