Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/WCNC.2007.654 | 2007 IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-9 |
Keywords | Field | DocType |
wireless sensor network,energy conservation,intrusion detection,sensor network,job shop scheduling,wireless sensor networks | Energy conservation,Software deployment,Network usage,Computer science,Computer network,Real-time computing,Intrusion detection system,Distributed computing,Combinatorics,Job shop scheduling,Combinatorial mathematics,Data delivery,Wireless sensor network | Conference |
ISSN | Citations | PageRank |
1525-3511 | 5 | 0.50 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yew Fai Wong | 1 | 7 | 1.23 |
| Lek Heng Ngoh | 2 | 135 | 18.21 |
| Lawrence W. C. Wong | 3 | 9 | 1.96 |
| Winston Khoon Guan Seah | 4 | 294 | 30.42 |