BAT-based Optimized Routing Protocol in Cognitive Radio Ad Hoc Network

International Journal of Application or Innovation in Engineering & Management (IJAIEM)
Web Site: www.ijaiem.org Email: editor@ijaiem.org

Volume 4, Issue 12, December 2015
ISSN 2319 - 4847
BAT-based Optimized Routing Protocol in

Cognitive Radio Ad Hoc Network
SangitaPal1,Srinivas sethi2
Department of CSEA, IGIT, Saranag, Orissa.
ABSTRACT
Different kinds of optimization algorithm have been developed based on different context and it is highly essential in field of
communication, particularly in routing protocol in Cognitive Radio Ad Hoc Network. Many authors have placed their
optimized routing techniques in their application to make the communication in better and efficient way. In this paper, it has
been discussed the BAT algorithm optimization technique and implement the technique in the field of routing protocol in
Cognitive Radio Ad Hoc Network to make the better and optimize one. It has been designed a new routing protocol CRAODVOpt and compared with conventional routing protocol CRAODV in Cognitive Radio Ad Hoc Network environment. The
performance of proposed routing protocol is observed better than existing one.
Keywords:Cognitive radio (CR); Routing; Optimization; CRAODV-Opt; BAT algorithm;
1. INTRODUCTION
Now a day, optimization is widely used in the routing problem. Optimization is the study of planning and designing
problems using mathematical tools to find best solutions and optimally use all the valuable resources. It is considered as
maximization and minimization problem. In general, optimization problem is defined as[19]:
Minimize
subject to
and
fi(x)
hj(x)=0,
gk(x)0,
Maximize
subject to
and
fi(x)
hj(x)=0,
gk(x)>=0,
i=(1,2,,M)
j=(1,2,...,J)
k=(1,2,...,K)
OR
i=(1,2,,M)
j=(1,2,...,J)
k=(1,2,...,K)
where fi(x), hj(x) and gk(x) are the functions of design vector and x is the decision variables[21]. The function fi(x)
where i= 1,2 ,3,,M is the objective function. The equalities of h jand the inequalities for gkis known as constraints
[19]. The inequality is also defined as greater than and equal to zero and the objectives are formulated as maximization
problem.
Cognitive Radio (CR) is projected to use radio spectrum enthusiastically. Every single node in CR has transceiver to
examine spectrum in order to discover which spectrum is exploited and which is not. CR is the technology that
permits a cognitive radio ad-hoc network (CRAHN)[21] to exploit the spectrum in a dynamic approach. The crucial
idea of the cognitive radio is to gain the most prominent accessible spectrum. CRAHN is one of the classifications of
CR network [21]. It does not have any communication stamina. Thus, a CR consumer can communicate with other CR
users on both licensed and unlicensed spectrum bands throughout the ad hoc connection. Particularly it is better to use
optimized routing protocol in CRAHN. CRAODV-Opt, an optimized routing protocol has been developed by using
meta-heuristic Bat algorithm and compared with existing CRAODV in CRAHN environment.
The rest of the paper is as follow. Optimization Algorithms discussed in the section 2, followed by Optimal Routing
Protocol in Cognitive Radio Ad-Hoc Network in section 3. Bat algorithm has been discussed in section 4. Section 5
discussed optimized routing protocol in CRAHN, followed by result and discussion in section 6. Finally it has been
concluded in section 7.
2. OPTIMIZATION ALGORITHMS
To solve the optimization problem, efficient search and optimization algorithms are required. There are many
optimization algorithms which are divided depending upon the characteristics [21,22] as in fig.-1.
Page 116

ISSN 2319 - 4847
Fig.-1: Different kinds of Optimization Approaches

