Please use this identifier to cite or link to this item:
|Title:||Sensor density for complete information coverage in wireless sensor networks|
|Authors:||Wang, B. |
|Citation:||Wang, B.,Chua, K.C.,Srinivasan, V.,Wang, W. (2006). Sensor density for complete information coverage in wireless sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3868 LNCS : 69-82. ScholarBank@NUS Repository.|
|Abstract:||Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor. This is a conservative definition of coverage and we have previously proposed a new notion of information coverage. Compared with the conventional definition of coverage, a point can still be information covered even if it is not within the sensing disk of any sensor. The density requirements for complete information coverage of a field are analyzed and simulated for a random sensor deployment. Our results show that significant savings in terms of sensor density can be achieved with information coverage. © Springer-Verlag Berlin Heidelberg 2006.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.