Please use this identifier to cite or link to this item:
|Title:||A combinatorics-based wakeup scheme for target tracking in wireless sensor networks||Authors:||Wong, Y.F.
|Issue Date:||2007||Citation:||Wong, Y.F.,Ngoh, L.H.,Wong, W.C.,Seah, W.K.G. (2007). A combinatorics-based wakeup scheme for target tracking in wireless sensor networks. IEEE Wireless Communications and Networking Conference, WCNC : 3572-3577. ScholarBank@NUS Repository. https://doi.org/10.1109/WCNC.2007.654||Abstract:||Sensor networks deployed for the purpose of target tracking and intrusion detection have very specific requirements in terms of sensing coverage, timeliness of data and network lifetime. Many existing work focus on wakeup schemes that only attempt to prolong network usage but failed to address issues such as coverage, timeliness of data delivery, target tracking continuity and deployment cost all at the same time. Given any maximum target speed, our solution based on a Combinatorics approach, guarantees delay bounds and node lifetime bounds, critical for any practical deployment of a target tracking application. We support our solution further with simulation results. ©2007 IEEE.||Source Title:||IEEE Wireless Communications and Networking Conference, WCNC||URI:||http://scholarbank.nus.edu.sg/handle/10635/68737||ISBN:||1424406595||ISSN:||15253511||DOI:||10.1109/WCNC.2007.654|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.