TY - JOUR
T1 - Coverage enhancement by using the mobility of mobile sensor nodes
AU - Fang, Can
AU - Zhang, Peng
AU - Fu, Cheng
AU - Zhang, Zili
PY - 2014/4
Y1 - 2014/4
N2 - Coverage is a fundamental problem in sensor networks. Sensor coverage, which reflects how well a sensor network is monitored by sensors, is an important measure for the quality of service (QoS) that a sensor network can provide. In mobile sensor networks, the mobility of sensor nodes can be utilized to enhance the coverage of the network. Since the movement of sensor nodes will consume much energy, this mobility of sensor nodes should be properly managed by some pre-defined schemes or protocols. By noticing this issue, some existing works have proposed several movement-assisted sensor deployment schemes. These works assume that the target field is a 2-dimensional space. In this paper, we study a generalized case of this problem whereby the target field can be a space which ranges from 1-dimensional to 3-dimensional. Two variations of the movement-assisted sensor deployment problem with different optimization objectives were formulated. We identify a set of basic attributes which can be used as guidelines for designing movement-assisted sensor deployment schemes. Based on these attributes, we propose efficient algorithms for both variants of the movement-assisted sensor deployment problem.
AB - Coverage is a fundamental problem in sensor networks. Sensor coverage, which reflects how well a sensor network is monitored by sensors, is an important measure for the quality of service (QoS) that a sensor network can provide. In mobile sensor networks, the mobility of sensor nodes can be utilized to enhance the coverage of the network. Since the movement of sensor nodes will consume much energy, this mobility of sensor nodes should be properly managed by some pre-defined schemes or protocols. By noticing this issue, some existing works have proposed several movement-assisted sensor deployment schemes. These works assume that the target field is a 2-dimensional space. In this paper, we study a generalized case of this problem whereby the target field can be a space which ranges from 1-dimensional to 3-dimensional. Two variations of the movement-assisted sensor deployment problem with different optimization objectives were formulated. We identify a set of basic attributes which can be used as guidelines for designing movement-assisted sensor deployment schemes. Based on these attributes, we propose efficient algorithms for both variants of the movement-assisted sensor deployment problem.
KW - Coverage
KW - Movement-assisted
KW - Polynomial time complexity
KW - Sensor deployment
KW - Sensor network
UR - http://www.scopus.com/inward/record.url?scp=84897110866&partnerID=8YFLogxK
U2 - 10.1007/s11042-012-1139-4
DO - 10.1007/s11042-012-1139-4
M3 - 文章
AN - SCOPUS:84897110866
SN - 1380-7501
VL - 69
SP - 819
EP - 842
JO - Multimedia Tools and Applications
JF - Multimedia Tools and Applications
IS - 3
ER -