Designing a security unit to reduce the permeability of anonymous groups and congestion control in wireless sensor networks

Abstract

Recent developments in the fields of electronics and wireless communication have provided conditions to design and build lower power consumption sensors and use of radio signals for information communications has provided various applications. Design of such networks has their own specific challenges. One of these problems is the probability of congestion due to higher data transmission rate. Using radio signals, the hackers are able to pretend and introduce themselves as a network member through cracking security barriers and in this case the conditions are provided for hacker nodes to access critical information and other destructive activities. Hence, in this paper we will present a new algorithm for the problem of congestion and increase of security in the wireless sensor networks through designing a security unit for the head cluster. The security unit considers a switch for each node by using Linear Feedback Shift Registers (LFSR), till each node encode its data with the key and transfer it to the next node. In this algorithm, security coefficient and sensitive tasks are increased for networks with specific activities and the stepwise algorithm is used instead of end to end algorithm to ensure reliability of package arrival to solve the congestion problem.  In this algorithm, limitations of sensor networks such as limited energy and small size of nodes buffer are taken into account. Results of the evaluations carried out by NS2 simulator have shown that delay in package arrival is reduced, using such algorithm, fewer energy is consumed by the nodes and network lifetime is increased, accordingly.