Target detection in three-dimension sensor networks based on Clifford algebra

The three-dimension sensor networks are supposed to be deployed for many applications. So it is significant to do research on the problems of coverage and target detection in three-dimension sensor networks. In this paper, we develop the coverage model of 3D sensor networks based on Clifford algebra, and propose the method for detecting target moving. With our method, the time consuming of calculating the target moving formulation is lower than that of traditional methods in sensor nodepsilas coverage area. Both the theory and experiment prove the efficiency of this method.

[1]  Seth Hutchinson,et al.  Barrier Coverage for Variable Bounded-Range Line-of-Sight Guards , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[2]  Isaac Balberg.  Continuum Percolation , 2009, Encyclopedia of Complexity and Systems Science.

[3]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[4]  Indranil Sengupta,et al.  Optimisation Problems Based on the Maximal Breach Path Measure for Wireless Sensor Network Coverage , 2006, ICDCIT.

[5]  Don Towsley,et al.  On the Coverage and Detectability of Large-scale Wireless Sensor Networks , 2003 .

[6]  Miodrag Potkonjak,et al.  Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.

[7]  Wenyu Liu,et al.  Localization and Synchronization for 3D Underwater Acoustic Sensor Networks , 2007, UIC.

[8]  Miodrag Potkonjak,et al.  Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure , 2001, MobiHoc '01.

[9]  Wei Wang,et al.  Worst and Best Information Exposure Paths in Wireless Sensor Networks , 2005, MSN.

[10]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[13]  Jie Wu,et al.  Energy-Efficient Connected Coverage of Discrete Targets in Wireless Sensor Networks , 2005, ICCNMC.

[14]  J.A. Ritcey,et al.  Probabilistic Detection of Mobile Targets in Heterogeneous Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[15]  Miodrag Potkonjak,et al.  Minimal and maximal exposure path algorithms for wireless embedded sensor networks , 2003, SenSys '03.

[16]  Weixin Xie,et al.  Coverage analysis for sensor networks based on Clifford algebra , 2008, Science in China Series F: Information Sciences.

[17]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[18]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[19]  Jie Wu,et al.  Maximum network lifetime in wireless sensor networks with adjustable sensing ranges , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[20]  Vlady Ravelomanana,et al.  Extremal properties of three-dimensional sensor networks with applications , 2004, IEEE Transactions on Mobile Computing.

[21]  Joseph O'Rourke.  Computational geometry column 15 , 1992, Int. J. Comput. Geom. Appl..

[22]  Zhang Wen-Zhe,et al.  An Algorithm for Target Traversing Based on Local Voronoi Diagram , 2007 .

[23]  Guo-Liang Chen,et al.  Double Barrier Coverage in Dense Sensor Networks , 2008, Journal of Computer Science and Technology.

[24]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.