PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Computational complexity of relay placement in sensor networks
Jukka Suomela
In: SOFSEM 06, 21-27 Jan 2006, Merin, Czech Republic.

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 amount 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 approximative solutions is NP-hard.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:1150
Deposited By:Jukka Suomela
Deposited On:14 November 2005