English
Related papers

Related papers: Application Delay Modelling for Variable Length Pa…

200 papers

In this paper, we study the interplay between delay violation probability and average Age of Information (AoI) in a two-user wireless multiple access channel with multipacket reception (MPR) capability. We consider a system in which users…

Information Theory · Computer Science 2019-05-22 Nikolaos Pappas , Marios Kountouris

In this paper, I develop a generalized method to approximate end-to-end delay (average delay, jitter and density functions) in packet-switched networks (PSNs) of any size under 1) Kleinrock's independence assumption (KIA) and 2) when packet…

Networking and Internet Architecture · Computer Science 2021-03-23 Yu Chen

In this paper, time delay estimation techniques robust to narrowband interference (NBI) are proposed. Owing to the deluge of wireless signal interference these days, narrowband interference is a common problem for communication and…

Information Theory · Computer Science 2015-12-29 TaeJin Park , Kyeong Ok Kang

The maximum traffic arrival rate at the network for a given delay guarantee (delay constrained throughput) has been well studied for wired channels. However, few results are available for wireless channels, especially when multiple antennas…

Networking and Internet Architecture · Computer Science 2011-03-22 Kashif Mahmood , Mikko Vehkaperä , Yuming Jiang

In this work, we analyze the throughput of random access multi-user relay-assisted millimeter-wave wireless networks, in which both the destination and the relay have multipacket reception capability. We consider a full-duplex network…

Networking and Internet Architecture · Computer Science 2018-10-08 Cristian Tatino , Nikolaos Pappas , Ilaria Malanchini , Lutz Ewe , Di Yuan

The IEEE 802.11 backoff algorithm is very important for controlling system throughput over contentionbased wireless networks. For this reason, there are many studies on wireless network performance focus on developing backoff algorithms.…

Networking and Internet Architecture · Computer Science 2016-01-05 Hatm Alkadeki , Xingang Wang , Michael Odetayo

We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can achieve the min-cut capacity and therefore…

Information Theory · Computer Science 2009-10-22 Theodoros K. Dikaliotis , Alexandros G. Dimakis , Tracey Ho , Michelle Effros

In recent years, more and more applications use ad-hoc networks for local M2M communications, but in some cases such as when using WSNs, the software processing delay induced by packets relaying may not be negligible. In this paper, we…

Networking and Internet Architecture · Computer Science 2020-12-11 Taichi Miya , Kohta Ohshima , Yoshiaki Kitaguchi , Katsunori Yamaoka

In highly-dense IEEE 802.11 deployments, areas covered by multiple Wireless Local Area Networks (WLANs) will be common. This opens the door for stations equipped with multiple IEEE 802.11 interfaces to use several WLANs simultaneously,…

Networking and Internet Architecture · Computer Science 2017-12-22 Guillem Cañizares , Boris Bellalta

In this paper, we provide a throughput analysis of the IEEE 802.11 protocol at the data link layer in non-saturated traffic conditions taking into account the impact of both transmission channel and capture effects in Rayleigh fading…

Networking and Internet Architecture · Computer Science 2016-11-17 F. Daneshgaran , Massimiliano Laddomada , F. Mesiti , M. Mondin

We characterize the stability, metastability, and the stationary regime of traffic dynamics in a single-cell uplink wireless system. The traffic is represented in terms of spatial birth-death processes, in which users arrive as a Poisson…

Information Theory · Computer Science 2020-10-15 Ahmad AlAmmouri , Jeffrey G. Andrews , Francois Baccelli

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

Information Theory · Computer Science 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

Information Theory · Computer Science 2016-11-17 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri

For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The…

Information Theory · Computer Science 2013-10-04 Harpreet S. Dhillon , Howard C. Huang , Harish Viswanathan , Reinaldo A. Valenzuela

Vehicle-to-infrastructure and vehicle-to-vehicle communications has been introduced to provide high rate Internet connectivity to vehicles to meet the ubiquitous coverage and increasing high-data rate internet and multimedia demands by…

Networking and Internet Architecture · Computer Science 2020-08-24 Aytül Bozkurt

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

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…

Information Theory · Computer Science 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang

We apply linear network coding (LNC) to broadcast a block of data packets from one sender to a set of receivers via lossy wireless channels, assuming each receiver already possesses a subset of these packets and wants the rest. We aim to…

Information Theory · Computer Science 2018-02-09 Mingchao Yu , Alex Sprintson , Parastoo Sadeghi

We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless…

Networking and Internet Architecture · Computer Science 2013-12-19 Easwar Vivek Mangipudi , Venkatesh Ramaiyan

In this paper correspondence between experimental data for packet delay and two theoretical types of distribution is investigated. Statistical tests have shown that only exponential distribution can be used for the description of packet…

Networking and Internet Architecture · Computer Science 2017-02-20 A. M. Sukhov , N. Yu. Kuznetsova , A. K. Pervitsky , A. A. Galtsev