Name
Abstract | ||
|---|---|---|
In wireless sensor networks (WSN), reliable monitoring of a phenomenon (or event detection) depends on the collective data provided by the target cluster of sensors and not on any individual node. In this paper we define a WSN reliability measure that considers the aggregate flow of sensor data into a sink node (gateway or cluster head). Given an estimation of the data generation rate and the failure probability of each sensor, we formulate the reliability measure and show that computing this measure for an arbitrary WSN is #P-hard. We present an exponential algorithm for arbitrary WSN. We then consider some special cases where we can either compute or approximate (bound) the reliability using an efficient algorithm. Finally, we present some numerical results that demonstrate some of the applications of our algorithms. Reliability evaluation tools are important in the context of design and analysis of sensitive information gathering sensor networks. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICC.2006.255607 | 2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12 |
Keywords | Field | DocType |
Wireless sensor networks, clusters, probabilistic graph model, graph-theoretic algorithms, reliability | Key distribution in wireless sensor networks,Computer science,Computer network,Real-time computing,Default gateway,Cluster analysis,Information sensitivity,Wireless sensor network,Test data generation,Distributed computing | Conference |
ISSN | Citations | PageRank |
1550-3607 | 25 | 1.25 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hosam M. F. AboElFotoh | 1 | 59 | 5.49 |
| Ehab S. Elmallah | 2 | 105 | 19.29 |
| Hossam S. Hassanein | 3 | 1672 | 169.21 |