Research On Energy Balanced Routing Algorithm For Wireless Sensor Networks Based On Small World

Wireless Sensor Networks(WSNs)are self-organizing networks with wireless communication technology,which consist of many small,low-energy sensor nodes.At present,it has been widely used in health monitoring,environmental monitoring,natural disaster prevention,and smart home.Since sensor nodes are mostly deployed in environments that are inaccessible to humans or dangerous,it is difficult to manually replace the battery when the node’s energy is exhausted.In addition,most data transmission in WSNs adopt multi-hop routing.It will lead to the premature death of nodes close to the Sink node and resulted in the energy hole of the network.Therefore,under the condition of limited network energy,how to ensure the network energy balance,improve node utilization and extend network lifetime are the focus of the whole research.Small world network has the characteristics of small average path length and large clustering coefficient.We introduce it into WSNs,which can reduce the communication overhead of the whole network,balance the energy consumption of nodes and extend the network lifetime.This paper focuses on the research of energy balanced routing algorithm and the main work of this paper is as follows:(1)In this paper,the small world feature is introduced into the wireless sensor network.New links are created between some nodes and Sink in real-time to reduce the load of nodes near Sink nodes according to the parameters in network,such as clustering coefficient,betweenness,residual energy,etc.At the same time,the link energy cost of the network is optimized to reduce the number of low-energy nodes and balance the network energy consumption.An energy balance routing algorithm based on small-world WSN considering neighbor’s node energy(EN-SWSN)is proposed.Simulation results show that the proposed algorithm has obvious advantages in balancing network energy,extending network lifetime,and improving node utilization.(2)In this paper,the Sensor Scheduling for Partial Coverage Problem(SSPC)is analyzed.Its objective is to reduce the number of working nodes and prolong the network lifetime by scheduling nodes in the network on the premise of guaranteeing coverage requirements and network connectivity.In order to solve the SSPC problem,we propose a node scheduling routing algorithm based on NCS(NS-NCS)on the basis of the Node cooperative sensing model(NCS).Simulation results show that this algorithm has obvious advantages in prolonging network lifetime and reducing node energy consumption.The network lifetime increases with the increase of the initial energy of nodes.At the same initial energy,the network lifetime of NS-NCS is improved by more than 1.5 times and 1.1times compared to EN-SWSN and NS-DCM,respectively.