Based on the focus:
Gradient based algorithm is very efficient algorithm which uses derivative information.For example hill
climbing. As the function has discontinuities it becomes difficult to calculate the derivatives accurately.
Gradient free algorithm is very useful as it uses the values of the function instead of derivative information.
Depending on the perspective:
Trajectory-based algorithms: As the iteration continues, it uses only one solution and trace out a path. For
example hill climbing which relates the source point with the destination point in a crisscross way.
Population-based algorithms: It uses more than one solution which traces out multiple paths such as Particle
Swarm Optimization.
Depending on the nature:
Deterministic algorithms: It follows a thorough procedure and it repeats the pathway and values of both
variables and functions. The algorithm reaches the same final solution for the same initial point every time the
algorithm is executed. For example hill climbing, where it follows the exactly same path for the same starting
point as the program executes.
Stochastic algorithms: It always follows some randomness. The algorithm reaches the different final solution for
the same initial point every time the algorithm is executed. For example genetic algorithm and particle swarm
optimization. It is again divided into two levels heuristics and meta-heuristics.
Heuristics: It means to discover or to find by trial and error in order to produce feasible solutions to a complex
problem within a stipulated given period of time. This algorithm is efficient and produces quality solutions. But
sometimes it does not produce best solutions and even there is no guarantee that the algorithm will work.
Meta-heuristics: It is the higher level of heuristic algorithm. It uses tradeoff of randomization and local search.
This algorithm produces quality solutions within the given period of time, but still there is no guarantee that it
will work all the time. Hence, it is mostly suitable for global optimization. For example genetic algorithm and
particle swarm optimization.
Hybrid algorithms: This algorithm is the mixture of both deterministic and stochastic algorithms. It uses
deterministic algorithms but the only difference is that it initiates with different source points. For example, hill
climbing when it starts randomly.
Based on the searching:
Local search algorithms: It is a meta-heuristic method generally used for solving complex problems such as
simple hill climbing. It converges towards a local optimum and this algorithm is often called as deterministic
algorithm and has no ability to escape from local optima.
Global search algorithm: Mostly meta-heuristics algorithms are suitable for global optimization. For example,
hill climbing with random restarts turns the local search algorithm into global search capability.
3. OPTIMAL ROUTING PROTOCOL IN COGNITIVE RADIO AD-HOC NETWORK (CRAHN)
The resource allocation and data routing problem in the dynamic spectrum access environment is an optimization
problem. Different techniques like computational intelligence paradigm, game theory, meta-heuristic, combining
concepts, etc., are used to maximizing resource utilization which is discussed by different authors for different contexts.
Evolutionary algorithms (EA) can be applied to obtain approximate solutions for optimization problems in a rational
Page 117

