Secure routing in wireless sensor networks with pruning and pattern synthesis process

Abstract

Wireless Sensor Network (WSN) is one of the most promising technologies of this decade. Its design is determined by many factors such as network topology, routing, transmission errors and energy consumption. Consequently designing a WSN application introduces several routing and security challenges. WSN deployment for secure routing is highly demanding due to unpredictable and unfriendly nature of environments. The routing security and network lifetime in WSNs should be enhanced. Subsequently it can be extended by optimizing the routing with a finite number of mobile sensors. The proposed routing algorithms provide a decision and control mechanism at each sensor node during routing rather than the only power newlinemanagement which is used in the literature. In this research, the solutions for wireless sensor network issues such as secure routing, finding shortest paths, liminating route modifiers, crashing critical longest path are taken into consideration. The solutions are presented in the form, namely, Improved ersion of Data Filtration (IVDF), Pruning Route Modifiers (PRM), Pattern Synthesis Process (PSP) and Crashing Critical Path (CCP). The IVDF algorithm is explored to detect and prevent the bogus routing information which is injected to the wireless motes for communication. To establish an effective communication in military as well as civilian applications, an efficient scheme to detect the bogus routing information which depletes the energy of the sensors in en-route nodes is required. In this research, a bandwidth efficient rekeying for filtering injected newlinebogus routing information is proposed. newline newline