JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

CSVANET - Cuckoo Search for Efficient Optimal Path Selection with QoS
Usha.M #1, Dr.B. Ramakrishnan*2
Research Scholar, Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli, Tamilnadu, India1
Associate Professor, ST Hindu College , Nagercoil2
Ushasathyam74@gmail.com
ramsthc@gmail.com

Abstract - VANETs are slowly growing into a large commercial application network. The major concern in a
VANET is the amount for security applied to the transmitted data when it is expected to travel the transmission
route. Data security may be compromised due to the presence of selfish or malicious nodes .Security is one of the
major components in deciding the QoS aspect of a network. Our proposed technique focuses on security and quality
of service based energy aware multipath routing in VANETs. The GSA-PSO algorithm is used to for selecting
efficient multi-path routes. Due to continuous usage the routes may gradually lose their link quality. This is
overcome by selecting an optimal path among the established routes. We have proposed a cuckoo search algorithm
which is patterned over the lifestyle of a cuckoo bird. The performance aspect of our proposed work is analyzed
against existing techniques to prove their efficiency. The simulation of the proposed methodology proves that the
CSVANET shows better performance in terms of energy and network quality. It also shows that our proposed work
is much more improved than that of the existing methods.

Keywords - VANET, optimal link state routing protocol, Gravitational Search Algorithm, Particle swarm
Optimization, and Cuckoo search (CS) algorithm.
1. Introduction
A VANET uses vehicles as its nodes in order to carry out the transmissions. The vehicles act as routers and
transmit data between each other. The vehicular nodes are highly mobile by nature. Road side units and On board
units facilitate communication among the vehicles. The nodes rely on each other to forward the messages. The
vehicles are equipped with communication units (DSRC (Direct Short Range Communication)) in order to make
transmission possible. Roadside units help facilitate the transmission further to the vehicular nodes. Several tailor
made algorithms have been proposed for finding the best route to the destination node. The channel is also utilized
effectively by using the spectrum opportunistically. Bandwidth needs to be used effectively with as much delay as
possible. The network density is directly dependent on the traffic density. The data is transmitted using multihops
among the vehicular nodes. VANETs are now widely used for several applications that enable information to travel
faster. Secure routing and faster delivery are the two major issues constantly focused on in order to achieve a good
throughput [1-3].

V1, V2, V3 – Three Different Vehicles

V2V – Vehicle to Vehicle
V2R - Vehicle to Roadside Unit

Figure.1: VANET Communication

Volume VI, Issue V, May/2019 Page No:1785

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

Cognitive radio technology can be used alongside spectrum sensing techniques in order to achieve efficient channel
utilization during transmission. Based on this technology the users of the spectrum are prioritized based on their
spectrum usage. This prioritization helps in identifying the next user who is supposed to utilize the spectrum.
Routing in VANETs is usually on a multi hop basis .All routing algorithms must take into account ,the high mobility
of the vehicular nodes [4-7].The data needs to be delivered correctly to the intended node regardless of its current
position. Routing and security still continues to be the two major challenges in a VANET. A VANET can be
modeled based on a MANET (Mobile Ad hoc NETwork).The only major change should be the facilitation of the
Inter-Vehicular Communication (IVC).The information is exchanged via IVC with the help of On Board Units
(OBUs) and the fixed Road Side Units (RSUs). These two units coordinate with each other to transmit information
between the vehicles. The RSU acts like an access point while the OBU in the vehicle acts as a router to forward
information [8][9].
2. RELATED WORKS
World Health Organization (WHO) has published a report which states that a lot of accidental casualties are caused
on a day to day basis due to a lot of factors .These factors may range from heavy population to not obeying the
traffic rules. The main reason stated was the lack of traffic information at all stages [1].Intelligent traffic information
would help avoid untoward road incidents. A VANET is an import aspect of advances adhoc networking
technology that helps supply this traffic information called Intelligent Transportation system(ITS) services .This
helps in providing road safety and comfort to the end users and also helps in reducing the congestion associated with
the traffic entities.[10]-[15]. The performance aspects of a VANET can be improved by combining other useful
technologies. Fuzzy related techniques can be combined alongside cognitive radio technology so as to achieve a
better level of security in identifying the users as either genuine or malicious. Routing in VANETs can be further
enhanced by using a static algorithm like OLSR(Optimized Link State Routing).This routing algorithm identifies
selector nodes which are made responsible for forwarding the packets .This OLSR technique is further made
stronger by using a minimal set of Multi Point Relays(MMPR).In order to achieve even better efficiency the MMPR
technique is further enhanced by Robust MPR(RMPR).This RMPR technique improvises on the MMPR technique
by reducing the number of two hop neighbor nodes in the relay selector node set[1-3][16].

