Abstract
After a wireless sensor network (WSN) is deployed, sensor nodes are usually left unattended for a long period of time. There is an inevitable devolution of the connected coverage of the WSN due to battery exhaustion of sensor nodes, intended physical destruction attacks on sensor nodes, unpredictable node movement by physical means like wind, and so on. It is, therefore, critical that the base station (BS) learns in real time how well the WSN performs the given sensing task (i.e., what is the current connected coverage) under a dynamically changing network topology. In this paper, we propose a coverage inference protocol (CIP), which can provide the BS an accurate and in-time measurement of the current connected coverage in an energy-efficient way. Especially, we show that the scheme called BOND, which our CIP requires to be implemented on each sensor node, enables each node to locally self-detect whether it is a boundary node with the minimal communication and computational overhead. The BOND can also be exploited to seamlessly integrate multiple functionalities with low overhead. Moreover, we devise extensions to CIP that can tolerate location errors and actively predict the change of the connected coverage based on residual energy of sensor nodes.
| Original language | English (US) |
|---|---|
| Article number | 10 |
| Pages (from-to) | 850-864 |
| Number of pages | 15 |
| Journal | IEEE Transactions on Mobile Computing |
| Volume | 9 |
| Issue number | 6 |
| DOIs | |
| State | Published - Jun 2010 |
| Externally published | Yes |
Fingerprint
Keywords
- Connected coverage
- Self-monitoring
- Wireless sensor network.
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Software
Cite this
A Coverage Inference Protocol for Wireless Sensor Networks. / Zhang, Chi; Zhang, Yanchao; Fang, Yuguang.
In: IEEE Transactions on Mobile Computing, Vol. 9, No. 6, 10, 06.2010, p. 850-864.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A Coverage Inference Protocol for Wireless Sensor Networks
AU - Zhang, Chi
AU - Zhang, Yanchao
AU - Fang, Yuguang
PY - 2010/6
Y1 - 2010/6
N2 - After a wireless sensor network (WSN) is deployed, sensor nodes are usually left unattended for a long period of time. There is an inevitable devolution of the connected coverage of the WSN due to battery exhaustion of sensor nodes, intended physical destruction attacks on sensor nodes, unpredictable node movement by physical means like wind, and so on. It is, therefore, critical that the base station (BS) learns in real time how well the WSN performs the given sensing task (i.e., what is the current connected coverage) under a dynamically changing network topology. In this paper, we propose a coverage inference protocol (CIP), which can provide the BS an accurate and in-time measurement of the current connected coverage in an energy-efficient way. Especially, we show that the scheme called BOND, which our CIP requires to be implemented on each sensor node, enables each node to locally self-detect whether it is a boundary node with the minimal communication and computational overhead. The BOND can also be exploited to seamlessly integrate multiple functionalities with low overhead. Moreover, we devise extensions to CIP that can tolerate location errors and actively predict the change of the connected coverage based on residual energy of sensor nodes.
AB - After a wireless sensor network (WSN) is deployed, sensor nodes are usually left unattended for a long period of time. There is an inevitable devolution of the connected coverage of the WSN due to battery exhaustion of sensor nodes, intended physical destruction attacks on sensor nodes, unpredictable node movement by physical means like wind, and so on. It is, therefore, critical that the base station (BS) learns in real time how well the WSN performs the given sensing task (i.e., what is the current connected coverage) under a dynamically changing network topology. In this paper, we propose a coverage inference protocol (CIP), which can provide the BS an accurate and in-time measurement of the current connected coverage in an energy-efficient way. Especially, we show that the scheme called BOND, which our CIP requires to be implemented on each sensor node, enables each node to locally self-detect whether it is a boundary node with the minimal communication and computational overhead. The BOND can also be exploited to seamlessly integrate multiple functionalities with low overhead. Moreover, we devise extensions to CIP that can tolerate location errors and actively predict the change of the connected coverage based on residual energy of sensor nodes.
KW - Connected coverage
KW - Self-monitoring
KW - Wireless sensor network.
UR - http://www.scopus.com/inward/record.url?scp=77951697729&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951697729&partnerID=8YFLogxK
U2 - 10.1109/TMC.2010.29
DO - 10.1109/TMC.2010.29
M3 - Article
AN - SCOPUS:77951697729
VL - 9
SP - 850
EP - 864
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
SN - 1536-1233
IS - 6
M1 - 10
ER -