Approximating relay placement in sensor networks
In: 3rd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, 2-6 October 2006, Torremolinos, Spain.
The problem of placing relay nodes in a wireless sensor network is studied in the context of balanced data gathering. Previous work is extended by showing that even the simplest classes of the relay placement problem are hard to approximate. This work also presents a heuristic method for both lower-bounding and upper-bounding the maximum performance of a sensor network over all possible relay locations.
|EPrint Type:||Conference or Workshop Item (Paper)|
|Project Keyword:||Project Keyword UNSPECIFIED|
|Subjects:||Theory & Algorithms|
|Deposited By:||Jukka Suomela|
|Deposited On:||22 October 2006|