Figure.2: Multi Point Relays (MPR)

The techniques used in other ad hoc networks can be utilized in VANETs after making slight alterations to suit the
needs of a VANET. For instance, the CEAACK method proposed by J.Sathiamoorthy et.al can be utilized to cluster
the network with cluster head appointed for each cluster. This method helps in eradicating the malicious users in the
network. The same clustering technique may be further improved by adopting a three tier fuzzy algorithm which
provides additional security to the clustered network. Natural and biological habitat and lifestyle can also be
modeled to improve the working of an ad hoc network. The lifestyle and behavior of the ants can be modeled in
order to arrive at efficient routing algorithms. The Ant colony optimization algorithm can be further enhanced by
introducing fuzzy concepts [17][18].This helps in creating dynamic clusters and also helps in the selection of a head
node for the cluster dynamically without delay. Broadcasting can also be enhanced by using an advanced technique
of identifying one hop and two hop nodes to forward the data[16][19][20]. The techniques discussed can be well
suited to VANETs after making some necessary alterations to suit the working of a VANET.

Volume VI, Issue V, May/2019 Page No:1786

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

Many algorithms have been proposed to facilitate multipath routing in VANETs. Liu and Yu [21] have proposed
an authentication based anonymous secure routing technique. This attempts to achieve better communication
metrics. Network assaults can be avoided by using a cluster based approach with focus towards efficient routing.
Key-encrypted onion routing is used in order to protect the transmitted message from the temporary nodes which
enter the network. A sensible hole detection algorithm proposed by Babu et al.[22].This technique further proposed
a very good feedback based security scheme that can analyse and distinguish the node activity within the network.
The technique focuses more on improving the QoS of the network. Power utilization is a common problem since
extended usage may drain the battery, herby losing out on node energy. Multicasting techniques focus on power
usage which helps in building an efficient network. An energy competent genetic algorithm was proposed by Lu
etal.[23] to establish a better QoS in the network by using the multicasting technique. The proposed work was a NP-
complete problem. The technique ensures that minimal energy is utilized in carrying out the network activities. Deep
and Bansal proposed a new mean PSO technique which is actually a refined version of the PSO technique. Two
terms of the velocity update equation of the PSO scheme was replaced with two newer terms that merged the linear
combination of pbest and gbest values [24-26]. The proposed work was analyzed using criterion based functions
and was analyzed against the SPSO technique. The proposed variant was found to be more effective than the
normal PSO in terms of its standard metrics. This was measured based on how reliable, effective and stable the
network was [27][28]. OLSR is a proactive routing protocol famous for its applicability on wireless networks. It
utilizes MPR selector nodes in order to find the best path for forwarding the data. These selector nodes ensure that
only the selected node relays are allowed to transmit. The OLSR technique achieves a certain level of security and
also ensures that the forwarding technique does not flood the network unnecessarily [29].Routing is a major
challenge in VANETs because of the mobile nature of the nodes [30][31]. The security aspect of the vehicular nodes
needs to be addressed in VANETs. Several techniques have been presented in order to improve the safety measures.
These measures focus on the safety of both the drivers as well as the vehicles. The vehicle to infrastructure is usually
adapted in VANETs.
3. CHALLENGES IN VANETS
VANETs face a lot of challenges in terms of transmission and delivery. Some of the challenges that need to be
addressed are
 Frequent breaks in links and the mobile nature of the nodes pose a greater challenge in the multi-hop data
transmission.
 Data collection regarding accidents, traffic conditions, safety regulations, entertainment etc.
 Incurring minimal delay in terms of faster delivery, for which suitable vehicular nodes need to be selected.
 To extract a good throughput form a VANET, these challenges need to be addressed and resolved.