ISSN 2319 - 4847
amount of computation time[3].Forexample, genetic algorithms (GA), ant colony optimization (ACO), BAT algorithm,
artificial bee colony (ABC), and particle swarm optimization (PSO) are belongs to this category. Similarly, Game
Theory provides various favorable criteria for the spectrum sharing problem among network users (both PU and
SU)[1][2].
Genetic algorithm (GA) is a searching method used to find the near solutions to the optimization problems[5]. GA is
mainly inspired by inheritance, mutation, natural selection, and crossover which belong to evolutionary biology. The
route/ paths from source to destination can be discovered and selected using fitness function of genetic algorithms[6].
At the network layer, throughput optimization sub-problem is solved by GA for finding the optimum solution[4]. The
genetic algorithm is used for optimal resource allocation which maximizes the throughput.
Swarm Intelligence (SI) techniques are evolving computational intelligence paradigm combining the concepts and
principles from biology, social sciences and mathematics which is generally used for several optimization problems.
The collective behaviour of distributed and self-organized swarms is performed in SI[12].
Ant colony optimization (ACO)[8] is one of the probabilistic SI method inspired by the behaviour of ant to solve
computational problems. Generally, it is used to find better paths, by using graphs from colony to the food. The design
of the ant colony approach is to imitate the behaviour with simulated ants walking around the graph which represents
the defined problem to solve in an optimal way. This approach acknowledges the pheromone trails emulation. Other
ants follow the trail to reach at their colony instead of travelling at random. The pheromone trail starts to disappear
over time and indicates its reducing strength. However, pheromone evaporation has the advantage of avoiding the
convergence to a locally optimal solution. ACO approach can be employed in networks to improve the performance of
routing protocols[9].
Due to dynamic nature of CRN to get optimization solution, ASAR (Ant-based Spectrum Aware Routing) [7] is an
algorithm which is robust, adaptive, and self-learned in multi-hop CRN. It is a new routing solution which can observe
and learn the dynamic network and then select the route. It discovers route, perform observation and learn by SI
techniques. F-ant is used to discover possible paths from source to sink and B-ant is used to collect the information on
the network and revise routing table of the nodes. A strengthening learning function is used to learn the dynamic
network. Hence this algorithm controls routing overhead as well as minimizes end-to-end delay.
Particle Swam Optimization (PSO) is an evolutionary algorithms (EA) in which optimization is achieved by
cooperative behaviour of individuals instead of emphasizing on survival of the fittest principle among several
population. It is not affected by the nonlinearity and size of the problem. Hence, it can be used to solve multi-objective
optimization and combinatorial problems in networking [13, 14], due to which, it can meet to the optimal solution. It
can also be applied on spectrum sensing and resource allocation in the CRN[15, 16]. Binary Particle Swarm
Optimization (BPSO) is used to maximize the total capacity and minimize the power consumption in CRAHN [15].
Similarly, PSO is used to assign Orthogonal Frequency Division Multiplexing (OFDM) carriers to SUs to maximize
sum rate capacity of the CRN under interference and power constraints[16]. Binary Particle Swarm Optimization
(BPSO), Socio Cognitive Particle Swarm Optimization (SCPSO) and Derivation 0 are three variants of PSO, are used
to maximize the throughput for the number of secondary links, which can be acknowledged in the CRN in the
occurrence of primary links under interference constraints[11].
Artificial Bee Colony (ABC) is another kind of algorithm, which mimics the foraging activity of honeybees, based on
the exchange of information among bees to get group information[17]. A swarm of virtual bees are generated those are
allowed to move arbitrarily in the search space. They interact when finding some target of food source. The possible
solution to the optimization problem treated as location of a food source and the quality or fitness of the associated
solution treated as the amount of a food source. The employed bee is considered as solution in the population. The
survival and progress of the bee colony are dependent upon the fast discovery and proficient use of the best food
resources and can be implemented in real time problems at a low computational cost.
BAT Algorithm is a meta-heuristic approach based on the echolocation behavior of bats. Frequency and sound tuning
technique have used in this algorithm to control dynamic behaviors of swam of bats. It is potentially more powerful
than PSO, GA and Harmony Search[18]. It is used for continuous constrained optimization problems.
Cognitive radio techniques improve their performance and optimize the spectrum usage by applying intelligent
learning and searching techniques. Some traditional methods may not perform better to solve optimization problems in
a scalable and fast fashion especially when the size of the network increases. Heuristic Harmony Search (HS)
algorithm[10] reduce the bandwidth requisite for exchanging information among the nodes. But, the performance of
the distributed algorithm degrades slightly. It also minimizes the computational complexity and optimizes efficiently
the channel assignment
Game Theory is a mathematical tool that analyzes the strategic interaction among multiple decision makers. The
importances of studying CRN in a game theory framework are:
To model dynamic spectrum sharing among users like PUs and SUs as games then analyze the behaviours and
actions of users in a formalized game structure, through which the achievements in game theory can be fully
utilized.
Page 118

