Name
Abstract | ||
|---|---|---|
A common configuration used in area surveillance occurs when an area of interest is protected by deploying a number of concentric rings of sensor nodes around the area. When operating in a harsh environment, the nodes of the deployed Wireless Sensor Network (WSN) become subject to random failure. Consequently, the network becomes vulnerable to undetected unauthorized traversals to the area of interest. In this paper, we formulate a network wide reliability problem that quantifies the likelihood that the network continues to provide joint intrusion detection and reporting to a sink node at the center of the network. The algorithm uses a dynamic programming approach that strives to process many of the operating states of network while running efficiently. Our obtained numerical results illustrates the use of the algorithm as a network design tool. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/LCN.2015.7366292 | IEEE Conference on Local Computer Networks |
Keywords | Field | DocType |
reliable surveillance,ring deployed wireless sensor networks,area surveillance,sensor nodes,network wide reliability,joint intrusion detection,sink node,dynamic programming | Sensor node,Key distribution in wireless sensor networks,Wireless network,Computer science,Computer network,Wireless WAN,Mobile wireless sensor network,Heterogeneous network,Wireless sensor network,Distributed computing,Intelligent computer network | Conference |
ISSN | Citations | PageRank |
0742-1303 | 0 | 0.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammed Elmorsy | 1 | 3 | 2.78 |
| Ehab S. Elmallah | 2 | 105 | 19.29 |