Placement and Relocation of Wireless Sensor Nodes by a Team of Robots

FieldValue
dc.contributor.authorFletcher, Greg
dc.date.accessioned2013-11-07T19:31:20Z
dc.date.available2013-11-07T19:31:20Z
dc.date.created2010
dc.date.issued2010
dc.identifier.citationSource: Masters Abstracts International, Volume: 49-06, page: 3885.
dc.identifier.urihttp://hdl.handle.net/10393/28811
dc.identifier.urihttp://dx.doi.org/10.20381/ruor-13730
dc.description.abstractWe propose a novel localized sensor placement algorithm for wireless sensor networks, named Back-Tracking Deployment (BTD). Through simulation we show that BTD far outperforms the only competing algorithm LRV [2] in robot moves and robot messages at no additional cost in a failure-free environment and at minimal cost of sensor messages in a failure-prone environment. Further, we propose the first localized carrier-based sensor relocation algorithm for wireless sensor networks, named Randomized Robot-assisted Relocation of Static Sensors (R3S2). We also presented a grid-based variant, called G-R3S2 and a cluster-based variant, called C-R3S2 and C-G-R3S2. Through extensive simulation, the effectiveness and practicality is shown. The simulation results indicate in particular that robots following the LRV policy (G-R3S2 and C-G-R3S2) outperformed those that did not across all measured metrics. Further, the cluster-based variants outperformed their counterpart (C-G-R3S2 vs. G-R3S2 and C-R3S2 vs. R3S2) across all metrics.
dc.format.extent78 p.
dc.language.isoen
dc.publisherUniversity of Ottawa (Canada)
dc.subject.classificationComputer Science.
dc.titlePlacement and Relocation of Wireless Sensor Nodes by a Team of Robots
dc.typeThesis
dc.degree.nameM.C.S.
dc.degree.levelMasters
CollectionTh├Ęses, 1910 - 2010 // Theses, 1910 - 2010

Files
MR74143.PDF3.55 MBAdobe PDFOpen