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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call