English
Related papers

Related papers: A Random Multiple Access Protocol with Spatial Int…

200 papers

A class of nonlinear ARCH processes is introduced and studied. The existence of a strictly stationary and $\beta$-mixing solution is established under a mild assumption on the density of the underlying independent process. We give…

Probability · Mathematics 2007-05-23 Youssef Sa\"{ı}di , Jean-Michel Zako\"{ı}an

In this work, we study the impact of a relay node to a network with a finite number of users-sources and a destination node. We assume that the users have saturated queues and the relay node does not have packets of its own; we have random…

Information Theory · Computer Science 2014-02-05 Nikolaos Pappas , Anthony Ephremides , Apostolos Traganitis

We study an open discrete-time queueing network that models the collection of data in a multi-hop sensor network. We assume data is generated at the sensor nodes as a discrete-time Bernoulli process. All nodes in the network maintain a…

Networking and Internet Architecture · Computer Science 2019-07-26 Iqra Altaf Gillani , Amitabha Bagchi , Pooja Vyavahare

We consider a slotted-ALOHA LAN with loss-averse, noncooperative greedy users. To avoid non-Pareto equilibria, particularly deadlock, we assume probabilistic loss-averse behavior. This behavior is modeled as a modulated white noise term, in…

Computer Science and Game Theory · Computer Science 2012-02-28 George Kesidis , Youngmi Jin

The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are…

Disordered Systems and Neural Networks · Physics 2009-11-13 Kartik Anand , Tobias Galla

In this note we analyse various stability properties of the max-min fair Rate Control Protocol (RCP) operating with small buffers. We first tackle the issue of stability for networks with arbitrary topologies. We prove that the max-min fair…

Networking and Internet Architecture · Computer Science 2016-11-18 Thomas Voice , Gaurav Raina

With the rapid expansion of the Internet of Things, the efficient sharing of the wireless medium by a large amount of simple transmitters is becoming essential. Scheduling-based solutions are inefficient for this setting, where small data…

Information Theory · Computer Science 2022-02-18 Federico Clazzer , Alexandre Graell i Amat

We study here the dynamics (and stability) of Probabilistic Population Protocols, via the differential equations approach. We provide a quite general model and we show that it includes the model of Angluin et. al. in the case of very large…

Distributed, Parallel, and Cluster Computing · Computer Science 2008-07-02 Ioannis Chatzigiannakis , Paul G. Spirakis

This paper analyzes the connection between the protocol and physical interference models in the setting of Poisson wireless networks. A transmission is successful under the protocol model if there are no interferers within a parameterized…

Information Theory · Computer Science 2016-09-20 Jeffrey Wildman , Steven Weber

We present a stochastic geometry-based model to investigate alternative medium access choices for LoRaWAN---a widely adopted low-power wide-area networking (LPWAN) technology for the Internet-of-things (IoT). LoRaWAN adoption is driven by…

Information Theory · Computer Science 2020-02-26 Luca Beltramelli , Aamir Mahmood , Patrik Österberg , Mikael Gidlund

In this paper we show that in a multiclass Markovian network with unit rate servers, the condition that the average load $\rho$ at every server is less than unity is indeed sufficient for the stability or positive recurrence for \emph{any}…

Networking and Internet Architecture · Computer Science 2010-06-24 Sayee C. Kompalli , Ravi R. Mazumdar

We study a dynamic allocation problem that arises in various scenarios where mobile clients joining and leaving the system have to communicate with static stations via radio transmissions. Restrictions are a maximum delay, or laxity,…

Data Structures and Algorithms · Computer Science 2018-03-06 Austin Halper , Miguel A. Mosteiro , Yulia Rossikova , Prudence W. H. Wong

In this article, we prove that a small random perturbation of dynamical system with multiple stable equilibria converges to a Markov chain whose states are neighborhoods of the deepest stable equilibria, under a suitable time-rescaling,…

Probability · Mathematics 2021-03-02 Fraydoun Rezakhanlou , Insuk Seo

Stability is a critical feature of distributed linear multi-input-multi-output systems. Global asymptotic stability usually can be guaranteed when using decentralised or distributed control architectures, if: (i) conservative controllers…

Optimization and Control · Mathematics 2018-03-06 Daniel O'Keeffe , Stefano Riverso , Laura Albiol-Tendillo , Gordon Lightbody

Supporting massive device transmission is challenging in Machine-to-Machine (M2M) communications. Particularly, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn causes high…

Information Theory · Computer Science 2012-08-16 Huasen Wu , Chenxi Zhu , Richard J. La , Xin Liu , Youguang Zhang

In this paper we study coordinated multipath routing at the flow-level in networks with routes of length one. As a first step the static case is considered, in which the number of flows is fixed. A clustering pattern in the rate allocation…

Optimization and Control · Mathematics 2009-10-27 Sarah Lilienthal , Michel Mandjes

Random Access (RA) Medium Access (MAC) protocols are simple and effective when the nature of the traffic is unpredictable and random. In the following paper, a novel RA protocol called Enhanced Contention Resolution ALOHA (ECRA) is…

Information Theory · Computer Science 2012-11-22 Federico Clazzer , Christian Kissling

We focus on a system in which a set of two-state Markov sources report status update to a common receiver over a shared wireless channel. Inspired by practical IoT networks, we consider three variations of ALOHA as medium access protocol:…

Information Theory · Computer Science 2023-08-14 Andrea Munari

Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve per- formance competitive with that of orthogonal schemes. So far…

Information Theory · Computer Science 2017-07-03 Federico Clazzer , Enrico Paolini , Iacopo Mambelli , Cedomir Stefanovic

Non-orthogonal multiple access (NOMA) has been considered as a promising solution for improving the spectrum efficiency of next-generation wireless networks. In this paper, the performance of a p-persistent slotted ALOHA system in support…

Networking and Internet Architecture · Computer Science 2020-02-25 Ziru Chen , Yong Liu , Sami Khairy , Lin X. Cai , Yu Cheng , Ran Zhang