Routing in Wireless Sensor Networks with Asymmetric Links

Abstract

Energy utilization is a significant factor while designing a routing algorithm in Wireless Senor Networks (WSN). In Wireless networks, network lifetime is directly related to energy consumption of senor nodes. Initial energy of nodes reduces at every transmission of data packets and once complete energy of nodes depletes node dies and replacement of battery is not possible in every case due to hassle environment. To improve lifetime period sensing, aggregation and transmission function performs in such a way that minimizes the energy consumption. Direct transmission of data from sensor to Base station consumes more energy; hence it is important to choose routing that had energy efficient mechanism. In proposed work, clustering algorithm used to organize nodes into cluster for transmission of data from nodes to base station. Proposed algorithm works well in both centralized and distributed environment. Proposed routing Cluster formation and selecting cluster head, which transfer data from their cluster nodes to base station, uses hierarchical clustering algorithm and considers distance parameter, energy index and RSSI value to compute proximity matrix for forming clusters. In proposed algorithm randomized and distributed approach taken which exhibits improvement in network lifetime by reducing energy consumption while transmission. Comparison of results with exiting algorithm shows the better performance of proposed algorithm.