Results 11  20
of
54
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
"... Abstract—We consider throughputoptimal power allocation in multihop wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying optimization problems, that prohibits an efficient solution even in a centralized setting. We take a randomization approach t ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract—We consider throughputoptimal power allocation in multihop wireless networks. The study of this problem has been limited due to the nonconvexity 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 queued switches to an SINR ratebased interference model. Further, we develop distributed power allocation and comparison algorithms that satisfy these conditions, thereby achieving (nearly) 100% throughput. We illustrate the performance of our proposed power allocation solution through numerical investigation and present several extensions for the considered problem. Index Terms—Power allocation, wireless scheduling, capacity region, graphbased interference model, SINR interference model. I.
Maximizing Capacity with Power Control under Physical Interference Model in Simplex Mode ⋆
"... Abstract. This paper addresses the join selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference model in the simplex mode. For the special setting in which all nodes have unlimited maximum transmission power, ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This paper addresses the join selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference model in the simplex mode. For the special setting in which all nodes have unlimited maximum transmission power, Kesselheim [8] developed an constant approximation algorithm. For the general setting in which all nodes have bounded maximum transmission power, the existence of constant approximation algorithm remains open. In this paper, we resolve this open problem by developing a constantapproximation algorithm for the general setting in which all nodes have bounded maximum transmission power. 1
The Power of NonUniform Wireless Power
, 2012
"... We study a fundamental measure for wireless interference in the SINR model when power control is available. This measure characterizes the effectiveness of using oblivious power — when the power used by a transmitter only depends on the distance to the receiver — as a mechanism for improving wireles ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We study a fundamental measure for wireless interference in the SINR model when power control is available. This measure characterizes the effectiveness of using oblivious power — when the power used by a transmitter only depends on the distance to the receiver — as a mechanism for improving wireless capacity. We prove optimal bounds for this measure, implying a number of algorithmic applications. An algorithm is provided that achieves — due to existing lower bounds — capacity that is asymptotically best possible using oblivious power assignments. Improved approximation algorithms are provided for a number of problems for oblivious power and for power control, including distributed scheduling, secondary spectrum auctions, wireless connectivity, and dynamic packet scheduling.
Approximation algorithms for wireless link scheduling with flexible data rates
 In ESA
, 2012
"... ar ..."
SINR Diagram with Interference Cancellation
"... This paper studies the reception zones of a wireless network in the SINR model with receivers that employ interference cancellation (IC). IC is a recently developed technique that allows a receiver to decode interfering signals, and cancel them from the received signal in order to decode its intende ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
This paper studies the reception zones of a wireless network in the SINR model with receivers that employ interference cancellation (IC). IC is a recently developed technique that allows a receiver to decode interfering signals, and cancel them from the received signal in order to decode its intended message. We first derive the important topological properties of the reception zones and their relation to highorder Voronoi diagrams and other geometric objects. We then discuss the computational issues that arise when seeking an efficient description of the zones. Our main fundamental result states that although potentially there are exponentially many possible cancellation orderings, and as a result, reception zones, in fact there are much fewer nonempty such zones. We prove a linear bound (hence tight) on the number of zones and provide a polynomial time algorithm to describe the diagram. Moreover, we introduce a novel parameter, the Compactness Parameter, which influences the tightness of our bounds. We then utilize these properties to devise a logarithmic time algorithm to answer pointlocation queries for networks with IC.
SINR Diagrams: Convexity and its Applications in Wireless Networks
, 2012
"... The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signaltointerference & noise ratio (SINR) model. For a collection of simultaneously transmitting stations in the plane, it is possible to identify a reception zone ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signaltointerference & noise ratio (SINR) model. For a collection of simultaneously transmitting stations in the plane, it is possible to identify a reception zone for each station, consisting of the points where its transmission is received correctly. The resulting SINR diagram partitions the plane into a reception zone per station and the remaining plane where no station can be heard. SINR diagrams appear to be fundamental to understanding the behavior of wireless networks, and may play a key role in the development of suitable algorithms for such networks, analogous perhaps to the role played by Voronoi diagrams in the study of proximity queries and related issues in computational geometry. So far, however, the properties of SINR diagrams have not been studied systematically, and most algorithmic studies in wireless networking rely on simplified graphbased models such as the unit disk graph (UDG) model, which conveniently abstract away interferencerelated complications, and make it easier to handle algorithmic issues, but consequently fail to capture accurately some important aspects of wireless networks.
Online independent set beyond the worstcase: Secretaries, prophets and periods
 In Proc. 41st Intl. Coll. Automata, Languages and Programming (ICALP
, 2014
"... ar ..."
(Show Context)
1 Understanding the Scheduling Performance in Wireless Networks with Successive Interference Cancellation
"... Abstract—Successive interference cancellation (SIC) is an effective way of multipacket reception to combat interference in wireless networks. We focus on link scheduling in wireless networks with SIC, and propose a layered protocol model and a layered physical model to characterize the impact of SIC ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract—Successive interference cancellation (SIC) is an effective way of multipacket reception to combat interference in wireless networks. We focus on link scheduling in wireless networks with SIC, and propose a layered protocol model and a layered physical model to characterize the impact of SIC. In both the interference models, we show that several existing scheduling schemes achieve the same order of approximation ratios, independent of whether or not SIC is available. Moreover, the capacity order in a network with SIC is the same as that without SIC. We then examine the impact of SIC from first principles. In both chain and cell topologies, SIC does improve the throughput with a gain between 20 % and 100%. However, unless SIC is properly characterized, any scheduling scheme cannot effectively utilize the new transmission opportunities. The results indicate the challenge of designing an SICaware scheduling scheme, and suggest that the approximation ratio is insufficient to measure the scheduling performance when SIC is available. KeywordsNetwork capacity; link scheduling; successive interference cancellation I.