English
Related papers

Related papers: Throughput-Delay-Reliability Tradeoff with ARQ in …

200 papers

In this paper, we analyze asymptotic delay-throughput trade-offs in mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. We show that node spatial heterogeneity has the ability to drastically improve upon existing…

Performance · Computer Science 2008-07-09 Michele Garetto , Emilio Leonardi

We consider a half-duplex wireless relay network with hybrid-automatic retransmission request (HARQ) and Rayleigh fading channels. In this paper, we analyze the outage probability of the multi-relay delay-limited HARQ system with…

Information Theory · Computer Science 2012-02-14 Behrouz Maham , Aydin Behnad , Merouane Debbah

The future wireless networks envision ultra-reliable communication with efficient use of the limited wireless channel resources. Closed-loop repetition protocols where retransmission of a packet is enabled using a feedback channel has been…

Information Theory · Computer Science 2017-10-03 Saeed R. Khosravirad , Harish Viswanathan

The growing demand for stringent quality of service (QoS) guarantees in 5G networks requires accurate characterisation of delay performance, often measured using Delay Violation Probability (DVP) for a given target delay. Widely used…

Information Theory · Computer Science 2025-09-16 Vishnu N Moothedath , Sangwon Seo , Neda Petreska , Bernhard Kloiber , James Gross

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

In this work, we analyze the fundamental performance tradeoff of the single-antenna Automatic Retransmission reQuest (ARQ) Z-interference channel (ZIC). Specifically, we characterize the achievable three-dimensional tradeoff between…

Information Theory · Computer Science 2012-04-04 Mohamed S. Nafea , D. Hamza , Karim G. Seddik , Mohammed Nafie , Hesham El Gamal

In this paper, we introduce a network-decomposed hierarchical cooperation (HC) protocol and completely characterize the corresponding throughput--delay trade-off for a large wireless ad hoc network formed in the context of social…

Information Theory · Computer Science 2018-09-05 Cheol Jeong , Won-Yong Shin

This paper presents a dual method of closed-form analysis and lightweight simulation that enables an evaluation of the performance of mobile ad hoc networks that is more realistic, efficient, and accurate than those found in existing…

Information Theory · Computer Science 2016-11-17 Don Torrieri , Salvatore Talarico , Matthew C. Valenti

The problem of achieving ultra-reliable and low-latency communication (URLLC) in multi-terminal networks has gained traction in the recent past owing to new wireless applications in vehicular networks. In the context of multi-hop networks,…

Information Theory · Computer Science 2021-03-09 Jaya Goel , J. Harshan

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

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

We analyze the performance of the type-I automatic repeat request (ARQ) protocol with ultra-reliability constraints. First, we show that achieving a very low packet outage probability by using an open loop setup is a difficult task. Thus,…

Information Theory · Computer Science 2017-01-31 Endrit Dosti , Uditha Lakmal Wijewardhana , Hirley Alves , Matti Latva-aho

Network capacity region is an important character of mobile ad hoc networks. Using cell-partitioned model, an expression of upper bound of delay-tolerant hybrid mobile ad hoc network is deduced regardless of coverage of base stations, types…

Networking and Internet Architecture · Computer Science 2014-04-08 Hu Li , Yuan`an Liu , Hefei Hu , Dongming Yuan , Sirui Duan

In this paper, we address the discrete-time average consensus problem in strongly connected directed graphs, where nodes exchange information over unreliable error-prone communication links. We enhance the Robustified Ratio Consensus…

Systems and Control · Electrical Eng. & Systems 2024-07-30 Evagoras Makridis , Themistoklis Charalambous , Christoforos N. Hadjicostis

The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple access relay (MAR) channel where a single relay is dedicated…

Information Theory · Computer Science 2007-07-16 Kambiz Azarian , Hesham El Gamal , Philip Schniter

Rate, energy and delay are three main parameters of interest in ad-hoc networks. In this paper, we discuss the problem of maximizing network utility and minimizing energy consumption while satisfying a given transmission delay constraint…

Information Theory · Computer Science 2010-11-24 Amir Mahdi Khodaian , Babak H. Khalaj , Hamed Shah-mansouri

Delay and Disruption Tolerant Networks (DTNs) may lack continuous network connectivity. Routing in DTNs is thus a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the…

Networking and Internet Architecture · Computer Science 2017-06-23 Lei You , Jianbo Li , Changjiang We , Chenqu Dai

This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline.…

Networking and Internet Architecture · Computer Science 2010-07-12 Juan Jose Jaramillo , R. Srikant , Lei Ying

The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver…

Information Theory · Computer Science 2007-07-13 Vivek P. Mhatre , Catherine P. Rosenberg

We analyze the multihop delay of ad hoc cognitive radio networks, where the transmission delay of each hop consists of the propagation delay and the waiting time for the availability of the communication channel (i.e., the occurrence of a…

Networking and Internet Architecture · Computer Science 2009-12-22 Wei Ren , Qing Zhao , Ananthram Swami