Numerous studies have analyzed the performances of routing protocols in mobile Ad-hoc networks (MANETs); most of these studies vary at most one or two parameters in experiments and do not study the interactions among these parameters. Furthermore, efficient mathematical modeling of the performances has not been investigated; such models can be useful for performance analysis, optimization, and prediction. This study aims to show the effectiveness of the response surface methodology (RSM) on the performance analysis of routing protocols in MANETs and establish a relationship between the influential parameters and these performances through mathematical modeling. Given that routing performances usually do not follow a linear pattern according to the parameters; mathematical models of factorial designs are not suitable for establishing a valid and reliable relationship between performances and parameters. Therefore, a Box–Behnken design, which is an RSM technique and provides quadratic mathematical models, is used in this study to establish a relationship. The obtained models are statistically analyzed; the models show that the studied performances accurately follow a quadratic evolution. These models provide invaluable information and can be useful in analyzing, optimizing, and predicting performances for mobile Ad-hoc routing protocols.
Performance evaluation of MANET routing protocols based on QoS and energy p...IJECEIAES
Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced DistanceVector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Maximizing Throughput using Adaptive Routing Based on Reinforcement LearningEswar Publications
This document summarizes a research paper that proposes a reinforcement learning approach called prioritized sweeping confidence based dual reinforcement learning (PSCDR) for adaptive routing in mobile ad hoc networks. The PSCDR approach uses a prioritized sweeping technique to optimize confidence based dual reinforcement routing. Simulation results on 50 node mobile ad hoc networks and fixed grid networks show that the proposed PSCDR approach significantly increases throughput compared to conventional routing protocols like DSDV, AODV and DSR, especially under medium to high traffic loads. The PSCDR approach dynamically selects routes in real-time based on current network traffic to minimize packet delivery time and avoid congestion.
Fast Data Collection with Interference and Life Time in Tree Based Wireless S...IJMER
This document discusses techniques for fast data collection in wireless sensor networks using a tree-based topology. It specifically focuses on minimizing the schedule length for aggregated convergecast (where data is aggregated at each hop) and raw-data convergecast (where packets are individually relayed to the sink).
It first considers time scheduling on a single channel, and then combines scheduling with transmission power control and multiple frequencies to further reduce interference and schedule length. It provides lower bounds on schedule length when interference is eliminated, and proposes algorithms that achieve these bounds.
Evaluation of different channel assignment methods, routing tree topologies, interference models, and their impact on schedule length is also presented. The key findings are that combining scheduling, power control,
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.
This document proposes a new sketch method called Joint Sketch (JS) to measure the host connection degree distribution (HCDD) in real-time for high-speed network links. JS uses a discrete uniform Flajolet-Martin sketch combined with a small bitmap to build a compact digest of each host's network flows. Theoretical analysis and experimental results show that JS is significantly more accurate than previous methods at estimating the HCDD, using the same amount of memory. JS provides a more effective traffic summary than prior methods, especially for hosts with many connections.
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.
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive network routing is investigated. Shortest Path routing is always not suitable for any wireless mobile network as in high traffic conditions, shortest path will always select the shortest path which is in terms of number of hops, between source and destination thus generating more congestion. In prioritized sweeping reinforcement learning 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 Mobile ad hoc networks with random mobility. Various performance parameters such as Interval and number of nodes are used for judging the network. Packet delivery ratio, dropping ratio and delay shows optimum results using the prioritized sweeping reinforcement learning method.
Performance evaluation of MANET routing protocols based on QoS and energy p...IJECEIAES
Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced DistanceVector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Maximizing Throughput using Adaptive Routing Based on Reinforcement LearningEswar Publications
This document summarizes a research paper that proposes a reinforcement learning approach called prioritized sweeping confidence based dual reinforcement learning (PSCDR) for adaptive routing in mobile ad hoc networks. The PSCDR approach uses a prioritized sweeping technique to optimize confidence based dual reinforcement routing. Simulation results on 50 node mobile ad hoc networks and fixed grid networks show that the proposed PSCDR approach significantly increases throughput compared to conventional routing protocols like DSDV, AODV and DSR, especially under medium to high traffic loads. The PSCDR approach dynamically selects routes in real-time based on current network traffic to minimize packet delivery time and avoid congestion.
Fast Data Collection with Interference and Life Time in Tree Based Wireless S...IJMER
This document discusses techniques for fast data collection in wireless sensor networks using a tree-based topology. It specifically focuses on minimizing the schedule length for aggregated convergecast (where data is aggregated at each hop) and raw-data convergecast (where packets are individually relayed to the sink).
It first considers time scheduling on a single channel, and then combines scheduling with transmission power control and multiple frequencies to further reduce interference and schedule length. It provides lower bounds on schedule length when interference is eliminated, and proposes algorithms that achieve these bounds.
Evaluation of different channel assignment methods, routing tree topologies, interference models, and their impact on schedule length is also presented. The key findings are that combining scheduling, power control,
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.
This document proposes a new sketch method called Joint Sketch (JS) to measure the host connection degree distribution (HCDD) in real-time for high-speed network links. JS uses a discrete uniform Flajolet-Martin sketch combined with a small bitmap to build a compact digest of each host's network flows. Theoretical analysis and experimental results show that JS is significantly more accurate than previous methods at estimating the HCDD, using the same amount of memory. JS provides a more effective traffic summary than prior methods, especially for hosts with many connections.
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.
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive network routing is investigated. Shortest Path routing is always not suitable for any wireless mobile network as in high traffic conditions, shortest path will always select the shortest path which is in terms of number of hops, between source and destination thus generating more congestion. In prioritized sweeping reinforcement learning 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 Mobile ad hoc networks with random mobility. Various performance parameters such as Interval and number of nodes are used for judging the network. Packet delivery ratio, dropping ratio and delay shows optimum results using the prioritized sweeping reinforcement learning method.
The document discusses a proposed congestion control method called ELFIQM for wireless networks. ELFIQM is inspired by the Engset loss formula queue model and aims to distribute network load evenly across multiple routes. It does this by estimating key parameters like minimum queue length, blocking probability, and congestion rate. Simulation results showed ELFIQM improved packet delivery ratio, throughput, and reduced network overhead by up to 25% compared to other queue-based load balancing techniques.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
Solving bandwidth guaranteed routing problem using routing dataIJCNCJournal
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands
as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted
demand. The novel idea is to select routes based on not only network states but also information derived
from routing data such as probabilities of the ingress egress pairs and usage frequencies of the links.
Experiments with respect to acceptance ratio and computation time have been conducted against various
test sets. Results indicate that the proposed algorithm has better performance than the existing popular algorithms including Minimum Interference Routing Algorithm (MIRA) and Random Race based Algorithm for Traffic Engineering (RRATE)
.
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.
Maximizing Efficiency Of multiple–Path Source Routing in Presence of JammerIOSR Journals
This paper explores maximizing the efficiency of multiple-path source routing in the presence of a jammer. It implements jamming-aware traffic allocation based on previous work, relaxing the assumption of in-network inference of variable correlations. The source node allocates traffic to paths based on estimated jamming statistics. Portfolio selection theory is used to optimize throughput. Simulation results using NS2 show the network is capable of jamming-aware allocation that increases throughput compared to ignoring jamming.
A PROACTIVE FLOW ADMISSION AND RE-ROUTING SCHEME FOR LOAD BALANCING AND MITIG...IJCNCJournal
The centralized architecture in software-defined network (SDN) provides a global view of the underlying network, paving the way for enormous research in the area of SDN traffic engineering (SDN TE). This research focuses on the load balancing aspects of SDN TE, given that the existing reactive methods for data-plane load balancing eventually result in packet loss and proactive schemes for data plane load
balancing do not address congestion propagation. In the proposed work, the SDN controller periodically monitors flow level statistics and utilization on each link in the network and over-utilized links that cause network congestion and packet loss are identified as bottleneck links. For load balancing the identified largest flow and further traffic through these bottleneck links are rerouted through the lightly-loaded alternate path. The proposed scheme models a Bayesian Network using the observed port utilization and residual bandwidth to decide whether the newly computed alternate path can handle the new flow load before flow admission which in turn reduces congestion propagation. The simulation results show that
when the network traffic increases the proposed method efficiently re-routes the flows and balance the network load which substantially improves the network efficiency and the quality of service (QoS) parameters.
A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mes...IOSR Journals
This document summarizes a load aware proposal for maximum available bandwidth routing in wireless mesh networks. It first introduces wireless mesh networks and discusses that seeking maximum available bandwidth paths is a fundamental routing issue. It then analyzes several existing routing techniques that provide bandwidth guarantees, including ETX, AVAIL, EED, and CAB. ETX considers packet loss ratios, AVAIL models 802.11 MAC behavior to predict throughput and delay, EED accounts for queuing delay, and CAB satisfies consistency requirements through hop-by-hop routing. The document identifies problems with these existing methods and proposes a load aware routing protocol to route through maximum available bandwidth paths while satisfying optimality and consistency requirements. It will plot throughput and delay graphs
Concurrent Multi - Path Real Time Communication Control Protocol (Cmprtcp)IRJET Journal
The document proposes a new transport protocol called Concurrent Multi-Path Real Time Communication Control Protocol (CMPRTCP) to handle real-time streams like video and audio over IP networks. CMPRTCP intelligently uses multiple paths between multi-homed hosts to concurrently transmit synchronized streams. It describes CMPRTCP's architecture and operation in detail. Experiments show CMPRTCP performs better than other protocols by maximizing timely data delivery under varying network conditions.
An Extensive Literature Review of Various Routing Protocols in Delay Tolerant...IRJET Journal
This document summarizes an extensive literature review on routing protocols in delay tolerant networks (DTNs). It begins by defining DTNs as wireless networks with intermittent connectivity where nodes use a store-carry-forward mechanism. Common routing protocols for DTNs like epidemic, spray and wait, and prophet are described. The document then reviews several papers that propose and evaluate new routing algorithms or improvements for DTNs, analyzing metrics like delivery ratio, overhead, and latency. Key factors considered include node contact histories, social characteristics, energy constraints, and message prioritization. Finally, it suggests the contact duration between nodes could be an important parameter to further optimize routing in DTNs.
ON THE TRANSMISSION OF ASYNCHRONOUS DATA STREAMS OVER PACKET SWITCHED NETWORK...IJCNCJournal
The task of synchronizing discrete information on received data packets in packet-switched networks and random multiple access to the transmission medium is actual. In such channels, an asynchronous method of information transmission is provided. Therefore, in telecommunication systems, there is a problem of developing new methods for exchanging information and forming an effective structure for organizing clock synchronization for incoming data packets.
Dynamic control of coding for progressive packet arrivals in dt nsIEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
The document proposes a Crosslayered and Power Conserved Routing Topology (CPCRT) for congestion control in mobile ad hoc networks. CPCRT aims to distinguish between packet loss due to link failure versus other causes like congestion. It takes a cross-layer approach using information from the physical, MAC, and application layers. The proposed method also aims to conserve power during packet transmission by adjusting transmission power levels based on received signal strength. Simulation results show that CPCRT can better utilize resources and conserve power during congestion control compared to other approaches.
International Journal of Computational Engineering Research(IJCER) ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
This document discusses dynamic adaptation techniques for optimizing data transfer performance over networks. It describes how the number of concurrent data transfer streams can be adjusted dynamically according to changing network conditions, without relying on historical measurements or external profiling. The proposed approach gradually increases the level of parallelism during a transfer to find a near-optimal number of streams based on instant throughput measurements, allowing it to adapt to varying environments and network utilization over time.
Transfer reliability and congestion control strategies in opportunistic netwo...IEEEFINALYEARPROJECTS
The document discusses transfer reliability and congestion control strategies in opportunistic networks. It begins by stating that opportunistic networks have unpredictable node contacts and rarely have complete end-to-end paths. It then discusses how modified TCP protocols are ineffective for these networks and they require different approaches than intermittently connected networks. The document surveys proposals for transfer reliability using hop-by-hop custody transfer and end-to-end receipts. It also categorizes storage congestion control based on single or multiple message copies. It identifies open research issues including replication management and drop policies for multiple copies.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Optimize the Network Coding Paths to Enhance the Coding Protection in Wireles...IJCNCJournal
Efficient protection techniques for multimedia data transfer over Wireless Sensor Network (WSN) are very essential issues. In noisy Wireless Multimedia Sensor Networks (WMSN) Quality of Service (QoS) is a challenging task due to bandwidth and limited energy, and unpredictable channel conditions. Therefore, Forward Error Correction (FEC), a class of channel coding has been widely used in WSN. Nevertheless, the bulky size of multimedia data makes it more difficult to be transported over the noisy multi-hop wireless network. Moreover, the efficiency of FEC drops as the number of hops increases. In this paper, an optimized protection technique based on network coding and rateless code has been proposed to enhance the throughput and reduce overhead during data transfer in WMSN. The performance of NCP-OPR is enhanced via Optimal Network Path Model (ONPM) where the best available paths are optimally selected using Particle Swarm Optimization (PSO). In conjunction with the proposed protection scheme, the proposed ONPM is intended for limited power WSN by optimally distributing the power usage among the network paths so that the throughput can be improved.
Optimize the Network Coding Paths to Enhance the Coding Protection in Wireles...IJCNCJournal
- The document proposes an optimized protection technique using network coding and rateless codes to enhance throughput and reduce overhead during data transfer in wireless multimedia sensor networks.
- It presents an Optimal Network Path Model (ONPM) that uses Particle Swarm Optimization to select the best available paths in a way that optimally distributes power usage among network paths to improve throughput.
- The performance of the proposed ONPM is evaluated through simulations and compared to existing algorithms, showing it can enhance coding protection and effectively optimize network paths to improve data transfer in wireless multimedia sensor networks.
WS-OLSR: MULTIPOINT RELAY SELECTION IN VANET NETWORKS USING A WINGSUIT FLYING...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and
bandwidth availability make optimizing broadcast message flooding a problem in an Optimized Link State
Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately
been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions
in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based
on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-OLSR) is investigated to enhance the
existing MPR-based solution, arguing that considering a cost function as a further decision measure will
effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced
MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of
mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm
phenomenon in VANETs.
WS-OLSR: Multipoint Relay Selection in VANET Networks using a Wingsuit Flying...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and bandwidth availability make optimizing broadcast message flooding a
problem in an Optimized Link State Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-
OLSR) is investigated to enhance the existing MPR-based solution, arguing that considering a cost function as a further decision measure will effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm phenomenon in VANETs
Analytical average throughput and delay estimations for LTESpiros Louvros
This document summarizes an article that appeared in a journal published by Elsevier. The article proposes an analytical model to estimate average throughput and packet transmission delay for uplink cell edge users in LTE networks. The model uses probability analysis and mathematical modeling to estimate transmission delay and throughput, providing cell planners with an analytical tool for evaluating uplink performance under different conditions. The model accounts for factors like scheduling decisions, resource allocation, channel conditions and buffering that impact transmission delay and throughput for cell edge users.
Evaluation of Table Driven Protocols-DSDV & OLSR in MANETijsrd.com
Ad-hoc networks are wireless networks where nodes communicate with each other using multi-hop links. There is no stationary infrastructure or base station for commu-nication. In the infrastructure network base stations are fixed. A MANET is a type of Ad-hoc network that can change locations and configure itself on the fly. Routing in Ad-hoc-networks has been a challenging task ever since the wireless networks came into existence. A number of protocols have been developed for accomplish this task. The objective of the proposed work is to study the Table driven(Proactive) Protocols- DSDV and OLSR protocol performance on the basis of Cumulative sum of no. of all generated packets, Throughput of dropping packets, Packet Size Vs. Average throughput of sending packets, Packet Size Vs. Average throughput of receiving packets, Throughput of receiving bits Vs. Maximal Simulation processing time. Output results are compared using network simulator-2(NS2) between DSDV and OLSR.
The document discusses a proposed congestion control method called ELFIQM for wireless networks. ELFIQM is inspired by the Engset loss formula queue model and aims to distribute network load evenly across multiple routes. It does this by estimating key parameters like minimum queue length, blocking probability, and congestion rate. Simulation results showed ELFIQM improved packet delivery ratio, throughput, and reduced network overhead by up to 25% compared to other queue-based load balancing techniques.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
Solving bandwidth guaranteed routing problem using routing dataIJCNCJournal
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands
as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted
demand. The novel idea is to select routes based on not only network states but also information derived
from routing data such as probabilities of the ingress egress pairs and usage frequencies of the links.
Experiments with respect to acceptance ratio and computation time have been conducted against various
test sets. Results indicate that the proposed algorithm has better performance than the existing popular algorithms including Minimum Interference Routing Algorithm (MIRA) and Random Race based Algorithm for Traffic Engineering (RRATE)
.
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.
Maximizing Efficiency Of multiple–Path Source Routing in Presence of JammerIOSR Journals
This paper explores maximizing the efficiency of multiple-path source routing in the presence of a jammer. It implements jamming-aware traffic allocation based on previous work, relaxing the assumption of in-network inference of variable correlations. The source node allocates traffic to paths based on estimated jamming statistics. Portfolio selection theory is used to optimize throughput. Simulation results using NS2 show the network is capable of jamming-aware allocation that increases throughput compared to ignoring jamming.
A PROACTIVE FLOW ADMISSION AND RE-ROUTING SCHEME FOR LOAD BALANCING AND MITIG...IJCNCJournal
The centralized architecture in software-defined network (SDN) provides a global view of the underlying network, paving the way for enormous research in the area of SDN traffic engineering (SDN TE). This research focuses on the load balancing aspects of SDN TE, given that the existing reactive methods for data-plane load balancing eventually result in packet loss and proactive schemes for data plane load
balancing do not address congestion propagation. In the proposed work, the SDN controller periodically monitors flow level statistics and utilization on each link in the network and over-utilized links that cause network congestion and packet loss are identified as bottleneck links. For load balancing the identified largest flow and further traffic through these bottleneck links are rerouted through the lightly-loaded alternate path. The proposed scheme models a Bayesian Network using the observed port utilization and residual bandwidth to decide whether the newly computed alternate path can handle the new flow load before flow admission which in turn reduces congestion propagation. The simulation results show that
when the network traffic increases the proposed method efficiently re-routes the flows and balance the network load which substantially improves the network efficiency and the quality of service (QoS) parameters.
A Load Aware Proposal for Maximum Available Bandwidth Routing in Wireless Mes...IOSR Journals
This document summarizes a load aware proposal for maximum available bandwidth routing in wireless mesh networks. It first introduces wireless mesh networks and discusses that seeking maximum available bandwidth paths is a fundamental routing issue. It then analyzes several existing routing techniques that provide bandwidth guarantees, including ETX, AVAIL, EED, and CAB. ETX considers packet loss ratios, AVAIL models 802.11 MAC behavior to predict throughput and delay, EED accounts for queuing delay, and CAB satisfies consistency requirements through hop-by-hop routing. The document identifies problems with these existing methods and proposes a load aware routing protocol to route through maximum available bandwidth paths while satisfying optimality and consistency requirements. It will plot throughput and delay graphs
Concurrent Multi - Path Real Time Communication Control Protocol (Cmprtcp)IRJET Journal
The document proposes a new transport protocol called Concurrent Multi-Path Real Time Communication Control Protocol (CMPRTCP) to handle real-time streams like video and audio over IP networks. CMPRTCP intelligently uses multiple paths between multi-homed hosts to concurrently transmit synchronized streams. It describes CMPRTCP's architecture and operation in detail. Experiments show CMPRTCP performs better than other protocols by maximizing timely data delivery under varying network conditions.
An Extensive Literature Review of Various Routing Protocols in Delay Tolerant...IRJET Journal
This document summarizes an extensive literature review on routing protocols in delay tolerant networks (DTNs). It begins by defining DTNs as wireless networks with intermittent connectivity where nodes use a store-carry-forward mechanism. Common routing protocols for DTNs like epidemic, spray and wait, and prophet are described. The document then reviews several papers that propose and evaluate new routing algorithms or improvements for DTNs, analyzing metrics like delivery ratio, overhead, and latency. Key factors considered include node contact histories, social characteristics, energy constraints, and message prioritization. Finally, it suggests the contact duration between nodes could be an important parameter to further optimize routing in DTNs.
ON THE TRANSMISSION OF ASYNCHRONOUS DATA STREAMS OVER PACKET SWITCHED NETWORK...IJCNCJournal
The task of synchronizing discrete information on received data packets in packet-switched networks and random multiple access to the transmission medium is actual. In such channels, an asynchronous method of information transmission is provided. Therefore, in telecommunication systems, there is a problem of developing new methods for exchanging information and forming an effective structure for organizing clock synchronization for incoming data packets.
Dynamic control of coding for progressive packet arrivals in dt nsIEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
The document proposes a Crosslayered and Power Conserved Routing Topology (CPCRT) for congestion control in mobile ad hoc networks. CPCRT aims to distinguish between packet loss due to link failure versus other causes like congestion. It takes a cross-layer approach using information from the physical, MAC, and application layers. The proposed method also aims to conserve power during packet transmission by adjusting transmission power levels based on received signal strength. Simulation results show that CPCRT can better utilize resources and conserve power during congestion control compared to other approaches.
International Journal of Computational Engineering Research(IJCER) ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
This document discusses dynamic adaptation techniques for optimizing data transfer performance over networks. It describes how the number of concurrent data transfer streams can be adjusted dynamically according to changing network conditions, without relying on historical measurements or external profiling. The proposed approach gradually increases the level of parallelism during a transfer to find a near-optimal number of streams based on instant throughput measurements, allowing it to adapt to varying environments and network utilization over time.
Transfer reliability and congestion control strategies in opportunistic netwo...IEEEFINALYEARPROJECTS
The document discusses transfer reliability and congestion control strategies in opportunistic networks. It begins by stating that opportunistic networks have unpredictable node contacts and rarely have complete end-to-end paths. It then discusses how modified TCP protocols are ineffective for these networks and they require different approaches than intermittently connected networks. The document surveys proposals for transfer reliability using hop-by-hop custody transfer and end-to-end receipts. It also categorizes storage congestion control based on single or multiple message copies. It identifies open research issues including replication management and drop policies for multiple copies.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Optimize the Network Coding Paths to Enhance the Coding Protection in Wireles...IJCNCJournal
Efficient protection techniques for multimedia data transfer over Wireless Sensor Network (WSN) are very essential issues. In noisy Wireless Multimedia Sensor Networks (WMSN) Quality of Service (QoS) is a challenging task due to bandwidth and limited energy, and unpredictable channel conditions. Therefore, Forward Error Correction (FEC), a class of channel coding has been widely used in WSN. Nevertheless, the bulky size of multimedia data makes it more difficult to be transported over the noisy multi-hop wireless network. Moreover, the efficiency of FEC drops as the number of hops increases. In this paper, an optimized protection technique based on network coding and rateless code has been proposed to enhance the throughput and reduce overhead during data transfer in WMSN. The performance of NCP-OPR is enhanced via Optimal Network Path Model (ONPM) where the best available paths are optimally selected using Particle Swarm Optimization (PSO). In conjunction with the proposed protection scheme, the proposed ONPM is intended for limited power WSN by optimally distributing the power usage among the network paths so that the throughput can be improved.
Optimize the Network Coding Paths to Enhance the Coding Protection in Wireles...IJCNCJournal
- The document proposes an optimized protection technique using network coding and rateless codes to enhance throughput and reduce overhead during data transfer in wireless multimedia sensor networks.
- It presents an Optimal Network Path Model (ONPM) that uses Particle Swarm Optimization to select the best available paths in a way that optimally distributes power usage among network paths to improve throughput.
- The performance of the proposed ONPM is evaluated through simulations and compared to existing algorithms, showing it can enhance coding protection and effectively optimize network paths to improve data transfer in wireless multimedia sensor networks.
WS-OLSR: MULTIPOINT RELAY SELECTION IN VANET NETWORKS USING A WINGSUIT FLYING...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and
bandwidth availability make optimizing broadcast message flooding a problem in an Optimized Link State
Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately
been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions
in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based
on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-OLSR) is investigated to enhance the
existing MPR-based solution, arguing that considering a cost function as a further decision measure will
effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced
MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of
mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm
phenomenon in VANETs.
WS-OLSR: Multipoint Relay Selection in VANET Networks using a Wingsuit Flying...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and bandwidth availability make optimizing broadcast message flooding a
problem in an Optimized Link State Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-
OLSR) is investigated to enhance the existing MPR-based solution, arguing that considering a cost function as a further decision measure will effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm phenomenon in VANETs
Analytical average throughput and delay estimations for LTESpiros Louvros
This document summarizes an article that appeared in a journal published by Elsevier. The article proposes an analytical model to estimate average throughput and packet transmission delay for uplink cell edge users in LTE networks. The model uses probability analysis and mathematical modeling to estimate transmission delay and throughput, providing cell planners with an analytical tool for evaluating uplink performance under different conditions. The model accounts for factors like scheduling decisions, resource allocation, channel conditions and buffering that impact transmission delay and throughput for cell edge users.
Evaluation of Table Driven Protocols-DSDV & OLSR in MANETijsrd.com
Ad-hoc networks are wireless networks where nodes communicate with each other using multi-hop links. There is no stationary infrastructure or base station for commu-nication. In the infrastructure network base stations are fixed. A MANET is a type of Ad-hoc network that can change locations and configure itself on the fly. Routing in Ad-hoc-networks has been a challenging task ever since the wireless networks came into existence. A number of protocols have been developed for accomplish this task. The objective of the proposed work is to study the Table driven(Proactive) Protocols- DSDV and OLSR protocol performance on the basis of Cumulative sum of no. of all generated packets, Throughput of dropping packets, Packet Size Vs. Average throughput of sending packets, Packet Size Vs. Average throughput of receiving packets, Throughput of receiving bits Vs. Maximal Simulation processing time. Output results are compared using network simulator-2(NS2) between DSDV and OLSR.
Analysing Mobile Random Early Detection for Congestion Control in Mobile Ad-h...IJECEIAES
This research paper suggests and analyse a technique for congestion control in mobile ad hoc networks. The technique is based on a new hybrid approach that uses clustering and queuing techniques. In clustering, in general cluster head transfers the data, following a queuing method based on a RED (Random Early Detection), the mobile environment makes it Mobile RED (or MRED), It majorly depends upon mobility of nodes and mobile environments leads to unpredictable queue size. To simulate this technique, the Network Simulator 2 (or NS2) is used for various scenarios. The simulated results are compared with NRED (Neighbourhood Random Early Detection) queuing technique of congestion control. It has been observed that the results are improved using MRED comparatively.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IRJET - A Review on Congestion Control Methods in Mobile Adhoc NetworksIRJET Journal
This document reviews different techniques for congestion control in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and discusses how congestion can occur and degrade network performance. The literature survey section then summarizes several recent studies that have proposed various congestion control methods. These include adaptive data rate and control of hello packets, cross-layer approaches, hop-by-hop congestion control algorithms, avoiding congestion by monitoring bandwidth capacity, and fuzzy logic based congestion control. The document concludes that congestion is a major issue in MANETs and different control mechanisms aim to improve throughput, delivery ratio and reduce packet loss and delay.
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
The document discusses how transmission power impacts the quality of service (QoS) in mobile ad hoc network (MANET) routing protocols. It investigates four routing protocols - AODV, DSR, DSDV, and OLSR using the NS3 simulator. The analysis shows that AODV generally has the best performance in terms of packet delivery ratio, packet loss, jitter, and delay across different transmission power levels. Increasing transmission power improves the performance for all protocols, with AODV maintaining consistent high performance regardless of power level.
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
Wireless communication is significantly influenced by the Mobile Ad Hoc Network (MANET), which consists of nodes like mobile phones, tablets, computers, or other devices that can connect with one another. MANET is a decentralized network that communicates without using any specified infrastructure. The lack of battery power in this multihop network with no infrastructure is problematic. As a result, proper transmission power utilization must be considered. Transmission power significantly impacts the data dissemination of different routing protocols used in this MANET environment. By taking this issue into account, the performance of routing protocols is examined based on different transmission power settings. The packet delivery ratio (PDR), packet loss (PL), jitter, and Dealy all play a role in determining network service quality. This study investigates how transmission power impacts MANET routing protocols’ quality of Service (QoS). The MANET routing protocols investigated in this study include AODV, OLSR, DSDV, and DSR. NS3 is used to create the simulation env
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.
Congestion Control in Wireless Sensor Networks Using Genetic AlgorithmEditor IJCATR
Sensor network consists of a large number of small nods, strongly interacting with the physical environment, takes
environmental data through sensors, and reacts after processing on information. Wireless network technologies are widely used in most
applications. As wireless sensor networks have many activities in the field of information transmission, network congestion cannot be
thus avoided. So it seems necessary that some new methods can control congestion and use existing resources for providing better traffic
demands. Congestion increases packet loss and retransmission of removed packets and also wastes of energy. In this paper, a novel
method is presented for congestion control in wireless sensor networks using genetic algorithm. The results of simulation show that the
proposed method, in comparison with the algorithm LEACH, can significantly improve congestion control at high speeds.
Abstract: Energy consumption is one of the constraints in Wireless Sensor Networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues viz. Energy consumption, network lifetime, network scalability and packet overhead. In existing system a hybrid optimization based PEGASIS-DSR optimized routing protocol (PDORP) is presented which used cache and directional transmission concept of both proactive and reactive routing protocols. The performance of PDORP has been evaluated and the results indicated that it performs better in most significant parameters. The performance of the existing method is checked when it is evaluated and validated with the nodes which are highly dynamic in nature based on the application requirement. The current system finds the trusted nodes in the case of only static environment. To overcome the issue the proposed system is applied for dynamic WSN’s with the location frequently being changed. The PDORP-LC is applied with local caching (LC) to acquire the location information so that the path learning can be dynamic without depending on the fixed location. The proposed work is performing in dynamic environment with the dynamic derivation of trusted nodes.
Keywords: local caching (LC), Wireless Sensor Networks (WSNs), PEGASIS-DSR optimized routing protocol (PDORP).
Title: Energy Efficient Optimal Paths Using PDORP-LC
Author: ADARSH KUMAR B, BIBIN CHRISTOPHER, ISSAC SAJAN, AJ DEEPA
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Simulation based comparison of routing protocols in wireless multihop ad hoc ...IJECEIAES
Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and quality of service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile adhoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyzed in the presence of varying the number of mobile nodes, pause time, and traffic connection numbers. Moreover, Routing and QoS performance metrics such as normalized routing load, routing packet, packet delivery ratio, packet drop, end-to-end delay, and throughput are measured to conduct a performance comparison between three routing protocols. Simulation results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. AOMDV is better than DSDV in terms of end-to-end delay. DSDV provides lower throughput performance results. Network topology parameters have a slight impact on AODV performance.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
Similar to RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET ROUTING PROTOCOLS (20)
Particle Swarm Optimization–Long Short-Term Memory based Channel Estimation w...IJCNCJournal
Paper Title
Particle Swarm Optimization–Long Short-Term Memory based Channel Estimation with Hybrid Beam Forming Power Transfer in WSN-IoT Applications
Authors
Reginald Jude Sixtus J and Tamilarasi Muthu, Puducherry Technological University, India
Abstract
Non-Orthogonal Multiple Access (NOMA) helps to overcome various difficulties in future technology wireless communications. NOMA, when utilized with millimeter wave multiple-input multiple-output (MIMO) systems, channel estimation becomes extremely difficult. For reaping the benefits of the NOMA and mm-Wave combination, effective channel estimation is required. In this paper, we propose an enhanced particle swarm optimization based long short-term memory estimator network (PSOLSTMEstNet), which is a neural network model that can be employed to forecast the bandwidth required in the mm-Wave MIMO network. The prime advantage of the LSTM is that it has the capability of dynamically adapting to the functioning pattern of fluctuating channel state. The LSTM stage with adaptive coding and modulation enhances the BER.PSO algorithm is employed to optimize input weights of LSTM network. The modified algorithm splits the power by channel condition of every single user. Participants will be first sorted into distinct groups depending upon respective channel conditions, using a hybrid beamforming approach. The network characteristics are fine-estimated using PSO-LSTMEstNet after a rough approximation of channels parameters derived from the received data.
Keywords
Signal to Noise Ratio (SNR), Bit Error Rate (BER), mm-Wave, MIMO, NOMA, deep learning, optimization.
Volume URL: https://airccse.org/journal/ijc2022.html
Abstract URL:https://aircconline.com/abstract/ijcnc/v14n5/14522cnc05.html
Pdf URL: https://aircconline.com/ijcnc/V14N5/14522cnc05.pdf
#scopuspublication #scopusindexed #callforpapers #researchpapers #cfp #researchers #phdstudent #researchScholar #journalpaper #submission #journalsubmission #WBAN #requirements #tailoredtreatment #MACstrategy #enhancedefficiency #protrcal #computing #analysis #wirelessbodyareanetworks #wirelessnetworks
#adhocnetwork #VANETs #OLSRrouting #routing #MPR #nderesidualenergy #korea #cognitiveradionetworks #radionetworks #rendezvoussequence
Here's where you can reach us : ijcnc@airccse.org or ijcnc@aircconline.com
June 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhanced Traffic Congestion Management with Fog Computing - A Simulation-Base...IJCNCJournal
Abstract: Accurate latency computation is essential for the Internet of Things (IoT) since the connected
devices generate a vast amount of data that is processed on cloud infrastructure. However, the cloud is not
an optimal solution. To overcome this issue, fog computing is used to enable processing at the edge while
still allowing communication with the cloud. Many applications rely on fog computing, including traffic
management. In this paper, an Intelligent Traffic Congestion Mitigation System (ITCMS) is proposed to
address traffic congestion in heavily populated smart cities. The proposed system is implemented using fog
computing and tested in a crowdedCairo city. The results obtained indicate that the execution time of the
simulation is 4,538 seconds, and the delay in the application loop is 49.67 seconds. The paper addresses
various issues, including CPU usage, heap memory usage, throughput, and the total average delay, which
are essential for evaluating the performance of the ITCMS. Our system model is also compared with other
models to assess its performance. A comparison is made using two parameters, namely throughput and the
total average delay, between the ITCMS, IOV (Internet of Vehicle), and STL (Seasonal-Trend
Decomposition Procedure based on LOESS). Consequently, the results confirm that the proposed system
outperforms the others in terms of higher accuracy, lower latency, and improved traffic efficiency.
Call for Papers -International Journal of Computer Networks & Communications ...IJCNCJournal
International Journal of Computer Networks & Communications (IJCNC)
Citations, h-index, i10-index of IJCNC
---- Scopus, ERA Listed, WJCI Indexed ----
Scopus Cite Score 2022--1.8
https://airccse.org/journal/ijcnc.html
IJCNC is listed in ERA 2023 as per the Australian Research Council (ARC) Journal Ranking
Scope & Topics
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Authors are solicited to contribute to this journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the Computer Networks & Communications.
Topics of Interest
· Network Protocols & Wireless Networks
· Network Architectures
· High speed networks
· Routing, switching and addressing techniques
· Next Generation Internet
· Next Generation Web Architectures
· Network Operations & management
· Adhoc and sensor networks
· Internet and Web applications
· Ubiquitous networks
· Mobile networks & Wireless LAN
· Wireless Multimedia systems
· Wireless communications
· Heterogeneous wireless networks
· Measurement & Performance Analysis
· Peer to peer and overlay networks
· QoS and Resource Management
· Network Based applications
· Network Security
· Self-Organizing Networks and Networked Systems
· Optical Networking
· Mobile & Broadband Wireless Internet
· Recent trends & Developments in Computer Networks
Paper Submission
Authors are invited to submit papers for this journal through E-mail: ijcnc@airccse.org or through Submission System. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this Journal.
Important Dates
· Submission Deadline : June 22, 2024
· Notification : July 22, 2024
· Final Manuscript Due : July 29, 2024
· Publication Date : Determined by the Editor-in-Chief
Contact Us
Here's where you can reach us: ijcnc@airccse.org or ijcnc@aircconline.com
For other details please visit - http://airccse.org/journal/ijcnc.html
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Blockchain Enforced Attribute based Access Control with ZKP for Healthcare Se...IJCNCJournal
The relationship between doctors and patients is reinforced through the expanded communication channels provided by remote healthcare services, resulting in heightened patient satisfaction and loyalty. Nonetheless, the growth of these services is hampered by security and privacy challenges they confront. Additionally, patient electronic health records (EHR) information is dispersed across multiple hospitals in different formats, undermining data sovereignty. It allows any service to assert authority over their EHR, effectively controlling its usage. This paper proposes a blockchain enforced attribute-based access control in healthcare service. To enhance the privacy and data-sovereignty, the proposed system employs attribute-based access control, zero-knowledge proof (ZKP) and blockchain. The role of data within our system is pivotal in defining attributes. These attributes, in turn, form the fundamental basis for access control criteria. Blockchain is used to keep hospital information in public chain but EHR related data in private chain. Furthermore, EHR provides access control by using the attributed based cryptosystem before they are stored in the blockchain. Analysis shows that the proposed system provides data sovereignty with privacy provision based on the attributed based access control.
EECRPSID: Energy-Efficient Cluster-Based Routing Protocol with a Secure Intru...IJCNCJournal
A revolutionary idea that has gained significance in technology for Internet of Things (IoT) networks backed by WSNs is the " Energy-Efficient Cluster-Based Routing Protocol with a Secure Intrusion Detection" (EECRPSID). A WSN-powered IoT infrastructure's hardware foundation is hardware with autonomous sensing capabilities. The significant features of the proposed technology are intelligent environment sensing, independent data collection, and information transfer to connected devices. However, hardware flaws and issues with energy consumption may be to blame for device failures in WSN-assisted IoT networks. This can potentially obstruct the transfer of data. A reliable route significantly reduces data retransmissions, which reduces traffic and conserves energy. The sensor hardware is often widely dispersed by IoT networks that enable WSNs. Data duplication could occur if numerous sensor devices are used to monitor a location. Finding a solution to this issue by using clustering. Clustering lessens network traffic while retaining path dependability compared to the multipath technique. To relieve duplicate data in EECRPSID, we applied the clustering technique. The multipath strategy might make the provided protocol more dependable. Using the EECRPSID algorithm, will reduce the overall energy consumption, minimize the End-to-end delay to 0.14s, achieve a 99.8% Packet Delivery Ratio, and the network's lifespan will be increased. The NS2 simulator is used to run the whole set of simulations. The EECRPSID method has been implemented in NS2, and simulated results indicate that comparing the other three technologies improves the performance measures.
Analysis and Evolution of SHA-1 Algorithm - Analytical TechniqueIJCNCJournal
A 160-bit (20-byte) hash value, sometimes called a message digest, is generated using the SHA-1 (Secure Hash Algorithm 1) hash function in cryptography. This value is commonly represented as 40 hexadecimal digits. It is a Federal Information Processing Standard in the United States and was developed by the National Security Agency. Although it has been cryptographically cracked, the technique is still in widespread usage. In this work, we conduct a detailed and practical analysis of the SHA-1 algorithm's theoretical elements and show how they have been implemented through the use of several different hash configurations.
Optimizing CNN-BiGRU Performance: Mish Activation and Comparative AnalysisIJCNCJournal
Deep learning is currently extensively employed across a range of research domains. The continuous advancements in deep learning techniques contribute to solving intricate challenges. Activation functions (AF) are fundamental components within neural networks, enabling them to capture complex patterns and relationships in the data. By introducing non-linearities, AF empowers neural networks to model and adapt to the diverse and nuanced nature of real-world data, enhancing their ability to make accurate predictions across various tasks. In the context of intrusion detection, the Mish, a recent AF, was implemented in the CNN-BiGRU model, using three datasets: ASNM-TUN, ASNM-CDX, and HOGZILLA. The comparison with Rectified Linear Unit (ReLU), a widely used AF, revealed that Mish outperforms ReLU, showcasing superior performance across the evaluated datasets. This study illuminates the effectiveness of AF in elevating the performance of intrusion detection systems.
An Hybrid Framework OTFS-OFDM Based on Mobile Speed EstimationIJCNCJournal
The Future wireless communication systems face the challenging task of simultaneously providing high-quality service (QoS) and broadband data transmission, while also minimizing power consumption, latency, and system complexity. Although Orthogonal Frequency Division Multiplexing (OFDM) has been widely adopted in 4G and 5G systems, it struggles to cope with a significant delay and Doppler spread in high mobility scenarios. To address these challenges, a novel waveform named Orthogonal Time Frequency Space (OTFS). Designers aim to outperform OFDM by closely aligning signals with the channel behaviour. In this paper, we propose a switching strategy that empowers operators to select the most appropriate waveform based on an estimated speed of the mobile user. This strategy enables the base station to dynamically choose the waveform that best suits the mobile user’s speed. Additionally, we suggest retaining an Integrated Sensing and Communication (ISAC) radar approach for accurate Doppler estimation. This provides precise information to facilitate the waveform selection procedure. By leveraging the switching strategy and harnessing the Doppler estimation capabilities of an ISAC radar.Our proposed approach aims to enhance the performance of wireless communication systems in high mobility cases. Considering the complexity of waveform processing, we introduce an optimized hybrid system that combines OTFS and OFDM, resulting in reduced complexity while still retaining performance benefits.This hybrid system presents a promising solution for improving the performance of wireless communication systems in higher mobility.The simulation results validate the effectiveness of our approach, demonstrating its potential advantages for future wireless communication systems. The effectiveness of the proposed approach is validated by simulation results as it will be illustrated.
Enhanced Traffic Congestion Management with Fog Computing - A Simulation-Base...IJCNCJournal
Accurate latency computation is essential for the Internet of Things (IoT) since the connected devices generate a vast amount of data that is processed on cloud infrastructure. However, the cloud is not an optimal solution. To overcome this issue, fog computing is used to enable processing at the edge while still allowing communication with the cloud. Many applications rely on fog computing, including traffic management. In this paper, an Intelligent Traffic Congestion Mitigation System (ITCMS) is proposed to address traffic congestion in heavily populated smart cities. The proposed system is implemented using fog computing and tested in a crowdedCairo city. The results obtained indicate that the execution time of the simulation is 4,538 seconds, and the delay in the application loop is 49.67 seconds. The paper addresses various issues, including CPU usage, heap memory usage, throughput, and the total average delay, which are essential for evaluating the performance of the ITCMS. Our system model is also compared with other models to assess its performance. A comparison is made using two parameters, namely throughput and the total average delay, between the ITCMS, IOV (Internet of Vehicle), and STL (Seasonal-Trend Decomposition Procedure based on LOESS). Consequently, the results confirm that the proposed system outperforms the others in terms of higher accuracy, lower latency, and improved traffic efficiency.
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
May 2024, Volume 16, Number 3 - The International Journal of Computer Network...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
Gender and Mental Health - Counselling and Family Therapy Applications and In...PsychoTech Services
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
This presentation was provided by Racquel Jemison, Ph.D., Christina MacLaughlin, Ph.D., and Paulomi Majumder. Ph.D., all of the American Chemical Society, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.
Elevate Your Nonprofit's Online Presence_ A Guide to Effective SEO Strategies...TechSoup
Whether you're new to SEO or looking to refine your existing strategies, this webinar will provide you with actionable insights and practical tips to elevate your nonprofit's online presence.
Andreas Schleicher presents PISA 2022 Volume III - Creative Thinking - 18 Jun...EduSkills OECD
Andreas Schleicher, Director of Education and Skills at the OECD presents at the launch of PISA 2022 Volume III - Creative Minds, Creative Schools on 18 June 2024.
Temple of Asclepius in Thrace. Excavation resultsKrassimira Luka
The temple and the sanctuary around were dedicated to Asklepios Zmidrenus. This name has been known since 1875 when an inscription dedicated to him was discovered in Rome. The inscription is dated in 227 AD and was left by soldiers originating from the city of Philippopolis (modern Plovdiv).
THE SACRIFICE HOW PRO-PALESTINE PROTESTS STUDENTS ARE SACRIFICING TO CHANGE T...indexPub
The recent surge in pro-Palestine student activism has prompted significant responses from universities, ranging from negotiations and divestment commitments to increased transparency about investments in companies supporting the war on Gaza. This activism has led to the cessation of student encampments but also highlighted the substantial sacrifices made by students, including academic disruptions and personal risks. The primary drivers of these protests are poor university administration, lack of transparency, and inadequate communication between officials and students. This study examines the profound emotional, psychological, and professional impacts on students engaged in pro-Palestine protests, focusing on Generation Z's (Gen-Z) activism dynamics. This paper explores the significant sacrifices made by these students and even the professors supporting the pro-Palestine movement, with a focus on recent global movements. Through an in-depth analysis of printed and electronic media, the study examines the impacts of these sacrifices on the academic and personal lives of those involved. The paper highlights examples from various universities, demonstrating student activism's long-term and short-term effects, including disciplinary actions, social backlash, and career implications. The researchers also explore the broader implications of student sacrifices. The findings reveal that these sacrifices are driven by a profound commitment to justice and human rights, and are influenced by the increasing availability of information, peer interactions, and personal convictions. The study also discusses the broader implications of this activism, comparing it to historical precedents and assessing its potential to influence policy and public opinion. The emotional and psychological toll on student activists is significant, but their sense of purpose and community support mitigates some of these challenges. However, the researchers call for acknowledging the broader Impact of these sacrifices on the future global movement of FreePalestine.
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptxEduSkills OECD
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET ROUTING PROTOCOLS
1. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
DOI: 10.5121/ijcnc.2018.10104 45
RESPONSE SURFACE METHODOLOGY FOR
PERFORMANCE ANALYSIS AND MODELING OF
MANET ROUTING PROTOCOLS
Mohamed Skander Daas1
and Salim Chikhi2
1
MISC Lab, Department of Fundamental Computer Science and its Applications,
Abdelhamid Mehri Constantine 2 University, Constantine, Algeria
2
MISC Lab, University of Abdelhamid Mehri - Constantine 2, Constantine, Algeria
ABSTRACT
Numerous studies have analyzed the performances of routing protocols in mobile Ad-hoc networks
(MANETs); most of these studies vary at most one or two parameters in experiments and do not study the
interactions among these parameters. Furthermore, efficient mathematical modeling of the performances
has not been investigated; such models can be useful for performance analysis, optimization, and
prediction. This study aims to show the effectiveness of the response surface methodology (RSM) on the
performance analysis of routing protocols in MANETs and establish a relationship between the influential
parameters and these performances through mathematical modeling. Given that routing performances
usually do not follow a linear pattern according to the parameters; mathematical models of factorial
designs are not suitable for establishing a valid and reliable relationship between performances and
parameters. Therefore, a Box–Behnken design, which is an RSM technique and provides quadratic
mathematical models, is used in this study to establish a relationship. The obtained models are statistically
analyzed; the models show that the studied performances accurately follow a quadratic evolution. These
models provide invaluable information and can be useful in analyzing, optimizing, and predicting
performances for mobile Ad-hoc routing protocols.
KEYWORDS
Response surface methodology, performance analysis, and modeling, routing protocols, mobile ad-hoc
networks, design of experiments
1. INTRODUCTION
Many protocols have been developed for mobile ad-hoc networks, OLRS, AODV, and DSDV are
among the most studied [1], and have often been used as a reference in most studies and
performance analyses.
However, analyzing protocols performances in MANETs is a complex task. For each scenario,
several critical parameters (e.g., number of nodes, number of connections, data rate, node
velocity, and pause time) must be accurately controlled to satisfy the required characteristics of
the performance analysis. The development of computing machines has led to the development of
increasingly complex simulators. This complexity results in simulations that require much
computing time. For example, simulating an experience may consume more time than real-world
execution. Therefore, realizing or simulating real experiences in both cases may be relatively
costly in terms of time, effort, energy, resources, and so on. In order to cope with this problem,
design of experiments (DOE) provides a set of well-selected experiences to obtain the maximum
desired information at a low cost. Conventional methods of analyzing protocol performances are
usually Univariate; only one parameter is changed at a time while the remaining parameters are
kept constant, and the interactions among different parameters are disregarded. These methods
require a large number of experiments and consume much time, [2-8] are examples which use this
kind of analysis.
2. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
46
Response surface methodology (RSM) can effectively deal with the limitations of the
abovementioned methods. RSM is a systematic technique to define the relationship between the
parameters affecting a process and the response of that process via quadratic models. Analysis of
variance (ANOVA) and regression are the most important tools in RSM data analysis. RSM has
been successfully applied in various scientific and industrial fields, such as chemistry, biology,
physics, mechanics, and chemical engineering. RSM has also been used to conduct experiments
to rapidly develop and improve novel products and processes. It allows researchers and engineers
to explicitly model the relationships among various parameters in a given system and arrive at
optimal solutions in minimal time. In RSM, several process parameters can be simultaneously
varied and studied. A small number of experiments are necessary to estimate the contribution
degree of the individual and the interaction effect parameters on the investigated responses.
In the presented study, several important parameters (number of nodes, number of connections,
data rate, velocity of nodes, and pause time) of OLSR, AODV, and DSDV routing protocols are
examined, and a quadratic mathematical modeling using the Box–Behnken design is performed to
analyze the effects of main parameter and their interactions on numerous crucial performance
metrics (packet delivery fraction, average throughput, average end-to-end delay, mean of hops
number, mean jitter, and normalized routing overhead). The obtained models can be used to
analyze, predict and optimize the performance of each metric of each protocol under the provided
parameters. This provides invaluable perspectives to the performance analysis of the selected
routing protocols.
2. RELATED WORKS
In literature, only a few studies employed DOE to study several parameter effects or/and their
interactions on several performance metrics of MANET routing protocols. The authors in [9] used
the Taguchi approach to determine the effects of several factors (terrain, network size, pause time,
node velocity, transmission range, packet rates, and traffic load) and their interactions on the
routing overhead performance metric of the DSR protocol. The study showed that the most
significant parameter that affects the routing overhead is the size of the network, followed by
pause time, node speed, and traffic load. Similarly, the authors in [10] employed the Taguchi
approach to investigate the drop rate performance of DSR and AODV routing protocols. In the
same work various parameters of network performance (routing protocol, node density, node
speed, traffic load, and pause time) are considered to analyze the factors and interactions for the
network performance of DSR and AODV routing protocols by determining various metrics
(packet delivery ratio, average delay, discovery time, and recovery time) using a factorial design.
Many other works used factorial design to quantify the main and interactive effects [11, 10, 12,
13]. The authors in [14], have used a factorial design technique to analyze routing mobile ad-hoc
networks and have developed two first-order linear models that define the relationship between
the influential parameters and two performance metrics. An interesting study [15] used DOE for
factor screening (23
factorial design) to identify the most influential timers in the AODV routing
protocol and the number of retries before declaring link failure in the MAC protocol affecting
average throughput and average packet delay. Response surface methodology (RSM) was applied
to optimize the values of the significant factors and improve the average packet delay and average
throughput. Similarly, authors in [16] applied successfully RSM to model and optimize the node’s
power consumption to study the effect of several parameters on the power consumption of Digi’s
XBee PRO of shelf WSN modules.
3. MOBILE AD-HOC ROUTING PROTOCOLS
Several protocols exist, addressing the problem of routing in MANETs. Such protocols can be
divided into three classes based on when and how discovering routes. The first type of protocols
is the proactive protocols, where routing information is collected without an actual need for a
3. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
47
given route establishment. This information is stored in routing tables and should be periodically
maintained. The second type of protocols is the reactive (or on-demand) protocols, this kind of
protocols establish a route from source to a destination node when a source need it. The third type
is the hybrid routing protocols which are a combination of proactive and reactive routing
protocols [17]. In this paper, we examine three main ad-hoc routing protocols – OLSR [18],
AODV [19] and DSDV [20].
4. PERFORMANCE METRICS
Performance metrics are interesting because they can project what actually occurs during the
simulations and provide valuable information on the simulated routing protocols.
Before presenting the studied performance metrics, below are several utilized terms.
• tFirstRxPacket and tLastRxPacket represent the beginning and end times of the flow from
the viewpoint of the receiver.
• delaySum and jitterSum are the sum of delay and jitter values.
• txPackets is the number of transmitted packets.
• rxBytes and rxPackets are the number of received bytes and packets.
• timesForwarded is the number of times a packet has been reportedly forwarded summed for
all packets in the flow.
• txRoutingPackets is the number of transmitted routing packets.
4.1. PACKET DELIVERY FRACTION
Packet delivery fraction (PDF) is the ratio of the total number of successfully delivered data
packets at the destination divided by the total number of generated data packets.
= 100
∑
∑
(1)
4.2. AVERAGE THROUGHPUT
The average throughput (ATH) is the total number of received data packets by the sink agent at a
specific time. ATH is obtained by dividing the total data packet size received by the sum of the
differences between the time the last packet was received and the time the first packet was
received in each flow multiplied by 8. It is expressed in bits/s.
=
∗∑
∑ ( ! )
(2)
4.3. AVERAGE END-TO-END DELAY
The average end-to-end delay (E2ED) determines the average time that packets require from the
source to the application layer at the destination node. It is expressed in seconds.
#2# =
∑ % & '()
∑
(3)
4.4. MEAN HOP COUNT
Mean hop count is the mean of the number of hops traveled by packets.
* + = 1 +
∑ ) - . % %
∑ ( /)
(4)
4. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
48
4.5. MEAN JITTER
Jitter is the variation in time between arrivals of packets. For improved performance, the delay
between packets should be small.
01 =
∑ 2 '()
∑
(5)
4.6. NORMALIZED ROUTING OVERHEAD
The normalized routing overhead (ROH) is the total number of transmitted routing packets,
including forwarded routing packets, divided by the total number of received data packets at the
destination.
3+ =
∑ -( 45
∑
(6)
5. PERFORMANCE ANALYSIS AND MODELING OF MANET ROUTING
PROTOCOLS USING RSM
The most important parameters (number of nodes, number of connections, data rate, node
velocity, and pause time) of OLSR, AODV, and DSDV routing protocols were studied, and an
RSM approach was employed to analyze the effects of these main parameters and their
interactions on numerous crucial performance metrics (PDF, ATH, E2ED, MHOP, JIT, and
ROH).The relationship between parameters and the performances is generally nonlinear (presence
of curvature effect), that is why the full factorial design models will not be suitable for
performance modeling. Quadratic mathematical models using the Box–Behnken design were
developed to model the performance of each metric of each protocol under the given parameters.
Invaluable perspectives for the performance analysis of the selected routing protocols are thus
provided. The software Minitab was used for results analysis, mathematical model building, and
graph plotting. The interested reader can find more details about RSM in [21].
5.1. MATHEMATICAL MODELING OF ROUTING PROTOCOLS PERFORMANCES USING
BOX-BEHNKEN DESIGN
The Box–Behnken design is an RSM (Response Surface Methodology) design used to develop a
mathematical model that allows efficient estimation of first- and second-order coefficients. Each
factor takes one of three equally spaced values coded as -1, 0, and +1. Figure 1 shows the
experimental points of a Box–Behnken design with three factors.
Figure 1. An example of the Box-Behnken design with three factors
5. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
49
5.2. EXPERIMENT DETAILS
The experiments were simulated with the network simulator NS-3 version 3.25 under the Linux
(Ubuntu 15.0) operating system. The simulation time was set to 900 s, and the first 50 s were used
as start-up time. Nodes were randomly distributed and positioned according to the random
waypoint (RWP) mobility model in a rectangular field of 300m x 1500m; their velocity was
uniformly selected from 0 to a given speed (m/s). The nodes used CBR/UDP sources generating
packets of 64 bytes. The 802.11b MAC was installed on each node. The bandwidth was 11 Mb/s.
Application data were initialized at a random time between 50 and 51 s and continued until the
end of the simulation. We employed 10 runs in each experiment, and each obtained performance
result is the average of 10 runs.
5.3. SELECTION OF PROCESS PARAMETERS
By following RSM, the five parameters were considered, The five factors and their corresponding
levels are provided in Table 1; the response varies in the studied domain.
Table 1. Parameter levels.
To estimate the coefficients of the quadratic model, the experiment matrix of the Box–Behnken
design for five factors is provided in Table 2. The parameters corresponding to the central point
(0, 0, 0, 0, 0) are repeated three times. The proposed design requires 43 runs to model a response
surface.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
50
Table 2. Box-Behnken design matrix with five parameters.
5.4. EXPERIMENTAL RESULTS FOR BOX-BEHNKEN DESIGN
The PDF, ATH, E2ED, MHOP, JIT, and ROH values determined as output parameters
(responses) for OLSR, AODV, and DSDV for the 43 experiments are provided in Table 3 and
Table 4.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
51
Table 3. Results of the Box-Behnken Design Experiments of PDF, ATH and E2ED performances.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
52
Table 4. Results of the Box-Behnken Design Experiments of MHOP, JIT, and ROH performances.
5.5. QUADRATIC REGRESSION MODELS
The mathematical models generated by RSM in the current study aims to establish a relationship
between different performance metrics and input parameters A, B, C, D, and E that can be used to
predict the response values for a given set of control parameters. The second-order polynomial
equation may be written as:
6 = 78 + ∑ 79:9
;
9</ + ∑ ∑ 79=:9:=9>= + ∑ 799:9
?;
9</ + @ (7)
where 6 is the predicted response, β0 is the constant coefficient, βi is the ith
linear coefficient of
input parameter xi, βii is the ith
quadratic coefficient of input parameter xi, βij is the interaction
coefficients between input parameters xi and xj, and є is the error of the model. The estimated
coefficients 7A are obtained using mathematical regression according to formula 8:
9. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
53
7A = (B′B) /
B′
C (8)
Where B′ is the transpose of the matrix B. B is the matrix of the model which depends on the
experimental points chosen to execute the design. y is the vector of the responses, Eighteen
mathematical models were obtained through RSM. Each model corresponds to a given
performance (PDF, ATH, E2ED, MHOP, JIT, or ROH) of a given protocol (OLSR, AODV, or
DSDV). These models can be employed to analyze, optimize, and predict the six performance
metrics of the three protocols under a given configuration of the five factors (A, B, C, D, and E).
Table 5 and Table 6 show the coefficients of different models according to Equation 9.
6( , F, G, , #) = 78 + 7H + 7IF + 7JG + 7K + 7L# + 7HI F + 7HJ G + 7HK +
7HL # + 7IJFG + 7IKF + 7ILF# + 7JKG + 7JLG# + 7KL # + 7HH
?
+ 7IIF?
+ 7JJG?
+
7KK
?
+ 7LL#?
(9)
Table 5. Model Coefficients of PDF, ATH and E2ED performances.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
54
Table 6. Model Coefficients of MHOP, JIT, and ROH performances.
Based on models 9 and 15, two examples of surface plots are generated in Figures 2 and Figure 3
to see a graphic representation of the effect of different parameters on E2ED performance
respectively in AODV and DSDV protocols. Surface plots show how two parameters at one time
affect E2ED metric together. Since there are more than two parameters, the parameters not
exposed in the graphs are kept constant at level 0.
Figure 2. Surface Plots of Average End-to-End Delay (E2ED) in AODV
11. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
55
Figure 3. Surface Plots of Average End-to-End Delay (E2ED) in DSDV
5.6. ANALYSIS OF QUADRATIC MODELS
The responses of the Box–Behnken design experiments in Tables 3 and 4 were fed into Minitab
software and analyzed using analysis of variance (ANOVA) with 95% of confidence level.
Firstly, using DOE can provide much analytical information and statistical plots. For the sake of
brevity, these plots are not presented in this paper for all responses; however, it can be obtained
using a DOE software. Figure 4 is a screenshot from Minitab software showing an example of the
regression model and ANOVA results of ATH performance of OLSR protocol.
The p-value (P) determines which of the effects in the model are statistically significant, P is
compared to a-level of (0.05), and if the p-value is less than to 0.05 we can conclude that the
effect is significant; else we conclude that the effect is not significant. In this example, it can be
seen that the only significant terms are A, C, D, AC and DE, the other terms are not significant.
Many others plots can be extracted like residual plots; Figure 5 presents an example of four
residual plots of ROH performance of AODV protocol which are:
• Histogram of the residuals: shows global characteristics of the residuals. A long tail on one
side indicates a skewed distribution. If at least two bars are distant from the others, those
points can be considered as outliers.
• Normal probability plot of residuals: if the residuals are normally distributed, the points
should generally take a straight line, else, the normality assumption may be invalid.
• Residuals versus fitted values: on both sides of 0, this plot should form a random pattern. If
a point is far from the majority of the other points, it may be considered as an outlier.
Residuals versus order of data: represents a plot of all residuals in the order of data collection, it
can be useful to find non-random error and to check if the residuals are uncorrelated with each
other.
12. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
56
Figure 4. An example of the regression model and the ANOVA results of ATH performance of
OLSR protocol
13. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
57
Figure 5. An example of four residual plots of ROH performance of AODV protocol
Secondly, to check the quality of the obtained models many statistical measurements are shown in
Table 7: R2
, adjusted R2
, predicted R2
, lack-of-fit, P-value of regression and adequate precision.
These statistical measurements can be obtained by performing an analysis of variance of the
regression model which is a means of testing significance, quality, predictability, and adequacy of
a model.
Table 7. Statistical measurements for models’ quality and validation.
14. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
58
The adequacy of the model fits can be explained by the significance determined by the p-value
(Prob>F), when the model has a p-value <= 0,05, that means the model is significant and has 5%
probability that a calculated response using the model is due to noise. All the studied responses
have a very small p-value <= 0.001 which make all regression models significant.
The Lack-of-Fit report provides details for a test that evaluates whether the model fits the data
well; it compares the residual error to the pure error from replicated design points. When the p-
value of the lack-of-fit > 0.05 , means its non-significance. So when lack-of-fit is significant
means that the model fits the data well. As shown in Table 7 p-values of lack-of-fit of ATH and
PDF models for all protocols are >= 0.05 that the models accurately fits the data in contrary of
ROH and JIT which have a p-value of lack-of-fit < 0.05.
R2
and adjusted R2
(adjusted for the number of terms in the model) are other measures to
determine the amount of variation around the mean as explained by the given model; their values
are always between 0 and 100%. The higher the value of R2
the better the model fits the data.
However, the predicted R2
is calculated for each model in Table 7 to determine how well the
model predicts novel observations. The predicted R2
determines how much variability in the new
data the model is expected to explain [22]. The predicted R2
is always lower than the R2
and the
adjusted R2
and may even be negative. Table 7 shows that the R2
values are considerably high.
Generally, an R2
value between 70 and 100 indicates good correlation, that between 40 and 70
indicates average correlation, and that between 0 and 40 indicates low correlation.
To determine whether the obtained models can be adequately used to predict the response,
adequate precision, which is a signal-to-noise ratio, was calculated; the result should be greater
than 4 for it to be desirable [23]. All of the 18 developed models have adequate precision greater
than 4, which indicates that these models are adequate for predicting responses. In general, it can
be seen that ATH and PDF performances behaviors follow accurately quadratic pattern better
than E2ED and MHOP metrics. JIT and especially ROH metrics are less predictable and show
less quality of fitting models than all the other metrics.
5.6. CASE STUDY
This example shows how can the obtained models be used to predict ATH in OLSR, AODV, and
DSDV protocols under a given parameters. Assuming that we wish to study the effects of number
of nodes (A) on the average throughput metric under the given configuration of parameters
(number of connections B=4, data rate C=512, node velocity D=16, and pause time E=100).
Before replacing the values in different concerned models, the natural value of each parameter
should be converted to a coded one (between -1 and +1) using formula 10.
MJ =
NO (POQRO)/?
(PO RO)/?
(10)
Where, MJ, MT, T and UT correspond to the coded, natural, high, and low values of the parameter,
respectively. The low and high values of each parameter are provided in Table 1. Therefore, the
coded values of B, C, D, and E will be -0,5, -0,54, 0,55, and -0,77, respectively. The coded values
can be replaced in the corresponding equation (Equation 11 to predict ATH in OLSR, Equation
12 to predict ATH in AODV, and Equation 13 to predict ATH in DSDV) plotted in Figure 6.
6?
′
= 1437,53 + 30,23 − 10,69 ?
. . . (+U^3) (11)
6′
= 131,93 + 6,54 − 24,29 ?
. . . ( + M) (12)
6/_
′
= 1205,05 − 27,54 + 16,57 ?
. . . ( ^ M) (13)
15. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
59
Figure 6. Example: Average throughput analysis of the case study
6. CONCLUSIONS
This study shows the manner in which the response surface methodology approach can be used to
analyze and model the routing protocol performances of MANETs. The method provides more
information, clear vision, an overview and detailed analysis, and an easy way of evaluating and
comparing routing protocols and their behaviors. Eighteen empirical quadratic mathematical
models are developed using the Box–Behnken design. The quality and the adequacy of the
models are also studied and validated through statistical measures mainly based on regression and
ANOVA tests. The models can be effectively employed to analyze, optimize, and accurately
predict the six performance metrics under a given configuration of five parameters. The presented
response surface plots provide an extensive exploratory analysis and comparison of these metrics,
and give insight into the effects of various parameters. Developing models rather than conducting
traditional experimental analysis is important; various models can be exploited by a third party to
extract, analyze, or compare performances without performing additional specific experiments.
REFERENCES
[1] A. Upadhyay and R. Phatak, "Performance evaluation of aodv dsdv and olsr routing protocols with
varying ftp connections in manet," IJRCCT, vol. 2, no. 8, 2013.
[2] M. Salehi, A. Boukerche, and A. Darehshoorzadeh, "Modeling and performance evaluation of
security attacks on opportunistic routing protocols for multihop wireless networks,"Ad Hoc Networks,
vol. 50, pp. 88 - 101, 2016.
[3] K. Yamaguchi, K. Mukaiyama, T. Akiyama, T. Kobayashi, and H. Matsue, "Performance analysis of
routing methods based on olsr and aodv with traffic load balancing and qos for wi-fi mesh network,"
in 2016 International Conference on Information Networking (ICOIN). IEEE, Jan 2016, pp. 114-119.
[4] S. R. Das, R. Casta~neda, and J. Yan, "Simulation based performance evaluation of routing protocols
for mobile ad hoc networks," Mobile Networks and Applications, vol. 5, no. 3, pp. 179-189, 2000.
[5] J. Zheng and Q. Wu, "Performance modeling and analysis of the ieee 802.11p edca mechanism for
vanet," IEEE Transactions on Vehicular Technology, vol. 65, no. 4, pp. 2673-2687, April 2016.
[6] K. A. A. Omer, "The Impact of Node Misbehavior on the Performance of Routing Protocols in
Manet," International Journal of Computer Networks & Communications, vol. 8, no. 2, pp. 103-112,
Nov 2016.
[7] D. Torrieri, S. Talarico, and M. C. Valenti, "Performance comparisons of geographic routing
protocols in mobile ad hoc networks," IEEE Transactions on Communications, vol. 63, no. 11, pp.
4276-4286, Nov 2015.
16. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
60
[8] G. A. QasMarrogy, A. Y. Ali, E. S. QasMarrogy, A. H. M. Aldlawie, "Performance Analysis of
Routing Protocols and TCP Variants under HTTP and FTP Traffic in MANETs," International
Journal of Computer Networks & Communications, vol. 6, no. 6, pp. 79-96, Nov 2014.
[9] M. H. Lee, H. Mohamed, and M. Sarahintu, "Determining the effects of scenario metrics on the
performance of dynamic source routing using taguchi approach," Matematika, vol. 23, pp. 121-132,
2007.
[10] Y. Wang, D. Kaleshi, M. H. Barton, J. He, L. Li, A. Munro, and Z. Fan, "Key factor and interaction
for network performance in mobile ad hoc networks," in Wireless Pervasive Computing, 2007.
ISWPC’07. 2nd International Symposium on. IEEE, 2007, pp. 302-306.
[11] R. V. Boppana and A. Mathur, "Analysis of the dynamic source routing protocol for ad hoc
networks," in Workshop on Next Generation Wireless Networks, 2005, pp. 1-8.
[12] S. Saxena and M. Sinha, "Statistical study of performance metrics of adaptive fault tolerant
replication routing protocol for manet," International Journal on Computer Science and Engineering,
vol. 4, no. 11, p. 1804, 2012.
[13] S. Hakak, S. A. Latif, F. Anwar, and M. K. Alam, "Impact of key factors on average jitter in manet,"
in Proceedings of the 2014 First International Conference on Systems Informatics, Modelling and
Simulation, ser. SIMS ’14. Washington, DC, USA: IEEE, 2014, pp. 219-223.
[14] M. W. Totaro and D. D. Perkins, "Using statistical design of experiments for analyzing mobile ad hoc
networks," in Proceedings of the 8th ACM International Symposium on Modeling, Analysis and
Simulation of Wireless and Mobile Systems, ser. MSWiM ’05. New York, NY, USA: ACM, 2005,
pp. 159-168.
[15] K. K. Vadde, V. R. Syrotiuk, and D. C. Montgomery, "Optimizing protocol interaction using response
surface methodology," IEEE Transactions on Mobile Computing, vol. 5, no. 6, pp. 627-639, June
2006.
[16] G. Horvat, D. Sostaric, and D. Zagar, "Response surface methodology based power consumption and
rf propagation analysis and optimization on xbee wsn module," Telecommun. Syst., vol. 59, no. 4, pp.
437-452, Aug. 2015.
[17] L. Buhrer, "Simulation of a data centric routing protocol for mobile ad hoc networks," Master’s
thesis, Swiss Federal Institute of Technology (ETH) Zurich, ftp://ftp.tik.ee.ethz.ch, 3 2003.
[18] T. Clausen and P. Jacquet, "Optimized link state routing protocol (olsr)," United States, Tech. Rep.,
2003.
[19] C. E. Perkins and E. M. Royer, "Ad-hoc on-demand distance vector routing," in Mobile Computing
Systems and Applications, 1999. Proceedings. WMCSA ’99. Second IEEE Workshop on. IEEE, Feb
1999, pp. 90-100.
[20] C. E. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (dsdv)
for mobile computers," SIGCOMM Comput. Commun. Rev., vol. 24, no. 4, pp. 234-244, Oct. 1994.
[21] R. Myers, D. Montgomery, and C. Anderson-Cook, Response Surface Methodology: Process and
Product Optimization Using Designed Experiments, ser. Wiley Series in Probability and Statistics.
Wiley, 2016. [Online]. Available: https://books.google.co.in/books?id=YFSzCgAAQBAJ
[22] D. C. Montgomery, Design and analysis of experiments, 5th ed. New York / Chichester: John Wiley
& Sons, 2001.
[23] Stat-Ease, Handbook for Experimenters, Stat-Ease, Inc, T2021 East Hennepin Ave, Suite 480
Minneapolis, MN 55413, 2016.
17. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
61
AUTHORS
Mohamed Skander Daas got his engineer degree in Parallel and Distributed Systems
from the University of Mentouri Constantine, in 2007 and a Magister degree in Artificial
Intelligence and Computer Imaging from University of Oum El-Bouaghi in 2014. He is
currently a PhD candidate at the Department of Fundamental Computer Science and its
Applications and a member at SCAL team (Soft Computing and Artificial Life) of MISC
Laboratory, University of Constantine 2. He is also and Assistant Professor of computer
science at University of Brothers Mentouri - Constantine 1. His current research projects
focus on computational intelligence and mobile Ad-Hoc networks.
Salim Chikhi received his M.Sc. degree in computer systems from University Mentouri
Of Constantine, Algeria, in collaboration with Glasgow University, UK, in 1993. He
received his Ph.D. degree in computer science from University Mentouri of Constantine,
Algeria in 2005. Currently, he is a full professor at the University Constantine2, Algeria.
He is the head of MISC laboratory (Modeling and Implementation of Complex Systems)
and the leader of the SCAL team (Soft Computing and Artificial Life). His research areas
include soft computing and artificial life techniques and their applications to real life
problems, namely routing in logistics, biometry, and natural language processing.