The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we consider the backpressure-based control for wireless multihop networks with time-correlated arrivals. The arrival process considered in this work is fairly general in the sense that it may exhibit long-range dependence depending on the asymptotic shape of the autocorrelation function. We first show that the original backpressure policy is still throughput-optimal even with correlated...
In this work, we address the joint problem of traffic scheduling and interference management related to the deployment of Small Cell Networks (SCNs). The Base Stations of the SCNs (which we will refer to as Micro Base Stations, MBSs) are low power devices with limited buffer size. They are connected to a Central Scheduler (CS) with limited capacity backhaul links. In this scenario, traffic has to...
This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known, and all control decisions are based on information provided by ACK/NACK feedback from past transmissions. This system can be viewed as a restless multi-armed bandit problem with a concave objective function of the time average reward...
This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints. Although the celebrated backpressure algorithm maximizes throughput,...
This paper presents a study on achievable throughput in wireless multihop networks with unicast flows that use XOR-like network coding. A joint routing, scheduling, and network coding problem is formulated under a realistic signal to interference plus noise ratio interference model. This formulation provides a mathematical framework to study the achievable throughput of a given wireless network for...
This paper studies the problem of interference-free broadcast in wireless ad hoc networks. In particular, we are interested in asymmetric power assignments so that the induced broadcast communication graph is both, energy efficient and has a short collision-free broadcast schedule. We consider both random and deterministic node layouts and develop four different broadcast schemes with provable performance...
Using mobile elements as mechanical carriers of data has been shown to be an effective way of prolonging sensor network lifetime and of relaying data in partitioned networks. The existing literature has mostly focused on designing delay minimizing routes for the mobile elements by leveraging variants of the Traveling Salesman Problem (TSP). We show that TSP-based routes can in fact result in data...
A low-latency, accurate RFID counting scheme can be used as a fundamental building block to support more elaborated RFID query operations. RFID counting algorithms of such nature have been proposed recently by Kodialam et. al. [2], [3]. One distinct feature of these schemes is that they do not require the reader to explicitly identify individual tags and thus can help to preserve privacy of the RFID...
MaxWeight scheduling has gained enormous popularity as a powerful paradigm for achieving queue stability and maximum throughput in a wide variety of scenarios. The maximum-stability guarantees however rely on the fundamental premise that the system consists of a fixed set of flows with stationary ergodic traffic processes. In the present paper we examine networks where the population of active flows...
There has been considerable recent work developing a new stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open problem has been the development of utility-optimal algorithms that are also delay efficient. In this paper, we show that the Backpressure algorithm, when combined with the LIFO queueing discipline (called LIFO-Backpressure),...
Scheduling for multi-channel (e.g., OFDM-based) wireless downlink systems is considered with the objective of providing low delay performance to users with real-time and stochastic traffic. The main contribution is the design of a low-complexity scheduling algorithm for the system with desired performance (in a large deviations sense). In particular, as the number of users and channels grows, the...
This paper considers the following network computation problem: n nodes are placed on a √n×√n grid, each node is connected to every other node within distance r(n) from itself, and is given an arbitrary input bit. Nodes communicate with each other so that finally a designated sink node can compute a target function f of the input bits. We focus on computing the identity function and the class of symmetric...
Recent advances in PHY layer design demonstrated efficient self-interference cancellation and full-duplex in a single band. Building a MAC that exploits self-interference cancellation is a challenging task. Links can be scheduled concurrently, but only if they either (i) don't interfere or (ii) allow for self-interference cancellation. Two issues arise: Firstly, it is difficult to construct a schedule...
We study the throughput region of random access in coded wireless packet networks. We propose a distributed and robust fixed point algorithm that determines whether given coded information flow requirements are feasible with random access and computes the minimal required attempt probabilities supporting these requirements. Combined with linear coding subgraph and flow optimization, this yields a...
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 access of the medium and the time is slotted. The relay node stores a source packet that it receives successfully in its queue when the transmission to the destination...
We investigate the problem of minimizing the sum of the queues of all the nodes in a wireless network with a tree topology. Nodes send their packets to the tree's root (sink). We consider a time-slotted system, and a primary interference model. We first consider the case where the root has only one child while the rest of the tree is arbitrary, and provide a causal sample-path delay optimal scheduling...
The rapid growth of wireless content access implies the need for content placement and scheduling at wireless base stations. We study a system under which clients are divided into clusters based on their channel conditions, and their requests are represented by different queues at logical frontends. Requests might be elastic (implying no hard delay constraint) or inelastic (requiring that a delay...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.