ISSN 2319 - 4847
The optimum spectrum usage is a multi-objective optimization problem and Game Theory provides optimality
criteria to compute game optimality under different game settings.
The non-cooperative Game Theory uses only local information to derive proficient distributed approaches for dynamic
spectrum sharing. It is highly desirable in CRAHN because in CRAHN elasticity self-organized approaches are
required and centralized control is not accessible.
The cooperative game theory analyzes best possible strategies and advances their positions in a game, by enforcing
collaboration between them. In a non-cooperative spectrum sharing game, each user pays attention for their own benefit
and chooses an efficient approach that can maximize their payoff function [1].
Coalitional game is a supportive game describing how a set of players cooperate with others, by creating cooperating
groups and hence it improves their payoff in a game. SUs communally identify the activities of the PUs and sense the
spectrum for accessing empty spectrum bands. The games are designed for the allocation of the resources and provide
SUs to support and create grand coalition [2].As it is potentially more powerful than PSO, GA and Harmony Search, it
is considered the Bat algorithm in this problem.
4. BAT ALGORITHM
Xin-She Yang[18] proposed a BAT algorithm which is based on echolocation behavior of micro BAT. The main
characteristic of micro bat is; it could search its prey/food and distinguish various types of pray by avoiding obstacles.
BAT sends signal with loudness of frequency 20 kHz to 200 kHz to the objects with variable wave length. Their signal
bandwidth differsas per the species, and increased by using more harmonics. The distance S can be calculated when
signal bounces back to the BAT after striking the objects. The BATselects the object with minimum distance. The
Micro BAT also uses the factors like time delay from production and recognition of deflection, loudness variations of
the deflection, time variation of its two ears. So, it can discover both distance and orientation of the object, types of
objects, size and speed of objects.Bats fly randomly with velocity at position with a fixed frequency, varying wavelength
or variable frequency with fixed wavelength and loudness to search for prey.
5. PROPOSED MODEL
In this section, it has been discussed the adaptation of the BAT algorithm to make better routing protocol in CRAHN.
The SU is treated as BAT and its population size is numbers of BAT in the network. The loudness of BAT in terms of
frequency is A, and the pulse rate of BAT is R. The SU will send the signal or information at a frequency range from
25 KHz to 250 KHz at a rate of 8 to 10 m/s.
In this segment, the proposed routing protocol Cognitive Radio Ad hoc On-demand Distance Vector using BAT
algorithm (CRAODV-Opt) has been delivered by describing the route discovery and route maintenance process with
optimized channel selection using BAT algorithm. The proposed optimized routing protocol CRAODV-Opt is designed
for efficient route discovery process using sets of better channel in the route from source to destination in the network.
It has been used the necessary functions of control packets like RREQ, RREP, SU_RREQ, SU_RREP and HELLO,
RERR, which are similar to CRAODV [23][24] and AODV[25]. The PU-RERR and proper utilization of the spectrum
by protocol have been also implemented. The proposed protocol has been compared with conventional CRAODV.
The RREQ is generated and flooding by SU which is treated as BAT in CRAHN and transmitted from the nodes to
other nodes in the network to find the route information during the route discovery process. The originating node
spreads a RREQ message to its neighbouring nodeswith defined time to live (TTL) and a specified hop distance, which
further communicates to their neighbour nodes if destination node not found. If none of intermediate nodes has the
route information of sink node, they retransmit the RREQ with a next hop number. This process continues until it
reaches to the destination node. Then it sends a RREP message with priority of the channel of PU. The priority is
calculated based on occurrence of primary users at its different channels (TIME-ON of primary users) and packet error
rate (PER) to the originated node with the complete stored route information in it. The SU select the channel according
to highest priority. This may helps to establish the route from source to destination node and transfer the data through
the established path. Nodes along with the route can be updated their routing table entries.
Now it has been discussed the route request by secondary users (SU_RREQ), which is important for CRAHN to find out
the better channel in the route. It will verify whether a licensed channel is free from PU activities or not. After
receiving a SU_RREQ message through the predefined channel it drop the RREQ packet if the licensed channel is not
free from PU activity. Otherwise, it creates a reverse route reply through same channel. A node can keep numerous
routes in CRAODV-Opt. The SU verifies the presence of a PU activity before transfer a packet using a channel. It sends
a secondary user route reply (SU_RREP) to the source node using the same channel. Otherwise, it broadcasts a copy of
the SU_RREQ message packet through the channel and it provides to check the duplicate SU_RREQ packet and
discard it if found. Secondary user route reply (SU_RREP) is used in the CRAHN to reply the destination information
regarding PU activity on a channel. The node updates the opposite path and sends SU_RREP through intermediate
nodes in the CRAHN.
Page 119

