This document summarizes a research paper that proposes improvements to the DSR routing protocol in mobile ad hoc networks through the use of genetic and fuzzy algorithms. The proposed GA-DSR protocol adds link costs to route request packets and has the destination node use the received route requests as input to a genetic algorithm to find the two best routes. It then sends these routes back to the source in a route reply packet. The protocol also uses fuzzy logic to dynamically adjust the route update period based on route error counts. The researchers believe this approach can help improve quality of service in DSR routing by selecting optimal paths based on link costs and maintaining up-to-date routes.
Effect of node mobility onaomdv protocol in manetijwmn
In this paper, we have analyzed the effect of node mobility on theperformance of AOMDV multipath routing
protocol. This routing protocol in ad hoc network has been analyzed with random way point mobility model
only. This is not sufficient to evaluate the behavior of a routing protocol. Therefore, in this paper, we
have considered Random waypoint, Random Direction and Probabilistic Random Walk mobility Model for
performance analysis of AOMDV protocol. The result reveals that packet delivery ratio decreases with the
increasing node mobility forall mobility models. Also, average end-to-end delay is also vary with varying
node speed, initially upto 20 nodes in all mobility models delay is minimum.
Performance evaluation of proactive, reactive and hybrid routing protocols wi...eSAT Journals
Abstract Our work mainly focused on the performance and effects of different mobility models like Random Waypoint, Reference Point Group, and Manhattan mobility models in different aspects to improve and analyze the behavior of Optimized Link-State Routing (OLSR), Temporally-Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) routing protocols. These three routing protocols can be classified into the following three general categories, based on the timing when the routes are discovered and updated-proactive (OLSR), reactive (TORA) and hybrid (ZRP). In literature various researchers have discussed the performance issues in AODV, DSDV and DSR routing protocols in Random Waypoint mobility model on Mobile Ad hoc Networks (MANETs) is not satisfactory due to link failure and late acknowledgement. To resolve the specified issue, we have come up with other alternatives like Reference Point Group, and Manhattan mobility model and also other routing protocols like OSLR, TORA and ZRP. A simulation was carried out in NS2 and Bonnmotion for above said protocols and mobility models in Constant Bit Rate (CBR) traffic to analyzed using various metrics like packet delivery fraction, end to end delay and normalized routing load. In our simulation it was shown that few mobility model performed better in different routing protocols. In our simulation results, we got a high Normalized Routing Load for Random Waypoint compared to Reference Point Group, and Manhattan mobility model in both DRP and OSLR protocols. Index Terms: MANET, CBR, Routing protocols, Mobility models, NS2
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsCSCJournals
In ad hoc networks, the nodes are dynamically and arbitrary located in a manner that the interconnections between nodes are changing frequently. Thus, designing an effective routing protocol is a critical issue. In this paper, we propose a fuzzy based routing method that selects the most stable route (FSRS) considering the number of intermediate nodes, packet queue occupancy, and internodes distances. Also it takes the produced cost of the selected route as an input to another fuzzy controller predicts its lifetime (FRLP), the evaluation of the proposed method is performed using OMNet++4.0 simulator in terms of packet delivery ratio, average end-to-end delay and normalized routing load.
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerAM Publications
The delay sensitive packet scheduling and routing algorithm to effectively deliver delay sensitive data’s over a multihop
networks. First packet urgency, node urgency, route urgency are calculated on the basis of end-to-end delay requirements.
Based on these urgency metrics, the proposed packet scheduling algorithm determines the transmission order of each packet to
minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize
the derivatives of route urgency in order to maximize the number of packets delivered within the required end-to-end delay.
Finally experimental results are presented to evaluate the performance of the proposed joint working algorithms.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Effect of node mobility onaomdv protocol in manetijwmn
In this paper, we have analyzed the effect of node mobility on theperformance of AOMDV multipath routing
protocol. This routing protocol in ad hoc network has been analyzed with random way point mobility model
only. This is not sufficient to evaluate the behavior of a routing protocol. Therefore, in this paper, we
have considered Random waypoint, Random Direction and Probabilistic Random Walk mobility Model for
performance analysis of AOMDV protocol. The result reveals that packet delivery ratio decreases with the
increasing node mobility forall mobility models. Also, average end-to-end delay is also vary with varying
node speed, initially upto 20 nodes in all mobility models delay is minimum.
Performance evaluation of proactive, reactive and hybrid routing protocols wi...eSAT Journals
Abstract Our work mainly focused on the performance and effects of different mobility models like Random Waypoint, Reference Point Group, and Manhattan mobility models in different aspects to improve and analyze the behavior of Optimized Link-State Routing (OLSR), Temporally-Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) routing protocols. These three routing protocols can be classified into the following three general categories, based on the timing when the routes are discovered and updated-proactive (OLSR), reactive (TORA) and hybrid (ZRP). In literature various researchers have discussed the performance issues in AODV, DSDV and DSR routing protocols in Random Waypoint mobility model on Mobile Ad hoc Networks (MANETs) is not satisfactory due to link failure and late acknowledgement. To resolve the specified issue, we have come up with other alternatives like Reference Point Group, and Manhattan mobility model and also other routing protocols like OSLR, TORA and ZRP. A simulation was carried out in NS2 and Bonnmotion for above said protocols and mobility models in Constant Bit Rate (CBR) traffic to analyzed using various metrics like packet delivery fraction, end to end delay and normalized routing load. In our simulation it was shown that few mobility model performed better in different routing protocols. In our simulation results, we got a high Normalized Routing Load for Random Waypoint compared to Reference Point Group, and Manhattan mobility model in both DRP and OSLR protocols. Index Terms: MANET, CBR, Routing protocols, Mobility models, NS2
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsCSCJournals
In ad hoc networks, the nodes are dynamically and arbitrary located in a manner that the interconnections between nodes are changing frequently. Thus, designing an effective routing protocol is a critical issue. In this paper, we propose a fuzzy based routing method that selects the most stable route (FSRS) considering the number of intermediate nodes, packet queue occupancy, and internodes distances. Also it takes the produced cost of the selected route as an input to another fuzzy controller predicts its lifetime (FRLP), the evaluation of the proposed method is performed using OMNet++4.0 simulator in terms of packet delivery ratio, average end-to-end delay and normalized routing load.
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerAM Publications
The delay sensitive packet scheduling and routing algorithm to effectively deliver delay sensitive data’s over a multihop
networks. First packet urgency, node urgency, route urgency are calculated on the basis of end-to-end delay requirements.
Based on these urgency metrics, the proposed packet scheduling algorithm determines the transmission order of each packet to
minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize
the derivatives of route urgency in order to maximize the number of packets delivered within the required end-to-end delay.
Finally experimental results are presented to evaluate the performance of the proposed joint working algorithms.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector (DSDV), Optimized list state routing protocols (OLSR), Ad hoc on demand routing protocol (AODV), dynamic source routing (DSR) are optimized versions of distance vector or link state routing protocols. Reinforcement Learning is new method evolved recently which is learning from interaction with an environment. Q Learning which is based on reinforcement learning that learns from the delayed reinforcements and becomes more popular in areas of networking. Q Learning is applied to the routing algorithms where the routing tables in the distance vector algorithms are replaced by the estimation tables called as Q values. These Q values are based on the link delay. In this paper, various optimization techniques over Q routing are described in detail with their algorithms.
Maximizing Throughput using Adaptive Routing Based on Reinforcement LearningEswar Publications
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive routing is studied. Routing is an emerging research area in wireless networks and needs more research due to emerging technologies such as wireless sensor network, ad hoc networks and network on chip. In addition, mobile ad hoc network suffers from various network issues such as dynamicity, mobility, data packets delay, high dropping ratio, large routing overhead, less throughput and so on. Conventional routing protocols based on distance vector
or link state routing is not much suitable for mobile ad hoc network. All existing conventional routing protocols are based on shortest path routing, where the route having minimum number of hops is selected. Shortest path routing is non-adaptive routing algorithm that does not take care of traffic present on some popular routes of the network. In high traffic networks, route selection decision must be taken in real time and packets must be diverted on some alternate routes. In Prioritized sweeping method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 nodes MANET with random mobility and 50 nodes fixed grid network. Throughput is used to judge the performance of network. Analysis is done by varying the interval between the successive packets.
Impact of mobility models on supp tran optimized dtn spray and wait routing p...ijmnct
The delay-tolerant networks (DTN) are networks that support communication between nodes when
connectivity is intermittent, due to the difficulties encountered in this type of environment, such as node
mobility frequently changing network topology, this which does not allow to route messages directly
between the source and destination, the routing algorithms must consider mobility to increase the rate of
message delivery. In our previous work of Supp-Tran we examine that spray and wait router was not
showing good delivery probability in case of SPMBM mobility model and FIFO forwarding strategy
compared to our Supp-Tran strategy.
This paper compares the behavior of the FIFO strategy used by default with spray and wait routing
protocol and that of our Supp-Tran strategy under different type of mobility, to do that the most mobility
models used are chosen to show how mobility model affects the forwarding strategy using as performance
metric such as delivery probability, the number of dropped messages , buffer time average, the overhead
ratio and average number of hops.
Performance Analysis for Parallel MRA in Heterogeneous Wireless NetworksEditor IJCATR
This paper analysis a different methods to find optimal path for services and power allocation to heterogeneous wireless network. Under heterogeneous wireless networks, a user can send data through a single or multi RATs (Radio Access Technology) simultaneously. The objective of this paper is to choose the optimal path for the services and power allocation to that bandwidth (BW) distributed joint allocation algorithm using Newton and modified Newton are adopted and the total system capacity compared. The analysis is done in Matlab and simulation results are compared. The numerical result shows that compare to Newton method, modified Newton method maximize the total system capacity.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1...Syeful Islam
Abstract—In this paper we consider a local area network (LAN) of dual mode service
where one is a token bus and the other is a carrier sense multiple access with a collision
detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet
dropping probability of a dual mode LAN for finitelength queue M/G/1(m) traffic. Here, the
offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond
delay. The concept of a tabular solution for two-dimensional Poisson’s traffic of circuit
switching is adapted here to find the cell dropping probability of the dual mode packet
service. Although the work is done for the traffic of similar bandwidth, it can be extended
for the case of a dissimilar bandwidth of a circuit switched network.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc NetworksA. Sufian
Nodes in ad hoc networks have limited battery power. Hence they require energy-efficient technique to improve average
network performance. Maintaining energy-efficiency in ad hoc networks is really challenging because highest energyefficiency
is achieved if all the nodes are always switched off and energy-efficiency will be minimum if all the nodes are
fully operational i.e. always turned-on. Energy preservation requires redirection of data packets through some other routes
having good performance. This improves data packet delivery ratio and number of alive nodes decreasing cost of messages.
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
DYNAMIC QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MAN...csandit
Mobile ad hoc networking does not possess any fixed infrastructure and hence, stable routing is the major problem. The mobility nature of MANET’s node facilitates rediscovery of a new path to organizing a routing. In order to intensify the Quality of Service and routing stability in MANET, we propose a Dynamic Quality of service Stability based Multicast Routing Protocol by modifying the Cuckoo Search Algorithm through a modernizing mechanism which is derived from the differential evolution algorithm. Tuned CSA is a combined feature of CSA and DE algorithms. Periodically, each node in the network creates neighbour stability and QoS database at every node by calculating the parameters like node and link stability factor,
bandwidth availability, and delays. Finally, multicast path constructs route request and route reply packets, stability information and performing route maintenance.
Web object size satisfying mean waitingIJCNCJournal
This paper addresses web object size which is one of important performance measures and affects to
service time in multiple access environment. Since packets arrive according to Poission distribution and
web service time has arbitrary distribution, M/G/1 model can be used to describe the behavior of the web
server system. In the time division multiplexing (TDM), we can use M/D/1 with vacations model, because
service time is constant and server may have a vacation. We derive the mean web object size satisfying the
constraint such that mean waiting time by round-robin scheduling in multiple access environment is equal
to the mean queueing delay of M/D/1 with vacations model in TDM and M/H2/1 model, respectively.
Performance evaluation shows that the mean web object size increases as the link utilization increases at
the given maximum segment size (MSS), but converges on the lower bound when the number of embedded
objects included in a web page is beyond the threshold. Our results can be applied to the economic design
and maintenance of web service.
Routing in All-Optical Networks Using Recursive State Space Techniquesipij
In this papr, we have minimized the effects of failures on network performace, by using suitable Routing
and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking
probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman
Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm must be
able to select most reliable routes and assign wavelengths to connections in a manner that utilizes the light
path(LP) established efficiently considering all possible requests.
A cross layer delay-aware multipath routing algorithm for mobile adhoc networkscsandit
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS)
mechanism to support diverse applications with varying and stringent requirements. Routing
protocols such as AODV, AOMDV, DSR and OLSR use minimum hop count as the metric for
path selection, hence are not suitable for delay sensitive real time applications. To support such
applications delay constrained routing protocols are employed. These Protocols makes path
selection based on the delay over the discovered links during routing discovery and routing
table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol
called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on
delay constraint. It employs cross-layer communications between MAC and routing layers to
achieve link and channel-awareness. It regularly updates the path status in terms of lowest
delay incurred at each intermediate node. Performance of the proposed protocol is compared
with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of
better packet delivery and reduced overhead between intermediate nodes.
Mobility models for delay tolerant network a surveyijwmn
Delay Tolerant Network (DTN) is an emerging networking technology that is widely used in the
environment where end-to-end paths do not exist. DTN follows store-carry-forward mechanism to route
data. This mechanism exploits the mobility of nodes and hence the performances of DTN routing and
application protocols are highly dependent on the underlying mobility of nodes and its characteristics.
Therefore, suitable mobility models are required to be incorporated in the simulation tools to evaluate DTN
protocols across many scenarios. In DTN mobility modelling literature, a number of mobility models have
been developed based on synthetic theory and real world mobility traces. Furthermore, many researchers
have developed specific application oriented mobility models. All these models do not provide accurate
evaluation in the all scenarios. Therefore, model selection is an important issue in DTN protocol
simulation. In this study, we have summarized various widely used mobility models and made a comparison
of their performances. Finally, we have concluded with future research directions in mobility modelling for
DTN simulation.
Performance analysis of voip traffic over integrating wireless lan and wan us...ijwmn
A simulation model is presented to analyze and evaluate the performance of VoIP based integrated
wireless LAN/WAN with taking into account various voice encoding schemes. The network model was
simulated using OPNET Modeler software. Different parameters that indicate the QoS like MOS, jitter,
end to end delay, traffic send and traffic received are calculated and analyzed in Wireless LAN/WAN
scenarios. Depending on this evaluation, Selection codecs G.729A consider the best choice for VoIP.
In ad hoc networks, routing plays a pertinent role. Deploying the appropriate routing protocol is very important in order to achieve best routing performance and reliability. Equally important is the mobility model that is used in the routing protocol. Various mobility models are available and each can have different impact on the performance of the routing protocol. In this paper, we focus on this issue by examining how the routing protocol, Optimized Link State Routing protocol, behaves as the mobility model is varied. For this, three random mobility models, viz., random waypoint, random walk and random direction are considered. The performance metrics used for assessment of Optimized Link State Routing protocol are Optimized Link State Routing protocol, end-to-end delay and packet delivery ratio.
A major role is played in the layout and evaluation of any empirical wireless structure to manifest is the goal of this paper that counterfeit mode architectures affect counterfeit conduct, regarding structure accomplishment metrics, essentially and therefore, the excellent architecture should be explored in order to accomplish the most accurate and reliable results. It is found that the most analytical factors it is found that that actuate counterfeit mode accomplishment are counterfeit time, structure event organizing and
grade of adequate. It is, also, found that counterfeit time in relation to event existence in the real structure
along with the usage of modern architectural concepts such as multi-interweave technology complement
analytical issues too in the advancement of an adequate counterfeit organization for wireless communications. In order to evaluate the above findings an extensive empirical review has been
demeanored analysising several distinct events counterfeitorganizations towards presenting the relation
between channel designing collections, counterfeit time and structure accomplishment.
Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector (DSDV), Optimized list state routing protocols (OLSR), Ad hoc on demand routing protocol (AODV), dynamic source routing (DSR) are optimized versions of distance vector or link state routing protocols. Reinforcement Learning is new method evolved recently which is learning from interaction with an environment. Q Learning which is based on reinforcement learning that learns from the delayed reinforcements and becomes more popular in areas of networking. Q Learning is applied to the routing algorithms where the routing tables in the distance vector algorithms are replaced by the estimation tables called as Q values. These Q values are based on the link delay. In this paper, various optimization techniques over Q routing are described in detail with their algorithms.
Maximizing Throughput using Adaptive Routing Based on Reinforcement LearningEswar Publications
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive routing is studied. Routing is an emerging research area in wireless networks and needs more research due to emerging technologies such as wireless sensor network, ad hoc networks and network on chip. In addition, mobile ad hoc network suffers from various network issues such as dynamicity, mobility, data packets delay, high dropping ratio, large routing overhead, less throughput and so on. Conventional routing protocols based on distance vector
or link state routing is not much suitable for mobile ad hoc network. All existing conventional routing protocols are based on shortest path routing, where the route having minimum number of hops is selected. Shortest path routing is non-adaptive routing algorithm that does not take care of traffic present on some popular routes of the network. In high traffic networks, route selection decision must be taken in real time and packets must be diverted on some alternate routes. In Prioritized sweeping method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 nodes MANET with random mobility and 50 nodes fixed grid network. Throughput is used to judge the performance of network. Analysis is done by varying the interval between the successive packets.
Impact of mobility models on supp tran optimized dtn spray and wait routing p...ijmnct
The delay-tolerant networks (DTN) are networks that support communication between nodes when
connectivity is intermittent, due to the difficulties encountered in this type of environment, such as node
mobility frequently changing network topology, this which does not allow to route messages directly
between the source and destination, the routing algorithms must consider mobility to increase the rate of
message delivery. In our previous work of Supp-Tran we examine that spray and wait router was not
showing good delivery probability in case of SPMBM mobility model and FIFO forwarding strategy
compared to our Supp-Tran strategy.
This paper compares the behavior of the FIFO strategy used by default with spray and wait routing
protocol and that of our Supp-Tran strategy under different type of mobility, to do that the most mobility
models used are chosen to show how mobility model affects the forwarding strategy using as performance
metric such as delivery probability, the number of dropped messages , buffer time average, the overhead
ratio and average number of hops.
Performance Analysis for Parallel MRA in Heterogeneous Wireless NetworksEditor IJCATR
This paper analysis a different methods to find optimal path for services and power allocation to heterogeneous wireless network. Under heterogeneous wireless networks, a user can send data through a single or multi RATs (Radio Access Technology) simultaneously. The objective of this paper is to choose the optimal path for the services and power allocation to that bandwidth (BW) distributed joint allocation algorithm using Newton and modified Newton are adopted and the total system capacity compared. The analysis is done in Matlab and simulation results are compared. The numerical result shows that compare to Newton method, modified Newton method maximize the total system capacity.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1...Syeful Islam
Abstract—In this paper we consider a local area network (LAN) of dual mode service
where one is a token bus and the other is a carrier sense multiple access with a collision
detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet
dropping probability of a dual mode LAN for finitelength queue M/G/1(m) traffic. Here, the
offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond
delay. The concept of a tabular solution for two-dimensional Poisson’s traffic of circuit
switching is adapted here to find the cell dropping probability of the dual mode packet
service. Although the work is done for the traffic of similar bandwidth, it can be extended
for the case of a dissimilar bandwidth of a circuit switched network.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc NetworksA. Sufian
Nodes in ad hoc networks have limited battery power. Hence they require energy-efficient technique to improve average
network performance. Maintaining energy-efficiency in ad hoc networks is really challenging because highest energyefficiency
is achieved if all the nodes are always switched off and energy-efficiency will be minimum if all the nodes are
fully operational i.e. always turned-on. Energy preservation requires redirection of data packets through some other routes
having good performance. This improves data packet delivery ratio and number of alive nodes decreasing cost of messages.
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
DYNAMIC QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MAN...csandit
Mobile ad hoc networking does not possess any fixed infrastructure and hence, stable routing is the major problem. The mobility nature of MANET’s node facilitates rediscovery of a new path to organizing a routing. In order to intensify the Quality of Service and routing stability in MANET, we propose a Dynamic Quality of service Stability based Multicast Routing Protocol by modifying the Cuckoo Search Algorithm through a modernizing mechanism which is derived from the differential evolution algorithm. Tuned CSA is a combined feature of CSA and DE algorithms. Periodically, each node in the network creates neighbour stability and QoS database at every node by calculating the parameters like node and link stability factor,
bandwidth availability, and delays. Finally, multicast path constructs route request and route reply packets, stability information and performing route maintenance.
Web object size satisfying mean waitingIJCNCJournal
This paper addresses web object size which is one of important performance measures and affects to
service time in multiple access environment. Since packets arrive according to Poission distribution and
web service time has arbitrary distribution, M/G/1 model can be used to describe the behavior of the web
server system. In the time division multiplexing (TDM), we can use M/D/1 with vacations model, because
service time is constant and server may have a vacation. We derive the mean web object size satisfying the
constraint such that mean waiting time by round-robin scheduling in multiple access environment is equal
to the mean queueing delay of M/D/1 with vacations model in TDM and M/H2/1 model, respectively.
Performance evaluation shows that the mean web object size increases as the link utilization increases at
the given maximum segment size (MSS), but converges on the lower bound when the number of embedded
objects included in a web page is beyond the threshold. Our results can be applied to the economic design
and maintenance of web service.
Routing in All-Optical Networks Using Recursive State Space Techniquesipij
In this papr, we have minimized the effects of failures on network performace, by using suitable Routing
and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking
probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman
Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm must be
able to select most reliable routes and assign wavelengths to connections in a manner that utilizes the light
path(LP) established efficiently considering all possible requests.
A cross layer delay-aware multipath routing algorithm for mobile adhoc networkscsandit
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS)
mechanism to support diverse applications with varying and stringent requirements. Routing
protocols such as AODV, AOMDV, DSR and OLSR use minimum hop count as the metric for
path selection, hence are not suitable for delay sensitive real time applications. To support such
applications delay constrained routing protocols are employed. These Protocols makes path
selection based on the delay over the discovered links during routing discovery and routing
table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol
called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on
delay constraint. It employs cross-layer communications between MAC and routing layers to
achieve link and channel-awareness. It regularly updates the path status in terms of lowest
delay incurred at each intermediate node. Performance of the proposed protocol is compared
with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of
better packet delivery and reduced overhead between intermediate nodes.
Mobility models for delay tolerant network a surveyijwmn
Delay Tolerant Network (DTN) is an emerging networking technology that is widely used in the
environment where end-to-end paths do not exist. DTN follows store-carry-forward mechanism to route
data. This mechanism exploits the mobility of nodes and hence the performances of DTN routing and
application protocols are highly dependent on the underlying mobility of nodes and its characteristics.
Therefore, suitable mobility models are required to be incorporated in the simulation tools to evaluate DTN
protocols across many scenarios. In DTN mobility modelling literature, a number of mobility models have
been developed based on synthetic theory and real world mobility traces. Furthermore, many researchers
have developed specific application oriented mobility models. All these models do not provide accurate
evaluation in the all scenarios. Therefore, model selection is an important issue in DTN protocol
simulation. In this study, we have summarized various widely used mobility models and made a comparison
of their performances. Finally, we have concluded with future research directions in mobility modelling for
DTN simulation.
Performance analysis of voip traffic over integrating wireless lan and wan us...ijwmn
A simulation model is presented to analyze and evaluate the performance of VoIP based integrated
wireless LAN/WAN with taking into account various voice encoding schemes. The network model was
simulated using OPNET Modeler software. Different parameters that indicate the QoS like MOS, jitter,
end to end delay, traffic send and traffic received are calculated and analyzed in Wireless LAN/WAN
scenarios. Depending on this evaluation, Selection codecs G.729A consider the best choice for VoIP.
In ad hoc networks, routing plays a pertinent role. Deploying the appropriate routing protocol is very important in order to achieve best routing performance and reliability. Equally important is the mobility model that is used in the routing protocol. Various mobility models are available and each can have different impact on the performance of the routing protocol. In this paper, we focus on this issue by examining how the routing protocol, Optimized Link State Routing protocol, behaves as the mobility model is varied. For this, three random mobility models, viz., random waypoint, random walk and random direction are considered. The performance metrics used for assessment of Optimized Link State Routing protocol are Optimized Link State Routing protocol, end-to-end delay and packet delivery ratio.
A major role is played in the layout and evaluation of any empirical wireless structure to manifest is the goal of this paper that counterfeit mode architectures affect counterfeit conduct, regarding structure accomplishment metrics, essentially and therefore, the excellent architecture should be explored in order to accomplish the most accurate and reliable results. It is found that the most analytical factors it is found that that actuate counterfeit mode accomplishment are counterfeit time, structure event organizing and
grade of adequate. It is, also, found that counterfeit time in relation to event existence in the real structure
along with the usage of modern architectural concepts such as multi-interweave technology complement
analytical issues too in the advancement of an adequate counterfeit organization for wireless communications. In order to evaluate the above findings an extensive empirical review has been
demeanored analysising several distinct events counterfeitorganizations towards presenting the relation
between channel designing collections, counterfeit time and structure accomplishment.
Cellular wireless systems like GSM suffer from congestion resulting in overall system degradation and poor service delivery. When the traffic demand in a geographical area is high, the input traffic rate will exceed thecapacity of the output lines. This work focused on homogenous wireless network (the network traffic and resource dimensioning that are statistically identical) such that the network performance
evaluation can be reduced to a system with single cell and a single traffic type. Such system can employa queuing model to evaluate the performance metric of a cell in terms of blocking probability.
Five congestion control models were compared in the work to ascertain their peculiarities, they are Erlang B, Erlang C, Engset (cleared), Engset (buffered), and Bernoulli. To analyze the system, an aggregate onedimensional Markov chain wasderived, such that it describes a call arrival process under the assumption
that it is Poisson distributed. The models were simulated and their results show varying performances, however the Bernoulli model (Pb5) tends to show a situation that allows more users access to the system and the congestion level remain unaffected despite increase in the number of users and the offered traffic into the system.
Impact of client antenna’s rotation angle and height of 5g wi fi access point...ijwmn
This paper investigates the impact of antenna rotation’s angle at the receiver side and antenna height at
transmitter side on radio channel’s amount of fading. Amount of fading is considered as a measure of
severity of fading conditions in radio channels. It indicates how severe the fading level relative to Rayleigh
fading channel. The results give an input to optimize height of 5G Wi-Fi access point for better link
performance for different antenna’s rotation angles at receiver side. The investigation covers three
different indoor environments with different multipath dispersion levels in delay and direction domains;
lecture hall, corridor, and banquet hall.
Analysis of security threats in wireless sensor networkijwmn
Wireless Sensor Network(WSN) is an emerging technology and explored field of researchers worldwide
in the past few years, so does the need for effective security mechanisms. The sensing technology
combined with processing power and wireless communication makes it lucrative for being exploited in
abundance in future. The inclusion of wireless communication technology also incurs various types of
security threats due to unattended installation of sensor nodes as sensor networks may interact with
sensitive data and /or operate in hostile unattended environments. These security concerns be addressed
from the beginning of the system design. The intent of this paper is to investigate the security related
issues in wireless sensor networks. In this paper we have explored general security threats in wireless
sensor network with extensive study.
Due to the rapidly increasing data speed requirement, it has become essential to smartly utilize the available frequency spectrum. In wireless communications systems, channel quality parameters are often used to enable resource allocation techniques that improve system capacity and user quality. The uncoded bit or symbol error rate (SER) is specified as an important parameter in the second and third generation partnership project (3GPP). Nonetheless, techniques to estimate the uncoded SER are usually not much published. This paper introduces a novel uncoded bit error rate (BER) estimation method using the
accurate-bits sequence of the new channel codes over the AWGN channel. Here, we have used the new channel codes as a forward error correction coding scheme for our communication system. This paper also presents the simulation results to demonstrate and compare the estimation accuracy of the proposed method over the AWGN channel.
New strategy to optimize the performance of spray and wait routing protocolijwmn
Delay Tolerant Networks have been (DTN) have been developed to support the irregular connectivity often
separate networks. The main routing problem in this type of network is embarrassed by time that is
extremely long, since connections are intermittent and opportunistic. Routing protocols must take into
account the maximum constraint encountered in this type of environment , use effective strategies
regarding the choice of relay nodes and buffer management nodes to improve the delivery of messages and
the time of their delivery . This article proposes a new strategy that optimizes the routing Spray and wait.
The proposed method uses the information contained in the messages delivered mostly paths traversed by
the messages before arriving at their destination and the time when nodes have receive these messages.
Simulation results show that the proposed strategy can increase the probability of delivery and minimizing
overhead unlike FIFO technology used with the default routing ' sprat and wait'
Path constrained data gathering scheme for wireless sensor networks with mobi...ijwmn
Wireless Sensor Networks (WSNs) have emerged as a promising solution for variety of applications.
Recently, in order to increase the lifetime of the network, many proposals have introduced the use of
Mobile Elements (MEs) as a mechanical carrier to collect data. In this paper, we investigate the problem of
designing the mobile element tour to visit subset of the nodes, termed as caching points, where the length of
the mobile element tour is bounded by pre-determined length. Caching can be implemented at various
points on the network such that any node in the network is at most k-hops away from one of these caching
points. To address this problem, we present heuristic-based solution. Our solution works by partitioning
the network such that the depth of each partition is bounded by k. Then, in each partition, the minimum
number of required caching points is identified. We compare the resulting performance of our algorithm
with the best known comparable schemes in the literature.
A novel resource efficient dmms approach for network monitoring and controlli...ijwmn
In this paper, we propose a novel Distributed MANET Management System (DMMS) approach to use cross layer models to demonstrate a simplified way of efficiently managing the overall performance of individual network resources (nodes) and the network itself which is critical for not only monitoring the traffic, but also dynamically controlling the end-to-end Quality of Service (QoS) for different applications. In the proposed DMMS architecture, each network resource maintains a set of Management Information Base (MIB) elements and stores resource activities in their abstraction in terms of counters, timer, flag and threshold values. The abstract data is exchanged between different management agents residing in different resources on a need-to-know basis and each agent logically executes management functions locally to develop understanding of the behavior of all network resources to ensure that user protocols can function smoothly. However, in traditional network management systems, they collect statistical data such as resource usage and performance by spoofing of resources. The amount of data that is exchanged with other resources through management protocols that can be extremely high and the bandwidth for overhead management functions increases significantly. Also, the data storage requirements in each network resource for management functions increases and become inefficient as it increases the power usage for processing. Our proposed scheme targets at solving the problems.
A review of security attacks and intrusion detection schemes in wireless sens...ijwmn
Wireless sensor networks are currently the greatest innovation in the field of telecommunications. WSNs
have a wide range of potential applications, including security and surveillance, control, actuation and
maintenance of complex systems and fine-grain monitoring of indoor and outdoor environments. However
security is one of the major aspects of Wireless sensor networks due to the resource limitations of sensor
nodes. Those networks are facing several threats that affect their functioning and their life. In this paper we
present security attacks in wireless sensor networks, and we focus on comparison and analysis of recent
Intrusion Detection schemes in WSNs.
Stochastic analysis of random ad hoc networks with maximum entropy deploymentsijwmn
In this paper, we present the first stochastic analysis of the link performance of an ad hoc network modelled
by a single homogeneous Poisson point process (HPPP). According to the maximum entropy principle, the
single HPPP model is mathematically the best model for random deployments with a given node density.
However, previous works in the literature only consider a modified model which shows a discrepancy in the
interference distribution with the more suitable single HPPP model. The main contributions of this paper
are as follows. 1) It presents a new mathematical framework leading to closed form expressions of the
probability of success of both one-way transmissions and handshakes for a deployment modelled by a
single HPPP. Our approach, based on stochastic geometry, can be extended to complex protocols. 2) From
the obtained results, all confirmed by comparison to simulated data, optimal PHY and MAC layer
parameters are determined and the relations between them is described in details. 3) The influence of the
routing protocol on handshake performance is taken into account in a realistic manner, leading to the
confirmation of the intuitive result that the effect of imperfect feedback on the probability of success of a
handshake is only negligible for transmissions to the first neighbour node.
Data mining is important process to extract the useful information and pattern from huge amount of data.
NS-2 is an efficient tool to build the environment of network. The results from simulate these environment
in NS-2 is trace file that contains several columns and lines represent the network events. This trace file
can be used to analyse the network according to performance metrics but it has redundant columns and
rows. So, this paper is to perform the data mining in order to find only the necessary information in
analysis operation to reduce the execution time and the storage size of the trace file.
ENHANCED THREE TIER SECURITY ARCHITECTURE FOR WSN AGAINST MOBILE SINK REPLI...ijwmn
Recent developments on Wireless Sensor Networks have made their application in a wide range
such as military sensing and tracking, health monitoring, traffic monitoring, video surveillance and so on.
Wireless sensor nodes are restricted to computational resources, and are always deployed in a harsh,
unattended or unfriendly environment. Therefore, network security becomes a tough task and it involves
the authorization of admittance to data in a network. The problem of authentication and pair wise key
establishment in sensor networks with mobile sink is still not solved in the mobile sink replication attacks.
In q-composite key pre distribution scheme, a large number of keys are compromised by capturing a
small fraction of sensor nodes by the attacker. The attacker can easily take a control of the entire network
by deploying a replicated mobile sinks. Those mobile sinks which are preloaded with compromised keys
are used authenticate and initiate data communication with sensor node. To determine the above problem
the system adduces the three-tier security framework for authentication and pair wise key establishment
between mobile sinks and sensor nodes. The previous system used the polynomial key pre distribution
scheme for the sensor networks which handles sink mobility and continuous data delivery to the
neighbouring nodes and sinks, but this scheme makes high computational cost and reduces the life time of
sensors. In order to overcome this problem a random pair wise key pre distribution scheme is suggested
and further it helps to improve the network resilience. In addition to this an Identity Based Encryption is
used to encrypt the data and Mutual authentication scheme is proposed for the identification and
isolation of replicated mobile sink from the network.
Intelligent transportation system (ITS) is an application which provides intelligence to the transportation
and traffic management systems. Although the word ITS applies to all systems in the transportation but as
per the European union directive it is the application of Information and communication technology in the
field of transportation is defined as ITS. The communication technology has evolved greatly today from
2G/3G to long term evolution (LTE). In this paper we focus on the LTE and its application in the ITS. Since
LTE offers excellent QoS, wide area coverage and high availability it is a preferred choice for vehicle to
infrastructure (V2I) service. At the same time the LTE customer base is increasing day by day which results
in congestion and accessing the network to send or request resources becomes difficult. In this paper we
have proposed a group based node selection algorithm to reduce the preamble ID collision otherwise this
uncoordinated preamble ID transmission by vehicle node (VN) will eventually clog the network and there
will be a massive congestion and re-transmissions attempts by VNs to obtain the random access channel
(RACH).
Virtual 2 d positioning system by using wireless sensors in indoor environmentijwmn
A 2D location detection system is constructed by using Wireless Sensor Nodes (WSN) to create aVirtual
Fingerprint map, specifically designed for use in an indoor environment. WSN technologies and
programmable ZigBee wireless network protocols are employed. This system is based on radio-location
fingerprinting technique. Both Linear taper functions and exponential taper functions are utilized with the
received signal strength distributions between the fingerprint nodes to generate virtual fingerprint maps.
Thus, areal and virtual combined fingerprint map is generated across the test area. K-nearest
neighborhood algorithm has been implemented on virtual fingerprint maps, in conjunction with weight
functions used to find the coordinates of the unknown objects. The system Localization accuracies of less
than a grid space areproved in calculations.
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...cscpconf
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active research area, basically for supporting real time applications that are based upon interaction between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve more deterministic behavior of the network i.e. a stable path, so that information carried by the network can be delivered in an uninterrupted fashion and for better resource utilization. In this paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing algorithm for MANETs with better route failure management and which will be highly adaptive and energy efficient.
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...csandit
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which
are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active
research area, basically for supporting real time applications that are based upon interaction
between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve
more deterministic behavior of the network i.e. a stable path, so that information carried by the
network can be delivered in an uninterrupted fashion and for better resource utilization. In this
paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing
algorithm for MANETs with better route failure management and which will be highly adaptive
and energy efficient.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (2
2n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIAIJITE
Communication in and out the classroom is an essential component for education. As the technology
emerges, there is a need to adopt to the new technologies to enhance students’ learning experience. Social
media technologies provide informal communication methods that promote student engagement and
satisfaction by removing communication barriers. In this paper, we report our experience in using different
social media technologies to enhance students’ learning experience and satisfaction with the course. We
perform our experiment in software project management course and conduct a survey to assess the
students’ perspective towards using these different social media technologies in enhancing their learning
and satisfaction. Results show that students are satisfied and feel that their learning experience has
improved when using social media for class communication.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
Similar to An approach to dsr routing qos by fuzzy genetic algorithms (20)
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
An approach to dsr routing qos by fuzzy genetic algorithms
1. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
DOI : 10.5121/ijwmn.2014.6208 89
AN APPROACH TO DSR ROUTING QOS BY
FUZZY-GENETIC ALGORITHMS
Sara Aliabadi¹ and Mehdi Agha Saram²
¹ Department of Computer Science, Islamic Azad University Science and Research
Branch Yazd, Yazd, Iran
² Department of Computer Science, Islamic Azad University Science and Research
Branch Yazd, Yazd, Iran
ABSTRACT
Although, all prior works improved routing on MANETs, there is no strong advancement on QoS. One of
the newest challenges to improve quality of routing in MANETs is combining the Genetic and Fuzzy
algorithms into routing protocols. The improvements on routing QoS are approached by using Genetic and
Fuzzy algorithms in this project. In cause of storing route information during route discovery, the DSR
routing protocol is chosen by this project. First of all, the suggested protocol in this project added Current
Time into DSR header. So, next intermediate node can obtain its previous link’s cost by this attachment and
adds the Link Cost to route discovery packet. Then, when the route discovery packet received to destination
node, it will expect for other packets till end of packet TTL. Next, the destination node will use collected
packets in Genetic Algorithm to find the two optimum routes. Finally, the destination node sends these
routes to source node. Next improvement is using Fuzzy Triangle Numbers to change route update. In this
case, the suggested protocol uses route error packets’ count and also Triangle Numbers to change route
update period time.
KEYWORDS
MANET, DSR, Genetic, Fuzzy, QoS
1. INTRODUCTION
Routing inMANET as a mobile self-configuring infrastructure-less wireless network is more
complicated than other usual networks. A node in MANET can be both terminal node and router.
Indeed, a node as a terminal node sends and receives packets while that node as a router will find
and save a path, andalso conducts packets to a destination. In the other hand, topology in this kind
of network is not stable because of nodes’ mobility. Thus, router based routing mechanisms
which try to save network topology do not work properly in MANET.
Dynamic Source Routing (DSR) as a standard routing protocol in MANET has a simple and
efficient routing algorithm. DSR finds a path by sending a Route Request packet and save the hop
IPs during route request flooding. There is no doubt that DSR does not consider on QoS and the
first found path will be used as packets route.
Quality of Service in routing needs to ensure that chosen path has less traffic, less packet loss,
optimum length, and the most possible bandwidth together. Approaching to routing QoS is
impossible without consideration of nature and dynamic topology in MANET. This project has
tried to use Genetic and Fuzzy algorithms in DSR to approach to QoS in MANET routing. The
first part of this article will explain the used genetic algorithm. Section two will introduce our
2. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
90
changes on DSR and how our protocol works. Section three is the explanation of route updating
by Fuzzy. And finally, we simulate our routing protocol by NS2 and compare it with standard
DSR.
2. GENETIC ALGORTHM
Researchers have used Gas in the SP routing solution, ATM bandwidth allocation solution,
multicast routing solution, Capacity and Flow Assignment (CFA) solution, and the dynamic
routing solution. It is clear that all these solutions can be formulated as some sort of syntactic
optimization solution.
The graph G=(N,A) can specifies the underlying topology of any multi-hop network, where N is a
set of nodes and A is a set of their links. Also, we can have a cost for each link (i, j) and call it as
Cij. In this case, we have a source node which we named it as node “S” and a destination node
with name “D”. The name Iij is denoted for each link (i, j) and can be defined as follows:
ܫ, ൌ ൞
1 ݂ܫ ݄݁ݐ ݈݅݊݇ ݂݉ݎ ݊݁݀ ݅ ݐ ݊݁݀ ݆
݁ݏݐݏ݅ݔ ݅݊ ݄݁ݐ ݃݊݅ݐݑݎ ݄ݐܽ
0 ݁ݏ݅ݓݎ݄݁ݐ
It is clear that diametrical elements of Iij must be ‘0’. By using the above definition, we can
formulate the SP routing solutions to syntactic optimization solution to minimize the objective
function as follows:
Minimize: ∑ ∑ ܥܫ
ୀௌ
ஷ
ୀௌ
Subject to: ∑ ܫ െ ∑ ܫ
ୀௌ
ஷ
ൌ ൝
1 ݂݅ ݅ ൌ ܵ
െ1 ݂݅ ݅ ൌ ܦ
0 ݁ݏ݅ݓݎ݄݁ݐ
ୀௌ
ஷ
And ∑ ൜
1 ݂݅ ݅ ് ܦ
ൌ 0 ݂݅ ݅ ൌ ܦ
ୀௌ
ஷ
2.1 COST
Cost for each link is formulated by RTS/CTS (Request To Send/ Clear To Send). In this way, we
estimates the cost for each link (i, j) by using packet delay during a fixed packet sending.
ܥ ൌ ܧሺሺೞ,ೝሻ
ೝೞ
ሻ ൌ ሺminሺܶ௦ െ ݆, ܶ െ ݇ሻ כ ܲሺ,,ሻ
୫୧୬ ሺ்ೝ,ିଵሻ
ୀ
୫୧୬ ሺ்ೞ,ିଵሻ
ୀ
୫୧୬ሺ்,ሺ்ೞା்ೝశభሻሻ
ୀ
In the above formula, the number of sent packet is mentioned by Tm. Ts and Tr are the activate
time of node S or sender and node R or receiver. Also, we can calculate P by below formula:
3. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
2.2 FITNESS
The fitness function shows the evaluation of each chromosome based on its links’ cost. Indeed,
the fitness function must accurately measure the quality of chromosomes in the
fitness function can be formulated as follow:
2.3 CROSSOVER
Crossover checks the current solutions in order to find better ones. Physically, the role of
exchanging one part of two chosen chromosomes to
such a manner that the GA produces new chromosomes from previous generation by exchanging
part of them, one part of route connects the source node to an intermediate node, and the other
part connects the intermediate node to the destination node. Following algorithm shows the
crossover process in this genetic algorithm:
/* , : Input Chromosomes ,
/* : Length of Chromosome
For (all i, j) { /* Find the potential crossing sites */
If ( [i] == [j] ) { /* if a node is commonly included in both chromosomes */
sites*/
}
= choose_rand( ); /* randomly choose a cro
= [1: ] // [ +1 :
= [1: ] // [ +1 :
Figure1. Overall procedure of the crossover. (a)
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
The fitness function shows the evaluation of each chromosome based on its links’ cost. Indeed,
the fitness function must accurately measure the quality of chromosomes in the population. The
fitness function can be formulated as follow:
Crossover checks the current solutions in order to find better ones. Physically, the role of
exchanging one part of two chosen chromosomes to make better routes plays by crossover. In
such a manner that the GA produces new chromosomes from previous generation by exchanging
part of them, one part of route connects the source node to an intermediate node, and the other
te node to the destination node. Following algorithm shows the
crossover process in this genetic algorithm:
, : Output Chromosomes */
, : Length of Chromosome */
i, j) { /* Find the potential crossing sites */
[j] ) { /* if a node is commonly included in both chromosomes */
[k]= (i, j); } /*Construct a set of potential crossing
); /* randomly choose a crossing site */
+1 : ] ; /* 1st
exchange */
+1 : ] ; /* 2nd
exchange */
Overall procedure of the crossover. (a) Pseudo code of the crossover. (b) Example of the crossover
procedure.
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
91
The fitness function shows the evaluation of each chromosome based on its links’ cost. Indeed,
population. The
Crossover checks the current solutions in order to find better ones. Physically, the role of
make better routes plays by crossover. In
such a manner that the GA produces new chromosomes from previous generation by exchanging
part of them, one part of route connects the source node to an intermediate node, and the other
te node to the destination node. Following algorithm shows the
[j] ) { /* if a node is commonly included in both chromosomes */
[k]= (i, j); } /*Construct a set of potential crossing
of the crossover. (b) Example of the crossover
4. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
2.4 MUTATION
Mutation is a process to change genes of the candidate chromosomes to improve the fitness in
new generation and keeping away from local optima.
partial-route from mutation node to the destination node in the GA.
/* C: Input Chromosome, : Output Chromosome, T: Topological Information Database */
= Choose_rand (C); /* Randomly choose a node as a mutation point */
Delete (T, C, ); /* Delete the nodes of upper partial
= C [1: ]; /* Put the upper partial
While (1) {
[ + 1] = Choose_rand_delete (T,
delete the node from T */
If ( [ + 1] == destination) {
Break; }
++; /* increment the
Figure 2. Overall procedure of the mutation. (a) Pseudo code of the mutation. (b) Example of the mutation
3. GA-DSR ROUTING
GA-DSR is a DSR optimized routing protocol for Mobile Ad hoc Networks which uses Genetic
and Fuzzy algorithms to improve Quality of Service. This optimized protocol sends and Route
Request packet to find destination, same as standard DSR, when the source n
route to the destination node. The difference is that this optimized protocol saves each link’s cost
beside the IP addresses.
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
Mutation is a process to change genes of the candidate chromosomes to improve the fitness in
new generation and keeping away from local optima. Physically, it generates an
route from mutation node to the destination node in the GA.
: Output Chromosome, T: Topological Information Database */
= Choose_rand (C); /* Randomly choose a node as a mutation point */
); /* Delete the nodes of upper partial-route from T */
]; /* Put the upper partial-route to the mutation chromosome */
+ 1] = Choose_rand_delete (T, [ ]); /* Randomly choose a node from T and
om T */
+ 1] == destination) {
Break; }
*/ }
Overall procedure of the mutation. (a) Pseudo code of the mutation. (b) Example of the mutation
procedure.
DSR is a DSR optimized routing protocol for Mobile Ad hoc Networks which uses Genetic
and Fuzzy algorithms to improve Quality of Service. This optimized protocol sends and Route
Request packet to find destination, same as standard DSR, when the source node does not know
route to the destination node. The difference is that this optimized protocol saves each link’s cost
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
92
Mutation is a process to change genes of the candidate chromosomes to improve the fitness in
Physically, it generates an alternative
: Output Chromosome, T: Topological Information Database */
]); /* Randomly choose a node from T and
Overall procedure of the mutation. (a) Pseudo code of the mutation. (b) Example of the mutation
DSR is a DSR optimized routing protocol for Mobile Ad hoc Networks which uses Genetic
and Fuzzy algorithms to improve Quality of Service. This optimized protocol sends and Route
ode does not know
route to the destination node. The difference is that this optimized protocol saves each link’s cost
5. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
When the destination node receives a RREQ packet, it saves received RREQ in its cach
end of Route Request TTL. During this time, the destination node will save all other RREQs from
same source node with same Route Request ID.
Table 1. Route Request Packet Details
Option Type
Current Time
When the Route Request TTL has been finished, t
Genetic Algorithm and finds the two best routes from source node to destination node.
the destination node creates a Route Reply packet, adds these two routes in it and sends the RREP
packet for the source node.
Table 2. Route Reply Packet Details
Option Type
First Route Count
The following flowchart shows the route discovery in GA
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
Figure 3. GA DSR Schema
When the destination node receives a RREQ packet, it saves received RREQ in its cach
end of Route Request TTL. During this time, the destination node will save all other RREQs from
same source node with same Route Request ID.
Table 1. Route Request Packet Details
IdentificationOpt Data Len
Target Address
TTL
Address [1]
Cost [1]
Address [2]
Cost [2]
…
Address [n]
Request TTL has been finished, the destination node adds all received RREQs in
Genetic Algorithm and finds the two best routes from source node to destination node.
the destination node creates a Route Reply packet, adds these two routes in it and sends the RREP
Table 2. Route Reply Packet Details
[L]Opt Data LenOption Type
Second Route CountCount
Address [1]
Address [2]
….
Address [n]
The following flowchart shows the route discovery in GA-DSR:
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
93
When the destination node receives a RREQ packet, it saves received RREQ in its cache until the
end of Route Request TTL. During this time, the destination node will save all other RREQs from
he destination node adds all received RREQs in
Genetic Algorithm and finds the two best routes from source node to destination node. Finally,
the destination node creates a Route Reply packet, adds these two routes in it and sends the RREP
Reserved
Second Route Count
6. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
Source node
If ( Route to destination Exist)
Send (data packet);
Else {
Make (Route Request);
Flood (Route Request);
}
Receive (Next_Node)
{
If (it’s destination)
{
Count (Cost);
If (TTL is not finished)
Else {
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
Figure 4. GA DSR Flowchart
Count (Cost);
If (TTL is not finished)
Wait();
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
94
7. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
95
Genetic_Algorithm(Route Request[]);
Make(Route Reply);
putInRouteReply(Two Best Routes);
Send(Route Reply);
}
}
Else {
If (Packet is repeated)
Drop(Packet);
Else {
Count (Cost);
AddToRouteRequest (Address);
Change(Current Time);
Flood(Route Request);
} }
4. ROUTE UPDATING
Route updating can help the protocol to reduce packet loss and improve QoS. Indeed, MANETs
have a mobile nature; so topology changes in them frequently. This mobile nature effects on the
routes and make them unusable after a while. So, all MANET routing protocols need a route
updating algorithm.
In this protocol, we use Triangular Fuzzy Numbers to make the route updating time dependent. In
this case, we forecast a time for route updating and make this time error dependent based on
Triangular Numbers. If the route error came from a direct node in a route, other nodes will update
that route immediately. Otherwise, nodes which received route error will increase their route error
counter and operate triangular equation. The result of Triangular equation should multiply to
forecast time and subtract from it.
݅ݎݐሺ௫;,,ሻ ൌ
ە
ۖ
۔
ۖ
ۓ
0 ݔ ܽ
ݔ െ ܽ
݉ െ ܽ
ݔ א ሺܽ, ݉ሿ, ܽ ് ݉
ܾ െ ݔ
ܾ െ ݉
ݔ א ሺ݉, ܾሿ, ݉ ് ܾ
1 ݔ ܾ
8. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
96
5. SIMULATION RESULTS
We simulated the GA-DSR protocol by NS2 for 5, 10, 15, 20, 25, 30, 35, and 40 nodes. Whereas
every simulation results may have some exceptions, we simulated the GA-DSR in some times and
made our decision based on their average.
5.1 ROUTE REQUESTDELAY
Whereas the GA-DSR destination nodes wait till end of Route Request TTL, there is no doubt
that the result of route request delay will be more than standard DSR. By the way, the simulation
shows that this difference decrease by nodes population increment.
Figure 5. Route Request Delay
5.2 END TO END DELAY
End to End Delay is the most important result to prove the success of each routing protocol. The
results of simulation show that the GA-DSR works more proper than standard DSR. We can see
that the End to End Delay in GA-DSR is less than Standard DSR. Also, GA-DSR has more
success during node population increment.
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
5 10 15 20 25 30 35 40
Time(Sec(
Number OF Nodes
ROUTE REQUEST DELAY (SEC/NUMBER OF
NODES)
DSR
GA DSR
9. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
5.3 PACKET DELIVERY RATE
Packet Delivery Rate is our final comparison between GA
doubt that the results of simulation show that the packet delivery rate increased in GA
compare on Standard ones.
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
5 10
Time(Sec)
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
Figure 6. End to End Delay
PACKET DELIVERY RATE
Packet Delivery Rate is our final comparison between GA-DSR and Standard DSR. There is no
doubt that the results of simulation show that the packet delivery rate increased in GA
Figure 7. Packet Delivery Rate
15 20 25 30 35
Number Of Nodes
End to End Delay
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
97
DSR and Standard DSR. There is no
doubt that the results of simulation show that the packet delivery rate increased in GA-DSR
DSR
GA DSR
10. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
98
6. CONCLUSION
This project tried to improve Standard DSR by using Genetic and Fuzzy algorithms. We proposed
a GA-DSR protocol which adds link cost to route request and uses genetic algorithm in
destination node to find the two best route for communication. The destination node will add
these two routes in route reply and sends it for the source node.
The route updating in proposed GA-DSR protocol works by Fuzzy Triangular Numbers. It uses a
route error counter and changes the route updating time based on the Triangular equation result.
Finally, we simulated our proposed routing protocol and made a comparison on standard DSR in
Route Request Delay, End to End Delay, and Packet Delivery Rate. The results showed us that
GA-DSR improved End to End Delay and Packet Delivery rate in comparison on Standard DSR.
REFRENCES
[1] Abdullah, J., (2010), Multiobjectives GA-Based QOS Routing Protocol for Mobile Ad Hoc
Network, International Journal of Grid and Distributed Computing, 3(4), 57-68.
[2] Aghdasi, H. S., Torabi, N., Rahmanzadeh, A., Aminiazar, M., and Abbaspour, M., (2012),
Usefulness of multicast routing protocols for vehicular Ad-hoc networks, Sixth International
Symposium Telecommunications (IST), 459-463.
[3] Ahn, Ch. W., and Ramakrishna, R. S., (2002), A Genetic Algorithm for Shortest Path Routing
Problem and the Sizing of Populations, IEEE TRANSACTIONS ON
EVOLUTIONARYCOMPUTATION, 6(6), 132-138.
[4] Ahn, Ch., W., and Ramakrishna, R., S., (2002), A Genetic Algorithm for Shortest Path Routing
Problem and the Sizing of Populations, IEEE TRANSACTIONS ON EVOLUTIONARY
COMPUTATION, 6(6), 566-579.
[5] Al-Ghazal, M., El-Sayed, A., and Kelash, H., (2007), Routing Optimlzation using Genetic
Algorlthm in Ad Hoc Networks, IEEE International Symposium on Signal Processing and
Information Technology, 497-503.
[6] Alzate, M., A., Salamanca, M., P., Pena, N., M., and Labrador, M., A., (2007), End-to-End Mean
Bandwidth Estimation as a Function of Packet Length in Mobile Ad Hoc Networks, IEEE, 415-
420.
[7] Anand, V., Sairam, N., and Thiagajan, M., (2012), A Review of Routing in Ad Hoc Networks,
Research Journal of Applied Sciences, Engineering and Technology, 4(8), 981-986.
[8] Artimy, M., M., Robertson, W., and Philips, W., j., (2006), Assignment of Dynamic Transmission
Range Based on Estimation of Vehicle Density, Engineering Mathematics and Internetworking,
40-48.
[9] Barati, J., (2011), Evaluation of intelligent algorithms in Routing Mobile Ad hoc Networks,
Mashhad Payam Nour University.
[10] Barolli, A., Takizawa, M., Xhafa, F., and Barolli, L., (2010), Application of Genetic Algorithms
for QoS Routing in Mobile Ad-Hoc Networks: A Survey, International Conference on Broadband,
Wireless Computing, Communication and Applications, 250-259.
[11] Barolli, L., Koyama, A., and Shiratori, N., (2003), A QoS Routing Method for Ad-Hoc Networks
Based on Genetic Algorithm, International Workshop on Database and Expert Systems
Applications, 14, 1-5.
[12] Chiang, Ch,. Gerla, M., and Zhang, L., (1998), Forwarding Group Multicast Protocol (FGMP) for
Multihop, Mobile Wireless Networks, CLUSTER COMPUTING, 1-16.
[13] Deb, K., Dhebar, Y., D., and Pavan, N., V., R., (1998), Non-Uniform Mapping in Binary-Coded
Genetic Algorithms, Kanpur Genetic Algorithms Laboratory (KanGAL).
[14] Denardin, G., W., Barriquello, C. H., Campos, A., and Prado, R. N., (2011), A Geographic
Routing Hybrid Approach for Void Resolution in Wireless Sensor Networks, Journal of Systems
and Software, 10(84), 1577-1590.
[15] Du, K., and Yang, Y., (2010), A QoS routing for Maximum Bandwidth in Ad Hoc Networks,
International Conference on Future Networks, 343-345.
11. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
99
[16] Duncan, N., and Eddie, B. T., (2012), An Energy-Efficient Dynamic Source Routing Protocol for
Mobile Ad-Hoc Networks, International Journal of Computing and ICT Research, 2(6), 23-32.
[17] Fuhrmann, Th., Pengfei, D., Kutzner, K., and Cramer, C., (2006), Pushing Chord into the
Underlay: Scalable Routing for Hybrid MANETs (PDF). System Architecture Group, Technical
University of Karlsruhe (TH).
[18] Gani, A., Han, Q., Anuar, N. B., and Zakaria, O., (2009), Enhancing DSR Protocol Performance in
Mobile Ad-Hoc Networks Using ACK Reply, WSEAS Transactions on Communications, 2(8),
227-236.
[19] Goyal, M., Soperi, M., Bacceli, E., Chaudhury, G., Shahik, A., Hosseini, H., and Trivedi, K.,
(2012), Improving Convergence Speed and Scalability in OSPF: A Survey, IEEE
COMMUNICATIONS SURVEYS & TUTORIALS, 14(2), 443-463.
[20] Grover, D., and Singh, G., (2012), Implementation: DSR & AODV, International Journal of
Computer Application, 2(5), 66-79.
[21] Guizani, B., Ayeb, B., Koukam, A., (2012), A New Cluster-Based Link State Routing for Mobile
Ad Hoc Networks, IEEE, The 2nd International Conference on Communications and Information
Technology (ICCIT): Communication Networks and Systems, Hammamet, 2 , 196-201.
[22] Gujral, R., Rana, S., and Chaudhari, A., (2012), Study and Comparison of Mesh and Tree Based
Multicast Routing Protocols for MANETs, International Journal of Latest Trends in Engineering
and Technology (IJLTET), 1(2), 58-65.
[23] Gulati, M., K., and Kumar, K., (2013), A Review of QoS Routing Protocols in MANETs,
International Conference on Computer Communication and Informatics, 1-6.
[24] Hao, L., (2009), The QoS Routing Protocol in the Ad Hoc Networks, International Conference on
Networking and Digital Society, 101-103.
[25] Hosseini Seno, S. A., Budiarto, R., and Wan, T. Ch., (2011), A Secure Mobile Ad hoc Network
Based on Distributed Certificate Authority, Arabian Journal for Science and Engineering, 2(36),
245-257.
[26] Hwang, R., H., Do, W., Y., and Yang, Sh., Ch., (2000), Multicast Routing Based on Genetic
Algorithms, JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 16, 885-902.
[27] Johnson, D., B., Maltz, D., A., and Broch, J., (2001), DSR: The Dynamic Source Routing Protocol
for Multi-Hop Wireless Ad Hoc Networks, Monarch, 1-25.
[28] Johnson, D., Hu, Y., and Maltz, D., (2007), The Dynamic Source Routing Protocol (DSR) for
Mobile Ad Hoc Networks for IPv4 (RFC 4728), IETF, 1-107.
[29] Karibasappa, A., S., G., and Muralidhara, K., N., (2011), Neuro Fuzzy Based Routing Protocol for
Mobile Ad-Hoc Networks, International Conference on Industrial and Information Systems, 6,
216-221.
[30] Katoch, Sh., and Aggarwal, R., (2013), Enhancement in DSR Protocol for Load Balancing and
Congestion Control, Global Journal of Computer Science and Technology Network, Web and
Security, 7(13),
[31] Kaur, N., and Singh, M., (2012), Effects of Caching on the Performance of DSR Protocol, IOSR
Journal of Engineering (IOSRJEN), 2(9), 7-11.
[32] Kojic, N., S., Ivancic, M., B., Z., Reljin, I., S., and Reljin, B., D., (2010), New Algorithm for
Packet Routing in Mobile Ad-hoc Networks, JOURNAL OF AUTOMATIC CONTROL,
UNIVERSITY OF BELGRADE, 20, 9-16.
[33] kosko, B., (1993), Fuzzy Thinking, Hyperion, New York.
[34] Kumar, M. and Mishra, R. (2012), An Overview of MANET: History, Challenges and
Applications, Indian Journal of Computer Science and Engineering (IJCSE), 3, 121-125.
[35] Kunz, Th., and Alhalimi, R., (2010), Energy-efficient proactive routing in MANET: Energy
metrics accuracy, Ad Hoc Networks, 7(8), 755-766.
[36] LAtiff, L., A., and Fisal, N., (2003), Routing Protocols in Wireless- Mobile Ad Hoc Network - A
Review, IEEE, 600-604.
[37] Liu, H., Li, J., Zhang, Y., Q., and Pan, Y., (2005), An Adaptive Genetic Fuzzy Multi-path Routing
Protocol for Wireless Ad-Hoc Networks, International Conference on Software Engineering,
Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS
International Workshop on Self-Assembling Wireless Networks, 6, 1-8.
[38] Lou, Y., Zhang, W., and Hu, Y., (2010), A New Cluster Based Routing Protocol for VANET,
Second International Conference on Networks Security, Wireless Communications and Trusted
Computing, 48, 176-180.
12. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
100
[39] Michalewicz, Z., (2001), Genetic Algorithms, Numerical Optimization, and Constraints, Polish
Academia of Science, 1-8.
[40] Mohammed, A., A., and Nagib, G., (2012), Optimal Routing In Ad-Hoc Network Using Genetic
Algorithm, Int. J. Advanced Networking and Applications, 3(5), 1323-1328.
[41] Nallusamy, R., Duaiswamy, K., Muthukumar, D., and Sathiakumar, C., (2010), Energy efficient
dynamic shortest path routing in Wireless Ad hoc Sensor Networks using Genetic Algorithm,
ICWCSC.
[42] Perkins, Ch., E., and Royer, E., M., (1997), Ad-hoc On-demand Distance Vector Routing, IEEE,
1-11.
[43] Perkins, Ch., E., and Royer, E., M., (2003), Ad hoc On-Demand Distance Vector (AODV)
Routing (RFC 3561), IETF, 1-37.
[44] Ragunath, V., (2004), Implementation of DSR Protocol in NS2 simulator, University of Bonn,
Informatik Department IV, 1-5.
[45] Ramesh, V., Subbaiah, P., and Supriya, K., (2010), Modified DSR (Preemptive) to Reduce Link
Breakage and Routing Overhead for MANET Using Proactive Route Maintenance (PRM), Global
Journal of Computer Science and Technology, 5(9), 124-129.
[46] Rifa-Pous, H., and Herrera-Joancomarti, J., (2011), Computational and Energy Costs of
Cryptographic Algorithms on Handheld Devices, Future Internet, 3, 31-48.
[47] Roshankar, R., Bhatia, R., Shrivatava, V., and Sharma, D., K., (2012), Performance Analysis of
Various Routing Protocols (Proactive and Reactive) for Random Mobility Models of Adhoc
Networks, Recent Advances in Information Technology, 1, 1-5.
[48] Royer, E., M., (1999), A Review of Current Routing Protocols for Ad Hoc Mobile Wireless
Networks, IEEE Personal Communications, 99 , 46-55.
[49] Saeed, N., H., Abbod, M., F., and Al-Raweshidy, H., S., (2012), MANET Routing Protocols T
axonomy, International Conference on Future Communication Networks, 123-128.
[50] Saleh, R., O., M., Saman, M., Y., M., and Rahman, M., N., A., (2012), Fresh Shortest Route
Algorithm for DSR Protocol in Mobile Ad-Hoc Networks, International Annual Symposium on
Sustainability Science and Management, 11, 1068-1073.
[51] Sarr, Ch., Chaudet, C., Chelius, G., and Lassous, I., G., (2005), A node-based available bandwidth
evaluation in IEEE 802.11 ad hoc networks, International Journal of Parallel, Emergent and
Distributed Systems, 1-21.
[52] Sihai, Zh., Layuan, L., and Yong, L. (2011), A QoS-based Routing Algorithm in Ad Hoc Network,
International Symposium on Distributed Computing and Applications to Business, Engineering
and Science, 10, 23-26.
[53] Tan, K., Zhang, Q., and Zhu, W., (2003), Shortest Path Routing in Partially Connected Ad Hoc
Networks, GLOBECOM, 1038-1042.
[54] Tong, F., Tang, W., Peng, L., Xie, R., Yang, W., and Kim, Y., (2010), A Node-Grade Based
AODV Routing Protocol for Wireless Sensor Network, 2010 Second International Conference on
Networks Security Wireless Communications and Trusted Computing (NSWCTC), 2, 180-183.
[55] Wismanath, K., Obraczka, K., and Tsudik, G., (2005), Exploring Mesh- and Tree Based Multicast
Routing Protocols for MANETs, 1-45.
[56] Wu, H., and Jia, X., (2007), QoS Multicast Routing by Using Multiple Paths/Trees in Wireless Ad
hoc networks, FFCSA, 559-612.
[57] Xiaochuan, X., Gang, W., Keping, W., Gang, W., and Shilou, J., (2009), Link reliability based
hybrid routing for tactical mobile ad hoc network, Journal of Systems Engineering and
Electronics, 2(19),259-267.
[58] Yeh, Ch., T., (2009), Approximations by interval, triangular and trapezoidal fuzzy numbers, IFSA-
EUSFLAT, 143-148.
[59] Zafar, H., Hassan, L., Khattak, A., Mufti, Z., and Jan, S., (2012), Implementation of the Dynamic
Source Routing Protocol in Network Simulator 2 – An Overview, SINDH UNIVERSITY
RESEARCH JOURNAL (SCIENCE SERIES), 44(3), 491-496.