English
Related papers

Related papers: Contention resolution on a restrained channel

200 papers

This paper investigates delay-distortion-power trade offs in transmission of quasi-stationary sources over block fading channels by studying encoder and decoder buffering techniques to smooth out the source and channel variations. Four…

Information Theory · Computer Science 2015-05-05 Roghayeh Joda , Farshad Lahouti , Elza Erkip

Information must take up space, must weigh, and its flux must be limited. Quantum limits on communication and information storage leading to these conclusions are here described. Quantum channel capacity theory is reviewed for both steady…

Quantum Physics · Physics 2015-06-26 Jacob D. Bekenstein , Marcelo Schiffer

We study a dynamic version of the Multiple-Message Broadcast problem, where packets are continuously injected in network nodes for dissemination throughout the network. Our performance metric is the ratio of the throughput of such protocol…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-12-03 Dariusz R. Kowalski , Miguel A. Mosteiro , Kevin Zaki

In this paper, we consider a multiple-access fading channel where $N$ users transmit to a single base station (BS) within a limited number of time slots. We assume that each user has a fixed amount of energy available to be consumed over…

Information Theory · Computer Science 2017-02-10 Antonious M. Girgis , Amr El-Keyi , Mohammed Nafie

Power allocation is one of the fundamental problems in wireless networks and a wide variety of algorithms address this problem from different perspectives. A common element among these algorithms is that they rely on an estimation of the…

Signal Processing · Electrical Eng. & Systems 2022-01-11 Arindam Chowdhury , Fernando Gama , Santiago Segarra

Motivated by packet routing in computer networks, online queuing systems are composed of queues receiving packets at different rates. Repeatedly, they send packets to servers, each of them treating only at most one packet at a time. In the…

Machine Learning · Statistics 2021-11-05 Flore Sentenac , Etienne Boursier , Vianney Perchet

We consider a slotted wireless network in an infrastructure setup with a base station (or an access point) and N users. The wireless channel gain between the base station and the users is assumed to be i.i.d., and the base station seeks to…

Information Theory · Computer Science 2013-08-01 Venkatesh Ramaiyan

We investigate the stability problem for discrete-time stochastic switched linear systems under the specific scenarios where information about the switching patterns and the probability of switches are not available. Our analysis focuses on…

Systems and Control · Computer Science 2018-04-23 Ahmet Cetinkaya , Hideaki Ishii , Tomohisa Hayakawa

In this paper, wireless video transmission to multiple users under total transmission power and minimum required video quality constraints is studied. In order to provide the desired performance levels to the end-users in real-time video…

Machine Learning · Computer Science 2018-10-18 Chuang Ye , M. Cenk Gursoy , Senem Velipasalar

Recent control trends are increasingly relying on communication networks and wireless channels to close the loop for Internet-of-Things applications. Traditionally these approaches are model-based, i.e., assuming a network or channel model…

Systems and Control · Electrical Eng. & Systems 2019-11-11 Konstantinos Gatsis , George J. Pappas

We propose a new method for opportunistic power control in multi-carrier interference channels for delay-tolerant data services. In doing so, we utilize a game theoretic framework with novel constraints, where each user tries to maximize…

Computer Science and Game Theory · Computer Science 2011-06-28 Mohammad R. Javan , Ahmad R. Sharafat

Admission control can be employed to avoid congestion in queueing networks subject to overload. In distributed networks the admission decisions are often based on imperfect measurements on the network state. This paper studies how the lack…

Probability · Mathematics 2007-08-22 Lasse Leskelä

We study {\em routing} and {\em scheduling} in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of paths for these packets is {\em admissible} if no…

Networking and Internet Architecture · Computer Science 2007-05-23 Matthew Andrews , Antonio Fernandez , Ashish Goel , Lisa Zhang

We consider a cognitive radio network in a multi-channel licensed environment. Secondary user transmits in a channel if the channel is sensed to be vacant. This results in a tradeoff between sensing time and transmission time. When…

Information Theory · Computer Science 2017-01-24 Kedar Kulkarni , Adrish Banerjee

The need to estimate a particular quantile of a distribution is an important problem which frequently arises in many computer vision and signal processing applications. For example, our work was motivated by the requirements of many…

Computer Vision and Pattern Recognition · Computer Science 2015-04-22 Ognjen Arandjelovic , Duc-Son Pham , Svetha Venkatesh

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

With the rise of critical machine-to-machine applications, next generation wireless communication systems must be designed with strict constraints on the latency and reliability. A key question in this context relates to channel state…

Information Theory · Computer Science 2017-06-06 Sebastian Schiessl , Hussein Al-Zubaidy , Mikael Skoglund , James Gross

In this paper, the fading broadcast channel with confidential messages is studied in the presence of statistical quality of service (QoS) constraints in the form of limitations on the buffer length. We employ the effective capacity…

Information Theory · Computer Science 2010-04-07 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

Resource-constrained systems are prevalent in communications. Such a system is composed of many components but only some of them can be allocated with resources such as time slots. According to the amount of information about the system,…

Information Theory · Computer Science 2014-04-02 Albert Y. S. Lam , Yanhui Geng , Victor O. K. Li

We consider stability of scheduled multiaccess message communication with random coding and joint maximum-likehood decoding of messages. The framework we consider here models both the random message arrivals and the subsequent reliable…

Information Theory · Computer Science 2007-07-13 KCV Kalyanarama Sesha Sayee , Utpal Mukherji