%%class \documentclass{iaesarticle2} %%required package. add for your convenient, but do not remove the initial \usepackage{amsmath, amsfonts, amssymb, float, fancyhdr} \usepackage[figuresright]{rotating} \usepackage{authblk, graphicx, indentfirst, lastpage, lipsum} \setlength{\affilsep}{0cm} \renewcommand\Authfont{\normalsize} \renewcommand\Affilfont{\normalfont\small} \usepackage{subfig, caption, epstopdf} \usepackage[left=2.5cm, right=2cm, top=1.5cm, bottom=2cm, includehead, includefoot]{geometry} \usepackage{caption} \captionsetup{labelsep=period} \usepackage{titlesec} \titleformat{\section} {\normalfont\normalsize\bfseries\uppercase}{\thesection}{1em}{} \titlespacing*{\section}{0cm}{0.7cm}{0cm} %%leave copyright info to the editor \CopyrightLine[Copyright]{201x}{Institute of Advanced Engineering and Science.} %%author \author[*]{\bfseries Shanthi D L} \author[**]{\bfseries Dr. Keshava Prasanna} %%\author[*]{\bfseries Third Author} %%author's affiliation \affil[*]{Assistant Professor, Department of Information Science and Engineering, BMSIT \& M, Bangalore} \affil[**]{Professor \& Dean, Department of Computer Science and Engineering, CIT, Tumkur} %%title and shortitle (for footer) \title{Energy Efficient Intelligent Routing in WSN using Doinant Genetic Algorithm} \shorttitle{Energy Efficient Intelligent Routing in WSN (Sahnthi D L)} %%starting \begin{document} %%indentation. do not change \setlength{\parindent}{1.27cm} %%header and footer setting. do not change \pagestyle{fancy} \fancyhfoffset{0cm} %%journal info \journalname{International Journal of Electrical and Computer Engineering (IJECE)} \journalshortname{IJECE} \journalhomepage{http://iaesjournal.com/online/index.php/IJECE} \vol{x} \no{x} \months{May} \years{2013} \issn{2088-8708} %%build title \maketitle %%border setting. do not change \hrule \vspace{.1em} \hrule \vspace{.5em} \noindent \parbox[t][][s]{0.275\textwidth}{% \textbf{Article Info} \vspace{.5em} \hrule \vspace{.5em} \begin{history} %%article info. editor's privilege Received \today \par Revised \par Accepted \end{history} \vspace{.5em} \hrule \vspace{.5em} \begin{keyword} %%write keyword here. separate by \sep Energy Efficient \sep Heuristic \sep Genetic Algorithm \sep Network Lifetime \sep Mobility \vspace{.5em} \end{keyword} \vspace{\fill} } \parbox{0.025\textwidth}{\hspace{0.5em}} \parbox[t][][s]{0.7\textwidth}{% \begin{abstract} %% Text of abstract In the current era of wireless sensor network development, among the various challenging issues, the life enhancement has obtained the prime interest. Reason is clear and straight: the battery operated sensors do have limited period of life hence to keep the network active as much as possible, life of network should be larger. To enhance the life of the network, at different level different approaches has been applied, broadly defining the proper scheduling of sensors and defining the energy efficient communication. In this paper heuristic based energy efficient communication approch has applied. A new development in the Genetic algorithm has presented and called as Dominant Genetic algorithm to determine the optimum energy efficient routing path between sensor nodes and to define the optimal energy efficient trajectory for mobile data gathering node. Dominancy of high fitness solution has included in the Genetic algorithm because of its natural existence. The proposed solution has applied the connection oriented crossover and mutation operator to maintain the feasibility of generated solution. With various simulation experiments it has observed that proposed method not only has delivered the better solution but also very less number of iterations required as compared to conventional form of Genetic algorithm. \end{abstract} } \parbox[l]{\textwidth}{% \rule{0.275\textwidth}{0.5pt} \hspace{0.5cm} \hrulefill \\ \emph{\textbf{Corresponding Author:}}\\ %% correspondence info. separate by \\ Shanthi D L\\ Department of ISE\\ BMS Institute of Technology, Bangalore-64\\ 9449176450\\ gopalaiahshanthi@bmsit.in } \vspace{.5em} \hrule \vspace{.1em} \hrule %% main text \section{Introduction} \label{} The innovations and progress in wireless communication and micro-sensing delivers a useful means to observe environment, ecological system, personal health, in building smart-homes, military surveillance, vehicle monitoring and so on. Any sensor network is implemented using a huge number of tiny devices that are limited by sensing, processing, transmitting abilities, and are battery powered. Collecting data is the most common and essential tasks in sensor networks; effectiveness of executing data collection operation defines network lifetime. Due to the inadequate radio resources and the energy limitation on each sensor node, it is very motivating task to extend the network lifetime while maintaining certain data collection rate. Several ways are used to transfer the sensed data from sensor nodes to the base station for processing say multi-hop. Energy is the primary apprehension to Wireless Sensor Networks (WSNs) for all its transmission and reception of data but, consumes a lot of energy to synchronize and to ensure the location awareness of the sensors. \par A number of researchers have suggested mobility as a solution to the problem of data gathering. Contemporary study has revealed that a significant decrease in communication energy consumption using controlled mobility in WSN. Example, a Mobile Base Station (MBS) can go from place to place in the sensing area to collect data from nodes using short-range communications. Introduction of mobile nodes in to WSN, energy utilization of static nodes may be reduced. Unscheduled mobility of mobile node might increase latency in data collection. Hence, it is necessary that trajectory obtained by MBS should be optimal in the sense of travel distance and invested energy. Major limiting factor of a WSN is its node’s energy; which demands the design of an energy-efficient routing protocol that increases the whole system performance. In this paper two different perspectives of energy saving scheme in WSN has presented. In the first case the need of routing path between two sensors obtained which carry the minimum expenditure of energy while in other case the trajectory of mobile data gathering has been defined to collect the data from different local base nodes which already has the information of all sensors belonging to their clusters. It is assumed that in the first case there is no mobility observed among the sensors while in the second case cluster heads were already available. Because of complexity involved with the problem is NP hard, heuristic approach has applied to achieve the solution. Among the various possibilities, the heuristic approach of Genetic algorithm has proved with the time as one of the more dominant and wide applicable method. There are various issues with conventional approach of Genetic algorithm (CGA) like unfair selection of parents to produce offspring, locus of crossover point, strategy of mutation applied and more importantly balancing between exploration against exploitation. To overcome these issues, a dominant form of Genetic algorithm has proposed which provide fair opportunities to each and every parent in participation of offspring creation helps in exploration, while elite members of the population deliver the rule of dominancy to exploit better one. A fair selection process through tournament selection has applied which deliver the number of opportunities to each and every one to prove itself rather than fitness oriented selection which causes faster convergence with sub-optimal solution. From simulation experiments it has been observed that there is better and faster routing strategy achieved within very less number of iterations which makes the proposed solution very computation efficient also. \section{Related Work} \label{} In the direction of energy saving scheme in WSN, there were number of different approaches by different researchers have been proposed in the past. In \cite{Fengyuan}, using the theory of potential in physics, an Energy-Balanced Routing Protocol (EBRP) has been designed by creating a mixed virtual potential field in terms of depth, energy density, and residual energy. In \cite{Rong}, the nodes deployed in WSN uses the renewable energy generated by solar panels built over for routing and sensing, here energy-efficient routing protocol for energy harvesting WSN is designed and implemented. While choosing route the parameters considered are transmission quality, energy depletion and energy wasting and the effect of bit error rate (BER). To maximize this WSN feature, the data and message delivery routes are carefully chosen so that overall energy consumption is minimized. \cite{Bayani} Has analyzed a detailed comparison between typical WSN protocols and their impacts over the WSN lifetime and perceived that flat and cluster-based protocols can increase WSN lifetime in different ways. Study has presented in \cite{Esther} over basic optimization of base-station positioning in WSN so that the data from the sensors can be communicated in an energy-efficient manner. \cite{Chaonan} Has proposed a prototypical and evaluated the consistency and lifetime of a sensor node in three typical set-ups, providing precise reliability analysis of WSN systems. Substantial improvement in WSN lifetime could be attained by introducing standby or spare nodes. These spare nodes are substituted, once any prime (original) node is depleted with energy. \cite{Bilal} Has proposed the LEACH-SM protocol, this is a modified form of Low-Energy Adaptive Clustering Hierarchy (LEACH) designed by providing an optimum spare nodes and energy management in spares. \cite{Mariam} Has proposed Balanced Energy-Efficient Network Integrated Super Heterogeneous for heterogeneous WSNs to improve stability, lifetime and throughput. In the direction of improving the performance of WSN with respect to energy requisite and to increase network lifetime a communication/computation energy trade-off need to be analyzed \cite{Huseyin} The analysis could be made at network-level (i.e., all nodes in the network use the same strategy) or at a node-level (i.e., sensor nodes do not necessarily have identical strategies). \cite{Robert} Has explored a number of research methodologies and leeway to the problem that includes online routing, clustering methods, and lifetime maximization on specially structured network. Based on Lagrange relaxation method, \cite{Huynh} has proposed an energy optimization method to assure delay constraint. An objective function has been proposed in terms of energy consumption and delay and also defined a method to find an optimal multiplier for that objective function. Based on Ant colony algorithm optimal path for routing has proposed in \cite{Yongjun}. \cite{Jian} Has proposed an energy-efficient centroid-based routing protocol (EECRP) for WSN assisted IoT to get better performance of the network. Rumor routing is another typical random walk routing protocol defined, but the problem, is not scalable and can lead to spiral paths. \cite{Liu} Has considered straight-line routing (SLR) to decrease the energy utilization of sensor nodes in WSNs. Locality of sink node may considerably affect the energy dissipation and throughput of the network. \cite{Yahya} Has given investigation over an optimum position for the sink node in such a way that the sum of distances from all the sensor nodes to the sink node is minimized. An Energy Efficient Connected Coverage (EECC) scheduling is made use to extend the lifetime of the WSN is given in \cite{J.Roselin}. Secure and energy-efficient method of optimization has been proposed in \cite{Mao} using the Dij-Huff Method. \cite{Turki} Has proposed a WSN-based multi-hop network infrastructure, to increase network lifetime by optimizing the routing strategy. A proposal of a novel routing architecture has suggested in \cite{Sandeep} for severe environment monitoring in heterogeneous WSN. The aim was to improve the stability period and network lifetime by restriction the distance between the sensor nodes and the gateway node by mitigating the hot-spot problem in the network. Random projection based on compressed sensing might decrease the volume of data communicated in a WSN, and efficient routing could ease the network traffic. \cite{Jianhua} Presented a Random projection-Polar coordinate-Chain routing (RPC) scheme to develop the time and energy efficient protocol. The review in \cite{Felicia} has presented the state of the art in the energy management schemes, and the available challenges in the area of WSN. \cite{Mohamed} Has proposed a method to reduce the energy consumption by energy balancing in clusters among all sensor nodes to minimize the energy dissipation during network communications. \cite{Arun} Presented a distributed MAC and transceiver optimization technique for selective hop device selection to minimize energy consumption per bit and maximize the lifetime of sensor network. \section{Proposed Work} \label{} Mathematical representation of the objective function can be defined as the minimization of the total energy spends over the considered route path. In graphical model of simulated network of WSN G (V, E), Energy efficient routing between defined sensor nodes (P,Q) can be consider as finding a number of possible paths $\{P_i \, | i \in \left \{ 0,1,....\right \}\} $ sequentially over a set of graphs $\{G_i \, | i \in \left \{ 0,1,....\right \}\} $, which must carry the minimum energy cost path as given in equation (\ref {one}) \begin{equation} %CF(PQ) = {\rm Min\,} \left \{0,1, ... \right\} CF(PQ) = {\rm Min\,} \left \{\sum_{l\in P_i (s,r)} {CF_l} \right\} \label{one} \end{equation} %\left \{ \sum_{l \in \P_i \left \(s,r\right\)} {CF_l} \right\} \par The optimal routing has transformed as a problem of optimization where objective was to minimize the total invested travel cost as a function of energy. The optimization of objective function has achieved by applying a modified form of Genetic algorithm which has used a more natural mechanism of “Dominancy” in the formation of new solution population. Genetic algorithm has shown great interest by a number of researchers \cite{K.F. Man} - \cite{Holland}. \vspace{0.3em} \par A solution population is initialized for a defined source-destination sensor pair which uses a concept of connected possible solution in the feasibility domain of possible paths. An equal opportunity for each parent is performed through uniform distribution probability in the process of offspring formation. This step is very natural and provides the facility of better exploration of the solution domain. One point crossover operator has applied which carried the node connected feature, where a set of common nodes in both parents form the possible locus of crossover point. If there were more than one possible locus in the set, a uniform random process has applied to select the particular one. Such kind of cross over maintain the explored solution under the feasibility domain and may cause the change in the length of generated offspring. A dynamic mutation strategy for each locus of offspring has under low mutation probability to maintain the diversity is used. A possible candidate of mutation is the member from a set of all possible connected sensor nodes from the just previous sensor. Again such process maintains the feasibility of explored solution. Once the number of generated offspring’s is same as parent population size, both populations are merged to form a selection pool where a tournament selection process is applied. In this selection process for each member a number of opponent members are selected randomly and it depends upon the fitness comparison and a tournament score declared. The higher scored members form a new population. In the new population, under a defined range, a random number of members are selected as elite members as well as poorest members depending upon their fitness. Elite member generate the offsprings and they replace the poorest member from the population if their fitness is better. Such kind of dominancy is very obvious and could be observed in human population as well. This dominancy involvement makes population more fitter as well as increase the rate of convegence without compromise with the exploration level. The concept of conditional niche has also applied where the previous best observed solution replaces the weakest member of the solution if the fitness allowed. The obtained final population has considered as the next generation population for further process. The functional block diagram of proposed algorithm has shown in Fig.2.The number associated with the edges indicate the flow of process sequentially. \subsection{Chromosome representation} \label{} Initial solution population has defined under a constraint based definition of nodes connection between a predefined source-destination pair. The following steps are used in the formation of each member in the initial population. \vspace{.2em} \hrule \vspace{.1em} \hrule \vspace{.5em} \emph{\textbf{Pseudo code for initial solution formation:}} %\vspace{.1em} \begin{enumerate} \item Initialization of Population size \\ For each member: fixed Sr \& Dt: start solution as S $\longleftarrow$ [Sr] \item Find Possible neighbors of last member of S, say NR $\longleftarrow$ \{Ni,Nj,....Nm\} \item Add a node from set NR to S: [Sr,Nj] $\leftarrow$ [NR ] $\longleftarrow$ [Uniform Random Process] \item Go to step 2 if the last node of [S(end)] \# Dt. \end{enumerate} \vspace{.2em} \hrule \vspace{.1em} \hrule \subsection{Connectivity based Crossover operator and Mutation} \label{} In the considered form of WSN, normal course of crossover operation is not possible because of limited connectivity association with other available sensor nodes. As in the case of normal process of crossover, any random position is considered as point of crossover, obtained offspring may carry the infeasibility and it’s not possible to recorrect that infeasibility with penalty process. In the proposed form of crossover same locus position will not appear, instead of that same node will be considered as the position of crossover as shown in Fig 1. As in Fig 1 (a), parents P1 AND P2 have taken for crossover. There are two attractors available in chromosomes (N3, N2) and (N2, N6), where the first position (like N3) is the position from first parent and a second position (N2) is the position from second parent. Other positions are not allowed to crossover; because they will make the solution unfeasible. It is also observed that crossover can cause the change in chromosome length. In this paper, possible domain of change under mutation with each node is the possible number of nodes, which are connected with their neighbors only. \begin{figure}[H] \begin{center} \centering \includegraphics{fig1} \caption{Connectivity based crossover, (a) parents selected for crossover (b) generated offspring after crossover} \end{center} \end{figure} \begin{figure}[hbt!] \centering \includegraphics[scale=0.8]{fig2} \caption{Functional representation of proposed Dominant Genetic algorithm} \end{figure} \section{Simulation Result} \label{} Two different possibilities of routing scenarios have explored. In the first case number of sensors form a network and communication takes place between the source node and sink node. Such a scenario needs an optimal path so that minimum energy is invested over the communication. In second case, data gathering node moves from centroid of one cluster to another cluster to collect the data and after visiting all the clusters it will return back to the starting position. Both cases can be handled as problem of path optimization. \subsection{Case1. Network1} In the area of {200} X {200} square units simulation experiment has done in MATLAB environment by random placement of sensors through the uniform distribution. Total 50 sensors have deployed and with the communication range of 50 units, connectivity in the network among the sensors has formed. Rather than considering the direct physical Euclidean distance between the connected sensor, a uniform random number in the range of [10, 20] has selected to model invested energy with the irregularities existed in the practical geographical environment. A population size of 20 has selected with crossover rate as 1 if feasibility exist otherwise equal to 0. A low probability of mutation rate 0.1 has considered inheriting the parent quality. For a given node pair, the process has iterated upto to 20 iterations and 10 independent trials have given to estimate the statistical significance. Performance qualities have measured in terms of cost of objective function value as well as time of solution stability. \begin{figure}[h] \centering \includegraphics[scale=0.9]{fig3} \caption{Simulated network 1 with obtained route between nodes} \end{figure} \begin{figure}[h] \centering \includegraphics[scale=0.8]{fig4} \caption{Convergence in CGA under 10 independent trials} \end{figure} \begin{figure}[h] \centering \includegraphics[scale=0.8]{fig5} \caption{Convergence in DGA under 10 independent trials} \end{figure} \begin{figure}[h] \centering \includegraphics[scale=0.8]{fig6} \caption{Mean Convergence in CGA and DGA over 10 independent trials} \end{figure} \begin{table}[H] \caption{Performance of CGA and DGA under 10 independent trials} \centering \begin{tabular}{|c| c |c |c |c|}\hline Trial No. & \multicolumn 2 {c|}{CGA} & \multicolumn 2 {c|}{DGA}\\ \hline P=20; S=50; C=50 & Route Cost & Iteration Cost & Route Cost & Iteration Cost \\ \hline 1 & 103 & 5 & 89 & 6 \\ \hline 2 & 92 & 7 & 84 & 6 \\ \hline 3 & 86 & 13 & 79 & 7 \\ \hline 4 & 108 & 4 & 79 & 2 \\ \hline 5 & 100 & 6 & 79 & 2 \\ \hline 6 & 91 & 5 & 79 & 2\\ \hline 7 & 84 & 4 & 79 & 2 \\ \hline 8 & 95 & 11 & 79 & 2 \\ \hline 9 & 95 & 6 & 79 & 2 \\ \hline 10 & 103 & 3 & 79 & 2 \\ \hline \end{tabular} \end{table} \begin{table}[H] \caption{Statistical behavior of performance in CGA and DGA} \centering \begin{tabular}{|c| c |c |c |c|}\hline & \multicolumn 2 {c|}{CGA} & \multicolumn 2 {c|}{DGA}\\ \hline & Route Cost & Iteration Cost & Route Cost & Iteration Cost \\ \hline Best & 84.0 & 3.0 & 79.0 & 2.0 \\ \hline Worst & 108.0 & 13.0 & 89.0 & 7.0 \\ \hline Mean & 95.7 & 6.4 & 80.5 & 3.3 \\ \hline Std.Dev. & 7.78 & 3.2 & 3.4 & 2.1 \\ \hline \end{tabular} \end{table} \subsection{ Case1. Network2} \begin{figure}[H] \centering \includegraphics[scale=0.9]{fig7} \caption{Simulated network 2 with obtained route between nodes} \end{figure} \begin{figure}[H] \centering \includegraphics[scale=0.8]{fig8} \caption{Convergence in CGA under 10 independent trials} \end{figure} \begin{figure}[H] \centering \includegraphics[scale=0.8]{fig9} \caption{Convergence in DGA under 10 independent trials} \end{figure} \begin{figure}[H] \centering \includegraphics[scale=0.8]{fig10} \caption{Mean Convergence in CGA and DGA over 10 independent trials} \end{figure} \begin{table}[H] \caption{Performance of CGA and DGA under 10 independent trials} \centering \begin{tabular}{|c| c |c |c |c|}\hline Trial No. & \multicolumn 2 {c|}{CGA} & \multicolumn 2 {c|}{DGA}\\ \hline P=20; S=50; C=50 & Route Cost & Iteration Cost & Route Cost & Iteration Cost \\ \hline 1 & 133 & 14 & 125 & 8 \\ \hline 2 & 169 & 7 & 122 & 6 \\ \hline 3 & 120 & 8 & 122 & 2 \\ \hline 4 & 130 & 14 & 122 & 2 \\ \hline 5 & 132 & 7 & 119 & 4 \\ \hline 6 & 158 & 5 & 119 & 2\\ \hline 7 & 122 & 7 & 119 & 2 \\ \hline 8 & 131 & 6 & 119 & 2 \\ \hline 9 & 135 & 6 & 119 & 2 \\ \hline 10 & 128 & 3 & 119 & 2 \\ \hline \end{tabular} \end{table} \begin{table}[H] \caption{Statistical behavior of performance in CGA and DGA} \centering \begin{tabular}{|c| c |c |c |c|}\hline & \multicolumn 2 {c|}{CGA} & \multicolumn 2 {c|}{DGA}\\ \hline & Route Cost & Iteration Cost & Route Cost & Iteration Cost \\ \hline Best & 120.0 & 3.0 & 119.0 & 2.0 \\ \hline Worst & 169.0 & 14.0 & 125.0 & 8.0 \\ \hline Mean & 135.8 & 7.7 & 120.5 & 3.2 \\ \hline Std.Dev. & 15.5 & 3.6 & 2.1 & 2.5 \\ \hline \end{tabular} \end{table} \par It has observed with Network 1 and Network2, a very sharp benefit has observed with DGA compared to CGA. It can be see with Fig.4 and Fig.8 for all the trials there were large change in the covergence characteristics with CGA while Fig.5 and Fig.9 with DGA follow a very tight relation among the different trials. The clear difference of convergence between CGA and DGA have shown in Fig.6 and Fig.10 where DGA has remarkably faster and lower value of route path cost. The performance under different trail for both networks has shown in Table1 and Table 3 along with their statistical information in Table 2 and Table 4. In both cases DGA has delivered the lower value of route cost as well as strong reliability in performance. The computation cost is about 2 to 3 iterations in DGA while CGA has taken around 7 iterations. \subsection{Trajectory of data gathering node} \label{} A simple model of mobile data gathering in WSN has shown in Fig.11. Here each cluster is having a cluster head which has all the information of cluster center. Rather than getting the information from each sensor, information collection by data gathering node can save lots of energy. Not only that the delay in information transmission can completely depend upon the trajectory quality. Hence it is necessary; the selected trajectory should be optimal and faster. \begin{figure}[H] \centering \includegraphics[scale=0.9]{fig11} \caption{Data gathering from centroid sensor node by mobile base node} \end{figure} \par Here it is assumed that there are 10 clusters in the network and the energy consumed to move the data gathering node from one cluster to another is given in Table 5. Experiments are carried by considering two different starting points for data gathering node. In the first case the starting point for mobile data gathering node is at first cluster while in the second case the starting point is at seventh cluster. The obtained performances under both the cases have shown in Table 5 to Table 8. It has observed that very less energy invested trajectory has been opted by DGA compared to CGA. The performance of mean convergence over 10 independent trials has also shown in Fig.12 and Fig.13 and in both cases a significant improvement has been observed with DGA compared to CGA. \begin{figure}[H] \centering \includegraphics[scale=0.8]{fig12} \caption{Trajectory Convergence in CGA and DGA over 10 independent trials with starting position in 1st cluster} \end{figure} \begin{table}[H] \caption{Performance under 10 trials by DGA} \centering \begin{tabular}{|c| c c c c c c c c c c c |c|} \hline {\bfseries Trial No.} & \multicolumn {11} {|c|}{\bfseries Obtained Trajectory by DGA} & {\bfseries Invested Energy}\\ \hline 1 & 1 & 6 & 7 & 8 & 5 & 3 & 10 & 2 & 9 & 4 & 1 & 818 \\ \hline 2 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 6 & 1 & 818 \\ \hline 3 & 1 & 5 & 3 & 9 & 4 & 2 & 10 & 6 & 7 & 8 & 1 & 836 \\ \hline 4 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 6 & 1 & 818 \\ \hline 5 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 6 & 1 & 818 \\ \hline 6 & 1 & 6 & 7 & 8 & 5 & 3 & 10 & 2 & 9 & 4 & 1 & 818 \\ \hline 7 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 6 & 1 & 818 \\ \hline 8 & 1 & 4 & 9 & 3 & 5 & 7 & 8 & 2 & 10 & 6 & 1 & 825 \\ \hline 9 & 1 & 4 & 9 & 2 & 8 & 7 & 6 & 10 & 3 & 5 & 1 & 826 \\ \hline 10 & 1 & 6 & 10 & 2 & 4 & 9 & 3 & 5 & 7 & 8 & 1 & 836 \\ \hline \multicolumn {12}{|r|}{Mean} & 823.1 \\ \multicolumn {12}{|r|}{Std. Dev.} & 7.46 \\ \hline \end{tabular} \end{table} \begin{table}[H] \caption{Performance under 10 trials by CGA} \centering \begin{tabular}{|c| c c c c c c c c c c c |c|} \hline {\bfseries Trial No.} & \multicolumn {11} {|c|}{\bfseries Obtained Trajectory by CGA} & {\bfseries Invested Energy}\\ \hline 1 & 1 & 3 & 5 & 8 & 7 & 6 & 10 & 2 & 9 & 4 & 1 & 832 \\ \hline 2 & 1 & 4 & 5 & 3 & 9 & 2 & 10 & 6 & 7 & 8 & 1 & 863 \\ \hline 3 & 1 & 2 & 9 & 10 & 6 & 7 & 8 & 5 & 3 & 4 & 1 & 862 \\ \hline 4 & 1 & 4 & 2 & 9 & 3 & 5 & 7 & 8 & 10 & 6 & 1 & 855 \\ \hline 5 & 1 & 8 & 7 & 5 & 3 & 9 & 4 & 2 & 10 & 6 & 1 & 836 \\ \hline 6 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 6 & 1 & 818 \\ \hline 7 & 1 & 5 & 3 & 9 & 4 & 2 & 10 & 6 & 7 & 8 & 1 & 836 \\ \hline 8 & 1 & 4 & 2 & 9 & 3 & 5 & 7 & 8 & 10 & 6 & 1 & 855 \\ \hline 9 & 1 & 4 & 9 & 2 & 10 & 6 & 7 & 8 & 5 & 3 & 1 & 832 \\ \hline 10 & 1 & 2 & 8 & 7 & 5 & 3 & 4 & 9 & 10 & 6 & 1 & 860 \\ \hline \multicolumn {12}{|r|}{Mean} & 844.9 \\ \multicolumn {12}{|r|}{Std. Dev.} &15.87 \\ \hline \end{tabular} \end{table} \begin{figure}[H] \centering \includegraphics[scale=0.8]{fig13} \caption{Convergence in CGA and DGA over 10 independent trials with starting position is 7th cluster} \end{figure} \begin{table}[H] \caption{Performance under 10 trials by CGA} \centering \begin{tabular}{|c| c c c c c c c c c c c |c|} \hline {\bfseries Trial No.} & \multicolumn {11} {|c|}{\bfseries Obtained Trajectory by CGA} & {\bfseries Invested Energy}\\ \hline 1 & 7 & 6 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 818 \\ \hline 2 & 7 & 8 & 2 & 9 & 4 & 1 & 5 & 3 & 10 & 6 & 7 & 826 \\ \hline 3 & 7 & 8 & 2 & 9 & 4 & 1 & 6 & 10 & 3 & 5 & 7 & 826 \\ \hline 4 & 7 & 5 & 3 & 9 & 4 & 1 & 6 & 10 & 2 & 8 & 7 & 825 \\ \hline 5 & 7 & 6 & 10 & 2 & 4 & 9 & 3 & 5 & 1 & 8 & 7 & 836 \\ \hline 6 & 7 & 6 & 1 & 5 & 3 & 10 & 9 & 4 & 2 & 8 & 7 & 846 \\ \hline 7 & 7 & 8 & 2 & 4 & 9 & 10 & 3 & 5 & 1 & 6 & 7 & 846 \\ \hline 8 & 7 & 6 & 10 & 2 & 4 & 9 & 3 & 5 & 1 & 8 & 7 & 836 \\ \hline 9 & 7 & 6 & 10 & 2 & 1 & 4 & 9 & 3 & 5 & 8 & 7 & 830 \\ \hline 10 & 7 & 5 & 3 & 9 & 2 & 4 & 1 & 6 & 10 & 8 & 7 & 855 \\ \hline \multicolumn {12}{|r|}{Mean} & 834.4 \\ \multicolumn {12}{|r|}{Std. Dev.} &11.6 \\ \hline \end{tabular} \end{table} \begin{table}[H] \caption{Performance under 10 trials by DGA} \centering \begin{tabular}{|c| c c c c c c c c c c c |c|} \hline {\bfseries Trial No.} & \multicolumn {11} {|c|}{\bfseries Obtained Trajectory by DGA} & {\bfseries Invested Energy}\\ \hline 1 & 7 & 8 & 2 & 10 & 6 & 1 & 4 & 9 & 3 & 5 & 7 & 825 \\ \hline 2 & 7 & 8 & 2 & 9 & 4 & 1 & 5 & 3 & 10 & 6 & 7 & 826 \\ \hline 3 & 7 & 6 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 818 \\ \hline 4 & 7 & 6 & 10 & 3 & 5 & 1 & 4 & 9 & 2 & 8 & 7 & 826 \\ \hline 5 & 7 & 6 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 818 \\ \hline 6 & 7 & 6 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 818 \\ \hline 7 & 7 & 6 & 1 & 4 & 9 & 2 & 10 & 3 & 5 & 8 & 7 & 818 \\ \hline 8 & 7 & 6 & 10 & 3 & 5 & 1 & 4 & 9 & 2 & 8 & 7 & 826 \\ \hline 9 & 7 & 8 & 1 & 6 & 10 & 2 & 4 & 9 & 3 & 5 & 7 & 836 \\ \hline 10 & 7 & 5 & 3 & 9 & 4 & 1 & 6 & 10 & 2 & 8 & 7 & 825 \\ \hline \multicolumn {12}{|r|}{Mean} & 823.6 \\ \multicolumn {12}{|r|}{Std. Dev.} &5.7 \\ \hline \end{tabular} \end{table} \section{Conclusion} \label{} Energy efficient routing is one of the best means to increase the life span of WSN. In this paper sensor to sensor communication has achieved to minimize the route cost while an optimization of mobile data gathering trajectory is made to minimize the invested energy. Proposed solution has achieved with a new form of Genetic algorithm which carry the natural phenomena of suppression of weaker by dominant one. The proposed process has delivered a better routing path in less time as well with high level of reliability compared to conventional form of GA. The achieved trajectory for mobi sink has shown energy efficient along with consistency in the performance. %{\bfseries } & {\bfseries OBR} &{\bfseries AR} & {\bfseries OBR} &{\bfseries AR} & {\bfseries OBR} &{\bfseries AR}\\ %\begin{table} %\centering %\begin{tabular}{|c|c|c|c|c|c|c|c|c|c|} %\hline %Source & N1 & N2 & N3 & N4 & N5 & N6 & Destination & Chrom Length \\ %\hline %P1 & 1 & 6 & 5 & & & & & %\end{tabular} %\end{table} %\begin{table}[h] %\caption{The Performance of ...} %\centering %\begin{tabular}{lcr} %\hline %Variable & Speed (rpm) & Power (kW) \\ %\hline %x & 10 & 8.6 \\ %y & 15 & 12.4 \\ %z & 20 & 15.3 \\ %\hline %\end{tabular} %\end{table} % %\begin{figure}[h] %\centering %\includegraphics[scale=0.5]{figure1} %\caption{Effects of selecting different switching under dynamic condition} %\end{figure} %% The Appendices part is started with the command \appendix; %% appendix sections are then done as normal sections %% \appendix %% \section{} %% \label{} %% References %% %% Following citation commands can be used in the body text: %% Usage of \cite is as follows: %% \cite{key} ==>> [#] %% \cite[chap. 2]{key} ==>> [#, chap. 2] %% %% References with BibTeX database: \bibliographystyle{IEEEtran} %\bibliography{} %% Authors are advised to use a BibTeX database file for their reference list. %% The provided style IEEEtran.bst formats references is generally used. %% For references without a BibTeX database: \begin{thebibliography}{4} %% \bibitem must have the following form: %% \bibitem{key}... %% \bibitem{Fengyuan} Fengyuan Ren, et al., "EBRP: Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks “, \textsl{IEEE Transactions on Parallel and Distributed Systems}, vol. 22, Issue. 12, pp. 2108-2125, 2011. \bibitem{Rong} Rong Cui ;Zhaowei Qu ; Sixing Yin, ”Energy-efficient routing protocol for energy harvesting wireless sensor network", in \textsl{15th IEEE International Conference on Communication Technology}, 2013. \bibitem{Bayani} M. Bayani, ”An Overall WSN Lifetime Analysis Using Directed Diffusion and Cluster-Based Protocols “, in \textsl{Iranian journal of electrical and computer engineering}, vol.12, NOs. 1 \& 2, 2013. \bibitem{Esther} Esther M.Arkin, et al., ”Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks”, in \textsl{Ad Hoc Networks}, vol.12, pp. 201-218, January 2014. \bibitem{Chaonan} Chaonan Wang, Liudong Xing, ”Reliability and lifetime modeling of wireless sensor nodes”, in \textsl{Microelectronics Reliability}, vol. 54, Issue. 1, pp. 160-166, January 2014. \bibitem{Bilal} Bilal AbuBakr, ”Extending Lifetime of Wireless Sensor Networks by Management of Spare Nodes”, in \textsl{Procedia Computer Science}, vol. 34, pp. 493-498, 2014. \bibitem{Mariam} Mariam Akbar, Nadeem Javaid ,”Sink mobility aware energy-efficient network integrated super heterogeneous protocol for WSNs”, in \textsl{EURASIP Journal on Wireless Communications and Networking}, 2016. \bibitem{Huseyin} Huseyin,” Maximizing Wireless Sensor Network lifetime by communication/computation energy optimization of non-repudiation security service: Node level versus network level strategies”, in \textsl{Ad Hoc Networks}, vol. 37, Part-2, pp. 301-323, February 2016. \bibitem{Robert} Robert M.Curry,”A survey of optimization algorithms for wireless sensor network lifetime maximization”, in \textsl{Computers \& Industrial Engineering}, vol. 101, pp. 145-166, November 2016. \bibitem{K.F. Man} K.F. Man, et al., ,” Genetic algorithms: concepts and applications [in engineering design] “, in \textsl{ IEEE Transactions on Industrial Electronics }, vol. 43, Issue. 5, October 1996. \bibitem{Holland} Holland J.H. Genetic Algorithms and Adaptation. In: Selfridge O.G., Rissland E.L., Arbib M.A. (eds) Adaptive Control of Ill-Defined Systems. \textsl{ NATO Conference Series (II Systems Science)}, vol. 16, Springer, Boston, MA, 1984. \bibitem{Huynh} Trong-Thua Huynh, et al., ”Delay constraint energy-efficient routing based on Lagrange relaxation in wireless sensor networks “, in \textsl{IET Wireless Sensor Systems}, vol. 7, Issue. 5, pp. 138-145, 2017. \bibitem{Yongjun}Yongjun Sun ; Wenxin Dong, et al., ”An Improved Routing Algorithm Based on Ant Colony Optimization in Wireless Sensor Networks “, in \textsl{IEEE Communications Letters}, vol. 21, Issue. 6, pp. 1317-1320, 2017. \bibitem{Jian} Jian Shen ; Anxi Wang, et al., ”An Efficient Centroid-Based Routing Protocol for Energy Management in WSN-Assisted IoT” , in \textsl{IEEE Access}, vol. 5, pp. 18469-18479, 2017. \bibitem{Liu} Hsiang-Hung Liu ; et al., ”On Energy-Efficient Straight-Line Routing Protocol for Wireless Sensor Networks “, in \textsl{IEEE Systems Journal}, vol. 11, Issue. 4, pp. 2374 - 2382, 2017. \bibitem{Yahya} Yahya Kord Tamandani,”Computing geometric median to locate the sink node with the aim of extending the lifetime of wireless sensor networks”, in \textsl{Egyptian Informatics Journal}, vol. 18, Issue. 1, pp. 21-27, March 2017. \bibitem{J.Roselin} J.Roselin, P.Latha, et al., ”Maximizing the wireless sensor networks lifetime through energy efficient connected coverage”, in \textsl{Ad Hoc Networks}, vol. 62, pp. 1-10, July 2017. \bibitem{Mao}Mao Yuxing ; et al., ” Weak node protection to maximize the lifetime of wireless sensor networks “, in \textsl{Journal of Systems Engineering and Electronics}, vol. 29, Issue. 4, pp. 693-706, 2018. \bibitem{Turki} Turki A. Alghamdi,” Secure and Energy Efficient Path Optimization Technique in Wireless Sensor Networks Using DH Method “, in \textsl{IEEE Access}, vol. 6, pp. 53576 - 53582, 2018. \bibitem{Sandeep} Sandeep Verma, et al., ”Design of a novel routing architecture for harsh environment monitoring in heterogeneous WSN “,in \textsl{IET Wireless Sensor Systems}, vol. 8, Issue. 6, 2018. \bibitem{Jianhua} Jianhua Qiao, et al., ”Polar Coordinate-Based Energy-Efficient-Chain Routing in Wireless Sensor Networks Using Random Projection “, in \textsl{IEEE Access}, vol. 6, pp. 21275 - 21286, 2018. \bibitem{Felicia} Felicia Engmann,”Prolonging the Lifetime of Wireless Sensor Networks: A Review of Current Techniques”, in \textsl{Wireless Communications and Mobile Computing}, 2018. \bibitem{Mohamed} Mohamed Elshrkawey, et al., ”An Enhancement Approach for Reducing the Energy Consumption in Wireless Sensor Networks”, in \textsl{Journal of King Saud University - Computer and Information Sciences}, vol. 30, Issue. 2, pp. 259-267, April 2018. \bibitem{Arun} Arun L.Kakhandki, et al., ”Energy efficient selective hop selection optimization to maximize lifetime of wireless sensor network”, in \textsl{Alexandria Engineering Journal}, vol. 57, Issue. 2, pp. 711-718, June 2018. \end{thebibliography} \section*{BIOGRAPHY OF AUTHORS} \begin{biography}[{\includegraphics[width=3cm,height=3cm,clip,keepaspectratio]{shanphoto}}] \textbf{Prof. Shanthi D L} %% Affiliation and educational background. is a graduate research scholar at Viswesvaraya Technological University Belagavi Karnataka with Master of Technology from Viswesvaraya Technological University Belagavi India (2007). Currently working as Assistant Professor at BMS Institute of Technology Bangalore India. %% Research interests, teaching, professional experiences, etc. Her researches are in fields of Wireless Sensor Networks, Networks, Internet of Things. %% Related activities and services. She is affiliated with IEEE as student member. %% Additional info. Further info on homepage: https://bmsit.ac.in \end{biography} \begin{biography}[{\includegraphics[width=3cm,height=3cm,clip,keepaspectratio]{guide}}] \textbf{Dr. Keshava Prasanna} %% Affiliation and educational background. Professor and Dean (Students) at CIT Tumkur India. is a research guide at Viswesvaraya Technological University Belagavi Karnataka India. He is having vast experience in teaching and guiding research scholars. %% Research interests, teaching, professional experiences, etc. His researches are in fields of Wireless Sensor Networks, Pattern Recognition, Image Processing, Brain Computer Interfacing etc, . %% Related activities and services. He is a member of IEEE, chair for various conferences, reviewer for various conferences and journals. %% Additional info. Further info on homepage: https://www.cittumkur.org \end{biography} \end{document} %% %% End of file `iaesarticle2.tex'.