Vol. 1(3), Oct. 2015, pp. 227-233 Presentation of an Optimum Routing Template in Wireless Sensor Networks (WSNs) Based on Imperialist Competitive Algorithm Mohammad Gharary, Javad Vahidi Computer MSc student, PHD analysis of algorithms Phone Number: +98-915-6029244 *Corresponding Author's E-mail: Gharary@me.com Abstract I In recent years, regarding to basic progresses in design of integrated orbits, wireless telecommunication and designing sensor a special type of wireless network named wireless sensor networks (WSNs) has been considered by researchers and different industries. One of the major challenges in wireless sensor networks is routing to send data on the network. In this paper was presented the method to find optimized routes by using imperialist competitive algorithm. In the method, initially in routing phase, we model the state of the network based on a graph, then according to the possible routes we routing. The target functions in the algorithm are to find the lowest available route between sender and recipient data. Two important operators in the proposed method are assimilation and revolution. In the paper, assimilation rate has been considered 90% and revolution rate is 50% and the maximum iteration in algorithm is considered 1000 in the base mode. According to the comparisons were done, the proposed method does the operation routing more efficient compared to methods based on genetic algorithm (GA). Keywords: Routing, Wireless Sensor, Network, Imperialist Competition. 1. Introduction Many usages of wireless sensor networks need to send data sure and to reduce of nodes energy consumption. On the other hand, fundamental challenge in the networks is presenting an appropriate routing protocol, due to natural limitations of wireless sensor networks. In many usages and protocols of routing, to reduce energy consumption and following prolongation of networks lifetime are important, due to sensor nodes energy limitations. In these networks, energy consumption consists of turning on Radio communications, energy necessary to send and receive of date packets types and energy necessary to turning on sensors. Most routing algorithms model problem state space in form of the graph. Then they are looking for the optimum route among the solutions available in the graph. In this paper, in the routing phase in the network there are different routes to send data from sender to recipient. Whatever we can find a route at minimum distance between sender and recipient, we have been done routing better. Since the distance between the nodes in the graph of network makes up the different route; one way is that first calculate cost of all routs then decide to choose optimum route. But this need high time due to number of network present nodes and we can say the algorithm is a factorial stage. Another way is Production of some routes random and performance of an optimization operation by optimum algorithms. So, optimum criterion is here the distance between present nodes and routes. Then in the paper, using of imperialist competitive algorithm, we are looking for a method to find minimum possible distance between node of sender and recipient data. 227 Article History: JKBEI DOI: 649123/11033 Received Date: 14 Jun. 2015 Accepted Date: 22 Sep. 2015 Available Online: 29 Oct. 2015
Mohammad Gharary et al. / Vol. 1(3) Oct. 2015, pp. 229-235 JKBEI DOI: 649123/11033 2. The Work Done Rein Form protocol [7] has been presented to form beginning to end, in order to guarantee packet transmission with reliability requires. The protocol is considering the importance and reliability to its packet transmission, it sends multiple copies of the transmitted packet to some neighbor nodes. Number of necessary routes to reliability ensures associated transmission packet is calculated based on transmission channel error and network topologic information (number of step from source to destination). The protocol isn’t considered energy parameter. EQSR protocol [13], energy parameters of the sensor nodes, the ratio of signal power to the noise power of the communication link and empty buffer of next node, in order to appropriate route choose and send data to sink. It uses multi-path routing transmission to increase delivery packets to the destination. To determine multiple routes between source and destination, sink determines the required routes by sending route request packet (RR) to source node. EARQ protocol [13] immediately sends information packets to sink with high reliability. The protocol to appropriate route choose, considers neighbor nodes energy cost. To send immediate packets choose node that have less latency. The protocol not discriminates to send packets in reliability and latency. And no priority is not considering in send different packets. PAP protocol [18] uses geographic send method greedy. The protocol considers the packet required speed in send to immediate packets; i.e. it choose nodes as next node which can supplies acquired speed of packet. Notable limitation of RAP protocol is that sends to geographic greedy is not considers network local conditions such as load balancing, level of congestion and communication channel quality. Therefore, RAP routing-path protocol has been unpredictable delay to every stage in dynamic environment of wireless sensor network that influence the network effectiveness and timely and successful send ensure of packet. Also other weakness of RAP algorithm is that is not considers the nodes present energy in route. MCMP protocol [20] considers reliability and the communication link delay as routing-path parameters to send packets. And it sends data to increase reliability for multi-path routing and by solving linear programming problem. The protocol is not considering neighbor nodes parameters and send spread speed. Packets are sent toward the congestion nodes in this protocol. For this reason, number of sensitive packets reduces to delivered time in destination due to overcrowding of nodes. MMSpeed protocol [22] was completed by speed protocol, and it is a multi-path routing protocol and multi-track. The protocol is considering the reliability parameters and time delay to send packet. A weakness of MMspeed protocol is that has not been considered energy important parameter to optimum route chooses. 3. Proposed Method In the part, we will review and introduce proposed algorithm to wireless sensor networks routing. We can model the routing problem in the form of a graph. In this case, any of nodes will convert graph tops. And any of the manes convert to present routes in the graph. Used methods in this work are based on imperialist competitive algorithm. In the algorithm concepts of country, imperialistic, colony, revolution and etc. are fundamental concepts. 3.1 Problem Model We can model a routing problem or a space-based sensor network by a graph. The aim is to find the shortest time possible to send data over the network from source to destination. In the graph above assuming that the node source is N1 and node data receive destination is N11; can be considered data transport cost of graph nodes by matrix to below figure. Cost= [100 101 102 98 97 104 96 101 100 103 98 97 99 101 100 103] 228 Journal of Knowledge-Based Engineering and Innovation (JKBEI) Universal Scientific Organization, http://www.aeuso.org/jkbei ISSN: 2413-6794 (Online)
Recommend
More recommend