An Energy-Efficient Mobile Triangulation-based Coverage Scheme

In triangulation-based coverage, a group of three mobile sensor nodes (MSNs) position themselves to form an equilateral triangle. A larger area is covered with many such smaller triangles as three MSNs move from one triangle to another. Such a scheme has several applications in localization, 3D imaging and coordinated search operation. In this work, we introduce an efficient mobile traversal algorithm (MTA) that provides a triangulation-based coverage of a field that can be approximated as a rectangle. We analyze the MTA in terms of the MSNs' travel distance and time taken to complete the traversal process. The bounds derived are also useful in determining the amount of energy consumption by the MSNs.

[1]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.

[2]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[3]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[4]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[5]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[6]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[7]  Krishnendu Chakrabarty,et al.  Energy-aware target localization in wireless sensor networks , 2003, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)..