Efficient algorithms are proposed almost on a daily basis in order to resolve the issues prevalent in
VANETs.
 Multi-hop technique used data delivery is a major issue because of frequent link failures and high node
mobility.
4. PROPOSED MODEL

Figure.3: CSVANET

Volume VI, Issue V, May/2019 Page No:1787

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

4.1 Multipath Routing Using PSO-GSA Algorithm

Initially, a multipath route selection using Gravitational Search Algorithm Particle Swarm Optimization (GSA-PSO)
is carried out. In the GSA-PSO technique, a candidate solution that has a the maximum mass and force attracts
neighboring solutions as well. The best solution is now compared with the best solutions of the neighboring nodes in
order to obtain a global best solution. This technique protects the network from attackers and selfish nodes in
addition to selecting efficient multipath routes. The algorithm effectively combines the global best solution of the
PSO algorithm along with the local search capability of the GSA technique. The GSA algorithm is applied in order
to find the gravitational constant among the gravitational forces .The updation of the velocity values and candidate
solution positions is carried out by the PSO algorithm. The GSA –PSO techniques are carried out in parallel in order
to obtain the best global solution [32]. The role of the cuckoo search algorithm is to enable the selection of an
optimal path based on the behavioral patterns of a cuckoo bird. The optimum path is chosen from among the
selected routes in order to handle the effects of reduction in the link quality due to continuous transmissions. The
working policy of the CS (Cuckoo Search) algorithm is explained in Section 4.2 and Fig. 4 depicts the architectural
diagram of the proposed model.
Mathematical Model
The GSA-PSO algorithm is modeled by initializing N agents randomly.

(1)

The forces of gravity acting from agent „j‟ on agent „i‟ is defined at time „t‟

(2)
Where
MAGj - active gravitational mass related to agent „j‟. This is used to estimate the strength of the gravitational field
based on an object.
MPGj - passive gravitational mass related to agent „i‟. This is used estimate the strength of the ability of an object
to communicate with the gravitational field.
Dij(t) - The Euclidean Distance between agents „i‟ and ‟j‟
e- a small constant value
G- the gravitational constant at an instant „t‟. G is calculated as shown in equation (3)
(3)

Where
G0 - initial value
c - Descending coefficient
iteration -current iteration
Max_iteration- the number of possible iterations
The total force working on agent „i‟ is estimated using equation (4)
(4)

Where
Rj - the random number in the [0,1] interval
The accelatration of agent „i‟ is calculated after estimating the total forces acting from agent „j‟ on agent „i‟. The
acceleration of agent „i‟ is proportional to the total force(Forcei(t)) and inversely proportional to the mass of agent
„i‟. tis is calculated by using equation(5).

(5)

Where
Mi(t) –mass of agent „i‟ at time‟t‟.

Volume VI, Issue V, May/2019 Page No:1788

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

The gravitational force, total force and acceleration of candidate solution or agent is calculated using equations (2)
through (5). The best solution of the agent is updated. The fitness function of the agent is then used to calculate the
best solution (pbest) of the agent. The mass of each agent is taken as its fitness function. The remaining energy of
each agent is used to calculate the mass of every agent. The global best solution (gbest) is obtained by continuously
updating each agent‟s velocity. Velocity and agent position is updated by using the equations (6) and (7).

(6)

(7)
Where
X, c1 and c2 are the weight parameters
r1 and r2 –random number varying from 0 to 1
Vi(t) - velocity of agent „i‟ at time„t‟
Ai(t) - acceleration of agent „i‟ at time„t‟

Gbest – represents the global best solution

