English
Related papers

Related papers: On the stability of flow-aware CSMA

200 papers

A multiple access system with bursty data arrivals to the terminals is considered. The users are frame-synchronized, with variable sized packets independently arriving in each slot at every transmitter. Each packet needs to be delivered to…

Information Theory · Computer Science 2016-11-29 Sakshi Kapoor , Sreejith Sreekumar , Sibi Raj B Pillai

We study the stability of wireless networks under stochastic arrival processes of packets, and design efficient, distributed algorithms that achieve stability in the SINR (Signal to Interference and Noise Ratio) interference model.…

Networking and Internet Architecture · Computer Science 2012-10-18 Eyjolfur I. Asgeirsson , Magnus M. Halldorsson , Pradipta Mitra

We model, demonstrate and characterize Dispersion Code Multiple Access (DCMA) and hence show the applicability of this purely analog and real-time multiple access scheme to high-speed wireless communications. We first mathematically…

Information Theory · Computer Science 2017-03-31 Lianfeng Zou , Shulabh Gupta , Christophe Caloz

In this letter, we characterize the performance of broadcast approach with continuum of transmission layers in random wireless networks where the channel state information (CSI) is assumed to be known only at the receiver. By modeling the…

Information Theory · Computer Science 2019-04-09 Praful D. Mankar , Harpreet S. Dhillon

In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same…

Computer Science and Game Theory · Computer Science 2016-11-18 I. Tinnirello , L. Giarré , G. Neglia

Recently several CSMA algorithms based on the Glauber dynamics model have been proposed for multihop wireless scheduling, as viable solutions to achieve the throughput optimality, yet are simple to implement. However, their delay…

Networking and Internet Architecture · Computer Science 2013-08-01 Jaewook Kwak , Chul-Ho Lee , Do Young Eun

Wireless local area networks (WLAN) still suffer from a severe performance discrepancy between different users in the uplink. This is because of the spatially varying channel conditions provided by the wireless medium. Cooperative medium…

Information Theory · Computer Science 2009-11-04 Georg Böcherer

We consider a multichannel random access system in which each user accesses a single channel at each time slot to communicate with an access point (AP). Users arrive to the system at random and be activated for a certain period of time…

Signal Processing · Electrical Eng. & Systems 2021-05-11 Muhammad Sohaib , Jongjin Jeong , Sang-Woon Jeon

In this paper we address the problem of fully distributed assignment of users to sub-bands such that the sum-rate of the system is maximized. We introduce a modified auction algorithm that can be applied in a fully distributed way using an…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-12-31 Oshri Naparstek , Amir Leshem

Multi-group multicast (MGM) is an increasingly important form of multi-user wireless communications with several potential applications, such as video streaming, federated learning, safety-critical vehicular communications, etc.…

Signal Processing · Electrical Eng. & Systems 2024-09-27 Xinze Lyu , Sundar Aditya , Bruno Clerckx

This paper has been withdrawn by arXiv. arXiv admin note: author list truncated due to disputed authorship and content. This submission repeats large portions of text from this http URL by other authors. Duty cycle mode in WSN improves…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-04-30 Rajeev K. Shakya

The main cause of wasted energy consumption in wireless sensor networks is packet collision. The packet scheduling algorithm is therefore introduced to solve this problem. Some packet scheduling algorithms can also influence and delay the…

Networking and Internet Architecture · Computer Science 2011-10-10 C. Jandaeng , W. Suntiamontut , N. Elz

In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…

Information Theory · Computer Science 2015-03-19 Zhou Zhang , Hai Jiang

In this paper, we consider safety message transmission in a dense vehicular network. With increasing vehicular network density, the collision rate increases when multiple vehicles transmit safety messages simultaneously. To address this…

Networking and Internet Architecture · Computer Science 2019-05-21 Shenglong Peng , Xuan He , Junyi Du , Yong Liang Guan , Liang Zhou

Compact Ultramassive Antenna Array (CUMA) is a pioneering paradigm that leverages the flexibility of the Fluid Antenna System (FAS) to enable a simple multiple access scheme for massive connectivity without the need for precoding, power…

CSMA/ECA is a contention protocol that makes it possible to construct a collision-free schedule by using a deterministic backoff after successful transmissions. In this paper, we further enhance the CSMA/ECA protocol with two properties…

Networking and Internet Architecture · Computer Science 2013-02-08 Luis Sanabria-Russo , Jaume Barcelo , Boris Bellalta

Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, $\xi$, and then combine them into frames of uniform…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-03-26 Thomas Petig , Elad M. Schiller , Philippas Tsigas

We demonstrate a technique for ultrastable optical frequency dissemination in a branching passive optical network using code-division multiple access (CDMA). In our protocol, each network user employs a unique pseudo-random sequence to…

Code-division multiple-access (CDMA) has the potential to support traffic sources with a wide range of quality of service (QoS) requirements. The traffic carrying capacity of CDMA channels under QoS constraints (such as delay guarantee) is,…

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

Consider a wireless network of n nodes represented by a graph G=(V, E) where an edge (i,j) models the fact that transmissions of i and j interfere with each other, i.e. simultaneous transmissions of i and j become unsuccessful. Hence it is…

Networking and Internet Architecture · Computer Science 2011-04-14 Devavrat Shah , Jinwoo Shin , Prasad Tetali