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 study the delay performance of wireless network considering different resource allocation schemes with single-hop traffic. Existing works studying the delay performance only consider a given resource allocation scheme, either multi-channel system (sharing bandwidth) or time slotted system (sharing time). The fundamental question ignored is which type of resource allocation scheme...
There is a need for military and commercial wireless radio networks that can operate in dynamic environments while supporting high spectral efficiency with throughput guarantees and low latency. This is particularly challenging in wireless mobile ad-hoc networks (MANET). Multiuser detection (MUD) technology promises to address these needs. But most research in MUD technology to date has focused on...
When designing distributed wireless networks utilizing shared bandwidth, a critical issue is allocating spatial and temporal resources to streaming information flows. We focus on large networks of half-duplex terminals sharing common bandwidth, and study methods for allocating resources on a fine-grained temporal basis, with specific emphasis on managing the interactions between streams of packets...
Recent advances in the physical layer have enabled the simultaneous reception of multiple packets by a node in wireless networks. In this paper, we present a generalized model for the throughput optimization problem in multi-hop wireless networks that support multi-packet reception (MPR) capability. The model incorporates the multi-access channel, which accurately accounts for the achievable capacity...
With K-hop interference model, especially when K ≥ 2, the throughput-optimal centralized scheduler needs to solve a NP-Hard problem. It leads to the desire of a distributed, low-complexity but throughput-optimal scheduling algorithm. We generalize a randomized scheduling framework for a K-hop interference model and develop two randomized distributed scheduling algorithms which can be integrated into...
This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop networks. While it is believed that CSMA-CA performs significantly worse than optimal, this belief is usually based on experiments that use rate allocation mechanisms which grossly underutilize the available capacity that random...
Fairness index among competing hosts in communication networks is an important system measurement. Several fairness index measurements have been proposed in the technical literature. However, most of these measurements, such as the max/min fairness index and Jain's index, reflect only a long-term average fairness of the system. Instantaneous fairness property has not been captured. In this paper,...
Many next generation applications (such as video flows) are likely to have associated minimum data rate requirements to ensure satisfactory quality as perceived by end-users. While there have been prior approaches on supporting quality-of-service (QoS) in mesh networks, they have largely ignored the issues that arise due to self-interference, the interference between different link layer transmissions...
We consider throughput-optimal power allocation in multi-hop wireless networks. The study of this problem has been limited due to the non-convexity of the underlying optimization problems, that prohibits an efficient solution even in a centralized setting. We take a randomization approach to deal with this difficulty. To this end, we generalize the randomization framework originally proposed for input...
Wireless mesh networking is a promising technology for building broadband wireless access networks. However, wireless mesh networks based on CSMA/CA MAC protocols suffer from unfairness and poor QoS support. Using TCP as a rate control mechanism in such networks further exacerbates the problem. Efficient rate allocation and scheduling algorithms that handle both multicast and unicast traffic in wireless...
Recent research indicates that multi-hop wireless networks can suffer from extreme imbalances in the throughput achieved by simultaneous competing flows. We address this problem by designing a practical distributed algorithm to compute a time-slot based schedule that provides end-to-end max-min fairness. Our system uses randomized priorities based on local weights to arbitrate access between nodes...
Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the nodes. Among the many reasons behind the importance of efficiently determining the membership of an arbitrary rate vector in the feasibility region, is its high relevance in optimal cross layer design. A key feature in a wireless...
We consider the problem of two wireless networks operating on the same (presumably unlicensed) frequency band. Pairs within a given network cooperate with one another, but between networks there is competition for spectrum. To make the problem tractable, we assume transmissions are scheduled according to a random access protocol where each network chooses an access probability for its users. In this...
We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the randomized scheduler to account for potential errors in its operation. These imperfections enable the design of a large class of low-complexity and distributed implementations for different interference models. We study the effect of such...
An optimal resource utilization framework to analyze the impact of end-to-end delay thresholds on the wireless network throughput is developed. In contrast to conventional networks where lumped transmission and queuing delays are used to model the end-to-end delay, the proposed framework models these delay components separately to analyze their relative contribution to the end-to-end delay when stringent...
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.