The velocity and agent position (candidate solution) is updated continuously till the global best solution is obtained.
The agent with the max gbest solution tries to attract such candidates that are in the nearby search region. The node
that has the global best solution is selected as the best node. This process is carried on till all the multipath routes in
the search area is found out.
4.2 Cuckoo Search (CS) Algorithm-Selection of an Optimal Route
Multipath routes are selected using the GSA–PSO algorithm. The multipath routes thus selected help in efficient
data transmission. Before a transmission is initiated, a route request message (RREQ) is sent by the initiating node
to the destination node. The RREQ is transmitted via the selected multipath routes. Once the RREQ is received by
the destination node, it returns a route reply (RREP) message back to the source node. The actual data is now
transmitted by the source node to the destination after the RREP is received. As the flow of transmission gradually
increases in the in the network, the link quality gets degraded. Due to this there is a possibility that the
acknowledgements from the destination may not reach the source node. To overcome this situation, the network
selects an optimal path from the previously established routes. The optimal route thus selected must be efficient in
terms of energy .It must also be the shortest route to the destination node. The cuckoo search algorithm helps the
network to discover the optimal path or route to the destination node. Many practical solutions of today are loosely
modeled on the natural and biological habitat around us. Similarly, the cuckoo search algorithm is based on the
biological behavior of the cuckoo birds. In fact, the technique is modeled on the levy flight behavior of the cuckoo
birds. We are aware of the fact that the cuckoo bird lays eggs in other birds‟ nests. If, at any point of time, the host
bird discovers the cuckoo‟s egg, it would not hesitate to either push the egg off its nest or completely builds a new
one. The cuckoo selects a nest and lays exactly one egg in the selected nest. The cuckoo selects only a high quality
nest to lay its egg.
In the CS algorithm, the search space region of the network symbolizes the nest of the host bird. Each egg in the nest
is represented as a candidate solution. The cuckoo‟s egg represents the new solution. The new solution is used to
replace the weaker fitness solution in order to arrive at the best solution possible.

The search space region is initialized with „M‟ number of solutions (nests). In order to select the optimal path, the
remainingl energy of the nodes must be effective. Additionally, the route between the source node and the
destination node must be a shortest route. The fitness function of the proposed Cuckoo Search Algorithm is defined
in Equation (8).

(8)

where,
Distance (n i , n i+1)- the distance between the nodes „n i‟ and „n i+1‟
i = 1- source node
m- destination node
Eresi - residual energy of each node

Volume VI, Issue V, May/2019 Page No:1789

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

Once the fitness function is calculated, each solution is evaluated using the levy flight behavior as shown in equation
(9).

(9)

(10)

Where
a[0] - step size.
Some of the new solutions can be generated using the Levy walk using Equations (2) and (3).This will help in
speeding up the local search. If the calculated fitness value of the new solution (cuckoo‟s egg) is better than the
other solutions (host eggs within the nest), then that solution is replaced by the new solution. This process is
repeated until the optimum solution is obtained. By applying the cuckoo search algorithm between the source and
the destination in the search space, an optimal path can thus be selected. This procedure is demonstrated in the
following algorithms.
Algorithm: GSA-PSO for Multipath Identification

Algorithm: Cuckoo Search (CS) for Optimal Route Identifier

The procedure adopted in the cuckoo search algorithm is represented in the following flowchart (Fig.) .The general
procedure is outlined in order to understand the working principle of the algorithm. It explains how the new solution
replaces the previous solution if the fitness value is up to the optimum level so that it helps in selecting the optimal
path.

Volume VI, Issue V, May/2019 Page No:1790

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

Figure.4: Flow Chart for Cuckoo Search (CS)

5. Results and Discussion
The effectiveness of the proposed GSA-PSO with CS(Cuckoo search) algorithm is analyzed with the GSA-PSO
technique in a VANET. Since this paper aims at introducing an enhanced version of the GSA –PSO algorithm, we
have proceeded to compare the efficiency of these two protocols. The effectiveness of GSA-PSO with CS against
the GSA-PSO is studied using a simulator (NS2) .Table 1 represents the parameters supplied to the NS2 simulator.
The number of nodes is changed and the network scenario is analyzed based on the changing traffic conditions. The
initial energy of the nodes is set to 100 joules .The performance metrics used to analyze the network are
 Packet Drop
 Packet Delay
 PDR
 Throughput

Simulation parameters
No. of Nodes 50, 75, 100, 125 and 150

Area Size 500m X 500m

MAC TYPE MAC / 802_11

Propagation Two Ray Ground

Antenna Omni Antenna

Simulation Time 50 sec

Volume VI, Issue V, May/2019 Page No:1791

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

Traffic Source CBR

Transmission range 100m

Packet Size 512 bytes

Rate 50 kbps

Channel bandwidth 2.0e6

5.1 Packet Drop

