Approximating relay placement in sensor networks

Authors:
Jukka Suomela
Affiliations:
University of Helsinki, Finland
Venue:
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Year:
2006

Citing 4
Cited 2

Optimal algorithms for approximate clustering

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Exact and approximate balanced data gathering in energy-constrained sensor networks

Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Networking Wireless Sensors

Networking Wireless Sensors
Computational complexity of relay placement in sensor networks

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science

Wireless relay placement

RWS'09 Proceedings of the 4th international conference on Radio and wireless symposium
An algorithm for wireless relay placement

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.