Wednesday, June 10, 2015

SIMULATION ROUTING PROTOCOL IN WIRELESS SENSOR NETWORK WITH USING CLUSTER BASED

Wireless Sensor Networks (Wireless Sensor Network) consists of a large number of sensor nodes free. Each node has the ability to send, receive and detect. Besides sensor node is also equipped with processing equipment Data, data storage or memory Sementra, communications equipment and power supply or battery. In this paper, we describe a routing protocol in Wireless Sensor Network with using the approach of grouping (Cluster based). Routing to be simulated, made based on each cluster node. Issue will be presented, namely how planning configuration, simulation-based cluster implementations WSN routing and how to influence methods This on the performance of the system. In the cluster-based routing method of calculation based on the distance and energy efficiency is used, because the node sends information through cluster head, then the energy can be saved for extend the lifetime of the network. Results are expected in this paper is create a routing path quickly and efficiently the use of energy, energy that is required one node for one-time delivery of data at 200-500 bits can be saved up to 1μJ

 RESULTS AND ANALYSIS 
At the first step is to create a program for input the number of nodes to be used and also save the position of the node that appears to be note the location of the node. Then the next process is to determine cluster head, cluster head in this case is not taken of the node that was raised at the beginning of the process, but rather generate new nodes to be used as the cluster head, but to cluster head shape and node colors distinguished in appearance. then if the existing cluster head then it will continue to the next process is the formation of clusters but if there is no cluster head will do the process The same is to determine the cluster head. In the cluster formation process is done by calculating the distance between all nodes and each cluster head and then after that it will compared to getting the closest distance if the nodes are known then the closest node will serve as members of the cluster. after cluster formation is the process of routing from node to get to the sink, to program routing formation as discussed in theory in the previous chapter, the node will immediately communicate to each cluster head that indicated by the lines on the display, then of cluster head will communicate with the cluster head nearest to send information to the sink. 

In Figure 4 is a display node positions that is located random, in this simulation are assume darea used is 450x500 m2, then node positions will be stored for use in the formation of clusters that can be seen in Figure 5. 
In the figure 6 is a display of all routing path may be traversed node for transmit data towards the sink, each color a head node cluster with cluster, the data given cluster head will be sent directly to sink 

On this simulation there are some parameters that used for experiments, among others, N = 50 nodes, simulation = 450x500 m2 area, Ei = 1-2 Joule, EFS = 10 pj, pj Emp = 0.0013, d0 = 87.7 m, the data bytes = 0-500, where Ei is the initial energy given to each node is between 1-2 joules and d0 a threshold. So that the amount of use the energy used at the node with l-bit data and the distance d can be calculated by equation (1) and (2) following:


for the receivers are: ERX (l) = l. Eelec (2) Where ETX is energy needed for ERX is sending data and energy needed to receive data, it is assumed node while sending and receiving requires energy consumption Eelec same.  
Figure 7 and shows that the relationship between the energy needed by the node to transmit data is directly proportional, the large bits of data transmitted, the more energy is needed and so does the distance. In the simulations performed by the data transmission 200bit - 500bit, the location of sources and sinks fixed so that changes is the cluster and distance delivery, from several experiments
found that for one-time delivery of data it takes energy - flatten 1 μJ, but this only to make one shipment on one node.
  
In the figure 8 is a graphic image reduction of energy used to perform sending data to the sink. In the cluster method This base, when a node to get the data and wanted mengirimkaanya to sink, then this data first should be sent to the cluster headnya, then after The cluster head which sends data to sink. In the process - the process node and also cluster head will experience a reduction in energy, the energy used is affected by distance delivery and also the amount of data sent. on trial amount of data sent is as much 500 bits of data and the distance is different - different each experiment. The value of the total energy required can be seen in Figure 8 for each time experiment, the energy required is not fixed because the distance is always changing.
In the experiment used three sources different positions will transmit as much data 500 bits continuously until the energy cluster headnya exhausted. After doing several times Experimental chart as shown 4:11 where each cluster head takes differ depending on the initial energy possessed by The cluster head and also the distance up to the sink.
 


Link download Jurnal :  http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=12&ved=0CCEQFjABOAo&url=http%3A%2F%2Fcore.ac.uk%2Fdownload%2Fpdf%2F12344113.pdf&ei=6f1mVbOSNNO1uQTM5oGAAw&usg=AFQjCNEr_oFX59ixdgSGBFkUii4A9KmPXQ&sig2=45VzT1cSXIiBCJPIrnAsyw&bvm=bv.93990622,d.c2E

   

No comments:

Post a Comment