Related papers: Analysis of Non-Persistent CSMA Protocols with Exp…
This paper addresses the stability and queueing delay of Space Division Multiple Access (SDMA) systems with bursty traffic, where zero-forcing beamforming enables simultaneous transmission to multiple mobiles. Computing beamforming vectors…
We consider a wireless network where each flow (instead of each link) runs its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically, each flow attempts to access the radio channel after some random time and transmits a packet if…
In this paper, we investigate centralized scheduling strategies for cooperative incremental redundancy retransmissions in the slow-fading half-duplex multiple access multiple relay channel. Time Division Multiple Access is assumed for the…
Collisions are a main cause of throughput degradation in Wireless LANs. The current contention mechanism for these networks is based on a random backoff strategy to avoid collisions with other transmitters. Even though it can reduce the…
The strength of carrier-sense multiple access with collision avoidance (CSMA/CA) can be combined with that of time-division multiple access (TDMA) to enhance the channel access performance in wireless networks such as the IEEE…
CSMA/CA networks have often been analyzed using a stylized model that is fully characterized by a vector of back-off rates and a conflict graph. Further, for any achievable throughput vector $\vec \theta$ the existence of a unique vector…
Contention-based wireless channel access methods like CSMA and ALOHA paved the way for the rise of the Internet of Things in industrial applications (IIoT). However, to cope with increasing demands for reliability and throughput, several…
In this paper, we study the stability of two interacting queues under random multiple access in which the queues leverage the feedback information. We derive the stability region under random multiple access where one of the two queues…
We analytically study a carrier sense multiple access (CSMA)-based network. In the network, the nodes have their own average throughput demands for transmission to a common base station. The CSMA is based on the request-to-send…
In this paper we prove Aldous's conjecture from 1987 that there is no backoff protocol that is stable for any positive arrival rate. The setting is a communication channel for coordinating requests for a shared resource. Each user who wants…
In this report, we study the packet delay as a QoS metric in CR systems. The packet delay includes the queue waiting time and the service time. In this work, we study the effect of both the scheduling and the power allocation algorithms on…
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,…
Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, we study the achievable…
Motivated by the demand of reliable and low latency communications, we employ tools from information theory, stochastic processes and queueing theory, in order to provide a comprehensive framework regarding the analysis of a Time Division…
We consider a dynamic server allocation problem over parallel queues with randomly varying connectivity and server switchover delay between the queues. At each time slot the server decides either to stay with the current queue or switch to…
In this paper we describe a network coding scheme for the Broadcast Erasure Channel with multiple unicast stochastic flows, in the case of a single source transmitting packets to $N$ users, where per-slot feedback is fed back to the…
Resource allocation in wireless networks typically occurs at PHY/MAC layers, while random network coding (RNC) is a network layer strategy. An interesting question is how resource allocation mechanisms can be tuned to improve RNC…
Communication protocols and techniques are often evaluated using simulation techniques. However, the use of formal modeling and analysis techniques for verification and evaluation in particular for Wireless Sensor Networks (WSN) becomes a…
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…
In this paper continuity theorems are established for the number of losses during a busy period of the $M/M/1/n$ queue. We consider an $M/GI/1/n$ queueing system where the service time probability distribution, slightly different in a…