Internet Archive Scholar

Deterministic Deployment of Wireless Sensor Networks *

M Brazil, C Ras, D Thomas
unpublished

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (362.3 kB)
https://web.archive.org/web/20180501023553/http://www.iaeng.org/publication/WCE2009/WCE2009_pp863-868.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL. The file type is application/pdf.

We propose a new heuristic for deter-ministic 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 multi-hop 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
more » ... ic is based on the GEOSTEINER algorithms for the Steiner minimal tree problem, and proves to be much more accurate than the current best heuris-tics for the 1-connected deployment problem, especially in the case of sparse data source distributions.
fatcat:bpqxdatpu5d6rnex4bpi4qyr4y
Citation

M Brazil, C Ras, D Thomas. "Deterministic Deployment of Wireless Sensor Networks *."