English
Related papers

Related papers: Interference Minimization in Asymmetric Sensor Net…

200 papers

The problem of computing a connected network with minimum interference is a fundamental problem in wireless sensor networks. Several models of interference have been studied in the literature. The most common model is the receiver-centric,…

Computational Geometry · Computer Science 2020-04-21 A. Karim Abu-Affash , Paz Carmi , Matthew J. Katz

We consider the following interference model for wireless sensor and ad hoc networks: the receiver interference of a node is the number of transmission ranges it lies in. We model transmission ranges as disks. For this case we show that…

Networking and Internet Architecture · Computer Science 2011-10-11 Kevin Buchin

Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to assign a transmission power to each node of a network such that the network is connected and at the same time the maximum of accumulated…

Data Structures and Algorithms · Computer Science 2011-07-22 Hakob Aslanyan

The interference at a wireless node s can be modelled by the number of wireless nodes whose transmission ranges cover s. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius…

Computational Geometry · Computer Science 2011-11-30 Majid Khabbazian , Stephane Durocher , Alireza Haghnegahdar

This paper examines the problem of assigning a transmission power to every node of a wireless sensor network. The goal is to minimize the total power consumption while ensuring that the resulting communication graph is connected. We focus…

Data Structures and Algorithms · Computer Science 2016-05-09 Stefan Hoffmann , Egon Wanke

Consider a MIMO interference channel whereby each transmitter and receiver are equipped with multiple antennas. The basic problem is to design optimal linear transceivers (or beamformers) that can maximize system throughput. The recent work…

Information Theory · Computer Science 2010-09-20 Meisam Razaviyayn , Maziar Sanjabi , Zhi-Quan Luo

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

An important problem in wireless sensor networks is to find the minimal number of randomly deployed sensors making a network connected with a given probability. In practice sensors are often deployed one by one along a trajectory of a…

Information Theory · Computer Science 2009-10-10 V. Kurlin , L. Mihaylova

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully…

Artificial Intelligence · Computer Science 2010-11-09 Seyed Hossein Khasteh , Saeid Bagheri Shouraki , Ali Akbar Kiaei

The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments in sensor networks. A line segment ` is said…

Computational Geometry · Computer Science 2017-11-16 Dinesh Dash , Arijit Bishnu , Arobinda Gupta , Subhas C. Nandy

A central problem in analog wireless sensor networks is to design the gain or phase-shifts of the sensor nodes (i.e. the relaying configuration) in order to achieve an accurate estimation of some parameter of interest at a fusion center, or…

Signal Processing · Electrical Eng. & Systems 2019-08-05 Shahin Khobahi , Mojtaba Soltanalian , Feng Jiang , A. Lee Swindlehurst

Consider $n$ sensors whose positions are represented by $n$ uniform, independent and identically distributed random variables assuming values in the open unit interval $(0,1)$. A natural way to guarantee connectivity in the resulting sensor…

Computational Geometry · Computer Science 2010-07-14 Evangelos Kranakis , Danny Krizanc , Pat Morin , Lata Narayanan , Ladislav Stacho

We consider a topology control problem in which we are given a set of $n$ sensors in the plane and we would like to assign a communication radius to each of them. The radii assignment must generate a strongly connected network and have low…

Computational Geometry · Computer Science 2012-07-02 Matias Korman

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

Given a set ${\cal V}$ of $n$ sensor node distributed on a 2-dimensional plane and a source node $s \in {\cal V}$, the {\it interference problem} deals with assigning transmission range to each $v \in {\cal V}$ such that the members in…

Networking and Internet Architecture · Computer Science 2012-07-25 Pragya Agrawal , Gautam K. Das

Interference limits performance in wireless networks, and cooperation among receivers or transmitters can help mitigate interference by forming distributed MIMO systems. Earlier work shows how limited receiver cooperation helps mitigate…

Information Theory · Computer Science 2010-05-03 I-Hsiang Wang , David N. C. Tse

Coverage is one of the fundamental issues in wireless sensor networks (WSNs). It reflects the ability of WSNs to detect the fields of interest. In a real sensor networks application, the detection area is always non-ideal and the terrain of…

Networking and Internet Architecture · Computer Science 2013-12-25 Lin Feng , Tie Qiu , Zhenlong Sun , Feng Xia , Yu Zhou

A wireless network's design must include the optimization of the area of coverage of its wireless transmitters - mobile and base stations in cellular networks, wireless access points in WLANs, or nodes on a transmit schedule in a wireless…

Networking and Internet Architecture · Computer Science 2016-04-01 Prateek Kapadia

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 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
‹ Prev 1 2 3 10 Next ›