English
Related papers

Related papers: Minimizing Total Interference in Asymmetric Sensor…

200 papers

We study the problem of interference management in fast fading wireless networks, in which the transmitters are only aware of network topology. We consider a class of retransmission-based schemes, where transmitters in the network are only…

Information Theory · Computer Science 2015-02-12 Navid Naderializadeh , Aly El Gamal , A. Salman Avestimehr

Transmit beamforming is a versatile technique for signal transmission from an array of $N$ antennas to one or multiple users [1]. In wireless communications, the goal is to increase the signal power at the intended user and reduce…

Information Theory · Computer Science 2014-07-22 Emil Björnson , Mats Bengtsson , Björn Ottersten

We describe a new approach for dealing with the following central problem in the self-organization of a geometric sensor network: Given a polygonal region R, and a large, dense set of sensor nodes that are scattered uniformly at random in…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Michael Kaufmann , Alexander Kroeller , Katharina Lehmann

We study problems related to connecting multi-interface networks of wireless devices. These problems are modeled using graphs, where vertices represent the devices and edges represent potential communication links. Each vertex can activate…

Data Structures and Algorithms · Computer Science 2026-05-11 Michał Szyfelbein , Camille Richer

We consider the scheduling of arbitrary wireless links in the physical model of interference to minimize the time for satisfying all requests. We study here the combined problem of scheduling and power control, where we seek both an…

Networking and Internet Architecture · Computer Science 2011-04-19 Magnus M. Halldorsson

In this paper, the optimal spectral efficiency (data rate divided by the message bandwidth) that minimizes the probability of causing disruptive interference for ad hoc wireless networks or cognitive radios is investigated. Two basic…

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

By using different interface adapters for different methods, it is possible to construct a maximally covering web of interface adapters which incurs minimum loss during interface adaptation. We introduce a polynomial-time algorithm that can…

Software Engineering · Computer Science 2010-12-01 Yoo Chung , Dongman Lee

In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed in some area, we seek to build a directed strongly connected…

Discrete Mathematics · Computer Science 2015-05-13 Chen Avin , Zvi Lotker , Francesco Pasquale , Yvonne-Anne Pignolet

We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…

Information Theory · Computer Science 2011-08-09 Urs Niesen

In this paper, we analyze various critical transmitting/sensing ranges for connectivity and coverage in three-dimensional sensor networks. As in other large-scale complex systems, many global parameters of sensor networks undergo phase…

Data Structures and Algorithms · Computer Science 2007-05-23 Vlady Ravelomanana

We propose an algorithm for the Wireless Sensor Network localization problem, which is based on the well-known algorithmic framework of Alternating Minimization. We start with a non-smooth and non-convex minimization, and transform it into…

Networking and Internet Architecture · Computer Science 2020-12-30 Eyal Gur , Shoham Sabach , Shimrit Shtern

Assuming a random uniform distribution of n sensor nodes over a virtual grid, this paper addresses the problem of finding the maximum number of connected set covers each ensuring 100% coverage of the query region. The connected sets remain…

Networking and Internet Architecture · Computer Science 2014-02-14 Dibakar Saha , Nabanita Das

We define a multiaccess communication scheme that effectively eliminates interference and resolves collisions in many-to-one and many-to-many communication scenarios. Each transmitter is uniquely identified by a steering vector. All signals…

Networking and Internet Architecture · Computer Science 2017-03-02 Naeem Akl , Ahmed Tewfik

In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mechanisms. Wireless mesh networks usually intensively deploy…

Networking and Internet Architecture · Computer Science 2010-07-15 Hung-Chin Jang

Interference-aware resource allocation of time slots and frequency channels in single-antenna, halfduplex radio wireless sensor networks (WSN) is challenging. Devising distributed algorithms for such task further complicates the problem.…

Information Theory · Computer Science 2017-03-21 Panos N. Alevizos , Efthymios A. Vlachos , Aggelos Bletsas

Wireless sensor networks are normally characterized by resource challenged nodes. Since communication costs the most in terms of energy in these networks, minimizing this overhead is important. We consider minimum length node scheduling in…

Networking and Internet Architecture · Computer Science 2013-01-24 K. Shashi Prabh

Recent results establish the optimality of interference alignment to approach the Shannon capacity of interference networks at high SNR. However, the extent to which interference can be aligned over a finite number of signalling dimensions…

Information Theory · Computer Science 2016-11-17 Krishna Gomadam , Viveck R. Cadambe , Syed A. Jafar

In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to…

Networking and Internet Architecture · Computer Science 2016-11-18 Tung-Wei Kuo , Kate Ching-Ju Lin , Ming-Jer Tsai

We address the problem of interference management and power control in terms of maximization of a general utility function. For the utility functions under consideration, we propose a power control algorithm based on a fixed-point…

Information Theory · Computer Science 2012-11-13 Ehsan Karamad , Raviraj Adve , Jerry Chow

We study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition (or \emph{schedule}) the links into the minimum number of slots, each satisfying…

Data Structures and Algorithms · Computer Science 2014-05-02 Magnus M. Halldorsson , Pradipta Mitra