Packet drop refers to the number of packets dropped as the network conditions deteriorate in the due course of time.
Packet drop becomes inevitable as the network starts to grow in size. As evident from Fig. we can see that the packet
drop ratio for GSA-PSO with CS is lower than that of GSA-PSO. We can attribute this to the fact that the GSA-PSO
with CS technique focuses on improving the link quality in addition to finding the optimal path. The GSA-PSO
technique only looks for the best solution and does not focus on the link quality. Hence GSA-PSO with CS shows a
reduced packet drop when compared to the GSA-PSO technique.

Figure.5: Packet drop Comparison

5.2 Delay
As the network and nodes increase over time, the transmitted packets need to travel multiple hops in order to reach
the destination. There may be link breakages due to external factors which may lead to a delay in the transmission.
All types of networks tend to suffer from delay at various instants of time. The networks may implement various
measures to reduce the delay but cannot completely avoid it. From Fig. we can see that the GSA-PSO with CS
technique has a shorter delay when compared to the GSA-PSO technique. This is because the GSA-PSO with CS
scheme uses the cuckoo search algorithm to find an optimal route from the source to the destination. This helps in
shortening the transmission time of the packets thus leading to an overall minimal delay. The GSA-PSO technique is
also efficient but it does not implement the cuckoo search algorithm to find the optimal solution. Also, there is no
procedure to find the optimal path like the GSA-PSO with CS technique. Hence the packets need to travel longer
routes leading to a higher delay.

Volume VI, Issue V, May/2019 Page No:1792

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

Figure.6: Packet Delay Comparison

5.3 Packet Delivery ratio
The PDR of a network refers to the number of the transmitted packets successfully delivered to the destination. The
PDR of a network determined its performance. From Fig. we can see that the PDR of GSA-PSO with CS is much
higher than the GSA-PSO scheme. The GSA-PSO with its cuckoo search optimization algorithm is able to find an
optimal path, which further helps in minimizing the delay. This automatically leads to an increased PDR. Though
the GSA-PSO scheme is efficient, it shows a higher delay in the transmission thus leading to a reduced PDR when
compared to the GSA-PSO with CS technique.

Figure.7: Packet Delivery Ratio (PDR) Comparison

5.4 Throughput
The throughput of a network denotes the overall performance of the network. It is usually determined by all the
other parameters used to measure the network performance. When we look at the comparison of the other metrics
like delay, packet drop and PDR of the two techniques, we can see that GSA-PSO with CS shows a better
performance than the GSA-PSO technique. The delay and the packet drops are minimized while the PDR is
maximized in the GSA-PSO with CS technique. As a result, the throughput of GSA-PSO with CS is much higher
and efficient than the GSA-PSO scheme. The GSA-PSO with CS focuses more on the major parameters that will
lead to the improvement of the network quality. GSA-PSO also focus on the quality of the network but without an
optimization technique (the cuckoo search algorithm), its performance is much lesser than the proposed technique.
Hence the throughput of the GSA-PSO with CS is higher than that of the GSA-PSO algorithm.

Volume VI, Issue V, May/2019 Page No:1793

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

Figure.8: Throughput Comparison

6. Conclusion
In this paper, we have proposed an enhanced version of the GSA –PSO technique by introducing the cuckoo search
algorithm in VANETs .The CS algorithm is an optimization technique which finds an optimal route from the source
to the destination node. This optimal path helps in improving the quality of the transmission to a higher extent in a
VANET than the existing GSA-PSO scheme. The performance of the GSA-PSO with CS scheme is much more
efficient than the existing scheme. The performance of the GSA-PSO with CS technique in VANETs is compared
with the GSA-PSO scheme. The results are simulated and they show that the GSA-PSO with CS in VANETs has
minimal delay, maximum PDR, minimal packet drop and an increased throughput than the existing GSA-PSO
scheme. For our future work we are planning to incorporate security based techniques in order to achieve a better
QoS in terms of increase data security.

