English
Related papers

Related papers: Effective Capacity of Buffer-Aided Full-Duplex Rel…

200 papers

This work focuses on the performance of multi-terminal wireless industrial networks, where the transmissions of all terminals are required to be scheduled within a tight deadline. The transmissions thus share a fixed amount of resources,…

Information Theory · Computer Science 2016-06-29 Yulin Hu , Martin Serror , Klaus Wehrle , James Gross

In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…

Information Theory · Computer Science 2015-03-19 Zhou Zhang , Hai Jiang

Consider a communication network with a source, a relay and a destination. Each time interval, the source may dynamically choose between a few possible coding schemes, based on the channel state, traffic pattern and its own queue status.…

Information Theory · Computer Science 2017-02-09 Asaf Cohen , Dennis Goeckel , Omer Gurewitz , Daniel S. Menasche , Mark Shifrin

Real-time video demands quality-of-service (QoS) guarantees such as delay bounds for end-user satisfaction. Furthermore, the tolerable delay varies depending on the use case such as live streaming or two-way video conferencing. Due to the…

Information Theory · Computer Science 2016-11-18 Amin Abdel Khalek , Constantine Caramanis , Robert W. Heath

Tandem queues with finite buffer capacity commonly exist in practical applications. By viewing a tandem queue as an integrated system, an innovative approach has been developed to analyze its performance through the insight from reduction…

Performance · Computer Science 2016-06-02 Kan Wu , Ning Zhao

In this paper, we investigate the two-hop full-duplex (FD) relay channel with self-interference and fading, which is comprised of a source, an FD relay, and a destination, where a direct source-destination link does not exist and the FD…

Information Theory · Computer Science 2017-11-17 Mohsen Mohammadkhani Razlighi , Nikola Zlatanov

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a sink node. The achievable rate formulas that we…

Networking and Internet Architecture · Computer Science 2015-03-20 Arpan Chattopadhyay , Abhishek Sinha , Marceau Coupechoux , Anurag Kumar

Multi-User scheduling is a challenging problem under the relaying scenarios. Traditional schemes, which are based on the instantaneous signal-to-interference-plus-noises ratios (SINRs), cannot solve the inherent disparities of the qualities…

Information Theory · Computer Science 2018-02-23 Pihe Hu , Cheng Li , Dingjie Xu , Bin Xia

In this paper, we consider a three node, two-way relay system with digital network coding over static channels where all link gains are assumed to be constant during transmission. The aim is to minimize total energy consumption while…

Information Theory · Computer Science 2012-10-29 Zhi Chen , Teng Joon Lim , Mehul Motani

Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…

Information Theory · Computer Science 2016-11-17 Stefano Marano , Vincenzo Matta , Ting He , Lang Tong

A framework for energy-efficient resource allocation in a single-user, amplify-and-forward relay-assisted MIMO system is devised in this paper. Previous results in this area have focused on rate maximization or sum power minimization…

Information Theory · Computer Science 2014-03-06 Alessio Zappone , Pan Cao , Eduard A. Jorswieck

We consider a switched (queuing) network in which there are constraints on which queues may be served simultaneously; such networks have been used to effectively model input-queued switches and wireless networks. The scheduling policy for…

Probability · Mathematics 2014-09-04 D. Shah , N. S. Walton , Y. Zhong

In this paper, we study the problem of cooperative communications in cognitive radio systems where the secondary user has limited relaying room for the overheard primary packets. More specifically, we characterize the stable throughput…

Networking and Internet Architecture · Computer Science 2016-11-17 Adel M. Elmahdy , Amr El-Keyi , Tamer ElBatt , Karim G. Seddik

Motivated by applications in online marketplaces such as ride-hailing platforms and payment channel networks, we study a single-server queue with state-dependent arrival control. The service operator dynamically chooses the arrival rate as…

Optimization and Control · Mathematics 2026-02-03 Tianze Qu , Sushil Mahavir Varma

Understanding the real achievable performance of mobile ad hoc networks (MANETs) under practical network constraints is of great importance for their applications in future highly heterogeneous wireless network environments. This paper…

Information Theory · Computer Science 2017-06-02 Jia Liu , Yang Xu , Yulong Shen , Xiaohong Jiang , Tarik Taleb

In this paper, we quantify the benefits of employing relay station in large-coverage cognitive radio systems which opportunistically access the licensed spectrum of some small-coverage primary systems scattered inside. Through analytical…

Information Theory · Computer Science 2010-01-05 Yan Chen , Vincent Lau , Shunqing Zhang , Peiliang Qiu

This letter studies a wireless-powered amplify-and-forward relaying system, where an energy-constrained relay node assists the information transmission from the source to the destination using the energy harvested from the source. We…

Information Theory · Computer Science 2014-11-13 Yong Zeng , Rui Zhang

It has been shown that a decentralized relay selection protocol based on opportunistic feedback from the relays yields good throughput performance in dense wireless networks. This selection strategy supports a hybrid-ARQ transmission…

Information Theory · Computer Science 2016-11-17 Caleb K. Lo , Robert W. Heath, , Sriram Vishwanath

In this paper, we consider a load balancing system under a general pull-based policy. In particular, each arrival is randomly dispatched to one of the servers whose queue lengths are below a threshold, if there are any; otherwise, this…

Performance · Computer Science 2018-08-22 Xingyu Zhou , Jian Tan , Ness Shroff

We consider a full-duplex decode-and-forward system, where the wirelessly powered relay employs the time-switching protocol to receive power from the source and then transmit information to the destination. It is assumed that the relay node…

Information Theory · Computer Science 2016-11-15 Mohammadali Mohammadi , Himal A. Suraweera , Gan Zheng , Caijun Zhong , Ioannis Krikidis
‹ Prev 1 3 4 5 6 7 10 Next ›