WSN  Vol.2 No.4 , April 2010
The Optimal Sensing Coverage for Road Surveillance
ABSTRACT
So far path coverage problem has been studied widely to characterize the properties of the coverage of a path or a track in an area induced by a sensor network, in which the path or track is usually treated as a curve and the width of it can be ignored. However, sensor networks often are employed to carry out road surveillance or target tracking, in which the interesting area is only the surface of the road, thus the width of the road must be considered. This paper analyzes the optimal sensing coverage of the road in this kind of applications, assuming that sensor nodes are deployed along both sides of the road determinately. The optimal position of sensor nodes is studied considering the sensing range of sensors and the width of the road, and the purpose is to cover the road surface completely with minimal nodes. The isosceles triangle model is proposed and proved to be the most suitable, that is to say all sensors get the maximal available sensing area if any three nearest sensors located on both sides of the road form an isosceles triangle. Comparing with the equilateral triangle model proposed in other articles, this model increases the coverage rate and supplies complete coverage of the road.

Cite this paper
nullX. Cheng, P. Liu, Z. Chen, H. Wu and X. Fan, "The Optimal Sensing Coverage for Road Surveillance," Wireless Sensor Network, Vol. 2 No. 4, 2010, pp. 318-327. doi: 10.4236/wsn.2010.24043.
References
[1]   A. Haoui, R. Kavaler and P. Varaiya, “Wireless Magnetic Sensors for Traffic Surveillance,” Transportation Research Part C, Vol. 16, 2008, pp. 294-306.

[2]   R.V. Field Jr. and M. Grigoriu, “Optimal Design of Sen-sor Networks for Vehicle Detection, Classifcation, and Monitoring,” Probabilistic Engineering Mechanics, Vol. 21, 2006, pp. 305-316.

[3]   J. Harada, S. Shioda and H. Saito, “Path Coverage Properties of Randomly Deployed Sensors with Finite Data- transmission Ranges,” Computer Networks, Vol. 53, 2009, pp. 1014-1026.

[4]   P. Manohar, S. S. Ram and D. Manjunath, “On the PathCoverage by a Non Homogeneous sensor Field,” IEEE GLOBECOM, 2006.

[5]   S. S. Ram, D. Manjunath, S. K. Iyer and D. Yogeshwaran, “On the Path Coverage Properties of Random Sensor Networks,” IEEE Transactions on Mobile Computing, Vol. 6, No. 5, May 2007.

[6]   S. Ferrari, “Track Coverage in Sensor Networks,” Proceedings of the 2006 American Control Conference, Minneapolis, 14-16 June 2006.

[7]   V. Kurlin and L. Mihaylova, “How Many Randomly Distributed Wireless Sensors are Enough to Make a 1-Dimensional Network Connected With a Given Probability?” IEEE Transactions on Information Theory, Vol. 10, No. 10, 2008.

[8]   H. H. Zhang and J. C. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,” Journal of Ad Hoc and Sensor Wireless Networks, Vol. 1, No. 1-2, 2005, pp. 89-124.

[9]   B. Liu and D. Towsley, “A Study on the Coverage of Large-scale Sensor Networks,” 1st IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, 2004.

[10]   D. Tian and N. D. Georganas, “A coverage-preserving node scheduling scheme for large wireless sensor net- works,” 1st ACM International Workshop on Wireless Sensor Networks and Applications, 2002, pp. 32-41.

 
 
Top