English
Related papers

Related papers: Statistical Delay Tradeoffs in Buffer-Aided Two-Ho…

200 papers

The time-varying feature of wireless channels usually makes the hard delay bound for data transmissions unrealistic to guarantee. In contrast, the statistically-bounded delay with a small violation probability has been widely used for delay…

Information Theory · Computer Science 2011-05-03 Qinghe Du , Yi Huang , Pinyi Ren , Chao Zhang

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

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

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

In this paper, we consider a bidirectional relay network with half-duplex nodes and block fading where the nodes transmit with a fixed transmission rate. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct…

Information Theory · Computer Science 2016-11-15 Vahid Jamali , Nikola Zlatanov , Robert Schober

Exchange of crucial and confidential information leads to the unprecedented attention on the security problem in wireless networks. Though the security has been studied in a number of works, the joint optimization of the physical layer…

Information Theory · Computer Science 2018-02-02 Yi Zhong , Xiaohu Ge , Tao Han , Qiang Li , Jing Zhang

We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may…

Information Theory · Computer Science 2009-01-16 Radha Krishna Ganti , Martin Haenggi

We study the throughput-delay performance tradeoff in large-scale wireless ad hoc networks. It has been shown that the per source-destination pair throughput can be improved from Theta(1/sqrt(n log n)) to Theta(1) if nodes are allowed to…

Information Theory · Computer Science 2009-08-31 Zhenning Kong , Edmund M. Yeh , Emina Soljanin

Two-way relaying promises considerable improvements on spectral efficiency in wireless relay networks. While most existing works focus on physical layer approaches to exploit its capacity gain, the benefits of two-way relaying on upper…

Information Theory · Computer Science 2012-05-16 Cen lin , Yuan Liu , Meixia Tao

In this paper, a network comprising wireless devices equipped with buffers transmitting deadline-constrained data packets over a slotted-ALOHA random-access channel is studied. Although communication protocols facilitating retransmissions…

Information Theory · Computer Science 2022-10-07 Nikolaos Nomikos , Themistoklis Charalambous , Yvonne-Anne Pignolet , Nikolaos Pappas

We consider a simple network consisting of a source, a half-duplex DF relay with a buffer, and a destination. We assume that the direct source-destination link is not available and all links undergo fading. We propose two new buffer-aided…

Information Theory · Computer Science 2013-02-19 Nikola Zlatanov , Robert Schober

In this paper, we investigate the delay-throughput trade-offs in mobile ad-hoc networks under two-dimensional i.i.d. mobility models. We consider two mobility time-scales: (i) Fast mobility where node mobility is at the same time-scale as…

Networking and Internet Architecture · Computer Science 2007-07-13 Lei Ying , Sichao Yang , R. Srikant

Energy efficiency and transmission delay are very important parameters for wireless multi-hop networks. Previous works that study energy efficiency and delay are based on the assumption of reliable links. However, the unreliability of the…

Networking and Internet Architecture · Computer Science 2008-07-30 Ruifeng Zhang , Jean-Marie Gorce , Katia Jaffrès-Runser

In this paper, we study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the…

Information Theory · Computer Science 2015-02-11 Maha Zohdy , Tamer ElBatt , Mohamed Nafie

In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the…

Information Theory · Computer Science 2015-03-20 Nikola Zlatanov , Robert Schober , Petar Popovski

Wireless sensor networks have been increasingly used for real-time surveillance over large areas. In such applications, it is important to support end-to-end delay constraints for packet deliveries even when the corresponding flows require…

Networking and Internet Architecture · Computer Science 2012-04-23 I-Hong Hou

This paper investigates the secure communication in a two-hop cooperative wireless network, where a buffer-aided relay is utilized to forward data from the source to destination, and a passive eavesdropper attempts to intercept data…

Information Theory · Computer Science 2018-02-20 Ji He , Jia Liu , Yulong Shen , Xiaohong Jiang

Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme…

Information Theory · Computer Science 2016-11-17 Ayfer Ozgur , Olivier Leveque

Scheduling is a critical and challenging resource allocation mechanism for multihop wireless networks. It is well known that scheduling schemes that favor links with larger queue length can achieve high throughput performance. However,…

Networking and Internet Architecture · Computer Science 2016-11-17 Bo Ji , Changhee Joo , Ness B. Shroff

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
‹ Prev 1 2 3 10 Next ›