ISSN 2319 - 4847
It built up a path through the same free channel of nodes to the source node as per the priority value of channel. Then it
forwards the SU_RREP message along the opposite path using specified channel. The SU will update the onward path
only if the new SU_RREP message is better forward route received using the same channel.
Similar to route discovery process in the CRAHN, the route maintenance process can be performed as it is a vital role
in routing protocol. There are two classes of route error (RERR) message in CRAODV-Opt. RERRs is one of them for
topology alterations in such dynamic network as it is ad hoc in nature and other one is primary user (PU-RERR) for
handling activity of the PU. The node in the network cancels all the route records using an accessed channel and it
notices the neighbour SUs that used licensed channel is inaccessible with a PU-RERR message when a PU activity is
identified through a node in a same channel. The SUs get a packet nullify the used channel route entries whose
succeeding hop is the PU-RERR sender. In this way, SU nodes in the network affected by the PU activity must
withdraw from the eventful channel.
In this way the route discovery and maintenance can be performed using channel which make it more efficient and
effective. The simulations have been carried out by using simulations through NS-2 [29], based on the CRCN
integrated simulator [30] and evaluate the performance of protocol through throughput, end-to-end delay, packet
delivery ratio(PDR) and normalized network routing load(NRL) as per the table-1.
TABLE-1: Simulation Parameters for CRAODV-Opt and CRAODV
S.N
o
1
2
3
4
5
6
7
8
9
10
11
12
Parameters
Values
Area size
PU Transmission range
Simulation time
Nodes speed
Pause times
Data rate
Mobility model
Interface
No. of channel
Numbers of SU Node
Numbers of PU Node
No. of Simulation
500m x500 m.
250 m.
500 s.
5 m/s
5 s.
5 Kbps
Random any point.
1
5
10,20,30,40,50,60,70,80,90,100
10
5
The parameters NRL, Delay, PDR, Throughput, which are used to evaluate the performance of routing protocol can be
obtained through the Trace Analyzer in NS2. The total amount of routing loads per total delivery packets in the
network system is treated as NRL. The delay refers as the average time taken to receive the data at destination node
from source node in the network. PDR is used to calculate the ratio between the number of successfully received packets
at destination nodes and the number of all packets sent by sources nodes. The throughput is the rate at which a network
receives data packets at receiver end at a particular time period.
6. RESULT AND DISCUSSION

In this paper, BAT algorithm based optimized routing protocol has been designed in the CRAHN and makes the
routing protocol more reliable and efficient one. It has been tried to improve the PDR and throughput, which denotes
the efficiency and reliability of routing protocol and good channel efficiency with low routing load and end to end
delay.
As per fig.-2, the proposed optimized routing protocol (i.e., CRAODV-Opt) has less routing load as compare to
conventional protocol CRAODV. This indicates average network overhead is less as compared to basic cognitive radio
routing protocol CRAODV. The packet collision may be less in the proposed model for CRAHN environment due to
less routing overhead. This is significantly better indication of proposed routing protocol in CRAHN.
As per fig.-3, the proposed routing protocol CRAODV-Opt uses less transmission time to transmit the data in the
network as compared to CRAODV. Similarly,optimized routing model CRAODV-Opt in CRAHN shows better results
in term of PDR as compared to conventional one (i.e., CRAODV) which is shown in fig.-4. The throughput has been
considered for better channel utilization for evaluation of proposed routing protocols, which has been analyzed through
the fig.-5. It has beenobserved the performance in terms of throughput of CRAODV-Opt is better as compared to
CRAODV.
Page 120

