By Topic

A Combinatorics-Based Wakeup Scheme for Target Tracking in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wong, Y.F. ; Inst. for Infocomm Res., Singapore Nat. Univ. ; Ngoh, L.H. ; Wong, W.C. ; Seah, W.K.G.

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.

Published in:

Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE

Date of Conference:

11-15 March 2007