© The Institution of Engineering and Technology
Deployment is an important issue in wireless sensor networks (WSNs). Most recent researches focus on the optimal deployment strategy to achieve full coverage in WSNs. However, the sensing devices in practical applications are finite, and cannot achieve full coverage in the whole monitored region. Moreover, the monitored objects distribute unevenly, and thus the monitored significance differs from region to region. How to deploy limited number of sensors efficiently has been to an important issue. In this study, we propose a new coverage problem in WSNs, named N-node coverage, to acquire the maximum information about monitored objects with N sensors. In this problem, the captured information is used as the new evaluation metric for network coverage. On the basis of the metric, we establish the N-node network coverage model, and prove that the N-node coverage problem is NP-hard. The authors propose a heuristic algorithm for deployment, named optimisation schEme of N-node (OPEN), to obtain the near-optimal solution of the problem. Experimental results show that the OPEN can effectively improve the coverage performance of the WSNs, and is able to provide practical guideline for deployment of WSNs with limited number of nodes.
References
-
-
1)
-
X.C. Xu ,
S. Sartaj
.
Approximation algorithms for sensor deployment.
IEEE Trans Comput.
,
1681 -
1695
-
2)
-
Q. Wu ,
S. Iyengar ,
N. Rao ,
J. Bahren ,
K. Chakrabarty ,
V. Vaishvavi
.
On efficient deployment of sensors on planar grid.
Comput. Commun.
,
2721 -
2734
-
3)
-
Wang, J., Sirisha, M., Muralidhar, M.: `Energy-efficient k-coverage for wireless sensor networks with variable sensing radii', Proc. IEEE GLOBECOM, December 2009, p. 1–6.
-
4)
-
Balister, P., Zheng, Z., Kumar, S., Sinha, P.: `Trap coverage: Allowing coverage holes of bounded diameter in wireless sensor networks', Proc. IEEE INFOCOM, April 2009, p. 136–144.
-
5)
-
G. Simon ,
R. Pintelon ,
L. Sujbert ,
J. Schoukens
.
An efficient nonlinear least square multisine fitting algorithm.
IEEE Trans. Instrum. Meas.
,
750 -
755
-
6)
-
Andreas, K., Acrlos, G., Anupam, G., Jon, K.: `Near optimal sensor placements: maximizing information while minimizing communication cost', Proc. IEEE/ACM IPSN, April 2006, p. 19–21.
-
7)
-
Kar, K., Banerjee, S.: `Node placement for connected coverage in sensor networks', Proc. IEEE WIOPT, 2003, p. 34–43.
-
8)
-
Q. Wu ,
S. Iyengar ,
N. Rao
.
(2002)
On efficient deployment of sensors on planar grid.
-
9)
-
K. Andreas ,
G. Acrlos ,
G. Anupam ,
K. Jon
.
Robust sensor placements at informative and communication-efficient locations.
ACM Trans. Sens. Netw.
,
1550 -
4859
-
10)
-
Liu, B., Brass, P., Dousse, O., Nain, P., Towsky, D.: `Mobility improves coverage of sensor networks', Proc. ACM MOBIHOC, May 2005, p. 300–308.
-
11)
-
Xing, G., Tan, R., Liu, B., Wang, J., Jia, X., Yi, C.W.: `Data fusion improves the coverage of wireless sensor networks', Proc. ACM MOBICOM, September 2009, p. 157–168.
-
12)
-
P. Hall
.
(1988)
In introduction to the theory of coverage processes.
-
13)
-
Bai, X.L., Yun, Z.Q., Xuan, D., Chen, B., Zhao, W.: `Optimal multiple-coverage of sensor networks', Proc. IEEE INFOCOM, April 2011, p. 2122–2132.
-
14)
-
C. Liu ,
K. Wu ,
Y. Xiao ,
B. Sun
.
Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks.
IEEE Trans. Parallel Distrib. Syst.
,
562 -
575
-
15)
-
G.J. Fan ,
R.H. Wang ,
H.P. Huang ,
L.J. Sun ,
C. Sha
.
Coverage-guaranteed sensor node deployment strategies for wireless sensor networks.
Sensors
,
2064 -
2087
-
16)
-
Z.Q. Yun ,
X.L. Bai ,
D. Xuan ,
T.H. Lai ,
W.J. Jia
.
Optimal deployment patterns for full coverage and k-Connectivity (k¡Ü6) wireless sensor networks.
IEEE/ACM Trans. Netw.
,
934 -
947
-
17)
-
K.P. Shih ,
H.C. Chen ,
C.M. Chou ,
B.J. Liu
.
On target coverage in wireless heterogeneous sensor networks with multiple sensing units.
Netw. Comput. Appl.
,
866 -
877
-
18)
-
J.S. Li ,
H.C. Kao
.
Distributed k-coverage self-location estimation scheme based on Voronoi diagram.
IET Commun.
,
167 -
177
-
19)
-
Balister, P., Kumar, S.: `Random vs. deterministic deployment of sensors in the presence of failures and placement errors', Proc. IEEE INFOCOM, April 2009, p. 2896–2900.
-
20)
-
X.L. Bai ,
Z.Q. Yun ,
D. Xuan ,
T.H. Lai ,
J. Jiaw
.
Optimal patterns for four-connectivity and full coverage in wireless sensor networks.
IEEE Trans. Mob. Comput.
,
435 -
448
-
21)
-
Yuan, Z., Tan, R., Xing, G.L., Lu, C., Chen, Y., Wang, J.: `Fast sensor placement algorithms for fusion-based target detection', Proc. IEEE RTSS, 2008, p. 103–112.
-
22)
-
Q. Zhao ,
G. Mohan
.
Lifetime maximization for connected target coverage in wireless sensor networks.
IEEE/ACM Trans. Netw.
,
1378 -
1391
-
23)
-
Hefeeda, M., Ahmadi, H.: `A probabilistic coverage protocol for wireless sensor networks', Proc. IEEE ICNP, 2007, p. 41–50.
-
24)
-
Fei, X., Azzedine, B., Regina, B.A.: `Irregular sensing range detection model for coverage based protocols in wireless sensor networks', Proc. IEEE GLOBECOM, December 2009, p. 122–128.
-
25)
-
Bejerano, Y.: `Simple and efficient k-coverage verification without location information', Proc. IEEE INFOCOM, April 2008, p. 291–295.
-
26)
-
Liu, B., Towsley, D.: `A study of the coverage of large-scale sensor networks', Proc IEEE MOBIHOC, October 2004, p. 475–483.
-
27)
-
Zhao, M.C., Lei, J.Y., Wu, M.Y., Liu, Y.H., Shu, W.: `Surface coverage in wireless sensor networks', Proc. IEEE, INFOCOM, April 2009, p. 109–117.
-
28)
-
P.J. Wan ,
C.W. Yi
.
Coverage by randomly deployed wireless sensor networks.
IEEE Trans. Inf. Theory
,
6 ,
2658 -
2669
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-wss.2011.0012
Related content
content/journals/10.1049/iet-wss.2011.0012
pub_keyword,iet_inspecKeyword,pub_concept
6
6