Completion Time in Two-User Channels: An Information-Theoretic Perspective

  title={Completion Time in Two-User Channels: An Information-Theoretic Perspective},
  author={Yuanpeng Liu and Elza Erkip},
  journal={IEEE Transactions on Information Theory},
  • Yuanpeng LiuE. Erkip
  • Published 1 August 2015
  • Computer Science
  • IEEE Transactions on Information Theory
Consider a multi-user channel, where each user has a large but non-replenishable bit pool to transmit. Completion time refers to the number of channel uses spent by each user to complete its transmission. In this paper, an information-theoretic formulation of completion time is based on the concept of constrained rates, which are defined over possibly different number of channel uses. Analogous to the capacity region, the completion time region characterizes all possible trade-offs among users… 

Multicast Transmission for Asynchronous Data Requests

This paper considers a two-user asynchronous multicast scenario where both users request the same content at different time instances, and a base station simultaneously serves them with nonorthogonal

Data Size-Aware Downlink Massive MIMO: A Session-Based Approach

A session-based scheme is introduced that splits time into sessions and allocates different rates in different sessions for the different users, which results in successively lower levels of interference when moving from one session to the next.

Multiple Access Communications for Age Minimization in UAV Aided Data Collection

  • Oktay OgutcuM. Yuksel
  • Computer Science
    2022 IEEE 95th Vehicular Technology Conference: (VTC2022-Spring)
  • 2022
This paper considers UAV aided data collection in sensor networks for time-critical applications and proposes two trajectory design algorithms, which reveal that multiple access transmission is optimal, when sensors are not too far apart and packet lengths are long, whereas path-length optimal trajectory is better when packets are short.



Random Access: An Information-Theoretic Perspective

It is shown that a simple coding scheme where active senders transmit a single message is optimum for a binary-expansion deterministic channel and achieves within one bit of the optimum in the case of a Gaussian channel.

Delay minimization in multiple access channels

  • Jing YangS. Ulukus
  • Computer Science
    2009 IEEE International Symposium on Information Theory
  • 2009
This work investigates a delay minimization problem in a multiple access wireless communication system using a discrete-time non-fading additive white Gaussian noise (AWGN) multiple access channel and shows that the optimal rate allocation policy is one which tries to equalize the queue lengths in each slot, while working on the dominant face of the capacity region.

Delay-optimal rate allocation in multiaccess communications: a cross-layer view

  • E. Yeh
  • Computer Science
    2002 IEEE Workshop on Multimedia Signal Processing.
  • 2002
Examination of a multiaccess communication scenario where users' packets arrive randomly into separate queues and transmission rates are allocated from the information-theoretic multiaccess capacity region based on the respective users' queue states shows a longer-queue-higher rate (LQHR) allocation strategy is shown to minimize the average system delay of packets.

Completion Time Minimization and Robust Power Control in Wireless Packet Networks

It is shown that, at all ranges of SINR, completion time minimization can be formulated as a convex optimization problem and hence can be efficiently solved.

Gaussian Interference Channel Capacity to Within One Bit

This work shows that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, it is shown that a very simple and explicit Han-Kobayashi type scheme can achieve to within a single bit per second per hertz of the capacity for all values of the channel parameters.

A New Approach to Random Access: Reliable Communication and Reliable Collision Detection

For random access communication over a discrete-time memoryless channel, it is shown that the achievable rate region of the introduced coding approach equals the Shannon information rate region without a convex hull operation.

Network Information Theory

A system with many senders and receivers contains many new elements in the communication problem: interference, cooperation and feedback. These are the issues that are the domain of network

Network Information Theory

Key topics covered include successive cancellation and superposition coding, MIMO wireless communication, network coding, and cooperative relaying, and asynchronous and random access channels.

Information Theory and Communication Networks: An Unconsummated Union

Several topics that are related to communication networks and that have an information-theoretic flavor are reviewed, including multiaccess protocols, timing channels, effective bandwidth of bursty data sources, deterministic constraints on datastreams, queuing theory, and switching networks.

Combining Queueing Theory with Information Theory for Multiaccess

A multiaccess communication model over the additive Gaussian noise channel is developed and analyzed that incorporates some queueing-theoretic aspects of the problem.