Please use this identifier to cite or link to this item:
|Title:||Coverage aware buffer management and scheduling for wireless sensor networks|
|Citation:||Chai, E.,Chan, M.C.,Ananda, A.L. (2007). Coverage aware buffer management and scheduling for wireless sensor networks. 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006 1 : 100-108. ScholarBank@NUS Repository. https://doi.org/10.1109/SAHCN.2006.288414|
|Abstract:||Environmental monitoring and surveillance is a popular application of wireless sensor network. In such an application, the data transmitted are tagged with geographic information. A network with better coverage provides better quality-of-service since it will be able to monitor its area of responsibility more effectively. In this work, we study the impact of congestion on coverage of the sensor network. Congestion can negatively impact the performance since it can result in reduced coverage and power wastage. In this paper, we present a buffer management scheme called Most Redundant Drop (MRD) and a scheduling algorithm called Coverage Transmit (CT) that make use of spatial information in sensor data to improve network coverage. Compared to drop-tail and FIFO, MRD and CT improve coverage by up to 75% when exact sensor location is available. Furthermore, as exact locations may not be available in practice, MRD and CT are evaluated using a modified DV-Hop scheme that provides approximate localization. Simulation results show that substantial improvement can also be obtained using only approximated locations. © 2006 IEEE.|
|Source Title:||2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 10, 2018
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.