Volume 5, Issue 3, March 2019 (ISSN: 2394 – 6598)
SHORTEST PATH ROUTING
ALGORITHM USING ANT COLONY OPTIMIZATION IN MANETS
A.Daniel1 Assistant Professor,
School of Computing Sciences and Engineering, Galgotias University,
Delhi NCR, Utter Pradesh, India [email protected]
U.Hari Haran2 Information Technology Galgotia College of Engineering and
Technology Greater Noida, India [email protected]
Abstract— A mobile ad-hoc network (MANET) is formed by a cluster of mobile hosts, each installed with a wireless transceiver, without the assistance of base stations. Various Clustering algorithms have been proposed to partition the network into small and manageable clusters and hence provide efficient resource management which enhances network performance. Ant Colony Optimization (ACO) is inspired by the foraging behaviour of real ant. ACO is meant to find optimal and shortest routing solution for many difficult problems such as Travelling salesman problem, Graph colouring problem... etc. In this paper, a new approach of clustering has been introduced based on ACO. This approach leads to formation of clusters which partition the network into number of non overlapping clusters. An algorithm based on ACO for the selection of Cluster Head and Gateway node is also proposed.
I. INTRODUCTION
Mobile unplanned Network (MANET) is associate degree infrastructure-less network that consists of a set of wireless mobile hosts to create a brief network while not the help of any base station.
Since information measure is restricted in an advertisement hoc network, it is very important to construct a virtual backbone consisting of solely a set of nodes that have the privilege to forward packets.
Such a virtual backbone known as spine plays a very important role in routing, broadcasting and property management in wireless unplanned networks. an endeavor ought to be created to stay this backbone skinny and connected [2]. The preferred methodology that developed to supply resource management over mobile unplanned networks is agglomeration. This technique supported partitioning the network in smaller and manageable teams every cluster known as cluster. agglomeration offers many edges once it used with MANETs like it enhances routing method and quality, Stabilizes dynamic constellation, helps to perform additional economical resource allocation, provides gradable routing design. This techniques dividing nodes of a self-organized network like painter into variety of overlapped or disjointed clusters. in step with Cluster based mostly network theme, we\'ve got 3 forms of mobile node in painter
1. Cluster Head: is outlined as an area organiser for its cluster. Cluster Head keeps in regular contact with member nodes and entree nodes of neighbor clusters. It performs inter-cluster routing, information forwarding and lots of alternative operations.
2. entree Node: could be a mobile node that acts as a communication medium between the clusters, will access neighbor cluster and forward info between clusters.
3. Cluster Member or normal Nodes: is that the one neither a Cluster Head nor entree. A cluster member wont to communicate with the Cluster Head of its cluster and update its table info per its corresponding cluster Head.
Fig.1 Cluster heads, Gateways and ordinary nodes in MANET [3].
A brief introduction to clump mechanism has been mentioned in section II. Route discovery method of associate on demand cluster primarily based routing is delineate in section II-A, and the way a routing is administrated is explained with the assistance of fig two in section II-B. In section III basic introduction of AC is given. In section IV a brand new optimized approach supported hypertension Colony optimisation has been introduced for formation of non overlapping cluster And an formula mistreatment ACO is planned for locating cluster Head and entrance way node.
II. CLUSTERING MECHANISM Clustering techniques is intended by process structural partitioning of nodes within explicit network as shown in fig. 1. This mean; for explicit network, the nodes can classified to outline set of clusters supported specific techniques to specify [3]:
1. Cluster formation part.
2. Cluster maintenance part.
According to agglomeration ideas in painter, cluster of many mobile nodes type cluster and out of those classified nodes one node should be electoral that leads the full cluster referred to as Cluster Head (CH) and is accountable for the resource demand and distribution member nodes of the cluster. Remaining nodes of cluster square measure the member nodes conjointly referred as normal Nodes (CN) except Cluster Gateways (CG) or entry nodes that square measure the nodes that act as a communication medium between quite one clusters.
The painter is maintained and managed by partitioning the network into clusters. supported bound criteria or property a way used for grouping the nodes based mostly is understood as agglomeration. The implementation of agglomeration schemes in painter helps in up the routing by reducing the dimensions of the routing table and decreasing transmission overhead by change the routing tables when topological changes occur.
Cluster based mostly routing may be a reactive routing. Reactive routing is additionally referred to as on-demand routing. Reactive routing has 2 main processes concerned in it -route discovery and Packet routing [1,2,3,4,5,6].
A. ROUTE DISCOVERY
If a node must realize a route to a different destination node, 1st it should discover a route that\'s required to succeed in the destination node then route the packet to it node. not like proactive routing, methods square measure maintained solely till they\'re required .Route Discovery is that the mechanism whereby a node A want to send a packet to a destination D obtains a supply route to D. the same as alternative painter protocols, the approach S finds a route (or multiple routes) to D is additionally done by flooding, however, thanks to the agglomeration approach the amount of nodes that square measure disturbed square measure a lot of less generally. primarily in Route Discovery, cluster heads square measure flooded in rummage around for a supply route. To perform Route Discovery, the supply node A sends out a Route Request Packet (RREQ), with a recorded supply route listing solely itself at the start. Any node that forwards this packet can append its own ID during this RREQ. every node forwards a RREQ packet just the once and it ne\'er forwards it to a node that has already appeared within the recorded route. In CBRP, the RREQ can continuously follow a route with the subsequent pattern to succeed in destination D: A CH1,G1,CH2,G2,G3,CH3 ... D[7,8,9,10,11,12,13].
B. Packet Routing
Ordinary nodes square measure cluster members however they are doing not have neighbors happiness to completely different clusters. entry nodes square measure nodes in a very non-cluster head state set at the boundary of a cluster. they\'re used for routing to a node from a distinct cluster.
Networks choose a collection of nodes which will function the backbone of the network. A network will
contain variety of clusters and every cluster has cluster head and cluster members, that square measure at one hop aloof from the cluster head. The cluster Head of 1 cluster is connected to a different cluster directly or through the entry nodes [14,15,16,17,18].The entry nodes and therefore the cluster heads along manage the routing mechanism of the network. In MANET, whenever a knowledge packet is send to a destined node we\'ve got to hold out a route discovery method. in a very route discovery a route request packet (RREQ) is flooded over the network. during this every and each node of the network participate that lead large information measure and energy uses. Finally it reduces network performance. so as to utilize our most scarce resources (energy, information measure etc), agglomeration as a best far-famed answer was planned. In agglomeration based mostly routing solely 2 nodes that participate in flooding of route request packet (RREQ).Those square measure Cluster Head (CH) and Cluster entry (CG). thence the less the amount of nodes taking part in routing call the a lot of the network performance can increase.Routing mechanism is show in following fig2.
Fig.2 Flooding of RREQ packet over cluster head(CH) and gateway node(GN) to find route from source node a to destinatiion node D.
III . ANT COLONY OPTIMIZATION Ant Colony improvement (ACO) is associate adaptational technique to search out partial answers for the issues wherever distinctive actual solution is either tough or not possible. ACO is galvanized by the hunt behaviour of ants. once ants explore for food, they wander arbitrarily and upon
finding food come back to their colony whereas giving birth a chemical substance referred to as secretion on the trail . several ants could travel through completely different routes to constant food supply. The emmet that travel the shortest path to the destination reaches initial to the destination and so once it starts moving back to its nest it follows constant path because it is that the solely path with high secretion concentration. so once it moves back to the nest it any will increase the concentration of secretion thereon path .Subsequently a lot of ants area unit attracted by this secretion path, that reinforces the trail even a lot of. Ants area unit straightforward agents that act via indirect communication called stigmergy. Stigmergy is associate indirect style of communication wherever individual agents leave signals within the surroundings and alternative agents sense them to drive their own behaviour. this kind of communication is native whereby straightforward agents act regionally while not having any international data. Since these bio-inspired networks area unit ascendable, it\'ll be useful for any analysis conjointly [19,20,21,22,23,24,25].
ARA [1] is one amongst the emmet colony improvement based mostly routing algorithmic program that works in associate on demand method.
It sets up multiple methods between supply and therefore the destination. At begin of session, Forward ants are going to be broadcasted by sender to any or all its neighbors. every Forward emmet incorporates a distinctive sequence variety to avoid duplicates. A node receiving a Forward emmet for the primary time creates a record consists of destination address, next hop, secretion worth in its routing table. The node interprets the supply address of the Forward emmet as destination address, the address of the previous node as next hop, and computes the secretion worth reckoning on the quantity of hops the Forward emmet required to succeed in the node[26,27,28]. once the Forward emmet reaches destination, the destination node extracts the data so destroys the Forward ants. A Backward emmet is made and sent towards the supply node, the trail is established and information packets area unit sent. information packets area unit wont to maintain the trail ,so overhead is reduced.
IV . PLANNED APPROACH
Although there area unit variety of approach gift for cluster formation in Adhoc networks however they suffers from limitation like overhead attributable
to transmission of huge variety of packets .Here we tend to area unit presenting a replacement approach which might divide the whole networks into non overlapping clusters.
The algorithmic program for cluster formation may be explained as follows
1. at first every node can broadcast a forward emmet packet with a hop limit of 1(neighbour node) .With each node acceptive atmost one forward emmet and rejecting the forward emmet packets received subsequently.
2. each node {which can|which can|which is able to} be obtaining a forward emmet as in step one will turn out a backward emmet packet back to the supply. thus resulting in the formation of disjoint clusters as shown in fig.
3. when step two the Cluster Head may be determined by investigation the quantity of backward emmet received on every node within the cluster. The node with most variety of backward emmet packet are going to be the Cluster Head.
4. therefore every node within the cluster may be allotted a Cluster Head id love the id of the cluster head determined from the step three.
The entrance for bury cluster transmission of packets may be determined by mistreatment following steps.
1. The Cluster Head can broadcast a forward emmet packet with a hop limit following condition
Cluster Head id (Sending node) != Cluster Head id (Receiving node)
2. If the condition within the step one is met then a backward emmet is made from the receiving node back to the supply and therefore the id love the supply of backward emmet are going to be set to the id of entrance node for transmittal packets between 2 clusters.
Fig.3. a) Formation of cluster head b) Gateway discovery for inter cluster communication
V . CONCLUSION
Clustering algorithm comes with number of benefits and enhances the performance of network due to less bandwidth utilization. Cluster Head (CH) and Cluster Gateway (CG) forms the main backbone of the cluster based network. Hence a new optimized approach based on Ant Colony Optimization has been introduced for formation of non overlapping cluster and an algorithm using ACO is proposed for finding cluster Head and Gateway node.
VI. REFERENCES
1. Sivaram, M., B. DurgaDevi, and J. Anne Steffi.
"Steganography of two LSB bits." International Journal of Communications and Engineering 1.1 (2012): 2231-2307.
2. Manikandan, v., v. Porkodi, amin salih mohammed, and m. Sivaram. "Privacy Preserving Data Mining Using Threshold Based Fuzzy Cmeans Clustering." ICTACT Journal on Soft Computing 9, no. 1 (2018).
3. Malathi, N., and M.Sivaram. "An Enhanced Scheme to Pinpoint Malicious Behavior of Nodes In Manet’s." (2015).
4. Mohammed, Amin Salih, D. Yuvaraj, M.
Sivaram, and V. Porkodi. "Detection And Removal Of Black Hole Attack In Mobile Ad Hoc Networks Using Grp Protocol."
International Journal of Advanced Research in Computer Science 10, no. 6 (2018).
5. Sivaram, M., D. Yuvaraj, Amin Salih Mohammed, V. Porkodi, and V. Manikandan.
"The Real Problem Through a Selection
Making an Algorithm that Minimizes the Computational Complexity."
6. Porkodi, V., M. Sivaram, Amin Salih Mohammed, and V. Manikandan. "Survey on White-Box Attacks and Solutions." Asian Journal of Computer Science and Technology 7, no. 3 (2018): 28-32.
7. Sivaram, M. "Odd And Even Point Crossover Based Tabu Ga For Data Fusion In Information Retrieval." (2014).
8. Dhivakar, B., S. V. Saravanan, M. Sivaram, and R. Abirama Krishnan. "Statistical Score Calculation of Information Retrieval Systems using Data Fusion Technique." Computer Science and Engineering 2, no. 5 (2012): 43- 45.
9. Punidha, R., avithra K, Swathika R, and Sivaram M, “ Preserving DDoS Attacks sing Node Blocking Algorithm.” International Journalof Pure and Applied Mathematics, Vol.119, o. 15, 2018, pp 633-640.
https://acadpubl.eu/hub/2018-119-15/3/473.pdf 10. M, Sivaram, et al. “Securing the Sensor Networks Along With Secured Routing Protocols for Data Transfer in Wireless Sensor Networks.” Journal of Emerging Technologies and Innovative Research, vol. 5, no. 10, Oct.
2018, pp. 316–321.,
doi:http://doi.one/10.1729/Journal.18612.
11. Steffin Abraham , Tana Luciya Joji , Sivaram M, D.Yuvaraj, “Enhancing Vehicle Safety With Drowsiness Detection Andcollision Avoidance” International Journal of Pure and Applied Mathematics, Volume 118 No. 22 2018, 921-927. https://acadpubl.eu/hub/2018- 118-22/articles/22b/39.pdf
12. Mahalakshmi.K, Sivaram.M, Shantha Kumari.K, Yuvaraj.D, Keerthika.R,
“Healthcare Visible Light Communication”, International Journal of Pure and Applied Mathematics, Volume 118 No. 11 2018, 345- 348, https://acadpubl.eu/jsi/2018-118-10- 11/articles/11/41.pdf.
13. Punidha.R, Sivaram.M, “Integer Wavelet Transform Based Approach For High Robustness Of Audio Signal Transmission”, International Journal of Pure and Applied Mathematics, Volume 116 No. 23 2017, 295- 304, https://acadpubl.eu/jsi/2017-116-23- 24/articles/23/40.pdf
14. DEEPA.S, SIVARAM.M, “Enabling Anonymous Endorsement In Clouds With Decentralized Access Control”, International Journal of Scientific Engineering and Applied Science (IJSEAS) - Volume-1, Issue-3, June 2015, 397-401.
15. Sivaram.M, Obulatha.O, “ Position Privacy Using LocX”, International Journal of Innovative Research in Engineering Science and Technology, Vol. III,Issue 01,Pp 206-212.
16. M. Sivaram, K. Batri, Amin Salih Mohammed and V. Porkodi, “Exploiting the Local Optima in Genetic Algorithm using Tabu Search”, Indian Journal of Science and Technology, Vol 12(1), DOI: 10.17485/ijst/2018/v12i1/139577, January 2019.
17. Sivaram M, Batri K, “ Odd and Even Point Crossover Based Tabu GA for Data Fusion in InformationRetrieval”,
http://hdl.handle.net/10603/38935, 10-Apr- 2015.
18. Sivaram.M, Yuvaraj.D, Amin Salih Mohammed, Porkodi.V “Estimating the Secret Message in the Digital Image” International Journal of Computer Applications, 181(36):26- 28, January 2019.
19. Mrs.V.Porkodi, Dr.D.Yuvaraj, Dr.Amin Salih Mohammed,V.Manikandan and M.Sivaram,
“Prolong the Network Lifespan of Wireless Sensor Network by Using Hpsm”, International Journal of Mechanical Engineering and Technology, 10(01), 2019, pp.2039–
2045.http://www.iaeme.com/IJMET/issues.asp
?JType=IJMET&VType=10&Type=01 20. Porkodi.V, Yuvaraj.D., Mohammed,A.S,
Sivaram.M and Manikandan.V,” IoT in Agriculture” Journal of Advanced Research in Dynamical and Control Systems, Pages: 1986- 1991,14-Special Issue, Pages: 1986-1991,2018.
21. Manikandan.V, Mohammed, A.S, Yuvaraj,D., Sivaram.M and Porkod.V, “An Energy Efficient EDM-RAEED Protocol for IoT Based Wireless Sensor Networks” Journal of Advanced Research in Dynamical and Control Systems, Pages: 1992-2004,14-Special Issue, Pages: 1992-2004, 2018.
22. Mohammed, A.S., Kareem, S.W., Al Azzawi, A.K., Sivaram, M. “Time series prediction using SRE-NAR and SRE-ADALINE”,
Journal of Advanced Research in Dynamical and Control Systems, Pages: 1716-1726, 2018.
23. Sivaram, M., Yuvaraj, D., Porkodi, V., Manikandan, V. “Emergent news event detection from facebook using clustering”
Journal of Advanced Research in Dynamical and Control Systems, Pages:1941-1947, 2018.
24. Nithya, S., Sundara Vadivel, P., Yuvaraj, D., Sivaram, M. “Intelligent based IoT smart city on traffic control system using raspberry Pi and robust waste management”, Journal of Advanced Research in Dynamical and Control Systems, Pages: 765-770, 2018.
25. Viswanathan, M., Sivaram, M., Yuvaraj, D., Mohammed, A.S. “Security and privacy protection in cloud computing”, Journal of Advanced Research in Dynamical and Control Systems, Pages 1704-1710, 2018
26. 25. Batri, K., Sivaram, M. “Testing the impact of odd and even point crossover of genetic algorithm over the data fusion in information retrieval”, European Journal of Scientific Research, 2012.
27. Sivaram Yuvaraj Amin Salih Mohamme M D V Porkodi. Estimating the Secret Message in the Digital Image. International Journal of Computer Applications 181(36):26-28, January 2019
28. M SIVARAM et al.: DETECTION OF ACCURATE FACIAL DETECTION USING
HYBRID DEEP CONVOLUTIONAL
RECURRENT NEURAL NETWORK DOI:
10.21917/ijsc.2019.0256
29. T.Nishitha, P.Chenna Reddy, Performance Evaluation Of AntHocNet Routing Algorithm in Ad Hoc Networks, IEEE ICCS.2012
30. Venugopal1, and L.M. Patnaik2, Efficient Passive Clustering and Gateway Selection in MANETs, Springer-Verlag Berlin Heidelberg IWDC 2005.
31. Mohammad et al., A Review of Clustering Algorithms as Applied in MANETs, International Journal of Advanced Research in Computer Science and Software Engg 2 (11), 2012.
32. Amritha Sampath, Tripti. C, Sabu M. Thampi, An ACO Algorithm for Effective Cluster Head Selection.
33. Jiang, Li, Tay, Cluster Based Routing Protocol(CBRP) Functional Specification,
INTERNET-DRAFT draft-ietf-manet-cbrp- spec-00.
34. Ratish Agarwal, Dr. Mahesh Motwani, Survey of clustering algorithms for MANET,
International Journal on Computer Science and Engineering Vol.1(2), 2009, 98-104.
35. Daniel Cˆamara Antonio A.F. Loureiro, A Novel Routing Algorithm for Ad Hoc Networks, 33rd Hawaii International Conference on System Sciences – IEEE 2000
