Analysing Effects of Asymmetric Linkage on Wireless Sensor Networks
Power consumption is an important factor when designing a route algorithm for Wireless Senor Networks (WSN). In Wireless Networks, the life time of a network is directly related to the power consumption of sensor nodes. The initial power of the nodes decreases in all data packet transfers and when the full power of the nodes eliminates the dying area and battery replacement does not occur in all cases due to local complexity. In order to develop a lifetime sensor, integration and transfer function work in a way that reduces energy consumption. The direct transfer of data from the sensor to the Base station consumes additional energy; therefore it is important to choose a route with a power saving device. In the proposed task, a merging algorithm is used to group nodes into groups in order to transfer data from nodes to the base channel. The proposed algorithm works well in both central and distributed environments. Composition of the proposed Cluster and selecting a cluster head, which transfers data from its cluster node to the base station, uses a hierarchical clustering algorithm and considers the distance parameter, power index and RSSI value to calculate proximity matrix to form clusters. In the proposed system a random and distributed algorithm taken that shows improvements in network life by reducing power consumption during transmission. Comparison of the results with the output algorithm indicates better performance of the proposed algorithm.