Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Megerian S, Koushanfar F, Potkonjak M, et al. Worst and best-case coverage in sensor networks. IEEE Trans Mobile Comput, 2005, 4(1): 84–92
Meguerdichian S, Koushanfar F, Potkonjak M, et al. Coverage problems in wireless ad-hoc sensor networks. IEEE Infocom, 2001, 3: 1380–1387
Meguerdichian S, Slijepcevic S, Karayan V, et al. Localized algorithms in wireless ad-hoc networks: Location discovery and sensor exposure. In: Proceedings of the 2nd ACM International Symposium on Mobile ad hoc Networking & Computing, New York: ACM Press, 2001. 106–116
Meguerdichian S, Koushanfar F, Qu G, et al. Exposure in wireless ad-hoc sensor networks. In: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking. New York: ACM Press, 2001. 139–150
Li X Y, Wan P J, Frieder O. Coverage in wireless ad hoc sensor networks. IEEE Trans Comput, 2003, 52(6): 753–763
Marengoni M, Draper B A, Hanson A, et al. A system to place observers on a polyhedral terrain in polynomial time. Image Vision Comput, 1996, 18: 773–780
Ren Y, Zhang S D, Zhang H K. Three-dimensional optimal coverage routing protocol in wireless sensor networks. J Chinese Electr, 2006, 34(2): 306–311
Alzoubi K, Li X Y, Wang Y, et al. Geometric spanners for wireless ad hoc networks. IEEE Trans Parallel Distrib Syst, 2003, 14(4): 408–421
Wang B, Chua K C, Srimivasan V, et al. Sensor density for complete information coverage in wireless sensor network. In: Wireless Sensor Networks, Third European Workshop (EWSN). Lecture Notes in Computer Science, 3868. Berlin: Springer-Verlag, 2006. 69–82
Alzoubi K, Li X Y, Wang Y, et al. Geometric spanners for wireless ad hoc networks. IEEE Trans Parallel Distrib Syst, 2003, 14(4): 408–421
Frank Y S Lin, Chiu P L. Energy-efficient sensor network design subject to complete coverage and discrimination constraints. In: Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. 586–593
Chakrabarty K, Iyengar S S, Qi H R, et al. Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans Comput, 2002, 51(12): 1448–1453
Huang C F, Tseng Y C, Lo L C. The coverage problem in three-dimensional wireless sensor networks. In: Proc. IEEE Globecomb04. Dallas: IEEE Press, 2004. 3182–3186
Li H B. Clifford algebra, geometric computing and reasoning. Adv Math, 2003, 32(4): 405–415
Dorst L, Mann S. Geometric algebra: a computation framework for geometrical application, Part I. IEEE Comput Graph Appl, 2002, 22(3): 24–31
Mann S, Dorst L. Geometric algebra: a computation framework for geometrical applications, Part II. IEEE Comput Graph Appl, 2002, 22(4): 58–67
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xie, W., Cao, W. & Meng, S. Coverage analysis for sensor networks based on Clifford algebra. Sci. China Ser. F-Inf. Sci. 51, 460–475 (2008). https://doi.org/10.1007/s11432-008-0048-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-008-0048-7