부산대학교 도서관

We propose a new heuristic for deterministic deployment of wireless sensor networks when 1-connectivity and minimum cost are the two competing objectives. Given a set of data sources and a base station, our aim is to introduce the minimum number of relays to the network so that every sensor is connected to the base station via some multihop path. We assume that the data sources and base station lie in a plane, and that every sensor and relay has the same fixed communication radius. Our heuristic is based on the GEOSTEINER algorithms for the Steiner minimal tree problem, and proves to be much more accurate than the current best heuristics for the 1-connected deployment problem, especially in the case of sparse data source distributions. [ABSTRACT FROM AUTHOR]