Related papers: Q-CSMA: Queue-Length Based CSMA/CA Algorithms for …
In this paper, we study stability and latency of routing in wireless networks where it is assumed that no collision will occur. Our approach is inspired by the adversarial queuing theory, which is amended in order to model wireless…
This paper is motivated by the observation that the average queueing delay can be decreased by sacrificing power efficiency in wireless communications. In this sense, we naturally wonder what is the minimum queueing delay when the available…
Carrier Sense Multiple Access (CSMA) MAC protocols are known to suffer from the hidden station (HS) problem. The complete mathematical analysis of CSMA networks with HSs is still an open problem, even for broadcast communication with a…
This paper has been withdrawn because of some paper issues. Recent studies on MAC scheduling have shown that carrier sense multiple access (CSMA) can be controlled to be achieve optimality in terms of throughput or utility. These results…
In this paper, we propose a novel adaptive carrier sense multiple access scheme with collision avoidance (CSMA/CA) to perform efficient and reliable data transfer with increased throughput across multiple coexisting wireless body area…
By integrating edge computing with parallel computing, distributed edge computing (DEC) makes use of distributed devices in edge networks to perform computing in parallel, which can substantially reduce service delays. In this paper, we…
We consider the delay properties of max-weight opportunistic scheduling in a multi-user ON/OFF wireless system, such as a multi-user downlink or uplink. It is well known that max-weight scheduling stabilizes the network (and hence yields…
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…
Motivated by applications in machine learning and statistics, we study distributed optimization problems over a network of processors, where the goal is to optimize a global objective composed of a sum of local functions. In these problems,…
We study the problem of broadcasting packets in wireless networks. At each time slot, a network controller activates non-interfering links and forwards packets to all nodes at a common rate; the maximum rate is referred to as the broadcast…
In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling,…
This paper studies the distributed scheduling of traffic flows with arbitrary deadlines that arrive at their source nodes and are transmitted to different destination nodes via multiple intermediate nodes in a wireless mesh network. When a…
The scope of this work is twofold: On the one hand, strongly motivated by emerging engineering issues in multiple access communication systems, we investigate the performance of a slotted-time relay-assisted cooperative random access…
Existing works on distributed consensus explore linear iterations based on reversible Markov chains, which contribute to the slow convergence of the algorithms. It has been observed that by overcoming the diffusive behavior of reversible…
In low power wireless sensor networks, MAC protocols usually employ periodic sleep/wake schedule to reduce idle listening time. Even though this mechanism is simple and efficient, it results in high end-to-end latency and low throughput. On…
This article defines the QoS-guaranteed efficient cloudlet deploy problem in wireless metropolitan area network, which aims to minimize the average access delay of mobile users i.e. the average delay when service requests are successfully…
With the ever-growing demand for low-latency services in machine-to-machine (M2M) communications, the delay performance of random access networks has become a primary concern, which critically depends on the sensing capability of nodes. To…
In this paper, we investigate the effect of bursty traffic and random availability of caching helpers in a wireless caching system. More explicitly, we consider a general system consisting of a caching helper with its dedicated user in…
Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise…
Despite the rich literature on scheduling algorithms for wireless networks, algorithms that can provide deadline guarantees on packet delivery for general traffic and interference models are very limited. In this paper, we study the problem…