Real Time Dynamic Node Scheduling and Key Distribution based Secure Routing in WSN for Improved Lifetime Maximization

Authors

  • R. Senthil Kumar
  • M. Prakash

Abstract

The problem of lifetime maximization and secure routing in Wireless Sensor Networks (WSN) has been well studied. Number of techniques available for the secure connectivity and data transmission in WSN. The methods suffer to achieve expected performance in secure routing in WSN and struggle to achieve higher lifetime of network. To improve the performance, an dynamic scheduling and key distribution algorithm is described in this article. The lifetime of network is highly depending on the energy parameter and by scheduling the nodes of WSN the lifetime of network can be improved highly. The scheduling algorithm maintains the node status and energy details in triggering the nodes status. At each session, the method discovery the routes to reach the destination and eliminates the poor energetic routes. For each route, the method estimates the secure routing weight (SRW) and based on that, the method selects a single route to reach the destination. For the nodes of route, the method distributes a key which is active for the current session. The nodes of the selected route only will be active for the session and the rest will be in silent mode. The proposed method improves the performance of security and lifetime of the network.

Downloads

Published

2019-12-24

Issue

Section

Articles