Computational complexity of relay placement in sensor networks

Authors:
Jukka Suomela
Affiliations:
Helsinki Institute for Information Technology HIIT, Basic Research Unit, Department of Computer Science, University of Helsinki, Finland
Venue:
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Year:
2006

Citing 8
Cited 9

Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Guest Editors' Introduction: Overview of Sensor Networks

Computer
Exact and approximate balanced data gathering in energy-constrained sensor networks

Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Energy concerns in wireless networks

IEEE Wireless Communications
Routing techniques in wireless sensor networks: a survey

IEEE Wireless Communications
Propagation measurements and models for wireless communications channels

IEEE Communications Magazine

Approximating relay placement in sensor networks

Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Design of sensor networks with guaranteed connectivity and lifetime

WICON '07 Proceedings of the 3rd international conference on Wireless internet
A genetic algorithm based approach for energy efficient routing in two-tiered sensor networks

Ad Hoc Networks
On Performance of Node Placement Approaches for Hierarchical Heterogeneous Sensor Networks

Mobile Networks and Applications
Relay node placement with energy and buffer constraints in wireless sensor networks using mobile data collector

International Journal of Sensor Networks
An efficient clusterhead placement for hybrid sensor networks

ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Fast track article: Designing hierarchical sensor networks with mobile data collectors

Pervasive and Mobile Computing
A new architecture for hierarchical sensor networks with mobile data collectors

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Positioning Algorithms by Information Fusion in Wireless Sensor Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the computational complexity of relay placement in energy-constrained wireless sensor networks. The goal is to optimise balanced data gathering, where the utility function is a weighted sum of the minimum and average amounts of data collected from each sensor node. We define a number of classes of simplified relay placement problems, including a planar problem with a simple cost model for radio communication. We prove that all of these problem classes are NP-hard, and that in some cases even finding approximate solutions is NP-hard.