Link Restoration and Relay Node Placement in Partitioned Wireless Sensor Network
Manwinder Singh, Anudeep Gandam · 2021
The main motive of Wireless Sensor Network (WSN) node is to sense and gather information from a specific domain and then send it to the sink where the application lies. This chapter proposes an approach for optimum relay node placement. There are many ways to distinguish the sensor nodes in WSN environment, but they are broadly classified into two types: homogenous and heterogeneous network clustering algorithms. WSN consist of n number of sensor nodes out of which m number of cluster heads and a base station. By using the k-means clustering method, the network is grouped into clusters. This method is approached by taking the mean value of the nodes. For the location calculation an objective function is designed which is based on the values of the number of packets lost, residual energy of nodes in the network and distance between the nodes by using k-means algorithm.