Routing Optimization And Analysis Based On Software Defined Wireless Sensor Network

Wireless Sensor Network(WSN)is widely used in military,IOT and environmental applications which comprised of wireless sensor nodes through self-organization.The main characteristic of wireless sensor networks is that their energy resources are limited.Therefore,it is critically important to improve energy efficience of sensor nodes.The researche focuses on designing an efficient routing algorithm to optimize the energy dissipation of sensor nodes.Firstly,we introduced software-defined wireless sensor network architecture and designed a clustering routing mechanism based on particle swarm algorithm which made full use of the global topology information collected by the controller to select cluster heads.In the clustering process,we considered the remaining energy of the node,the position of the cluster head and the sink node,the distances between the cluster heads,and the distances between the cluster heads and the nodes in the cluster.We used the particle swarm algorithm to achieve Cluster head optimization.The simulation results show that this algorithm has significant advantages in extending the network lifetime and reducing the average energy consumption compared with the traditional LEACH algorithm.Secondly,we proposed an energy efficient routing algorithm based on node location information.The main idea of this algorithm is to minimize the transmission energy according to the rules of the shortest distance transmission and achieve the purpose of saving energy consumption.Through simulation,we found that the energy-efficient routing algorithm was superior to the previous algorithm in extending the network lifetime,increasing the total amount of data transmitted,reducing the average energy consumption,and evenly distributing the energy of the nodes on the network.Finally,we utilized the knowledge of random geometry to model the second part of the routing algorithm,deduced the probability density function of the transmission energy of node and cumulative distribution function of arbitrary nodes in rectangular scenes and circular scenes and the average number of receiving times.By contrast,our theoretical derivation can accurately describe the energy consumption process of energy-efficient routing algorithms.Finally,we used the derived theoretical values to discuss the impact of different node density on the transmitting energy and received energy.