PROFICIENT CLUSTER-BASED ROUTING PROTOCOL USING EBSA AND LEACH APPROACHES

Transcription

1 PROFICIENT CLUSTER-BASED ROUTING PROTOCOL USING EBSA AND LEACH APPROACHES E SELVADIVYA divyacharlez@gmail.com GREETA PRIYADARSHINI greetasam@gmail.com ABSTRACT In this research we deal with delay-tolerant networking (DTN) where we seek to address the technical issues in heterogeneous networks along with the homogeneous networks that may lack continuous network connectivity. The main objective is to distributively group mobile nodes into a cluster, which can then interchangeably share their resources for overhead reduction and power balancing, to achieve proficient and scalable routing in DTMNs (Delay Tolerant Mobile Networks). The EBSA approach is used in heterogeneous networks and the LEACH approach is used in homogenous networks. The cluster-based routing protocol based on exponentially biased stirring average (EBSA) scheme is employed for on-line updating nodal contact probability. Based on nodal contact probabilities, a set of functions including sync (), abscond (), and unite () are devised for cluster formation and gateway selection. The gateway nodes exchange network information and perform routing in EBSA. Where as in homogenous networks we use the LEACH approach were the cluster the skull aggregates the data from its cluster members based on the report time TR and attributes A. These first level Cluster skulls aggregates the data and sends it to the second level cluster skull and finally the second level cluster skull sends the data to a higher level cluster or a base station The NS2 simulation results show that it achieves good energy consumption, increases the packets delivery ratio and reduces end-to-end delay, when EBSA is used along with LEACH. Thus we obtain a good performance metrics when we use both of them together. Keywords; EBSA, LEACH, clustering, intra clustering and interclustering I INTRODUCTION In this paper due to sporadic connectivity among mobile nodes, especially under low nodal density and short radio transmission range, the Delay-Tolerant Network (DTN) technology [1], [2] has been introduced to mobile wireless communications. DTN is necessarily an communication system, where communication links only exist momentarily, provides it impossible to establish end-to-end connections for data delivery but this is possible in the case of flat networks since it is scalable where as in the case of large networks this seemed to be a failure. So various clustering algorithm have been implemented in MANETS. However these concepts could not have been implemented in DTN because they were wired networks so the concept of DTN hierarchical routing (DHR) protocol to improve the routing scalability [3]. So we proposed the clustering and cluster- based routing protocols for DelayTolerant Mobile Networks (DTMNs).First we propose an exponentially biased stirring average (EBSA) scheme is employed for on-line updating nodal contact probability, with its mean proven to converge to the true contact probability. Subsequently, a set of functions including Sync(), Abscond(), and Unite() are devised to form clusters and select gateway nodes based on nodal contact probabilities. Finally, the gateway nodes exchange network information and perform routing in disseminated clustering and cluster based routing. Finally the LEACH algorithm (Low energy efficient cluster based routing) and media access with application data specific is being implemented in MANETS[4][5]. Along with this intention tracking is done in MANETS [6]. II CLUSTERING A definition of clustering could be the procedure of systematizing objects into group whose constituents are analogous in some way The essential idea of clustering is to group numerous nodes with similar domain pattern into a cluster which can then interchangeably share their possessions such as cache space for overhead diminution and load harmonizing aiming to achieve proficient routing Disseminated clustering Each node learns unswerving contact probabilities to other nodes. It is not necessary that a node stores contact information of all other nodes in network. a node decides to Unite or Abscond a cluster based on its contact probabilities to other members of that cluster. Since our purpose is to group all nodes with elevated pair-wise contact probabilities together, a node joins a cluster only if its Couple incisive contact probabilities to all existing members are greater than average. 1. Sync : 295

