Lifetime Extension of Wireless Sensor Network Using Harmony Search Algorithm

Abstract

– The lifetime of wireless sensor networks could be extended and it could cover all targets is based on memetic algorithm approach. Darwinian evolutionary and Lamarckian enhancement uses memetic algorithm. This algorithm also gives better solution than any other algorithms. Many Task Assignment Problems(TAP) and particle swarm optimization techniques formulated this harmony search algorithm. The harmony search algorithm performs certain steps. Firstly, show the WSN creation in MATLAB. Placing the nodes and sensor covers up which targets at a particular sensing range. Initially we will be generating the values using random permutation. We can also find the simulation with different sensing ranges and different population. It holds certain memetic algorithm processes such as Representation, fitness function, selection, crossover, mutation and compact operator. SET K-cover is initialized with harmony search, where cover forms a major advantage. Each covers plays a vital role in energy efficiency. Active and inactive state performs the usage of sensors and when it is not in use it will be inactive state which in turn helps us for conserving the energy. It also has been optimization techniques such as LP,NLP,DP. The improvisation of music player is named as harmony search.