Barrier Coverage of Wireless Sensor Networks Based on Clifford Algebra

One model for barrier coverage in sensor networks is Maximal Breach Path (MBP). Many proposed methods for searching MBP are just for 0-dimensional point targets. Xie proposed a coverage analysis approach for sensor networks based on Clifford algebra. In a 2-dimensional plane, a homogeneous computational method of distance measures has been provided for points, lines and areas, and a homogeneous coverage analysis model also has been proposed for targets with hybrid types and different dimensions. In the paper, we use Clifford algebra with traditional method to compute MBP for barrier coverage problem. And the experimental result illustrates that our method is more simple and effective than traditional method.

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

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

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

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

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