2 The Sync () procedure is invoked when two cluster constituents rally and both pass the association check. It is designed to swap and synchronize two local tables. The synchronization process is necessary because each node discretely learns network parameters, which may fluctuate from nodes to nodes. The Meet-A-Node episode is generated upon getting the Hello message (exchanged between two meeting node ). If both the nodes are same in the cluster then the relationship check function is summoned to confirm if they are still competent to stay in the same cluster Synchronization of Cluster constituents The Time Stamp field is used for the "enhanced" awareness of the network to deal with any disagreement When the time Stamp of any ingress in the gateway table is older than average, A, a Gateway-Outdate Event is engender for that entry meeting. No imparting node is necessarily concerned 2. Abscond : The node with subordinate stability must depart the cluster. The permanence of a node is defined to be its least amount contact probability with cluster members. It indicates the possibility that the node will be disqualified from the cluster due to little contact probability. The departing node then empties its gateway table and reorganize its Synchronization of Gateways: Gateway out-date episode Cluster ID. 3. Unite : The unite () practice is employed for a node to join a "enhanced" cluster or to amalgamate two separate clusters. A node will join the other's cluster if It passes association check of all current members Its permanence is going to be enhanced with the innovative cluster. By joining new cluster, it will copy the gateway table from the other node and update its cluster ID accordingly Three events occur here Slot-timeout episode End of each time slot Meet a node episode getting hello message Gateway outdate episode Time stamp older than verge Slot time-out episode A Slot-Timeout episode is generated by the finish of each time slot, triggering the practice of updating the contact probabilities by using the EBSA method Once the contact possibility are updated, the Gateway Update () process is invoked to update the gateway counter Meet-a-node episode Fig 1 Clustering based on EBSA III CLUSTER FOUNDATION ROUTING CFR (Cluster Foundation Routing) is an on-demand routing, where the nodes are separated into clusters. A Node S (source) has to send data to node D (destination). S launches route requests to all the adjacent cluster-skulls, and only to the cluster-skulls. When a cluster-head receives the route request, it checks if the node D is in his cluster. If this is the case, the cluster-skull sends the request unswervingly to the destination. But when D isn't in the cluster, it sends the route request to all the adjacent clusterskull This is done based on intra-cluster routing solitary-hop inter-cluster routing, and multi-hop inter-cluster routing. INTRA CLUSTER ROUTING 296

3 If Nodes a and b are in the identical cluster, they have elevated chance to meet each other, thus Node a will transmit the data message to Node b unswervingly upon their. Solitary hop inter cluster routing.all the nodes in the network are homogeneous and begin with the same initial energy and the BS however has a constant power supply and so, has no energy constraints. So we consider a hierarchical clustering scheme each cluster has a cluster skull which collects data from its cluster members, aggregates it and sends it to the BS or an upper level cluster skull. If they are not in the same cluster, Node a look up gateway information to Node b's cluster in its gateway table. If an entry is found, Node a send the data message to that gateway. Upon receiving the data message, the gateway will forward it to any node, e.g., Node a1, in Node b's cluster. Node a1 which in sum delivers the data message to Node b via Intra-cluster Routing. Multi-hop inter-cluster routing If Node a does not have any information about Node b, the data transmission needs a multi-cluster routing scheme. A link state like protocol is being implemented Cluster Connectivity Packet (CCP), and distributes it to other gateways in the network. The CCP of a Gateway comprises its cluster ID and a list of clusters to which it serves as gateway along with analogous contact probabilities. Such information can be readily obtained from the gateway table. Once a gateway node accumulates a sufficient set of CCP's, it constructs a network graph. Each vertex in the graph stands for a cluster. A link connects two vertices if there are gateways between these two clusters. The mass of the link is the contact probability of the analogous gateway nodes. Based on the network graph, the shortest path algorithm is employed to establish the routing table. Each entry in the routing table consists of the ID of a destination cluster and the next-hop cluster ID. Once the routing table is obtained, the routing is performed from a cluster to another cluster via solitaryhop Inter-cluster Routing and Intra cluster Routing A PROFICIENT METHODOLOGY FOR ENERGY CONSUMPTION HIERARCHIAL CLUSTERING In this research we deal with the nodes in this network periodically switch on and then transmits the data of interest. Thus, they provide a picture of the pertinent parameters at regular intervals. They are well suited for applications requiring episodic data monitoring Figure 2 Hierarchical clustering approach In the above figure we do consider the cluster members in blue colour, the first level cluster skull in green colour second level cluster skull in black colour and the base station node in red colour. Here the first level cluster skull aggregates the data from its cluster member. Then it sends it to the cluster skull the first level cluster skull aggregates the data and then sends it to the upper level cluster or the. base station[8] Proactive Network Protocol The types of functioning in proactive networks Functioning At each cluster change time, once the cluster- skulls are decided, the cluster- skull broadcasts the following parameters: Report Time (TR): This is the time episode between consecutive reports sent by a node. Attributes (A): This is a set of physical parameters which the user is interested in obtaining data about. 297