References:
[1] M. Usha, B. Ramakrishnan. "An Enhanced MPR OLSR Protocol for Efficient Node Selection Process in Cognitive Radio
Based VANET”, Wireless Personal Communications, 2019
[2] M. Usha, B. Ramakrishnan. “A Robust Architecture of the OLSR Protocol for Channel Utilization and Optimized
Transmission Using Minimal Multi Point Relay Selection in VANET”, Wireless Personal Communications, Online: 14 May
2019.
[3] M. Usha, B. Ramakrishnan , J Sathiamoorthy “Performance analysis of spectrum sensing techniques in cognitive radio based
vehicular ad hoc networks (VANET)” 2nd International Conference on Computing and Communications Technologies (ICCCT)
, p.74-80, IEEE Xplore, Feb-2017
[4] Joe, M. Milton, and B. Ramakrishnan. "WVANET: Modeling a novel web based communication architecture for vehicular
network." Wireless personal communications 85.4 (2015): 1987-2001.
[5] Joe, M. Milton, & B. Ramakrishnan, (2015)“Review of vehicular ad hoc network communication models including
WVANET (Web VANET) model and WVANET future research directions” Wireless networks 22 (7), 2369-2386
[6] Sathiamoorthy, J., B. Ramakrishnan, & M. Usha. (2015), “Design of a competent broadcast algorithm for reliable
transmission in CEAACK MANETs." Journal of Network Communications and Emerging Technologies 5.1, 144-151.
[7] Sathiamoorthy, J., B. Ramakrishnan, & M. Usha. (2018), “A Three Layered Peer-to-Peer Energy Efficient Protocol for
Reliable and Secure Data Transmission in EAACK MANETs” Wireless personal communications, Volume 102, Issue 1, pp 201-
227.
[8] Sathiamoorthy, J., B. Ramakrishnan, & M. Usha. (2018), “A Trusted Waterfall Framework Based Peer to Peer Protocol for
Reliable and Energy Efficient Data Transmission in MANETs” Wireless personal communications, Volume 102, Issue 1, pp 95-
124.
[9] S. Al-Sultan, M.M. Al-Doori, A.H. Al-Bayatti, H. Zedan, A comprehensive survey on vehicular ad hoc network, J. Netw.
Comput. Appl. 37 (2014) 380–392, doi: 10.1016 /j.jnca.2013.02.036.
[10] WHO, Fact-sheet for road traffic injuries. http://www.who.int/news-room/factsheets/ detail/road-traffic-
injuries/, 2017 (accessed May 2017)
[11] F. Cuomo, I. Rubin, A. Baiocchi, P. Salvo, Enhanced VANET broadcast throughput capacity via a dynamic backbone
architecture, Ad Hoc Netw. 21 (2014) 42–59, doi: 10.1016/j.adhoc.2014.04.008.
[12] X. Ma, J. Zhang, X. Yin, K.S. Trivedi, Design and analysis of a robust broadcast scheme for VANET safety-related services,
IEEE Trans. Veh. Technol. 61 (1) (2012) 46–61, doi:10.1109/TVT.2011.2177675.

Volume VI, Issue V, May/2019 Page No:1794

JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131

