# An Energy-Efficient and Secure Routing Protocol for Intrusion Avoidance in IoT-Based WSN
###### Abstract  
Due to the advancement of information and communication technologies, the use of Internet of Things (IoT) devices has increased exponentially. In the development of IoT, wireless sensor networks (WSNs) perform a vital part and comprises of low-cost smart devices for information gathering. However, such smart devices have constraints in terms of computation, processing, memory and energy resources. Along with such constraints, one of the fundamental challenges for WSN is to achieve reliability with the security of transmitted data in a vulnerable environment against malicious nodes. This paper aims to develop an energy-efficient and secure routing protocol (ESR) for intrusion avoidance in IoT based on WSN to increase the network period and data trustworthiness. Firstly, the proposed protocol creates different energy-efficient clusters based on the intrinsic qualities of nodes. Secondly, based on the (\(k\),\(n\)) threshold-based Shamir secret sharing scheme, the reliability and security of the sensory information among the base station (BS) and cluster head are achieved. The proposed security scheme presents a light-weight solution to cope with intrusions generated by malicious nodes. The experimental results using the network simulator (NS-2) demonstrate that the proposed routing protocol achieved improvement in terms of network lifetime as 37%, average end-to-end delay as 24%, packet delivery ratio as 30%, average communication cost as 29%, network overhead as 28% and the frequency of route re-discoveries as 38% when compared with the existing work under dynamic network topologies. Keywords:Internet of Things; network lifetime; smart devices; intrusion defence; secure routing +
Footnote †: journal:  
_Article_  
An Energy-Efficient and Secure Routing Protocol for Intrusion Avoidance in IoT-Based WSN [PERSON] 1\({}^{\copyright}\), [PERSON] 2,*({}^{\copyright}\), [PERSON] 1, [PERSON] 3\({}^{\copyright}\) and [PERSON] 1  
Footnote 1: email: [EMAIL_ADDRESS] (N.I. ); [EMAIL_ADDRESS]. manner for information capturing with limited constraints in terms of different resources i.e., energy, computational, memory and processing power. However, due to the complex structure of WSN and restricted constraints on sensor nodes, implementing security for IoT systems is hard to process and communication may compromise with the variety of network attacks [12; 13]. Moreover, WSNs based on IoT are used in both attended and unattended environments such as air pollution, water quality monitoring, smart cities, etc., another critical matter is to improve energy efficiency [14; 15] besides reliable data forwarding. In the past, different researchers have been presented with a cluster-based solution for WSN to achieve energy efficiency [16; 17; 18; 19; 20]. In clustering schemes, the nodes are separated into different regions with one cluster head referred to as the leader node. The aim of the cluster head is to collect the data from member nodes, aggregate them and further forwarded towards the base station (BS). The data transmission from cluster heads to BS may be accomplished either using single hop or multi-hop strategy. Probabilistic and non-probabilistic methods are mainly two kinds of clustering solutions. In probabilistic [21; 22; 23; 24; 25], clusters are generated in randomly order, which results in unbalanced load distribution and energy consumption. On the other hand, the non-probabilistic method [26; 27; 28; 29] uses multiple factors for the selection of cluster heads. Although, the non-probabilistic methods give an improved performance as compared to traditional probabilistic methods, however, because of dynamic nature of sensor nodes [30; 31; 32; 33; 34], improving energy conservation and routing robustness are still open challenges for IoT based on WSN. This research paper focuses on developing an energy-efficient and secure routing protocol to achieve reliable network communication against malicious threats.