WSN  Vol.1 No.2 , July 2009
Target Detection in Three-Dimension Sensor Networks Based on Clifford Algebra
ABSTRACT
The three-dimensional sensor networks are supposed to be deployed for many applications. So it is signifi-cant to do research on the problems of coverage and target detection in three-dimensional sensor networks. In this paper, we introduced Clifford algebra in 3D Euclidean space, developed the coverage model of 3D sensor networks based on Clifford algebra, and proposed a method for detecting target moving. With Clif-ford Spinor, calculating the target moving formulation is easier than traditional methods in sensor node’s coverage area.

Cite this paper
nullT. HE, W. XIE and W. CAO, "Target Detection in Three-Dimension Sensor Networks Based on Clifford Algebra," Wireless Sensor Network, Vol. 1 No. 2, 2009, pp. 82-89. doi: 10.4236/wsn.2009.12013.
References
[1]   C. Tian, W. Liu, J. Jin, Y. Wang, and Y. Mo, “Localiza-tion and synchronization for 3D underwater acoustic sensor network,” Proceedings of UIC 2007, pp. 622–631, July 2007.

[2]   W. X. Xie, W. M. Cao, and S. Meng, “Coverage analysis for sensor networks based on Clifford algebra,” Science in China Series F-Information Sciences, Vol. 51, No. 5, pp. 460–475, 2008.

[3]   W. X. Xie, T. C. He, and W. M. Cao, “Path analyses of sensor networks based on Clifford algebra,” Acta Elec-tronica Sinica, Vol. 35, No. 12A, pp. 27–31, 2007.

[4]   S. Megerian, F. Koushanfar, M. Potkonjak, M. B. Srivastava, “Worst and best-case coverage in sensor net-works,” IEEE Transactions on Mobile Computing, Vol. 4, No. 1, pp. 84–92, 2005.

[5]   X. Li, P. Wan, and O. Frieder, “Coverage problem in wireless ad-hoc sensor networks,” IEEE Transactions on Computers, Vol. 52, No. 6, pp. 753–763, 2003.

[6]   T. C. He, W. M. Cao, and W. X. Xie, “Research of breach issue for sensor networks based on Clifford geo-metrical algebra,” Chinese Journal of Scientific Instru-ment, Vol. 28, No. 8, pp. 161–165, 2007.

[7]   A. D. Gupta, A. Bishnu, and I. Sengupta, “Optimisation problems based on the maximal breach path measure for wireless sensor network coverage,” ICDCIT, pp. 27–40, 2006.

[8]   G. Veltri, Q. Huang, G. Qu, and M. Potkonjak, “Minimal and maximal exposure path algorithms for wireless em-bedded sensor networks,” Proceedings of the 1st Interna-tional Conference on Embedded Networked Sensor Sys-tems (SenSys’03), Los Angels, CA, USA, pp. 40–50, 2003.

[9]   L. Lazos, R. Poovendran, and J. A. Ritcey, “Probabilistic detection of mobile targets in heterogeneous sensor net-works,” in Proceedings of IPSN’07, pp. 519–528, 2007.

[10]   W. Z. Zhang, M. L. Li, and M. Y. Wu, “An algorithm for target traversing based on local Voronoi diagram,” Jour-nal of Software, Vol. 18, No, 5, pp. 1246–1253, 2007.

[11]   C. D. Jiang and G. L. Chen, “Double barrier coverage in dense sensor networks,” Journal of Computer Science and Technology, Vol. 23, No. 1, pp. 154–165, 2008.

[12]   M. Cardei, M. T. Thai, Y. Li, and W. Wu, “En-ergy-efficient target coverage in wireless sensor net-works,” Proceedings of IEEE INFOCOM’05, Miami, FL, pp. 1976–1983, 2005.

[13]   M. Cardei, J. Wu, M. Lu, and M. O. Pervaiz, “Maximum network lifetime in wireless sensor networks with ad-justable sensing ranges,” Proceedings of IEEE Interna-tional Conference on Wireless and Mobile Computing, Networking and Communications (WiMob’05), Montreal, Canada, pp. 1–8, 2005.

[14]   S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, “Coverage problems in wireless ad-hoc sensor networks,” in IEEE INFOCOM, Vol. 3, pp. 1380–1387, 2001.

[15]   S. Meguedrichian, S. Slijepcevic, V. Karayan, and M. Potkonjak, “Localized algorithms in wireless ad-hoc networks: Location discovery and sensor exposure,” Pro-ceedings of ACM MobiHoc’01, Long Beach, CA, USA, pp. 106–116, 2001.

[16]   M. Lu, J. Wu, M. Cardei, and M. Li, “Energy-efficient connected coverage of discrete targets in wireless sensor networks,” Proceedings of 2005 International Conference on Computer Networks and Mobile Computing (ICCN- MC’05), Zhangjiajie, China, pp. 1–10, 2005.

[17]   X. Li, P. Wan, and O. Frieder, “Coverage in wireless ad-hoc sensor networks,” Proceedings of IEEE Interna-tional Conference on Communications (ICC’02), New York, NY, USA, pp. 1–5, 2002.

[18]   S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkon-jak, “Exposure in wireless ad hoc sensor networks,” Pro-ceedings of ACM MobiCom’01, pp. 139–150, 2001.

[19]   S. Adlakha and M. Srivastava, “Critical density thresh-olds for coverage in wireless sensor networks,” Proceed-ings of IEEE Wireless Communications and Networking Conference (WCNC’03), NewOrleans, Louisiana, USA, pp. l6–20, 2003.

[20]   B. Wang, et al., “Worst and best information exposure paths in wireless sensor networks,” Proceedings of MSN 2005, pp. 52–62, December 2005.

[21]   B. Liu and D. Towsley, “On the coverage and detectabil-ity of large-scale wireless sensor networks,” Proceedings of WiOpt’03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, INRIA Sophia-Antipolis, France, pp. 1–3, 2003.

[22]   R. Meester and R. Roy, “Continuum percolation,” Bal-letin of the American Mathematical Society, Vol. 34, No. 4, pp. 447–448, 1997.

[23]   B. Liu and D. Towsley, “A study of the coverage of large-scale sensor networks,” Proceedings of the 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS’04), Florida, USA, pp. 475–481, 2004.

[24]   S. Kumar, T. Lai, and A. Arora, “Barrier coverage with wireless sensors,” Wireless Network, Vol. 13, pp. 817– 834, 2007.

[25]   S. Kloder and S. Hutchinson, “Barrier coverage for vari-able bounded-range line-of-sight guards,” in Proceedings of IEEE International Conference on Robotics and Automation 2007, pp. 391–396, April 2007.

[26]   J. O’Rourke, “Computational geometry: Column 15,” International Journal of Computational Geometry and Applications, Vol. 2, No. 2, pp. 215–217, 1992.

 
 
Top