Abstract
Random deployment of sensor nodes cause coverage problems due to unbalanced deployment. This includes both coverage area overlapping among the nodes and coverage holes in the terrain. Actual coverage area computations are partial and unreliable without considering these irregularities. The purpose of this paper is to compute the minimum number of sensor nodes that increase the probability for achieving Optimal Threshold Coverage Area (OTCA) for a given terrain in random deployment strategy. The analytical and simulation results show that OTCA is efficient in calculating the minimum number of sensor nodes required to achieve threshold coverage level for a given terrain.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Wang, B.: Coverage problems in sensor networks. In: ACM Computing Surveys, CSUR, vol. 43, Article no. 32, pp. 1–53. ACM, New York (2011)
Sun, Z., Wang, P., Vuran, M.C., Al-Rodhaan, M.A., Al-Dhelaan, A.M., Akyildiz, I.F.: BorderSense: border patrol through advanced wireless sensor networks. Ad Hoc Netw. 9, 468–477 (2011)
Bokareva, T., et al.: Wireless sensor networks for battlefield surveillance. In: Land Warfare Conference, Brisbane, pp. 1–8 (2006)
Sikdar, D., Bhargav, K.R.K., Dewangan, S.: Effectuation of wireless sensor networks for human rescue missions using RF signal detection. In: 1st International Conference on Wireless Technologies for Humanitarian Relief, pp. 309–313. ACM Press, Kerala (2011)
Balister, P., Zheng, Z., Kumar, S., Sinha, P.: Trap coverage: allowing coverage holes of bounded diameter in wireless sensor networks. In: IEEE INFOCOM, pp. 136–144. IEEE Press, Rio de Janeiro (2009)
Khosravi, H.: Optimal node scheduling for desired percentage of coverage in wireless sensor networks. Wirel. Sens. Netw. 4, 127–132 (2012)
Huang, C.-F., Tseng, Y.-C.: The coverage problem in a wireless sensor network. Mob. Netw. Appl. 10, 519–528 (2005)
Yu, J., Wan, S., Cheng, X., Yu, D.: Coverage contribution area based k-coverage for wireless sensor networks. IEEE Trans. Veh. Technol. 66, 8510–8523 (2017)
Megerian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Worst and best-case coverage in sensor networks. IEEE Trans. Mob. Comput. 4, 84–92 (2005)
Kashi, S.S., Sharifi, M.: Coverage rate calculation in wireless sensor networks. Computing 94, 833–856 (2012)
Sahoo, P.K., Liao, W.-C.: HORA: a distributed coverage hole repair algorithm for wireless sensor networks. IEEE Trans. Mob. Comput. 14, 1397–1410 (2015)
Xing, G., Wang, X., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Trans. Sens. Netw. 1, 36–72 (2005)
Niculescu, D., Nath, B.: Ad hoc positioning system (APS). In: Global Telecommunications Conference, pp. 2926–2931. IEEE, San Antonio (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sharma, A., Chauhan, S. (2018). Optimal Threshold Coverage Area (OTCA) Algorithm for Random Deployment of Sensor Nodes in Large Asymmetrical Terrain. In: Singh, M., Gupta, P., Tyagi, V., Flusser, J., Ören, T. (eds) Advances in Computing and Data Sciences. ICACDS 2018. Communications in Computer and Information Science, vol 906. Springer, Singapore. https://doi.org/10.1007/978-981-13-1813-9_4
Download citation
DOI: https://doi.org/10.1007/978-981-13-1813-9_4
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1812-2
Online ISBN: 978-981-13-1813-9
eBook Packages: Computer ScienceComputer Science (R0)