Abstract
The linked governance set has presently been introduced as an attractive scheme to the region analysis in wireless sensor networks (WSNs). Therefore the key issue bothering the behavior of the prevailing Minimal sized Governing Set (MGS) based analysis standards is that they are focused on increasing the count of sleep nodes to safeguard the energy. It makes the lively sensors to feel immense loads for handling voluminous adjacencies. The quicker depletion of the lively sensors might detach the network standard and discards the region explored. Hence for offering an improved transmission of the network association analysis and lifespan, a precise count of sensors must be triggered. The intention is based on the angle restricted minimal load allowance of the MGS issues termed as Angle Restricted minimal load MGS (ARGS) to design the region analysis in WSNs. The precise decision of the angle restriction of ARGS equalizes the load within the network on the lively sensors enhances the network analysis and lifespan. The knowledge automation-based heuristics termed as Automata Theory-based Energy Efficient Area algorithm (ATEEA) is designed for locating a close optimal solution to the substitution identical ARGS issues in WSN. The analysis difficulties of the designed scheme to locate the optimal solution of the region analysis issue are estimated. Diverse experiments are performed to depict the supremacy of the designed analysis standards over the prevailing MGS-based schemes in terms of rate of coverage region, remaining energy, number of lively nodes and the lifetime of the networks.
Similar content being viewed by others
References
Karthikeyan, A., Arunachalam, V. P., & Karthik, S. (2019). Performing data assessment in terms of sensor node positioning over three dimensional wireless. Mobile Networks and Applications. https://doi.org/10.1007/s11036-019-01386-5
Zeng, Y., Sreenan, C. J., Xiong, N., Yang, L. T., & Park, J. H. (2010). Connectivity and coverage maintenance in wireless sensor networks. Journal of Supercomputing, 52(1), 23–46
Sengupta, S., Das, S., Nasir, M. D., & Panigrahi, B. K. (2012). Multi-objective node deployment in WSNs: In search of an optimal trade-off among coverage, lifetime, energy consumption, and connectivity. Engineering Applications of Artificial Intelligence, 26(01), 405–416
Zhu, C., Zheng, C., Shu, L., & Han, G. (2012). A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications, 35(2), 619–632
Rizvi, S., Qureshi, H. K., Khayam, S. A., Rakocevic, V., & Rajarajan, M. (2012). A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks. Journal of Network and Computer Applications, 35(2), 597–605
Karthikeyan, A., Arunachalam, V. P., & Karthik, S. (2019). Attempting to model a fresh three dimensional coverage scheme for wireless sensor networks. Wireless Personal Communications. https://doi.org/10.1007/s11277-019-06759-3
Guvensan, M. A., & Yavuz, A. G. (2011). On coverage issues in directional sensor networks: A survey. Ad Hoc Networks, 9(7), 1238–1255
Wightman, P. M., & Labrador, M. A. (2011). A family of simple distributed minimum connected dominating set-based topology construction algorithms. Journal of Network and Computer Applications, 34(6), 1997–2010
Ammari, H. M., & Das, S. K. (2012). Centralized and clustered k-coverage protocols for wireless sensor networks. IEEE Transactions on Computers, 61(1), 118–133
Hefeeda, M., & Ahmadi, H. (2010). Energy-efficient protocol for deterministic and probabilistic coverage in sensor networks. IEEE Transactions on Parallel and Distributed Systems, 21(5), 579–593
Tang, L., Lu, Z., & Fan, B. (2020). Energy efficient and reliable routing algorithm for wireless sensors networks. Applied Sciences, 10, 1885. https://doi.org/10.3390/app10051885
Misra, S., Kumar, M. P., & Obaidat, M. S. (2011). Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks. Computer Communications, 34(12), 1484–1496
Lee, D. T., & Lin, A. K. (1986). Computational complexity of art gallery problems. IEEE Transactions on Information Theory, 32(2), 276–282
Gregg, W. W., Esaias, W. E., Feldman, G. C., Frouin, R., Hooker, S. B., McClain, C. R., & Woodward, R. H. (1998). Coverage opportunities for global ocean color in a multimission era. IEEE Transactions on Geoscience and Remote Sensing, 36(5), 1620–1627
Huang, C. F., & Tseng, Y. C. (2005). A survey of solutions to the coverage problems in wireless sensor networks. Journal of Internet Technology, 6(1), 1–8
Cardei, M., & Wu, J. (2006). Energy-efficient coverage problems in wireless ad hoc sensor networks. Computer Communications, 29(4), 413–420
Watfa, M. K., & Commuri, S. (2007). Boundary coverage and coverage boundary problems in wireless sensor networks. International Journal of Sensor Networks, 2(3), 273–283
Ram, S., Majunath, D., Iyer, S., & Yogeshwaran, D. (2007). On the path coverage properties of random sensor networks. IEEE Transactions on Mobile Computing, 6(5), 494–506
Cheng, X., Du, D. Z., Wang, L., & Xu, B. (2008). Relay sensor placement in wireless sensor networks. Wireless Networks, 14(3), 347–355
Fang, Z., & Wang, J. (2008). Convex combination approximation for the mincost WSN point coverage problem. In Proceedings of the third international conference on wireless algorithms, systems, and applications, Dallas, Texas (pp. 188–199).
Wang, B., Lim, H. B., & Ma, D. (2009). A survey of movement strategies for improving network coverage in wireless sensor networks. Computer Communications, 32(13–14), 1427–1436
Ghosh, A., & Das, S. K. (2008). Coverage and connectivity issues in wireless sensor networks: A survey. Pervasive and Mobile Computing, 4(3), 303–334
Rajaram, P., & Prakasam, P. (2016). Shape and area based coverage connectivity using robots in wireless sensor networks. Journal of Signal Processing and Wireless Networks, 01(01), 29–34
Li, Y., Thai, M. T., Wang, F., Yi, C. W., Wang, P. J., & Du, D. Z. (2005). On greedy construction of connected dominating sets in wireless networks. Wireless Communications and Mobile Computing, 5, 927–932
Alzoubi, K. M., Li, X. Y., Wang, Y., Wan, P. J., & Frieder, O. (2003). Geometric spanners for wireless ad hoc network. IEEE Transactions on Parallel and Distributed Systems, 14(4), 408–421
Dai, F., & Wu, J. (2004). An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, 15(10), 908–920
Butenko, S., Cheng, X., Oliveira, C., & Pardalos, P. M. (2004) A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks. In Recent developments in cooperative control and optimization, Springer book series (pp. 61–73).
Wightman, P., & Labrador, M. (2008) A3: A topology construction algorithm for wireless sensor networks. In Proceedings of IEEE global communications conference (GLOBECOM), New Orleans, USA.
Biabani, M., Fotouhi, H., & Yazdani, N. (2020). An energy-efficient evolutionary clustering technique for disaster management in IoT networks. Sensors, 20(9), 2647. https://doi.org/10.3390/s20092647
Sathyaprakash, P., & Prakasam, P. (2017). Proposed energy efficient multi attribute time slot scheduling algorithm for quality of service in wireless sensor network. Wireless Personal Communications, 97(4), 5951–5968
Alghamdi, T. A. (2020). Energy efficient protocol in wireless sensor network: optimized cluster head selection model. Telecommunication Systems, 74, 331–345
Narendran, M., & Prakasam, P. (2017). An energy aware competition based clustering for cluster head selection in wireless sensor network with mobility. Cluster Computing, 22(s5), 11019–11028
Mittal, N. (2020). An energy efficient stable clustering approach using fuzzy type-2 bat flower pollinator for wireless sensor networks. Wireless Personal Communications, 112, 1137–1163
Maheshwari, P., Sharma, A. K., & Verma, K. (2021). Energy efficient cluster based routing protocol for WSN using butterfly optimization algorithm and ant colony optimization. Ad Hoc Networks, 110. https://doi.org/10.1016/j.adhoc.2020.102317.
Narendra, K. S., & Thathachar, M. A. L. (1989). Learning automata: An introduction. Prentice-Hall.
Thathachar, M. A. L., & Harita, B. R. (1987). Learning automata with changing number of actions. IEEE Transactions on Systems, Man, and Cybernetics, 17(6), 1095–1100
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Karthikeyan, A., Prakasam, P., Karthik, S. et al. Automata Theory-based Energy Efficient Area Algorithm for an Optimal Solution in Wireless Sensor Networks. Wireless Pers Commun 120, 1125–1143 (2021). https://doi.org/10.1007/s11277-021-08507-y
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-021-08507-y