M.A. Thesis:

Agenetic algorithm based distance- aware routing ptotocol for wireless sensornetwork

Today the role of wireless tools is indisputable in IT fields. One of the most important fields of research on wireless devices is the wireless sensor networks. In wireless sensor networks the most important challenge is the energy consumption of sensors. In fact to send data to the base station must be selected reasonble method to minimize energy consumption of the wireless sensor network and maximize network lifetime. One of the most practical routing methods in sensor networks is clustering. The issue of clustering of sensors was a problem of NP-Hard and so far in the past meta heuristic methods have been used to solve this problem. One of the most important ways to solve wireless network optimization is to use the genetic algorithm. In this thesis a method based on improved genetic algorithm is proposed based on the parameters of distance and energy. The proposed method in this thesis is an improved method of GADA_LEACH. In the proposed method in addition to the nodes of the cluster the nodes are chosen as relays so that if the node is less than the desired node to the central station node than the distance between the nodes of the cluster head and the central station, the relay node is used. The results of the simulation of the proposed method show that the proposed method can perform better than conventional clustering methods in this field of study with better routing performance in a wireless sensor network

Keywords: Wireless Sensor Network, Energy Consumption, Life time, Improved Genetic Algorithm