International Journal of Electrical and Computer Engineering (IJECE) Vol. 13, No. 6, December 2023, pp. 6388~6398 ISSN: 2088-8708, DOI: 10.11591/ijece.v13i6.pp6388-6398  6388 Journal homepage: http://ijece.iaescore.com An efficient reconfigurable geographic routing congestion control algorithm for wireless sensor networks Mamatha M. Pandith 1 , Nataraj Kanathur Ramaswamy 1 , Mallikarjunaswamy Srikantaswamy 2 , Rekha Kanathur Ramaswamy 3 1 Department of Electronics and Communication Engineering, Don Bosco Institute of Technology, Bengaluru, Karnataka, India 2 Department of Electronics and Communication Engineering, JSS Academy of Technical Education, Bengaluru, Karnataka, India 3 Department of Electronics and Communication Engineering, SJB Institute of Technology, Bengaluru, Karnataka, India Article Info ABSTRACT Article history: Received Jan 15, 2023 Revised Mar 12, 2023 Accepted Mar 28, 2023 In recent times, huge data is transferred from source to destination through multi path in wireless sensor networks (WSNs). Due to this more congestion occurs in the communication path. Hence, original data will be lost and delay problems arise at receiver end. The above-mentioned drawbacks can be overcome by the proposed efficient reconfigurable geographic routing congestion control (RgRCC) algorithm for wireless sensor networks. the proposed algorithm efficiently finds the node’s congestion status with the help queue length’s threshold level along with its change rate. Apart from this, the proposed algorithm re-routes the communication path to avoid congestion and enhances the strength of scalability of data communication in WSNs. The proposed algorithm frequently updates the distance between the nodes and by- pass routing holes, common for geographical routing. when the nodes are at the edge of the hole, it will create congestion between the nodes in WSNs. Apart from this, more nodes sink due to congestion. it can be reduced with the help of the proposed RgRCC algorithm. As per the simulation analysis, the proposed work indicates improved performance in comparison to conventional algorithm. By effectively identifying the data congestion in WSNs with high scalability rate as compared to conventional methods Keywords: Carrier sense multiple access Congestion control Dynamic alternative path selection scheme Geographic routing Wireless sensor network This is an open access article under the CC BY-SA license. Corresponding Author: Mallikarjunaswamy Srikantaswamy Department of Electronics and Communication Engineering, JSS Academy of Technical Education Bengaluru, Karnataka, India Email: pruthvi.malli@gmail.com 1. INTRODUCTION The sink node and the sensor node are the two types of nodes in wireless sensor networks (WSNs). Sensors are minor in magnitude, restricted in energy and less in amount. They gather data and direct them to the sink node jump by jump. The sink accumulates data which is sensed and move it to the viewer. Congestion is unavoidable in such kind of structure [1]. A hovel or in other words a hole would form once the node energy in an area is drained. Such hovels extremely disturb functioning of the given network and could also breakdown the complete network. Hence, it is essential to evade congestion. The traffic and the resource control are two kinds of techniques of congestion control [2]. In the case of a traffic regulating technique, the source of data fine-tunes the transfer rate to avoid the data congestion. The data packets will go through other paths that are not congested, to the sink in resource control technique. Rapidly discovering fresh appropriate next hop nodes is tough. The novel next hop node quickly gets congested and drained [3]. The algorithm of routing in geographic area has little overhead of routing and respectable scalability and is ideal for significant networks, however it does not deliberate congestion regulation. The objective of such work is to find out a resource