ISSN 2319 - 4847
FIG.-2: NRL VS NUMBER OF SUS
FIG.-3: DELAY VS NUMBER OF SUS
FIG.-4: PDR VS NUMBER OF SUS
FIG.-5: THROUGHPUT VS NUMBER OF SUS
7. CONCLUSION
In this paper a proposed optimized routing protocol CRAODV-Opt has been developed in the CRAHN environment.
The proposed CRAODV-Opt select the optimized and reliable channel selection by using BAT algorithm for better and
optimized route construction. Due to this novel technique the route formation in proposed model CRAODV-Opt is
better than the existing routing protocol. It makes the optimized channel selection process in the network system with
more numbers of packet are transmitted as compared to conventional one (ex. CRAODV). It improves the PDR and
system throughput with minimum delay and network routing load as compared to a conventional routing protocol
CRAODV in CRAHN environment.
REFERENCES
[1]. Beibei Wang, Yongle Wu, K.J. Ray Liu, Game theory for cognitive radio networks: An overview, in Elsiver
Computer Networks, volume 64, issue 14,pp 2537-2561, April 2010.
[2]. JayaprakashRajasekharan, Jan Eriksson, Member, Visa Koivunen, Cooperative Game-Theoretic Approach to
Spectrum Sharing in Cognitive Radios in Elsiver Signal processing. Volume 106, pp 15-29, January 2015.
[3]. V. Selvi, D.R. Umarani, Comparative Analysis of Ant Colony and Particle Swarm Optimization Techniques,
International Journal of Computer Applications, volume 5, no. 4, page 16, August 2010.
[4]. JieJia, Xingwei Wang, Jian Chen, A genetic approach on cross-layer optimization for cognitive radio Wireless
mesh network under SINR model,in Elsevier Ad Hoc Network, volume 27, page 57-67, April 2015.
[5]. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1st ed., Addison-Wesley
Longman Publishing Co., Inc. Boston, MA, USA, 1989.
[6]. ErolGelenbe, Genetic Algorithms for Routing Discovery, in IEEE Transactions on Systems, Man, and
Cybernetics-Part B: Cybernetics. Vol. 36, no. 6, December 2006.
Page 121

