An energy efficient routing protocol using hybrid evolutionary algorithm in wireless sensor networks Online publication date: Sat, 17-Jun-2017
by R. Sharmila; V. Vijayalakshmi; R. Rajashree
International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP), Vol. 5, No. 3/4, 2016
Abstract: Recently wireless sensor networks (WSNs) poked interest of many researchers for developing energy efficient clustering and routing protocol. Low-energy adaptive clustering hierarchy (LEACH), a well-known technique, depends on probability model and fails to maximise the energy efficiency. In this paper, a novel method to improve the network lifetime by combining ability of genetic algorithm (GA) and Tabu search (TS). Not to mention the greater advantage of the hybrid evolutionary algorithm for optimal selection of cluster heads (CHs) based on Tabu search algorithm. Most of the evolutionary algorithm (EA) based routing protocols prolong the lifetime of the network but it reduces the stability period. Using the proposed hybrid evolutionary algorithm, the stability period can be improved by selecting essential component for the fitness function; the best shortest path for routing a data among the network can be achieved by using Tabu search algorithm. The simulation is carried out in homogeneous network, it demonstrates that hybrid protocol is increasing the efficiency of network by reducing energy consumption and maximise network lifetime. By introducing hybrid algorithm, the stability period has been greatly enhanced as well.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com