DocumentCode :
2095574
Title :
Barrier Coverage of Wireless Sensor Networks Based on Clifford Algebra
Author :
Cao, Wenming ; He, Tiancheng
Author_Institution :
ATR Nat. Key Lab. of Defense Technol., Shenzhen Univ., Shenzhen, China
Volume :
2
fYear :
2008
fDate :
20-22 Dec. 2008
Firstpage :
49
Lastpage :
52
Abstract :
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.
Keywords :
algebra; wireless sensor networks; 2D plane; Clifford algebra; barrier coverage; homogeneous coverage analysis model; maximal breach path; wireless sensor networks; Algebra; Area measurement; Computer networks; Computer science; Costs; Helium; Intelligent sensors; Laboratories; Sensor fusion; Wireless sensor networks; Clifford Algebra; barrier coverage; wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Computational Technology, 2008. ISCSCT '08. International Symposium on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3746-7
Type :
conf
DOI :
10.1109/ISCSCT.2008.188
Filename :
4731569
Link To Document :
بازگشت