ISSN 2319 - 4847
[7]. Li, B., Li, D., Wu, Q. H., Li, H.,ASAR: Ant-based spectrum aware routing for cognitiveradio networks., In
Proceedings of international conference on wireless communications &signalprocessing (WCSP), page 15, 2009.
Nanjing, China.
[8]. M. Dorigo, T. Sttzle, Ant Colony Optimization, MIT press, Cambridge, Massachusetts, 2004.
[9]. F. Dressler, O.B. Akan, A survey on bio-inspired networking, in Elsevier Computer Networks,volume 54, issue
6, page 881900, April 2010.
[10]. Javier Del Ser, MarjaMatinmikko, Sergio Gil-Lpez, MiiaMustonen, Centralized and distributed spectrum
channel assignment in cognitive wireless networks: A Harmony Search approach, in Elsevier Applied Soft
Computing, volume 12, issue 2, page 921930, February 2012.
[11]. AnabelMartnez-Vargas, ngel G. Andrade,Comparing particle swarm optimization variants for a cognitive
radio network,in Elsevier Applied Soft Computing,volume 13, issue 2, page 12221234, February 2013.
[12]. D. Karaboga, B. Akay, A comparative study of Artificial Bee Colony algorithm, in Elsevier Applied
Mathematics and Computation, volume 214, issue 1, page 108132, August 2009.
[13]. C.A.C. Coello, G.T. Pulido, M.S. Lechuga, Handling multiple objectives with particle swarm optimization,
IEEE Transactions on Evolutionary computation, volume 8, no. 3, page 256279, June 2004.
[14]. K. Zielinski, P. Weitkemper, R. Laur, K.-D.Kammeyer, Optimization of Power Allocation for Interference
Cancellation With Particle Swarm Optimization,IEEE Transactions on Evolutionary Computation, volume 13,
no. 1, page 128150, February 2009.
[15]. Li Yu, Cong Liu, Wenyu Hu, Spectrum allocation algorithm in cognitive ad-hoc networks with high energy
efficiency, 2010 International Conference on Green Circuits and Systems (ICGCS), IEEE, page 349354, June
2010, Shanghai.
[16]. M. Waheed, AnniCai, Evolutionary algorithms for radio resource management in cognitive radio network, in:
Performance Computing and Communications Conference (IPCCC), 2009 IEEE 28th International, IEEE, page
431436, December 2009, Scottsdale, AZ.
[17]. D. Karaboga, B. Akay, A modified Artificial Bee Colony (ABC) algorithm for constrained optimization
problems, in Elsevier Applied Soft Computing, volume 11, issue 3, page 30213031, April 2011.
[18]. X.-S. Yang, A New Metaheuristic Bat-Inspired Algorithm, in: Nature Inspired Cooperative Strategies for
Optimization, in Nature Inspired Cooperative Strategies for Optimization (NISCO 2010) (Eds. J. R. Gonzalez et
al.), Studies in Computational Intelligence, Springer Berlin, volume 284, Springer, page 65-74, 2010.
[19]. Xin-She Yang, .Nature-Inspired Metaheuristic algorithms,Publisher: Luniver Press; 0002-Revised edition (25
July 2010) July 2010. ISBN-10: 1905986289, ISBN-13: 978-1905986286
[20]. Xin-She Yang. Metaheuristic Optimization, Cambridge University, UK, 2011.
[21]. Ian F. Akyildiz, Won-Yeol Lee, Kaushik R. Chowdhury CRAHNs: Cognitive radio ad-hoc networks, in Elsiver
Ad Hoc Networks, Volume 7, Issue 5, Pages 810-836, 2009.
[22]. Abdul Saleem, Ahmad GhulamBaksh and Dr Faisal F Qureshi, CRANs (Cognitive Radio Ad Hoc Network) a
Survey, Proc. of International Conference on Communication Information Technology and Robotics N&N Global
Technology, 2015.
[23]. Sangita Pal, Srinivassethi, Selection of Reliable Channel by CRAODV-RC Routing Protocol in Cognitive Radio
Ad Hoc Network, Proceedings of the 49th Annual Convention of the Computer Society of India CSI Volume
2,Volume 338 of the series Advances in Intelligent Systems and Computing, pp 251-259, 2015.
[24]. Sangita Pal, Srinivassethi, Effective Routing Protocol in Cognitive Radio Ad Hoc Network using Fuzzy-based
Reliable Communication Neighbor Node Selection, Advances in Intelligent Systems and Computing 247,Springer
FICTA-2014, India.
[25]. C.E. Perkins, E.M., Belding-Royer, and S.R. Das, Ad Hoc On-Demand Distance Vector (AODV) Routing,
Internet Draft, draft-ietf-manet-aodv-13.txt, Febuary 2003.
[26]. Angela Sara Cacciapuoti, Cosimo Calcagno, Marcello Calef, Luigi Paura, CAODV: Routing in Mobile Ad-hoc
Cognitive Radio Networks, Wireless Days, pp: 1-5, 2010.
[27]. Angela Sara Cacciapuotia, Marcello Caleffia, Luigi Paura,, Reactive routing for mobile cognitive radio ad hoc
networks, in Elsevier Ad Hoc Networks, Volume 10, Issue 5, pp: 803815, 2012.
[28]. Shelly Salim and SangmanMoh, On-demand routing protocols for cognitive radio ad hoc networks, EURASIP
Journal on Wireless Communications and Networking (Springer open journal), 2015..
[29]. NS-2 Manual, (2009),http://www.isi.edu/nsnam/ns/nsdocumentation.htm
[30]. CRCNintegration,http://stuweb.ee.mtu.edu/~ljialian/r
AUTHOR
Sangita Pal received the B.Tech. andM.Tech. degrees in Computer Science Engineering in 1993 and 2010,
respectively.She has 17 years of teaching experience. She has numbers of journal and conference publications.
Page 122

ISSN 2319 - 4847
Srinivas Sethi received MCA and Ph.D. degree from Berhampur University and continue as Faculty in the Department
of CSEA since 1997. He has numbers of good journals and conference publications.
Page 123

BAT-based Optimized Routing Protocol in Cognitive Radio Ad Hoc Network

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

BAT-based Optimized Routing Protocol in Cognitive Radio Ad Hoc Network

Uploaded by

Copyright:

Available Formats

International Journal of Application or Innovation in Engineering & Management (IJAIEM)

Web Site: www.ijaiem.org Email: editor@ijaiem.org

ISSN 2319 - 4847