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.
A. Arun Kumar : School of Computer Science and Engineering VIT University, Chennai campus - 600128, India
Harmony search algorithm
Wireless sensor
networks
Energy Efficiency
Harmony memory considering rate(HMCR) and pitch
adjusting rate(PAR) are calculated and the result is
shown in the form of a graph, as it is the metaheuristic
algorithms it will take the inputs in the form of 0’s and
1’s. the formation of maximum number of covers is
possible when the targets are placed inside the particular
sensing range. Sensors collects various targets and those
sensors which covers all targets will be gathered as a
single cover. Harmony has the functionality as per the
memetic algorithm where the representation is used for
representing order based chromosomes. We need to find
the fitness function value of the chromosomes, then we
need to do the crossover and mutation to ensure the
legality in an order. So there should not be any duplicate
numbers in an order.
[1] Chaun-Kang Ting, Chein-Chih Liao “A memetic
algorithm for extending wireless sensor network
lifetime” Information sciences 180 (2010) page
no.:4818.
[2] Zong Woo Geem, Joong Hoon Kim, G.V.Loganathan
“A new heuristic optimization algorithm harmony
search” simulation 76:2, 60-68.
[3] Weyland, Dennis “A rigorous analysis of the harmony
search algorithm” metaheuristic computing1(2):50-60.
[4] Sorensen,Kenneth “The metaphor exposed” operational
research.
[5] Yu Gu, Yusheng Ji, Jie Li, Baohma Zhao, “centralized
and clustered k-coverage protocols for WSN” Eurasip
2012:74[march 2012].
[6] Guotang Nan, Guanxiong Shi, Zhifei Mao, Min
quaingLi , “Efficient energy consumption in two tiered
sensor network using genetic algorithm” Eurasip
2012:44[14 feb 2012].
[7] Dexuan Zou, Liquon Gao, Steven Li, Jianhna Wu, Xin
Wang “A novel global harmony search algorithm for
task assignment problem” Journal of systems and
software 83(2010)1678-1688.
