Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(14)
Ad Hoc Network
Data Model
Geometric Graph
Graph Model
Greedy Heuristic
Indexing Terms
Minimum Spanning Tree
Physical Model
Power Consumption
Sensor Network
Signal To Noise Ratio
Topology Control
Signal To Interference Noise Ratio
Wireless Sensor Network
Subscribe
Academic
Publications
The Complexity of Minimizing ReceiverBased and SINR Edge Interference
The Complexity of Minimizing ReceiverBased and SINR Edge Interference,10.1109/ICCCN.2011.6006021,Trac N. Nguyen,Min K. An,Nhat X. Lam,D. T. Huynh
Edit
The Complexity of Minimizing ReceiverBased and SINR Edge Interference
BibTex

RIS

RefWorks
Download
Trac N. Nguyen
,
Min K. An
,
Nhat X. Lam
,
D. T. Huynh
Topology control
has been used to minimize in terference or to reduce
power consumption
while maintaining connectivity in wireless ad hoc and sensor networks (WSNs) (which are represented as undirected graphs). In the graph model, the interference experienced by an edge in a WSN has been defined in at least two different ways: the senderbased and receiverbased interference models. These models have been extensively studied in the literature although the receiverbased model has received more attention. Recently, several researchers have started investigating interference in the more realistic
physical model
which is known as the SignaltoInterference NoiseRatio (SINR) model. The SINR model better reflects the real environment than the receiverbased or senderbased graph models. In this paper, we study the problem of assigning power to nodes in the plane to yield a connected network of minimum edge interference in the receiverbased (RBMEI) as well as the SINR models (SINRMEI). We show that RBMEI is NPcomplete for geometric graphs. For SINRMEI, NPcompleteness holds for planar geometric graphs. We also propose some simple greedy heuristics based on the
minimum spanning tree
approach, and study their performance through simulation. Index Termsâ€”Topology control, interference, connectivity, NP Completeness, SignaltoInterferenceNoiseRatio, receiverbased, heuristic, geometric graph.
Conference:
International Conference on Computer Communications and Networks  ICCCN
, pp. 17, 2011
DOI:
10.1109/ICCCN.2011.6006021
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
References
(20)
Network Lifetime and Power Assignment in ad hoc Wireless Networks
(
Citations: 67
)
Gruia Calinescu
,
Sanjiv Kapoor
,
Alexander Olshevsky
,
Alexander Zelikovsky
Conference:
European Symposium on Algorithms  ESA
, pp. 114126, 2003
EnergyEfficient Wireless Network Design
(
Citations: 15
)
Ioannis Caragiannis
,
Christos Kaklamanis
,
Panagiotis Kanellopoulos
Journal:
Theory of Computing Systems / Mathematical Systems Theory  MST
, vol. 39, no. 5, pp. 593617, 2006
Power consumption in packet radio networks
(
Citations: 257
)
Lefteris M. Kirousis
,
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
Journal:
Theoretical Computer Science  TCS
, vol. 243, no. 12, pp. 289305, 2000
Analysis of a conebased distributed topology control algorithm for wireless multihop networks
(
Citations: 252
)
Li Li
,
Joseph Y. Halpern
,
Paramvir Bahl
,
YiMin Wang
,
Roger Wattenhofer
Conference:
Symposium on Principles of Distributed Computing  PODC
, pp. 264273, 2001
The Range Assignment Problem in Static AdHoc Networks on Metric Spaces
(
Citations: 6
)
Deshi Ye
,
Hu Zhang
Conference:
Colloquium on Structural Information & Communication Complexity  SIROCCO
, pp. 291302, 2004