[13] H. Omar, W. Zhuang, L. Li, Ve-MAC: A TDMA-based MAC protocol for reliable broadcast in VANETs, IEEE Trans. Mob.
Comput. 12 (9) (2013) 1724–1736, doi:10.1109 /TMC.2012.142.
[14] I. Rubin, Y.-Y. Lin, A. Baiocchi, F. Cuomo, P. Salvo, Micro base station aided vehicular ad hoc networking, in: Proceedings
of International Conference on Computing Network and Communication (ICNC), 2014, pp. 231–235, doi:10.1109/ICCNC.2014.
6785337.
[15] Y.-Y. Lin, I. Rubin, Vehicular and messaging throughput tradeoffs in autonomous highway systems, in: Proceedings of the
IEEE Global Communication Conference (GLOBECOM), 2015, pp. 1–6, doi: 10.1109/GLOCOM.2015.7417014.
[16] Sathiamoorthy, J., B. Ramakrishnan, and M. Usha. "Design of a competent broadcast algorithm for reliable transmission in
CEAACK MANETs." Journal of Network Communications and Emerging Technologies 5.1 (2015): 144-151.
[17] J.Sathiamoorthy, Dr.B. Ramakrishnan “Energy and delay efficient dynamic cluster formation using hybrid AGA with FACO
in EAACK “Wireless Networks, pp 1-15, December (2015)
[18] J.Sathiamoorthy, Dr.B. Ramakrishnan “Energy and Delay Efficient Dynamic Cluster Formation Using Improved Ant
Colony Optimization Algorithm in EAACK MANETs“ Wireless Personal Communication, pp 1-122, November (2016).
[19]J.Sathiamoorthy, B.Ramakrishnan,"CEAACK – A Reduced Acknowledgment for Better Data Transmission for MANETs",
International Journal of Computer Network and Information Security (IJCNIS), Vol.8, No.2, pp.64-71, 2016.DOI:
10.5815/ijcnis.2016.02.08
[20] J.Sathiamoorthy, Dr.B. Ramakrishnan “A competent three-tier fuzzy cluster algorithm for enhanced data transmission in
cluster EAACK MANETs “Springer Soft Computing, 11 July 2017(Online)
[21]Liu, W., & Yu, M. (2014). AASR: Authenticated anonymous secure routing for MANETs in adversarial environments. IEEE
Transactions on Vehicular Technology, 63(9), 4585–4593.
[22] Babu, M., Dian, S., Chelladurai, S., & Palaniappan, M. (2015). Proactive alleviation procedure to handle black hole attack
and its version. The Scientific World Journal, 2015, 1–11.
[23]Lu, T., & Zhu, J. (2013). Genetic algorithm for energy-efficient QoS multicast routing. IEEE Communications Letters, 17(1),
31–34.
[24]Deep K, Bansal JC. Mean particle swarm optimization for function optimization. Int J Comput Intell Stud. 2009;1:72–92
[25]Singh N, Singh SB. A modified approach of standard particle swarm optimization algorithm. Int J Appl Math.
2013;28:1115–1125.
[26] Harish G. A hybrid PSO-GA algorithm for constrained optimization problems. Appl Math Comput. 2016;274:292–305.
[27]Rashedi E, Nezamabadi-Pour H. GSA: a gravitational search algorithm. Inform Sciences. 2009;179:2232–2248.
[28] Singh N. Mean gbest particle swarm optimization algorithm. J Adv Comput. Under Review, 2017.
[29]Ramakrishnan, B., M. Milton Joe, and R. Bhagavath Nishanth. "Modeling and simulation of efficient cluster based
Manhattan Mobility model for Vehicular communication." Journal of emerging technologies in web intelligence 6.2 (2014): 253-
261.
[30] Sardar MuhammadBilal, Carlos Jesus Bernardos, Carmen Guerrero , “Position-based routing in vehicular networks: A
survey”, Journal of Network and Computer Applications 36 (2013) 685–697.
[31] M. Usha, B. Ramakrishnan , J Sathiamoorthy “Architectural Analysis of Vehicle to Vehicle, Cluster and Cognitive Radio
Cooperative Sensing based Vehicular Ad Hoc Network” TEC- Elsevier International Conference on Electrical, Communication
and Computing, 2017.
[32] Pattabiram Thulasingam Kasthuribai, Murugaiyan Sundararajan. "Secured and QoS Based Energy-Aware Multipath Routing
in MANET”, Wireless Personal Communications, https://doi.org/10.1007/s11277-018-5820-4, 15 May 2018.

Authors:
Usha .M is a research Scholar, currently pursuing her Ph.D from M.S.University, Tirunelveli, under the
guidance of Dr.B. Ramakrishnan. She has completed M.C.A. and M.Phil in Computer Science from
Bharathidasan University, Trichy. She has also done her M.Tech (CIT) from Manonmaniam Sundaranar
University, Tirunelveli. She is currently working as an Assistant Professor in MEASI Institute of
Information Technology, Chennai. She has 12 years of teaching experience and she has published papers in
Network Security in National and International journals and has presented in International Conferences and
Seminars. Her current area of interest is Operating Systems, Algorithms and ad-hoc networks especially
MANET and VANET.
Dr B.Ramakrishnan is currently working as an Associate professor in the Department of Computer
Science and Research Centre, S.T.Hindu College, Nagercoil. He has got his post graduate Degree from
M.K. University and M.Phil Computer science from Alagappa University, Karaikudi. He has to his credit
30+ years of service in teaching IT related subjects. He has published a number of articles in leading
national and international journals. He has participated and presented a number of national and
international conference and seminars. His area of interest in the field of research includes network
technology, mobile communication, mobile ad-hoc network and vehicular network. He is a Chief Editor of
International journal of Computer Network and Application(IJCNA)

Volume VI, Issue V, May/2019 Page No:1795