4 At every report time, the cluster members sense the parameters specified in the attributes and send the data to the cluster- skull. The cluster- skull aggregates this data and sends it to the base station or the higher level cluster-skull, as the case may be. This ensures that the user has a whole picture of the complete area covered by the network. At every cluster change time, TR and A are transmitted afresh and so, can be changed. LOW ENERGY HIERARCHY ADAPTIVE CLUSTER LEACH LEACH (Low-Energy Adaptive Clustering Hierarchy) is a good approximation of a proactive network protocol, with some minor differences. Once the clusters are formed, the cluster skulls broadcast a TDMA schedule giving the order in which the cluster members can transmit their data. The total time required to complete this schedule is called the frame time TF. Every node in the cluster has its own slot in the frame, during which it transmits data to the cluster skull. When the last node in the schedule has transmitted its data, the schedule repeats. The report time discussed earlier is equivalent to the frame time in LEACH. The frame time is not broadcast by the cluster skull, though it is derived from the TDMA schedule. However, it is not under user control. Also, the attributes are predetermined and are not changed midway[7. RESULTS NODE CREATION Fig 3 Node formation for clustering The clustering consists of isolating the network into numerous groups named as clusters. One node in each cluster is chosen as a cluster skull and is given some responsibilities including the description of the constituent of the cluster and the maintenance of the cluster. Ten such clusters are formed with each consisting of five nodes along with the cluster skull A Cluster skull is chosen among each cluster. The information transfer takes place among the clusters and data are transferred among them through a gateway node. The information transfer takes place as Cluster Skull-to-Cluster Skull manner Fig 6 End to End delay based on EBSA and cluster skull burden End-to-end delay refers to the time taken for a packet to be transmitted across a network from source to destination. Delay jitter is the fluctuation of end-to-end delay from packet to the next packet. PACKET RECEVIED Fig 4 Packets received comparing EBSA and without clustering The packets are transferred from the source node to the destination node. The number of packets that reach the destination from source without being dropped are the packets that are termed as received PERFORMANCE ANALYSIS ALONG WITH EBSA OF LEACH Fig 5 Comparison of Bandwidth Performance There is a significant reduction in bandwidth when we combine LEACH along with EBSA END TO END DELAY 298

5 Fig 6 Comparison of packet delivery ratio Performance For a time duration of 100 seconds packet delivery ratio is said to be greater only when LEACH is used with EBSA approach. Fig10 Overall energy consumption contrast between EBSA and EBSA along with LEACH The graph shows overall energy in sleep state,idle state and transmit state consumption comparisons between EBSA and EBSA along with LEACH shows that considerable amount of energy is saved when we use both the approaches are used together. 6 CONCLUSIONS Fig 7 Performance analysis of End to End latency with EBSA and EBSA along with LEACH Thus we are able to investigate the delay for static and dynamic flows for heterogeneous network. Based on which we propose EBSA algorithm along with the LEACH approach by which significantly attain packet delivery ratio, obtain proficient bandwidth, better energy consumption in sleep state idle state along with overall energy consumption achieved and End to End Latency. REFERENCES Fig 8 Energy consumption contrast between EBSA and EBSA along with LEACH Energy consumption comparisons between EBSA and EBSA along with LEACH shows that considerable amount of energy is saved when we use both the approaches together in sleep state Fig9 Energy consumption contrast between EBSA and EBSA along with LEACH Energy consumption comparisons between EBSA and EBSA along with LEACH shows that considerable amount of energy is saved when we use both the approaches together in idle state. 1 K. Fall, A delay-tolerant network architecture for challenged Internets, in Proc. ACM SIGCOMM, pp , S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst,K. Scott, and H. Weiss, Delay-tolerant networking an approach to interplanetary Internet, IEEE Commun. Mag., vol. 41, no. 6, pp , C. Liu and J. Wu, Scalable routing in delay tolerant networks, in Proc.ACM MobiHoc, W.Heinzlman A Chandraskaran and H Balakrishnan Energy efficient routing protocol for wireless microsensor networks Jan W.Heinzlman An application specific protocol for wireless networks PhdDissertion,Mass Inst Technol Cambridge 6 Dynamic Clustering for saving energy in wireless sensor networks Second international conference on communication software networks W. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-Efficient Communication Protocols for Wireless Microsensor Networks. In Proceedings of Hawaiian International Conference on Systems Science, January Dynamic multi-level hierarchal clustering approach for wireless sensor networks G. S. Tomar; Member IEEE & Shekhar Verma Vikrant Institute of Technology & Management, Indore India Indian Institute of Information Technology, Allahabad India 299