Cluster-based Coverage Scheme for Wireless Sensor Networks using Learning Automata
محورهای موضوعی : Wireless Network
Ali Ghaffari
1
,
Seyyed Keyvan Mousavi
2
1 - Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran
2 - Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, Iran
کلید واژه: Wireless sensor networks, Clustering, Learning automata, Network coverage,
چکیده مقاله :
Network coverage is one of the most important challenges in wireless sensor networks (WSNs). In a WSN, each sensor node has a sensing area coverage based on its sensing range. In most applications, sensor nodes are randomly deployed in the environment which causes the density of nodes become high in some areas and low in some other. In this case, some areas are not covered by none of sensor nodes which these areas are called coverage holes. Also, creating areas with high density leads to redundant overlapping and as a result the network lifetime decreases. In this paper, a cluster-based scheme for the coverage problem of WSNs using learning automata is proposed. In the proposed scheme, each node creates the action and probability vectors of learning automata for itself and its neighbors, then determines the status of itself and all its neighbors and finally sends them to the cluster head (CH). Afterward, each CH starts to reward or penalize the vectors and sends the results to the sender for updating purposes. Thereafter, among the sent vectors, the CH node selects the best action vector and broadcasts it in the form of a message inside the cluster. Finally, each member changes its status in accordance with the vector included in the received message from the corresponding CH and the active sensor nodes perform environment monitoring operations. The simulation results show that the proposed scheme improves the network coverage and the energy consumption.
Network coverage is one of the most important challenges in wireless sensor networks (WSNs). In a WSN, each sensor node has a sensing area coverage based on its sensing range. In most applications, sensor nodes are randomly deployed in the environment which causes the density of nodes become high in some areas and low in some other. In this case, some areas are not covered by none of sensor nodes which these areas are called coverage holes. Also, creating areas with high density leads to redundant overlapping and as a result the network lifetime decreases. In this paper, a cluster-based scheme for the coverage problem of WSNs using learning automata is proposed. In the proposed scheme, each node creates the action and probability vectors of learning automata for itself and its neighbors, then determines the status of itself and all its neighbors and finally sends them to the cluster head (CH). Afterward, each CH starts to reward or penalize the vectors and sends the results to the sender for updating purposes. Thereafter, among the sent vectors, the CH node selects the best action vector and broadcasts it in the form of a message inside the cluster. Finally, each member changes its status in accordance with the vector included in the received message from the corresponding CH and the active sensor nodes perform environment monitoring operations. The simulation results show that the proposed scheme improves the network coverage and the energy consumption.
[1] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," Computer networks, vol. 38, no. 4, pp. 393-422, 2002.
[2] D. KeyKhosravi, A. Ghaffari, A. Hosseinalipour, and B. A. Khasragi, "New Clustering Protocol to Decrease Probability Failure Nodes and Increasing the Lifetime in WSNs," Int. J. Adv. Comp. Techn., vol. 2, no. 2, pp. 117-121, 2010.
[3] A. Ghaffari, "Designing a wireless sensor network for ocean status notification system," Indian Journal of Science and Technology, vol. 7, no. 6, pp. 809-814, 2014.
[4] A. Ghaffari, "Congestion control mechanisms in wireless sensor networks: A survey," Journal of network and computer applications, vol. 52, pp. 101-115, 2015.
[5] A. Seyfollahi and A. Ghaffari, "A lightweight load balancing and route minimizing solution for routing protocol for low-power and lossy networks," Computer Networks, vol. 179, p. 107368, 2020.
[6] A. Seyfollahi and A. Ghaffari, "Reliable data dissemination for the Internet of Things using Harris hawks optimization," Peer-to-Peer Networking and Applications, vol. 13, no. 6, pp. 1886-1902, 2020.
[7] J. A. Torkestani, "An adaptive energy-efficient area coverage algorithm for wireless sensor networks," Ad hoc networks, vol. 11, no. 6, pp. 1655-1666, 2013.
[8] S. M. Mohamed, H. S. Hamza, and I. A. Saroit, "Coverage in mobile wireless sensor networks (M-WSN): A survey," Computer Communications, vol. 110, pp. 133-150, 2017.
[9] A. Ghaffari and A. Rahmani, "Fault tolerant model for data dissemination in wireless sensor networks," in Information Technology, 2008. ITSim 2008. International Symposium on, 2008, vol. 4, pp. 1-8: IEEE.
[10] H. D. Nikokheslat and A. Ghaffari, "Protocol for Controlling Congestion in Wireless Sensor Networks," Wireless Personal Communications, vol. 95, no. 3, pp. 3233-3251, 2017.
[11] P. Natarajan and L. Parthiban, "k-coverage m-connected node placement using shuffled frog leaping: Nelder–Mead algorithm in WSN," Journal of Ambient Intelligence and Humanized Computing, pp. 1-16, 2020.
[12] C. Shivalingegowda and P. Jayasree, "Hybrid gravitational search algorithm based model for optimizing coverage and connectivity in wireless sensor networks," Journal of Ambient Intelligence and Humanized Computing, pp. 1-14, 2020.
[13] M. El-Hosseini, H. ZainEldin, H. Arafat, and M. Badawy, "A fire detection model based on power-aware scheduling for IoT-sensors in smart cities with partial coverage," Journal of Ambient Intelligence and Humanized Computing, pp. 1-20, 2020.
[14] R. Yarinezhad and S. N. Hashemi, "A sensor deployment approach for target coverage problem in wireless sensor networks," Journal of Ambient Intelligence and Humanized Computing, pp. 1-16, 2020.
[15] A. Pakmehr and A. Ghaffari, "Coverage Improving with Energy Efficient in Wireless Sensor Networks," Information Systems & Telecommunication, p. 57.
[16] M. A. Benatia, M. h. Sahnoun, D. Baudry, A. Louis, A. El-Hami, and B. Mazari, "Multi-Objective WSN Deployment Using Genetic Algorithms Under Cost, Coverage, and Connectivity Constraints," Wireless Personal Communications, vol. 94, no. 4, pp. 2739-2768, 2017.
[17] A. Xenakis, F. Foukalas, G. Stamoulis, and I. Katsavounidis, "Topology control with coverage and lifetime optimization of wireless sensor networks with unequal energy distribution," Computers & Electrical Engineering, 2017.
[18] J. Roselin, P. Latha, and S. Benitta, "Maximizing the wireless sensor networks lifetime through energy efficient connected coverage," Ad Hoc Networks, vol. 62, pp. 1-10, 2017.
[19] D. Thomas, R. Shankaran, M. Orgun, and S. Mukhopadhyay, "A secure barrier coverage scheduling framework for WSN-based IoT applications," IEEE Transactions on Green Communications and Networking, 2021.
[20] C. Shivalingegowda and P. Jayasree, "Hybrid gravitational search algorithm based model for optimizing coverage and connectivity in wireless sensor networks," Journal of Ambient Intelligence and Humanized Computing, vol. 12, no. 2, pp. 2835-2848, 2021.
[21] J. Yu, Y. Chen, L. Ma, B. Huang, and X. Cheng, "On connected target k-coverage in heterogeneous wireless sensor networks," Sensors, vol. 16, no. 1, p. 104, 2016.
[22] N.-T. Le and Y. M. Jang, "Energy-efficient coverage guarantees scheduling and routing strategy for wireless sensor networks," International Journal of Distributed Sensor Networks, vol. 11, no. 8, p. 612383, 2015.
[23] S. S. Dhillon, K. Chakrabarty, and S. S. Iyengar, "Sensor placement for grid coverage under imprecise detections," in Information Fusion, 2002. Proceedings of the Fifth International Conference on, 2002, vol. 2, pp. 1581-1587: IEEE.
[24] K.-P. Shih, Y.-D. Chen, C.-W. Chiang, and B.-J. Liu, "A distributed active sensor selection scheme for wireless sensor networks," in Computers and Communications, 2006. ISCC'06. Proceedings. 11th IEEE Symposium on, 2006, pp. 923-928: IEEE.
[25] S. Soro and W. B. Heinzelman, "Cluster head election techniques for coverage preservation in wireless sensor networks," Ad Hoc Networks, vol. 7, no. 5, pp. 955-972, 2009.
[26] H. Mostafaei, A. Montieri, V. Persico, and A. Pescapé, "A sleep scheduling approach based on learning automata for WSN partial coverage," Journal of Network and Computer Applications, vol. 80, pp. 67-78, 2017.
[27] M. Akhlaq, T. R. Sheltami, and E. M. Shakshuki, "C3: an energy-efficient protocol for coverage, connectivity and communication in WSNs," Personal and Ubiquitous Computing, vol. 18, no. 5, pp. 1117-1133, 2014.
[28] Z. Sun, Y. Zhang, Y. Nie, W. Wei, J. Lloret, and H. Song, "CASMOC: a novel complex alliance strategy with multi-objective optimization of coverage in wireless sensor networks," wireless Networks, vol. 23, no. 4, pp. 1201-1222, 2017.
[29] A. Khelil and R. Beghdad, "SPMI: Single Phase Multiple Initiator Protocol for Coverage in Wireless Sensor Networks," Wireless Personal Communications, vol. 96, no. 2, pp. 3159-3178, 2017.
[30] T. G. Nguyen, C. So-In, N. G. Nguyen, and S. Phoemphon, "A novel energy-efficient clustering protocol with area coverage awareness for wireless sensor networks," Peer-to-Peer Networking and Applications, vol. 10, no. 3, pp. 519-536, 2017.
[31] Y. Hu, Y. Niu, J. Lam, and Z. Shu, "An energy-efficient adaptive overlapping clustering method for dynamic continuous monitoring in WSNs," IEEE Sensors Journal, vol. 17, no. 3, pp. 834-847, 2016.
