English
Related papers

Related papers: A note on uniform power connectivity in the SINR m…

200 papers

In the light of energy conservation and the expansion of existing networks, wireless networks face the challenge of nodes with heterogeneous transmission power. However, for more realistic models of wireless communication only few…

Data Structures and Algorithms · Computer Science 2014-04-29 Fabian Fuchs , Dorothea Wagner

We study the stability of wireless networks under stochastic arrival processes of packets, and design efficient, distributed algorithms that achieve stability in the SINR (Signal to Interference and Noise Ratio) interference model.…

Networking and Internet Architecture · Computer Science 2012-10-18 Eyjolfur I. Asgeirsson , Magnus M. Halldorsson , Pradipta Mitra

The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signal-to-interference & noise ratio (SINR) model. For a collection of simultaneously transmitting stations…

Networking and Internet Architecture · Computer Science 2008-12-10 Chen Avin , Yuval Emek , Erez Kantor , Zvi Lotker , David Peleg , Liam Roditty

In this paper we consider the problem of communication scheduling in wireless networks with respect to the SINR(Signal to Interference plus Noise Ratio) constraint in metric spaces. The nodes are assigned linear powers, i.e. for each sender…

Networking and Internet Architecture · Computer Science 2011-07-26 Tigran Tonoyan

We consider a set of transmitters broadcasting simultaneously on the same frequency under the SINR model. Transmission power may vary from one transmitter to another, and a transmitter's signal strength at a given point is modeled by the…

Computational Geometry · Computer Science 2019-09-16 Boris Aronov , Gali Bar-On , Matthew J. Katz

Previous studies of connectivity in wireless networks have focused on undirected geometric graphs. More sophisticated models such as Signal-to-Interference-and-Noise-Ratio (SINR) model, however, usually leads to directed graphs. In this…

Information Theory · Computer Science 2007-12-18 Zhenning Kong , Edmund M. Yeh

In this paper we study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received power of a signal at a receiver against the sum of strengths…

Data Structures and Algorithms · Computer Science 2011-03-25 Erez Kantor , Zvi Lotker , Merav Parter , David Peleg

Efficient use of a wireless network requires that transmissions be grouped into feasible sets, where feasibility means that each transmission can be successfully decoded in spite of the interference caused by simultaneous transmissions.…

Networking and Internet Architecture · Computer Science 2014-11-06 Magnus M. Halldorsson , Tigran Tonoyan

A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…

Information Theory · Computer Science 2016-11-17 Rahul Vaze

We give efficient algorithms for the fundamental problems of Broadcast and Local Broadcast in dynamic wireless networks. We propose a general model of communication which captures and includes both fading models (like SINR) and graph-based…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-05-10 Magnus M. Halldorsson , Tigran Tonoyan , Yuexuan Wang , Dongxiao Yu

The signal-to-interference-and-noise ratio (SINR) is of key importance for the analysis and design of wireless networks. For addressing new requirements imposed on wireless communication, in particular high availability, a highly accurate…

Networking and Internet Architecture · Computer Science 2016-11-17 David Oehmann , Ahmad Awada , Ingo Viering , Meryem Simsek , Gerhard P. Fettweis

An asymptotic technique is developed to find the Signal-to-Interference-plus-Noise-Ratio (SINR) and spectral efficiency of a link with N receiver antennas in wireless networks with non-homogeneous distributions of nodes. It is found that…

Information Theory · Computer Science 2015-03-17 Siddhartan Govindasamy , Daniel W. Bliss

We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set…

Networking and Internet Architecture · Computer Science 2012-10-17 Magnus M. Halldorsson , Pradipta Mitra

In modern wireless networks, devices are able to set the power for each transmission carried out. Experimental but also theoretical results indicate that such power control can improve the network capacity significantly. We study this…

Networking and Internet Architecture · Computer Science 2010-08-27 Thomas Kesselheim

We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…

Networking and Internet Architecture · Computer Science 2018-03-14 Magnus M. Halldorsson , Guy Kortsarz , Pradipta Mitra , Tigran Tonoyan

A key challenge in wireless networking is the management of interference between transmissions. Identifying which transmitters interfere with each other is a crucial first step. In this paper we cast the task of estimating the a wireless…

Information Theory · Computer Science 2016-12-19 Jing Yang , Stark Draper , Robert Nowak

We study a fundamental measure for wireless interference in the SINR model known as (weighted) inductive independence. This measure characterizes the effectiveness of using oblivious power --- when the power used by a transmitter only…

Data Structures and Algorithms · Computer Science 2013-10-04 Magnus M. Halldorsson , Stephan Holzer , Pradipta Mitra , Roger Wattenhofer

We study the performance of wireless links for a class of Poisson networks, in which packets arrive at the transmitters following Bernoulli processes. By combining stochastic geometry with queueing theory, two fundamental measures are…

Information Theory · Computer Science 2020-07-22 Howard H. Yang , Tony Q. S. Quek , H. Vincent Poor

The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given is a set of links, each a sender-receiver pair located in a…

Data Structures and Algorithms · Computer Science 2012-03-15 Magnús Már Halldórsson , Pradipta Mitra

We consider protocols that serve communication requests arising over time in a wireless network that is subject to interference. Unlike previous approaches, we take the geometry of the network and power control into account, both allowing…

Networking and Internet Architecture · Computer Science 2012-03-07 Thomas Kesselheim
‹ Prev 1 2 3 10 Next ›