Coverage analysis for sensor networks based on Clifford algebra

The coverage performance is the foundation of information acquisition in distributed sensor networks. The previously proposed coverage work was mostly based on unit disk coverage model or ball coverage model in 2D or 3D space, respectively. However, most methods cannot give a homogeneous coverage model for targets with hybrid types. This paper presents a coverage analysis approach for sensor networks based on Clifford algebra and establishes a homogeneous coverage model for sensor networks with hybrid types of targets. The effectiveness of the approach is demonstrated with examples.

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

[2]  Yu-Chee Tseng,et al.  The coverage problem in three-dimensional wireless sensor networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[3]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[4]  Leo Dorst,et al.  Geometric algebra: A computational framework for geometrical applications (Part I: Algebra) , 2002 .

[5]  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).

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

[7]  Pei-Ling Chiu,et al.  Energy-efficient sensor network design subject to complete coverage and discrimination constraints , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[8]  LI Hong-bo.  Clifford Algebra, Geometric Computing and Reasoning , 2003 .

[9]  Wei Wang,et al.  Sensor Density for Complete Information Coverage in Wireless Sensor Networks , 2006, EWSN.

[10]  lt,et al.  Three-Dimensional Optimal Coverage Routing Protocol in Wireless Sensor Networks , 2006 .

[11]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[12]  Xiang-Yang Li,et al.  Coverage in Wireless Ad Hoc Sensor Networks , 2003, IEEE Trans. Computers.

[13]  Leo Dorst,et al.  Geometric algebra: A computational framework for geometrical applications ({Part II: Applications}) , 2002 .

[14]  Bruce A. Draper,et al.  A system to place observers on a polyhedral terrain in polynomial time , 2000, Image Vis. Comput..

[15]  Stephen Mann,et al.  Geometric Algebra: A Computational Framework for Geometrical Applications (Part 2) , 2002, IEEE Computer Graphics and Applications.

[16]  Yu-Chee Tseng,et al.  The Coverage Problem in Three-Dimensional Wireless Sensor Networks , 2007, J. Interconnect. Networks.

[17]  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).

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