English
Related papers

Related papers: Throughput capacity of two-hop relay MANETs under …

200 papers

Available throughput performance studies for mobile ad hoc networks (MANETs) suffer from two major limitations: they mainly focus on the scaling law study of throughput, while the exact throughput of such networks remains largely unknown;…

Information Theory · Computer Science 2015-09-24 Jia Liu , Min Sheng , Yang Xu , Jiandong Li , Xiaohong Jiang

Despite lots of literature has been dedicated to researching the delay performance in two-hop relay (2HR) mobile ad hoc networks (MANETs), however, they usually assume the buffer size of each node is infinite, so these studies are not…

Performance · Computer Science 2015-09-24 Jia Liu , Yang Xu , Xiaohong Jiang

In this paper, two-hop communication between a source and a destination with the aid of an intermediate relay node is considered. Both the source and intermediate relay node are assumed to operate under statistical quality of service (QoS)…

Information Theory · Computer Science 2010-10-01 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

This paper focuses on a class of important two-hop relay mobile ad hoc networks (MANETs) with limited-buffer constraint and any mobility model that leads to the uniform distribution of the locations of nodes in steady state, and develops a…

Information Theory · Computer Science 2016-09-09 Jia Liu , Min Sheng , Yang Xu , Jiandong Li , Xiaohong Jiang

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

A two-hop wireless communication link in which a source sends data to a destination with the aid of an intermediate relay node is studied. It is assumed that there is no direct link between the source and the destination, and the relay…

Information Theory · Computer Science 2011-07-22 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

Optimal queueing control of multi-hop networks remains a challenging problem even in the simplest scenarios. In this paper, we consider a two-hop half-duplex relaying system with random channel connectivity. The relay is equipped with a…

Information Theory · Computer Science 2015-10-28 Bo Zhou , Ying Cui , Meixia Tao

This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary…

Information Theory · Computer Science 2016-11-15 Badri N. Vellambi , Nima Torabkhani , Faramarz Fekri

This paper studies a generic model for cooperative cognitive radio networks where the secondary user is equipped with a finite relay queue as well as a finite battery queue. Our prime objective is to characterize the stable throughput…

Information Theory · Computer Science 2018-06-19 Mohamed A. Abd-Elmagid , Tamer ElBatt , Karim G. Seddik , Ozgur Ercetin

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be evaluated straightforwardly is not available and an explicit coding…

Information Theory · Computer Science 2015-10-13 Nikola Zlatanov , Vahid Jamali , Robert Schober

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be easily evaluated is not available and an explicit coding scheme which…

Information Theory · Computer Science 2015-11-18 Nikola Zlatanov , Vahid Jamali , Derrick Wing Kwan Ng , Robert

In this work, the achievable rate of three-node relay systems with selection relaying under statistical delay constraints, imposed on the limitations of the maximum end-to-end delay violation probabilities, is investigated. It is assumed…

Information Theory · Computer Science 2015-10-14 Deli Qiao

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

Information Theory · Computer Science 2008-04-22 Zhang Shengli , Soung Chang Liew

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

This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two…

Information Theory · Computer Science 2009-10-09 Yi Cao , Biao Chen

We consider a two-node queue modeled as a two-dimensional random walk. In particular, we consider the case that one or both queues have finite buffers. We develop an approximation scheme based on the Markov reward approach to error bounds…

Probability · Mathematics 2020-10-28 Yanting Chen , Xinwei Bai , Richard J. Boucherie , Jasper Goseling

This paper investigates the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at…

Information Theory · Computer Science 2019-04-25 Qi Gu , Gongpu Wang , Rongfei Fan , Ning Zhang , Zhangdui Zhong

The subject of this paper is the long-standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundamental performance limits of mobile ad hoc networks (MANETs). A…

This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite…

Networking and Internet Architecture · Computer Science 2012-12-03 Yulong Shen , Xiaohong Jiang , Jianfeng Ma , Weisong Shi

The exact Markov modeling analysis of erasure networks with finite buffers is an extremely hard problem due to the large number of states in the system. In such networks, packets are lost due to either link erasures or blocking by the full…

Information Theory · Computer Science 2010-12-14 Nima Torabkhani , Badri N. Vellambi , Faramarz Fekri
‹ Prev 1 2 3 10 Next ›