Please use this identifier to cite or link to this item:
|Title:||The computational accuracy of cover time for circular sensing range|
|Citation:||Ramli, M.A.,Leng, G. (2010). The computational accuracy of cover time for circular sensing range. Communications in Computer and Information Science 103 CCIS : 346-352. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-15810-0_44|
|Abstract:||Sensor coverage completion is usually tracked by use of a coverage map and discretizing the target region into smaller square cells or pixels. However, real sensors are typically fixed in range thus creating circular sensing regions. In this paper, we quantitatively discuss the effect of the size of the discretization of the domain on the accuracy of the covering time of a simple random walk algorithm. A simulation algorithm is proposed using coordinate pairs to track the covered regions in order to minimise memory usage. Finally we present how accurate estimates of mean and standard deviation of cover time can be obtained by comparing between simulation results with varying discretization ratio and the domain size. © 2010 Springer-Verlag.|
|Source Title:||Communications in Computer and Information Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 9, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.