Abstract
Mobile sensor nodes are featured with node mobility along with standard sensor functions. They can move around after being deployed. In many situations placement of static sensor nodes might not be possible and human intervention is not feasible. Mobile sensor nodes are very useful in such hazardous and disastrous situations. When a group of mobile sensor nodes are deployed to cover an area for search operations, coordination among the deployed nodes is very important. A mobile sensor node (MSN) depletes more energy during the traversal. Whenever there arises a failure, in one of the deployed mobile sensor nodes, the remaining fault-free mobile sensor nodes should travel to cover the remaining uncovered area. In this work we propose a Mobile Traversal Algorithm (MTA), for mobile sensor nodes to cover a rectangular region of interest (ROI). It makes MSNs to travel shorter distances to extend effective operational duration of the network and also to provide fault tolerance mechanism.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
X. Bai, Z. Yun, D. Xuan, T. H. Lai, and W. Jia, “Optimal patterns for four-connectivity and full coverage in wireless sensor networks,” IEEE Trans. Mobile Comput., vol. 9, no. 3, pp. 435–448, Mar. 2010.
R. J. D’Souza, G. Santoshi, and J. Jose, “Optimal 1-coverage by homogenous mobile sensor nodes using tri-hexagonal scheme,” in Proc. Int. Conf. Computer Communication and Informatics (ICCCI), Coimbatore, India, 2012, vol. 3, pp. 554–558.
G. N. Purohit, S. Verma, and M. Sharma, “Hexagonal coverage by mobile sensor nodes,” Int. J. Comput. Netw. Secur., vol. 2, no. 4, pp. 41–44, 2010.
V. S. Gordon, Y. L. Orlovich, and F. Werner, “Hamiltonian properties of triangular grid graphs,” Discrete Math., vol. 308, no. 24, pp. 6166–6188, Dec. 2008.
S. He, J. Chen, Y. Sun, D. K. Y. Yau, and N. K. Yip, “On optimal information capture by energy-constrained mobile sensors,” IEEE Trans. Veh. Technol., vol. 59, no. 5, pp. 2472–2484, Jun. 2010.
A. Itai, C. H. Papadimitriou, and J. L. Szwarcfiter, “Hamilton paths in grid graphs,” SIAM J. Comput., vol. 11, no. 4, pp. 676–686, 1982.
A. Khan, C. Qiao, and S. K. Tripathi, “Mobile traversal schemes based on triangulation coverage,” Mobile Netw. Appl., vol. 12, nos. 5–6, pp. 422–437, Dec. 2007.
R. Kreshner, “The number of circles covering a set,” Amer. J. Math., vol. 61, no. 3, pp. 665–671, Jul. 1939.
R. J. D’Souza and G Santoshi, “Optimal 2-coverage by heterogeneous mobile sensor nodes using triangular scheme,” Procedia Technol., vol. 4, pp. 187–195, 2012.
Z. Sun and J. Reif, “On energy-minimizing paths on terrains for a mobile robot,” in Proc. IEEE Int. Conf. Robotics and Automation (ICRA), 2003, vol. 3, pp. 3782–3788.
G. Wang, M. J. Irwin, P. Berman, H. Fu, and T. La Porta, “Optimizing sensor movement planning for energy efficiency,” in Proc. Int. Symp. Low Power Electronics and Design (ISLPED), San Diego, CA, USA, 2005, pp. 215–220.
S. Yoon, O. Soysal, M. Demirbas, and C. Qiao, “Coordinated locomotion and monitoring using autonomous mobile sensor nodes,” IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 10, pp. 1742–1756, Oct. 2011.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Santoshi, G., D’Souza, R.J. Optimal 1-coverage by homogeneous mobile sensor nodes using hexagonal scheme. Netw.Sci. 3, 96–107 (2013). https://doi.org/10.1007/s13119-013-0027-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13119-013-0027-1