Related papers: Spatial random multiple access with multiple depar…
We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may…
In this paper, we mainly investigate an integrated system operating under a software defined network (SDN) protocol. SDN is a new networking paradigm in which network intelligence is centrally administered and data is communicated via…
We consider a multihop wireless system. There are multiple source-destination pairs. The data from a source may have to pass through multiple nodes. We obtain a channel scheduling policy which can guarantee end-to-end mean delay for the…
We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling…
In this paper, a cooperative protocol is investigated for a multi-hop network consisting of relays with buffers of finite size, which may operate in different communication modes. The protocol is based on the myopic decode-and-forward…
This paper addresses the problem of navigation control of a general class of 2nd order uncertain nonlinear multi-agent systems in a bounded workspace, which is a subset of $R^3$ , with static obstacles. In particular, we propose a…
We consider three kinds of discrete-time arrival processes: transient, intermediate and recurrent, characterized by a finite, possibly finite and infinite number of events, respectively. In this context, we study renewal processes which are…
In this article we introduce a new model to study stability in multi-hop wireless networks in the framework of adversarial queueing. In such a model, a routing protocol consists of three components: a transmission policy, a scheduling…
In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…
This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…
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…
We introduce a model for the classical synchronised multiple access system with a single transmission channel and a randomised transmission protocol (ALOHA). We assume in addition that there is an energy harvesting mechanism, and any…
We study the problem of distributed traffic control in the partitioned plane, where the movement of all entities (robots, vehicles, etc.) within each partition (cell) is coupled. Establishing liveness in such systems is challenging, but…
Inspired by distributed resource allocation problems in dynamic topology networks, we initiate the study of distributed consensus with finite messaging passing. We first find a sufficient condition on the network graph for which no…
In a bi-directional relay channel, a pair of nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has mostly considered information theoretic limits of the…
Despite the extensive use of a centralized approach to design receivers at the base station for massive multiple-input multiple-output (M-MIMO) systems, their actual implementation is a major challenge due to several bottlenecks imposed by…
In order to enable the sequential implementation of quantum information theoretic protocols in the continuous variable framework, we propose two schemes for resource reusability, resource-splitting protocol and unsharp homodyne…
In this paper, we consider a network of processors aiming at cooperatively solving mixed-integer convex programs subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
In this technical report, we analyze the performance of an interference-aware opportunistic relay selection protocol for multi-hop line networks which is based on the following simple rule: a node always transmits if it has a packet, except…
Modern random access protocols are emerging as an efficient yet simple solution for arising internet of things (IoT) applications in upcoming beyond-5G systems. In this context, both terrestrial and non-terrestrial scenarios can benefit…