This document compares the performance of four routing protocols (AODV, DSR, OLSR, GRP) under the security attack of node misbehavior in mobile ad hoc networks (MANETs). The document presents background information on MANETs and the four routing protocols. It then discusses two types of misbehaving nodes (partially selfish and fully selfish) that are modeled in simulations. The simulations vary the percentage of misbehaving nodes and measure performance metrics like packet delivery ratio, end-to-end delay, data dropped, and load. The results show that packet delivery ratio decreases and data dropped increases as the percentage of misbehaving nodes increases for all protocols. OLSR generally has the lowest delay while
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETijasuc
This document summarizes and compares two extended versions of the AODV routing protocol for mobile ad hoc networks (MANETs): Reverse AODV (RAODV) and Multicast AODV (MAODV). RAODV aims to improve routing performance by allowing multiple route reply messages, while MAODV allows nodes to send multicast data packets through a multicast group tree. The document outlines the key features and operations of each protocol, including route discovery processes. It then evaluates and compares the performance of RAODV and MAODV using metrics like end-to-end delay and overhead while varying the number of nodes.
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
A New Theoretical Approach to Location Based Power Aware RoutingIOSR Journals
This document proposes a new theoretical approach to location based power aware routing in mobile ad hoc networks (MANETs). It aims to extend the network lifetime by improving power utilization during routing. The approach uses nodes' location information, remaining battery power, and bandwidth status to assign link stability and select routes with lower "uptime values" and minimum bandwidth over time. This is hypothesized to better utilize nodes' power sources and bandwidth. The document outlines calculating a root up time factor for each node based on its power backup and required power, and only using nodes with maximum backup. It concludes future work will design and validate a new protocol based on this approach.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETijasuc
This document summarizes and compares two extended versions of the AODV routing protocol for mobile ad hoc networks (MANETs): Reverse AODV (RAODV) and Multicast AODV (MAODV). RAODV aims to improve routing performance by allowing multiple route reply messages, while MAODV allows nodes to send multicast data packets through a multicast group tree. The document outlines the key features and operations of each protocol, including route discovery processes. It then evaluates and compares the performance of RAODV and MAODV using metrics like end-to-end delay and overhead while varying the number of nodes.
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
A New Theoretical Approach to Location Based Power Aware RoutingIOSR Journals
This document proposes a new theoretical approach to location based power aware routing in mobile ad hoc networks (MANETs). It aims to extend the network lifetime by improving power utilization during routing. The approach uses nodes' location information, remaining battery power, and bandwidth status to assign link stability and select routes with lower "uptime values" and minimum bandwidth over time. This is hypothesized to better utilize nodes' power sources and bandwidth. The document outlines calculating a root up time factor for each node based on its power backup and required power, and only using nodes with maximum backup. It concludes future work will design and validate a new protocol based on this approach.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
International Journal of Pharmaceutical Science Invention (IJPSI)inventionjournals
International Journal of Pharmaceutical Science Invention (IJPSI) is an international journal intended for professionals and researchers in all fields of Pahrmaceutical Science. IJPSI publishes research articles and reviews within the whole field Pharmacy and Pharmaceutical Science, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and speed.
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document summarizes a simulation-based performance analysis of three routing protocols (CBRP, DSR, AODV) for mobile ad hoc networks (MANETs) under different node densities. The analysis varies the number of data sources and evaluates the protocols based on packet delivery ratio, average end-to-end delay, and normalized routing load. The simulation is conducted using the NS-2 network simulator for dense and sparse network topologies with 50 nodes each, varying node speeds and transmission ranges. Results show that CBRP performs better than DSR and AODV in terms of normalized routing load for more than 15 sources in both dense and sparse topologies, while AODV has lower delay than CBR
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...ijasuc
This document analyzes the performance of two reactive MANET routing protocols, DSR and DSDV, under TCP Vegas and TCP Newreno variants through simulations. The simulations measured packet delivery ratio, average end-to-end delay, and total packets dropped. The results showed that DSDV generally had a higher packet delivery ratio but also higher end-to-end delay and more packet drops compared to DSR. DSR performed better in terms of delay and drops due to its on-demand route discovery, while DSDV maintained more consistent routes leading to better packet delivery.
This document summarizes research on load balancing techniques for congestion control in mobile ad hoc networks (MANETs). It first provides background on MANETs and issues like limited bandwidth. It then reviews literature on multipath routing and load balancing, categorizing approaches based on metrics like available bandwidth. The document proposes using acknowledgement times to estimate available bandwidth and distribute traffic to avoid congestion across multiple paths. By adapting sending rates based on estimated available bandwidth, this could minimize congestion in the network.
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
This document provides an introduction and overview of a dissertation submitted by Rachna to partially fulfill the requirements for a Master of Technology degree in Computer Science and Engineering. The dissertation focuses on improving the route discovery phase in multi-path Dynamic Source Routing (DSR) for mobile ad-hoc networks using a hybrid ant colony optimization approach. Key topics covered in the introductory chapters include an introduction to mobile ad-hoc networks, categories of ad-hoc routing protocols including DSR and AODV, characteristics and design challenges of MANETs, and concepts related to route discovery and maintenance in DSR.
Experimental Analysis Of On Demand Routing Protocolsmita gupta
The document discusses experimental analysis of on-demand routing protocols for mobile ad hoc networks. It provides an outline and introduces key terminologies for multi-hop networks, protocols, routers, hubs, switches, and network topologies. The literature review summarizes several research papers that analyze routing protocols like AODV, DSR, and DSDV using simulation tools to evaluate metrics such as packet delivery ratio, end-to-end delay, and network throughput under different mobility conditions. The problem statement indicates the document will experimentally analyze and compare the performance of on-demand routing protocols.
This document summarizes a research paper that examines the performance of three mobile ad hoc network (MANET) routing protocols: AODV, DSR, and DSDV. Through network simulations varying the number of nodes and connections, the paper evaluates the routing protocols based on average end-to-end delay, normalized routing load, packet delivery fraction, and throughput. The simulation results show that AODV generally has better performance than DSR and DSDV in terms of lower delay, higher packet delivery, and better throughput, especially as the network size increases. However, DSDV maintains more consistent performance than the reactive protocols as network conditions change.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node mobility.
A method of evaluating effect of qo s degradation on multidimensional qoe of ...IJCNCJournal
This paper studies a method of investigating effect of IP performance (QoS) degradation on quality of experience (QoE) for a Web service; it considers the usability based on the ISO 9241-11 as multidimensional QoE of a Web service (QoE-Web) and the QoS parameters standardized by the IETF. Moreover, the paper tackles clarification of the relationship between ISO-based QoE-Web and IETF-based QoS by the multiple regression analysis. The experiment is intended for the two actual Japanese online shopping services and utilizes 35 subjects. From the results, the paper quantitatively discusses how the QoE-Web deteriorates owing to the QoS degradation and shows that it is appropriate to evaluate the proposed method
Evaluation of scalability and bandwidthIJCNCJournal
Multi-Point to Multi-Point Traffic Engineering (MP2MP-TE) leads to an important scalability in Multi
Protocol Label Switching-Traffic Engineering (MPLS-TE) networks. This paper emphasizes on the support
of Fast-reroute (FRR) in MPLS-TE networks by using MP2MP bypass TE-tunnels. Hence, one MP2MP
bypass TE-tunnel can be used to protect several primary TE-tunnels. During failure, the primary TE-tunnel
is encapsulated into the MP2MP bypass TE-tunnel which calls for defining a new type of MPLS hierarchy,
i.e. the multipoint to multipoint hierarchy. In this paper we present a simulation study that evaluates
several fast rerouting scenarios depending on the number of leaves of a MP2MP bypass TE-tunnel and on
the number of primary TE-tunnels that can be encapsulated into one MP2MP bypass TE-tunnel. In
particular, the scalability/bandwidth efficiency tradeoff between these schemes is analyzed and valuable
comparisons with the existing approaches are presented.
Adhoc mobile wireless network enhancement based on cisco devicesIJCNCJournal
This document discusses enhancing the performance of ad hoc wireless networks using Cisco devices. It proposes using Cisco routers and access points to create a three-layer ad hoc network with endpoints, intermediate coordinators, and a core router layer for improved processing, reliability, cost, power consumption, and accessibility. It then outlines various protocols and configurations that could be implemented using Cisco devices, including NAT, ACLs, DHCP, and wireless security settings. Diagrams and tables show an example network topology and device IP addresses and configurations.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
International Journal of Pharmaceutical Science Invention (IJPSI)inventionjournals
International Journal of Pharmaceutical Science Invention (IJPSI) is an international journal intended for professionals and researchers in all fields of Pahrmaceutical Science. IJPSI publishes research articles and reviews within the whole field Pharmacy and Pharmaceutical Science, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and speed.
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document summarizes a simulation-based performance analysis of three routing protocols (CBRP, DSR, AODV) for mobile ad hoc networks (MANETs) under different node densities. The analysis varies the number of data sources and evaluates the protocols based on packet delivery ratio, average end-to-end delay, and normalized routing load. The simulation is conducted using the NS-2 network simulator for dense and sparse network topologies with 50 nodes each, varying node speeds and transmission ranges. Results show that CBRP performs better than DSR and AODV in terms of normalized routing load for more than 15 sources in both dense and sparse topologies, while AODV has lower delay than CBR
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...ijasuc
This document analyzes the performance of two reactive MANET routing protocols, DSR and DSDV, under TCP Vegas and TCP Newreno variants through simulations. The simulations measured packet delivery ratio, average end-to-end delay, and total packets dropped. The results showed that DSDV generally had a higher packet delivery ratio but also higher end-to-end delay and more packet drops compared to DSR. DSR performed better in terms of delay and drops due to its on-demand route discovery, while DSDV maintained more consistent routes leading to better packet delivery.
This document summarizes research on load balancing techniques for congestion control in mobile ad hoc networks (MANETs). It first provides background on MANETs and issues like limited bandwidth. It then reviews literature on multipath routing and load balancing, categorizing approaches based on metrics like available bandwidth. The document proposes using acknowledgement times to estimate available bandwidth and distribute traffic to avoid congestion across multiple paths. By adapting sending rates based on estimated available bandwidth, this could minimize congestion in the network.
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
This document provides an introduction and overview of a dissertation submitted by Rachna to partially fulfill the requirements for a Master of Technology degree in Computer Science and Engineering. The dissertation focuses on improving the route discovery phase in multi-path Dynamic Source Routing (DSR) for mobile ad-hoc networks using a hybrid ant colony optimization approach. Key topics covered in the introductory chapters include an introduction to mobile ad-hoc networks, categories of ad-hoc routing protocols including DSR and AODV, characteristics and design challenges of MANETs, and concepts related to route discovery and maintenance in DSR.
Experimental Analysis Of On Demand Routing Protocolsmita gupta
The document discusses experimental analysis of on-demand routing protocols for mobile ad hoc networks. It provides an outline and introduces key terminologies for multi-hop networks, protocols, routers, hubs, switches, and network topologies. The literature review summarizes several research papers that analyze routing protocols like AODV, DSR, and DSDV using simulation tools to evaluate metrics such as packet delivery ratio, end-to-end delay, and network throughput under different mobility conditions. The problem statement indicates the document will experimentally analyze and compare the performance of on-demand routing protocols.
This document summarizes a research paper that examines the performance of three mobile ad hoc network (MANET) routing protocols: AODV, DSR, and DSDV. Through network simulations varying the number of nodes and connections, the paper evaluates the routing protocols based on average end-to-end delay, normalized routing load, packet delivery fraction, and throughput. The simulation results show that AODV generally has better performance than DSR and DSDV in terms of lower delay, higher packet delivery, and better throughput, especially as the network size increases. However, DSDV maintains more consistent performance than the reactive protocols as network conditions change.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node mobility.
A method of evaluating effect of qo s degradation on multidimensional qoe of ...IJCNCJournal
This paper studies a method of investigating effect of IP performance (QoS) degradation on quality of experience (QoE) for a Web service; it considers the usability based on the ISO 9241-11 as multidimensional QoE of a Web service (QoE-Web) and the QoS parameters standardized by the IETF. Moreover, the paper tackles clarification of the relationship between ISO-based QoE-Web and IETF-based QoS by the multiple regression analysis. The experiment is intended for the two actual Japanese online shopping services and utilizes 35 subjects. From the results, the paper quantitatively discusses how the QoE-Web deteriorates owing to the QoS degradation and shows that it is appropriate to evaluate the proposed method
Evaluation of scalability and bandwidthIJCNCJournal
Multi-Point to Multi-Point Traffic Engineering (MP2MP-TE) leads to an important scalability in Multi
Protocol Label Switching-Traffic Engineering (MPLS-TE) networks. This paper emphasizes on the support
of Fast-reroute (FRR) in MPLS-TE networks by using MP2MP bypass TE-tunnels. Hence, one MP2MP
bypass TE-tunnel can be used to protect several primary TE-tunnels. During failure, the primary TE-tunnel
is encapsulated into the MP2MP bypass TE-tunnel which calls for defining a new type of MPLS hierarchy,
i.e. the multipoint to multipoint hierarchy. In this paper we present a simulation study that evaluates
several fast rerouting scenarios depending on the number of leaves of a MP2MP bypass TE-tunnel and on
the number of primary TE-tunnels that can be encapsulated into one MP2MP bypass TE-tunnel. In
particular, the scalability/bandwidth efficiency tradeoff between these schemes is analyzed and valuable
comparisons with the existing approaches are presented.
Adhoc mobile wireless network enhancement based on cisco devicesIJCNCJournal
This document discusses enhancing the performance of ad hoc wireless networks using Cisco devices. It proposes using Cisco routers and access points to create a three-layer ad hoc network with endpoints, intermediate coordinators, and a core router layer for improved processing, reliability, cost, power consumption, and accessibility. It then outlines various protocols and configurations that could be implemented using Cisco devices, including NAT, ACLs, DHCP, and wireless security settings. Diagrams and tables show an example network topology and device IP addresses and configurations.
Energy efficient clustering in heterogeneousIJCNCJournal
Cluster head election is a key technique used to reduce energy consumption and enhancing the throughput
of wireless sensor networks. In this paper, a new energy efficient clustering (E2C) protocol for
heterogeneous wireless sensor networks is proposed. Cluster head is elected based on the predicted
residual energy of sensors, optimal probability of a sensor to become a cluster head, and its degree of
connectivity as the parameters. The probability threshold to compete for the role of cluster head is derived.
The probability threshold has been extended for multi-levels energy heterogeneity in the network. The
proposed E2C protocol is simulated in MATLAB. Results obtained in the simulationshowthat performance
of the proposed E2Cprotocol is betterthan stable election protocol (SEP), and distributed energy efficient
clustering (DEEC) protocol in terms of energy consumption, throughput, and network lifetime.
The improvement of end to end delays in network management system using netwo...IJCNCJournal
The document summarizes research on improving end-to-end delays in a network management system using network coding. Specifically, it applies network coding to manage radio and television broadcast stations in a wireless network. The study shows that a proposed "Fast Forwarding Strategy" using network coding outperforms a classical routing strategy in reducing end-to-end delays from source to destination. It analyzes end-to-end delays theoretically using network calculus and conducts a practical study on a network of broadcast stations, finding the proposed strategy reduces delays compared to the classical strategy.
This document summarizes a research paper that proposes a new algorithm for calculating TCP timeout over wireless ad hoc networks. The current TCP timeout calculation does not adapt well to the unstable nature of wireless networks where factors like node mobility can cause estimated round trip times to vary greatly. The proposed algorithm aims to make timeout calculation more adaptive to network conditions in wireless ad hoc networks to improve TCP performance and quality of service for real-time multimedia applications. It describes challenges with existing TCP timeout approaches over wireless networks and reviews related literature before introducing the novel algorithm developed and tested through simulation.
Concepts and evolution of research in the field of wireless sensor networksIJCNCJournal
This document provides a comprehensive review of research in the field of wireless sensor networks (WSNs). It begins with an introduction to WSNs and discusses sensor nodes, network architectures, communication protocols, applications, and open research issues. It then reviews several related surveys that focus on specific aspects of WSNs such as applications, energy consumption techniques, security protocols, and testbeds. The document aims to provide an overview of all aspects of WSN research and identify promising directions like bio-inspired solutions. It discusses sensors and network types, architectures and services, and challenges like fault tolerance.
A Mobile Ad-Hoc Network (MANET) is a self configuring, infrastructure less network of mobile devices
connected by wireless links. Loopholes like wireless medium, lack of a fixed infrastructure, dynamic
topology, rapid deployment practices, and the hostile environments in which they may be deployed, make
MANET vulnerable to a wide range of security attacks and Wormhole attack is one of them. During this
attack a malicious node captures packets from one location in the network, and tunnels them to another
colluding malicious node at a distant point, which replays them locally. This paper presents a cluster based
Wormhole attack avoidance technique. The concept of hierarchical clustering with a novel hierarchical 32-
bit node addressing scheme is used for avoiding the attacking path during the route discovery phase of the
DSR protocol, which is considered as the under lying routing protocol. Pinpointing the location of the
wormhole nodes in the case of exposed attack is also given by using this method.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
A novel secure e contents system for multi-media interchange workflows in e-l...IJCNCJournal
The goal of e-learning is to benefit from the capabilities offered by new information technology (such as
remote digital communications, multimedia, internet, cell phones, teleconferences, etc.) and to enhance the
security of several government organizations so as to take into considerations almost all the contents of elearning
such as: information content, covering most of citizens or state firms or corporations queries.
Content provides a service to provide most if not all basic and business services; content of communicative
link provides the citizen and the state agencies together all the time and provides content security for all
workers on this network to work in securely environment. Access to information as well is safeguarded. The
main objective of this research is to build a novel multi-media security system (encrypting / decrypting
system) that will enable E-learning to exchange more secured multi-media data/information.
Distributed firewalls and ids interoperability checking based on a formal app...IJCNCJournal
To supervise and guarantee a network security, the administrator uses different security components, such
as firewalls, IDS and IPS. For a perfect interoperability between these components, they must be
configured properly to avoid misconfiguration between them. Nevertheless, the existence of a set of
anomalies between filtering rules and alerting rules, particularly in distributed multi-component
architectures is very likely to degrade the network security. The main objective of this paper is to check if a
set of security components are interoperable. A case study using a firewall and an IDS as examples will
illustrate the usefulness of our approach.
Infrastructure of services for a smart cityIJCNCJournal
Sustainability, appropriate use of natural resources and providing a better quality of life for citizens has become a prerequisite to change the traditional concept of a smart city. A smart city needs to use latest generation Information Technologies, IT, and hardware to improve services and data, to offer to create a balanced environment between the ecosystem and inhabitants. This paper analyses the advantages of using a private cloud architecture to share hardware and software resources when it is required. Our case study is Guadalajara, which has nine municipalities and each one monitor’s air quality. Each municipality has a set of servers to process information independently and consists of information systems for the transmission and storage of data with other municipalities. We analysed the behaviour of the carbon footprint during the years1999-2013 and we observed a pattern in each season. Thus our proposal requires municipalities to use a cloud-based solution that allows managing and consolidating infrastructure to minimize maintenance costs and electricity consumption to reduce carbon footprint generated by the city.
Regressive admission control enabled by real time qos measurementsIJCNCJournal
We propose a novel regressive principle to Admission Control (AC) assisted by real-time passive QoS
monitoring. This measurement-based AC scheme acceptsflows by default, but based on the changes in the
network QoS, it makes regressive decisions on the possible flow rejection, thus bringing cognition to the
network path. TheREgressive Admission Control (REAC) system consists of three modules performing the
necessary tasks:QoS measurements, traffic identification, and the actual AC decision making and flow
control. There are two major advantages with this new scheme; (i) significant optimization of the
connection start-up phase, and (ii) continuous QoS knowledge of the accepted streams. In fact, the latter
combined with the REAC decisions can enable guaranteed QoS without requiring any QoS support from
the network. REAC was tested on a video streaming test bed and proved to have a timely and realistic
match between the network's QoS and the video quality.
Managing, searching, and accessing iot devicesIJCNCJournal
In this paper a new method is proposed for management of REST-based services acting as proxies for Internet-of-Things devices. The method is based on a novel way of monitoring REST resources by hierarchical set of directories, with the possibility of smart searching for “the best” device according to atthe- place devices’ availability and functionality, overall context (including geo-location), and personal preferences. The system is resistant to changes of network addresses of the devices and their services, as well as core system points such as directories. Thus, we successfully deal with the problem of
(dis)connectivity and mobility of network nodes, and the problem of a “newcomer” device trying to connect
to the network at an incidental place/time.
Main novelty of the approach is a summary of three basic achievements. Firstly, the system introduces
unifying tools for efficient monitoring. On one hand, we may control an availability and load (statistics) of
devices/services. On the other hand, we are able to search for “the best” device/service with different criteria, also formulated ad-hoc and personalized. Secondly, the system is resistant to sudden changes of network topology and connections (basically IP addressing), and frequent disconnections of any system element, including core nodes such as central directories. As a result, we may have a common view to the whole system at any time/place and with respect to its current state, even if the elements of the system are distributed across a wider area. Thirdly, any element of the system, from simple devices to global directories, is able to self-adjust to evolving parameters of the environment (including other devices as a part of this environment). In particular, it is possible for a mobile “newcomer” device to interact with the system at any place and time without a need for prior installation, re-programming, determination of
actual parameters, etc. The presented approach is a coherent all-in-one solution to basic problems related
with efficient usage of IoT devices and services, well suited to the hardware- and software-restricted world
of Internet of Things and Services. Fully implemented, the system is now being applied for an “intelligent”
home and workplace with user-centric e-comfort management.
COST-EFFICIENT RESIDENTIAL ENERGY MANAGEMENT SCHEME FOR INFORMATION-CENTRIC N...IJCNCJournal
Home network (HOMENET) performs multiple important functions such as energy management,
multimedia sharing, lighting and climate control in smart grid (SG). In HOMENET there are numerous
challenges among which mobility and security are the basic requirements that need to be addressed with
priority. The information-centric networking (ICN) is regarded as the future Internet that subscribes data
in a content-centric manner irrespective of its location. Furthermore, it has pecial merit in mobility and
security since ICN supports in-network caching and self-contained security, these make ICN a potential
solution for home communication fabric. This paper aims to apply the ICN approach on HOMENET
system, which we called ICN-HOMENET. Then, a proof-of-concept evaluation is employed to evaluate the
effectiveness of the proposed ICN-HOMENET approach in data security, device mobility and efficient
content distribution for developing HOMENET system in SG. In addition, we proposed a cost-efficient
residential energy management (REM) scheme called ICN-REM scheme for ICN-HOMENET system which
encourages consumers to shift the start time of appliances from peak hours to off-peak hours to reduce the
energy bills. To the best of our knowledge, this is the first attempt to propose an ICN-based REM scheme
for HOMENET system. In this proposal, we not only consider the conflicting requests from appliances and
domestic power generation, but also think the energy management unit (EMU) should cooperate with
measurement sensors to control some specific appliances in some specific conditions. Moreover, the
corresponding performance evaluation validates its correctness and effectiveness.
AN OPTIMAL FUZZY LOGIC SYSTEM FOR A NONLINEAR DYNAMIC SYSTEM USING A FUZZY BA...IJCNCJournal
The impetus for this paper is the development of Fuzzy Basis Function “FBF” that assigns in an optimal fashion, a function approximation for a nonlinear dynamic system. A fuzzy basis function is applied to find the best location of the characteristic points by specifying the set of fuzzy rules. The advantage of this technique is that, it may produce a simple and well-performing system because it selects the most significant fuzzy basis functions to minimize an objective function in the output error for the fuzzy rules. The fuzzy basis function is a linguistic fuzzy IF_THEN rule. It provides a combination of the numerical information and the linguistic information in the form input-output pairs and in the form of fuzzy rules. The proposed control scheme is applied to a magnetic ball suspension system.
In the last decade Peer to Peer technology has been thoroughly explored, becauseit overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
In this paper we present algorithms for the construction and the maintenance of a hybrid P2P overlay multicast tree based on topological distances. The essential idea of these algorithms is to build a multicast tree by choosing neighbours close to each other. The topological distances can be easily obtained by the browser using the geolocation API. Thus the implementation of algorithms can be done web-based in a distributed manner.
We present proofs of our algorithms as well as experimental results and evaluations.
Performance comparison of coded and uncoded ieee 802.16 d systems under stanf...IJCNCJournal
Worldwide Interoperability for Microwave Access (WiMax), standardized asIEEE 802.16d is a popular
technology for broadband wireless communication system. Orthogonal Frequency Division Multiplexing
(OFDM) is the core of this technology.OFDMreduces Inter-symbol Interference (ISI) and hence improves
system performance (i.e., Bit Error Rate (BER)). To improve system performance further error correction
coding schemes have been included in WiMax. It is widely accepted thata coded system outperforms an
uncodedsystem. But, the performance improvement of a coded system depends on the channel conditions. In
this paper, we investigated and compared the performances of a coded and an uncoded WiMaxsystem
under a practical channel model called Stanford University Interim (SUI). Different modulation schemes
namely BPSK, QPSK, 16-QAM, and 64-QAM have been considered in this work. It is shown that the
selection of codedoruncoded WiMaxsystem should depend on the channel condition as well as on the
modulation used. It is also shown that anuncoded system outperforms a coded system under some channel
conditions.
Priority scheduling for multipath video transmission in wmsnsIJCNCJournal
This document proposes a priority scheduling mechanism for multipath video transmission over wireless multimedia sensor networks (WMSNs). It assigns different priorities to different types of video frames (I, P, B frames) and schedules them over multiple paths based on path conditions. Higher priority I and P frames are scheduled along higher quality paths. It divides node buffers into queues and uses round-robin scheduling between the queues based on frame type to prioritize transmission of higher priority frames. Path scores are calculated based on metrics like bandwidth, delay and energy to identify highest quality paths for important video packets. Simulation results show this approach improves video quality at the receiver.
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...IOSR Journals
This document analyzes the performance of the AODV, DSR, and IERP routing protocols in a mobile ad hoc network (MANET) with varying constant bit rate (CBR) traffic loads. It conducts simulations in QualNet 6.1 and evaluates the protocols based on average end-to-end delay, throughput, average jitter, and packet delivery ratio under different CBR values. The results show that AODV generally performs best with low and stable delay, jitter and high throughput and delivery ratio. DSR has better performance than IERP for throughput and delivery ratio. IERP shows the worst performance for delay and jitter as CBR increases. The document concludes by stating AODV is best overall but
The document evaluates the performance of 5 routing protocols (AODV, DSR, TORA, OLSR, GRP) in a mobile ad hoc network (MANET) using the OPNET simulator. Simulations were run with 30, 60, and 90 nodes using email and video conferencing applications. Performance was analyzed based on throughput, delay, load, and data dropped. In general, GRP and OLSR had the lowest delay, DSR and GRP had the lowest load, and OLSR and AODV had the highest throughput, while TORA often had the worst performance based on the metrics. The evaluation provides insights into the relative performance of the routing protocols under different conditions in a MANET
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
This document compares the performance of five routing protocols (AODV, DSR, DSDV, OLSR, DYMO) in mobile ad hoc networks through simulations. It describes the key characteristics and mechanisms of each protocol. Simulations are conducted in the NS-2 simulator using the random waypoint mobility model. Performance is evaluated under varying pause times based on four metrics: packet delivery ratio, average end-to-end delay, normalized routing load, and average throughput. The results aim to determine the best operational conditions for each protocol.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
This document compares the performance of five routing protocols (AODV, DSR, DSDV, OLSR, DYMO) in mobile ad hoc networks through simulations. It summarizes each protocol and discusses the simulation setup. The protocols are categorized as reactive, proactive, or hybrid. Key performance metrics like packet delivery ratio, end-to-end delay, and routing load are evaluated under varying pause times using the NS-2 simulator. The analysis seeks to determine the best operational conditions for each protocol in mobile ad hoc networks.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
In this paper, we proposed a replacement hybrid multipath routing protocol for
MANET known as Hybrid Multipath Progressive Routing Protocol for MANET (HMPRP),
during this work we improve the performance of accepted MANET routing protocols,
namely, the Ad-hoc On-demand Distance Vector routing protocol and use of their most
popular properties to formulate a replacement Hybrid routing protocol using the received
signal strength. The proposed routing protocol optimizes the information measure usage of
MANETs by reducing the routing overload and overhead. This proposed routing protocol
additionally extends the battery lifetime of the mobile devices by reducing the specified
variety of operations for (i) Route determination (ii) for packet forwarding. Simulation
results are used to draw conclusions regarding the proposed routing algorithm and
compared it with the AODV, OLSR, and ZRP protocol. Experiments carried out based on
this proposed algorithm, shows that better performance are achieved with regard to AODV,
OLSR, and ZRP routing algorithm in terms of packet delivery ratio, throughput, energy
consumed and end-to-end packet delay.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
This document summarizes a research paper that proposes a new hybrid multipath routing protocol for mobile ad hoc networks called Hybrid Multipath Progressive Routing Protocol (HMPRP). It improves upon existing routing protocols like AODV and OLSR by utilizing multiple paths based on received signal strength to increase packet delivery and reduce overhead. Simulation results showed the proposed protocol achieved better performance than AODV, OLSR and ZRP in terms of packet delivery ratio, throughput, energy consumption and delay.
An Effective and Scalable AODV for Wireless Ad hoc Sensor Networksijcnes
Appropriate routing protocol in data transfer is a challenging problem of network in terms of lower end-to-end delay in delivery of data packets with improving packet delivery ratio and lower overhead as well. In this paper we explain an effective and scalable AODV (called as AODV-ES) for Wireless Ad hoc Sensor Networks (WASN) by using third party reply model, n-hop local ring and time-to-live based local recovery. Our goal is to reduce time delay for delivery of the data packets, routing overhead and improve the data packet delivery ratio. The resulting algorithm AODV-ES is then simulated by NS-2 under Linux operating system. The performance of routing protocol is evaluated under various mobility rates and found that the proposed routing protocol is better than AODV.
Survey of Modified Routing Protocols for Mobile Ad-hoc Networkijsrd.com
In last few years extensive research work has been done in the field of routing protocols for Ad-hoc Network. Various routing protocols have been evaluated in different network conditions using different performance metrics. A lot of research has been done how to modify standard routing protocol in ad-hoc network to improve its performance. The hop count is not only metric that gives efficient routing path. There are various modified protocols which make the use of other parameters along with hop count to select the best routing path to the destination. In standard Ad-hoc On-demand Distance Vector (AODV) routing protocol only hop count is used for selecting the routing path. In this paper we have studied variants of AODV protocols with modified routing metric.
Optimised Proactive Link State Routing For DOS Attack PreventionEditor IJCATR
A Mobile Ad hoc Network is a collection of independent mobile nodes that can communicate to each other via radio waves. The mobile nodes that are in radio range of each other can directly communicate, whereas others need the aid of intermediate nodes to route their packets. Each node has a wireless interface to communicate with each other. These networks are fully distributed, and can work at any place without the help of any fixed infrastructure as access points or base stations. Routing protocols are divided into two broad classes – Reactive and Proactive. In Reactive or on demand routing protocols the routes are created only when they are needed. The application of this protocol can be seen in the Dynamic Source Routing Protocol (DSR) and the Ad-hoc On-demand Distance Vector Routing Protocol (AODV). Wherein Proactive or Table-driven routing protocols the nodes keep updating their routing tables by periodical messages. OPSR proposes a proactive mechanism in source routing.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
On the routing overhead in infrastructureless multihop wireless networksNarendra Singh Yadav
Routing in infrastructureless multihop wireless networks is a challenging task and has received a vast amount of attention from researchers. This has lead to development of many different routing protocols each having their own superiorities and pitfalls making it very difficult to decide on a better protocol under vulnerable scenarios in such networks. In this paper the performance of three routing protocols (DSR, AODV and CBRP) in terms of routing overhead in bytes and in packets is presented under growing density and varying mobility in different traffic conditions. The simulation results show that CBRP outperforms both DSR and AODV in all scenarios.
This document summarizes a review article about energy efficient routing protocols in mobile ad hoc networks (MANETs). It discusses how MANETs use multi-hop wireless connections between mobile nodes without a fixed infrastructure. It then reviews several prominent routing protocols for MANETs, including reactive protocols like AODV and DSR, proactive protocols like DSDV and OLSR, and a hybrid protocol. Finally, it proposes a new energy-efficient clustering-based routing algorithm that selects cluster heads based on node mobility and battery power to improve path efficiency and stability in MANETs.
Performance Observation of Proactive and Reactive Routing Protocols with Incr...Computer Science Journals
Mobile Ad-hoc network (MANET) is type of wireless network in which group of mobile nodes co-operate to forward the data packets to their neighbours without using centralized authority or any physical medium like cables or base station.
Experiment of Routing Protocol AODV (AdHoc On-demand Distance Vector)IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Performance analysis of aodv, olsr, grp and dsr routing protocols with databa...eSAT Journals
Abstract
Wireless Technology has an enormous use these days and is still becoming popular from times immemorial. It is at its peak when we
talk about research. This is because of the latest technological demands now days arising from Laptops, Wireless devices such as
Wireless local area networks (WLANs) etc. Because of its fast growing popularity day by day, it has led wireless technology data rates
higher and it has made its price cheaper, which is why wireless Technology is growing so fast. In this paper we have presented some
most commonly used routing protocols in MANET and compared the performance of AODV, OLSR, GRP and DSR routing protocol
by using OPNET simulator 14.5. The performance is evaluated under different parameters like Delay, Load, and Media access delay,
Network Load, Retransmission and Throughput for Database load.
Keywords— MANET, Peak Value, Protocol, Drop value
Similar a THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANET (20)
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.
April 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.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
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.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
International Conference on NLP, Artificial Intelligence, Machine Learning an...gerogepatton
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
UNLOCKING HEALTHCARE 4.0: NAVIGATING CRITICAL SUCCESS FACTORS FOR EFFECTIVE I...amsjournal
The Fourth Industrial Revolution is transforming industries, including healthcare, by integrating digital,
physical, and biological technologies. This study examines the integration of 4.0 technologies into
healthcare, identifying success factors and challenges through interviews with 70 stakeholders from 33
countries. Healthcare is evolving significantly, with varied objectives across nations aiming to improve
population health. The study explores stakeholders' perceptions on critical success factors, identifying
challenges such as insufficiently trained personnel, organizational silos, and structural barriers to data
exchange. Facilitators for integration include cost reduction initiatives and interoperability policies.
Technologies like IoT, Big Data, AI, Machine Learning, and robotics enhance diagnostics, treatment
precision, and real-time monitoring, reducing errors and optimizing resource utilization. Automation
improves employee satisfaction and patient care, while Blockchain and telemedicine drive cost reductions.
Successful integration requires skilled professionals and supportive policies, promising efficient resource
use, lower error rates, and accelerated processes, leading to optimized global healthcare outcomes.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANET
1. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
DOI : 10.5121/ijcnc.2016.8209 103
THE IMPACT OF NODE MISBEHAVIOR ON THE
PERFORMANCE OF ROUTING PROTOCOLS IN
MANET
Khaled Ahmed Abood Omer
Computer Science and Engineering Department, Faculty of Engineering/ University of
Aden, Yemen
ABSTRACT
MANET is a cooperative wireless network in which mobile nodes are responsible for routing and
forwarding packets from and to other nodes. Noncooperation is a challenge that definitely degrades the
performance of MANET. A misbehaving or selfish node may make use of other nodes in the network, but
decline to share its own resources with them. These selfish nodes may severely affect the performance of
routing protocols in MANET.
In this paper, we compare the performance of four routing protocols under security attack of node
misbehavior in MANET. We investigate AODV and DSR reactive routing protocols and OLSR and GRP
proactive routing protocols using Riverbed Modeler simulator. The performance comparison is carried out
using two types of misbehaving nodes. The metrics used are End-to-End delay, Packet Delivery Ratio, Data
dropped and the Load. The experimental results show that AODV routing protocol performs better than the
other routing protocols with higher packet delivery ratio. Further, OLSR routing protocol outperforms the
other routing protocols with minimum End-to-End delay.
KEYWORDS
AODV, DSR, GRP , OLSR, Selfish Nodes, MANET.
1. INTRODUCTION
Mobile Ad Hoc Networks (MANETs) are wireless networks without a predefined infrastructure,
such that the nodes can communicate with each other directly without the requirement of support
station. MANET consists of mobile wireless nodes that move randomly and form dynamic
topologies. MANET is an autonomous system where each node operates as an end system and
also as a router to forward packets from source node to destination node in the network. Therefore
routing and network management are done cooperatively by all the nodes in the network.
MANET networks are considered as challenging networks for communication due to its limited
resources and many changes in the network topology.
Routing protocols used in MANETS are classified into three categories named as proactive or
table driven, reactive or on demand and hybrid routing protocols. These routing protocols are
designed such that all nodes participate willingly to forward data and control packets among the
nodes in the network [1, 2].
Due to lack of a defined central authority in MANET networks, then securing the routing process
becomes a challenging task thus leaving MANETs vulnerable to attacks. Further, the nature of the
open structure and narrowly available battery-based energy, node misbehaviors may exist. A
2. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
104
misbehaving or selfish nodes may attempt to benefit from resources of other nodes, but refuse to
share its own resources. However, the existence of misbehaving or selfish nodes in the network,
may result in decreasing the network performance significantly [3].
This paper is organized as follows: In section 2, related work about routing protocols and
misbehaving nodes are discussed. Section 3 includes simulation environment. Section 4 describes
results and discussions. Finally the findings of the work are concluded in section 5.
2. ROUTING PROTOCOLS AND MISBEHAVING NODES
Routing protocols used in MANETS are classified into three categories named as proactive,
reactive and hybrid routing protocols. Proactive or table driven routing protocols such as
Optimized Link State Routing (OLSR) and Geographic Routing Protocol (GRP) protocols. In
these routing protocols, the routes to all the nodes are maintained in routing table. Packets are
sent over a predefined route specified in the routing table. Reactive or on-demand routing
protocol such as Dynamic Source Routing (DSR) and Ad Hoc On Demand Distance Vector
(AODV). In these routing protocols, the routes are not predefined for routing. A source node
initiates route discovery phase to find a new route whenever there are packets to be sent to
destination. The grouping of proactive and reactive approaches results in hybrid routing protocols
such as Zone Routing Protocol (ZRP) [1, 2, 4]. In this paper, we consider AODV, DSR, OLSR,
and GRP routing protocols for further investigation under misbehaving or selfish node security
attacks.
2.1 Routing Protocols
Ad-hoc On Demand Distance Vector (AODV) is a reactive routing protocol where the routes are
discovered only on demand when there is a need to send packets to destination nodes [5]. The
routing table is used to store the information about the next hop to the destination and a sequence
number received from the destination which indicates the received information is updated. The
information about the active neighboring nodes is received during the discovery of the
destination. The route discovery is achieved by broadcasting the RREQ message to the neighbors
with the requested destination sequence number, which prevents the old information from being
sent back to the request and also prevents looping problem. Passed nodes update their own
routing table about the requested node. Therefore, the path that identifies the route is recorded in
the routing table of the intermediate nodes. The destination node creates the route reply by using
RREP message to be sent back to the source. The source starts sending the packets to the
destination after receiving the route reply message. When the corresponding route breaks, then
the route error RERR message is used to inform the neighbors.
Dynamic Source Routing (DSR) is a reactive routing protocol that uses the concept of source
routing [6]. In source routing the source knows complete hop-by-hop route to the destination. In
this protocol, every node possess route cache to store recently discovered path such that route
entries are continuously updated. When a source desires to send packets to destination, it first
checks for the path in the cache. If the path is present, then the source attaches its source address
to the packet and uses that path to transmit the packet. If the path is not available or expired, then
the source node initiates route discovery by flooding RREQ packet to its neighbors asking for a
path to destination. Each node appends its own address when forwarding RREQ. As the route
request packet arrives to any of the nodes, the node checks its neighbors or its cache about the
destination. The node sends back RREP packet to source if route information is known, otherwise
the node broadcasts RREQ packet to its neighbors. Once route is discovered, then data packets
are sent from source to destination and this route is stored in the cache for future use. The
destination node sends RREP packet on receiving the first RREQ packet on the route obtained by
3. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
105
reversing the RREQ path. All routes used are assured to be free of loops since the source node
can avoid duplicate hops in the selected routes.
Optimized Link State Routing (OLSR) is a proactive routing protocol, so the routes are always
immediately available when needed to send packets in the network [7]. OLSR utilizes Multipoint
Relays (MPR) to minimize the overhead in the network. OLSR uses Hello message to find the
information about the link status and neighboring nodes in the network. TC message is used to
periodically broadcast information about advertized neighbors including the MPR selector list.
The Hello messages are sent only one hop away but the TC messages are broadcast throughout
the entire network. Also Multiple Interface Declaration (MID) message is broadcast throughout
the entire network only by MPRs to inform other hosts that the announcing host can have
multiple OLSR interface addresses. Also Host and Network Association (HNA) message
provides the external routing information for routing to the external addresses.
Geographic Routing Protocol (GRP) is a location-based routing protocol [8]. GRP is a proactive,
distance-based, greedy algorithm which uses the Global Positioning System (GPS) to mark the
location of each node in the network. GRP selects the next hop on the path as a node
geographically closest to destination. The network area is divided into square quadrants for
routing so that every four quadrants of the lower level form a quadrant of a higher level. GRP
maintains routing tables based on the geographical positions of the nodes in the network. Now if
the source and the destination nodes are located in the same quadrant then the source sends a
packet to its immediate neighbor geographically closest to the destination. Similarly, the
intermediate node forwards the packet to its immediate neighbor closest to the destination, until
the packet reaches the destination. If source and destination are not located in the same quadrant
then the source sends the packet to its immediate neighbor closest to the highest-level quadrant
where the destination exists. As the packet crosses the quadrant boundaries the location
information about the destination becomes more specific and finally the packet arrives at the
destination’s quadrant and is routed to destination using precise location information.
Gulati1M. K. et al compared the performance of proactive and reactive routing protocols AODV,
DSDV, and DSR using the NS-2 simulator [9]. The metrics used to compare the routing protocols
are packet delivery ratio, average end-to-end delay, throughput, jitter, normalized routing
overhead and normalized MAC overhead. The performance comparison is achieved by varying
mobility speed, number of nodes and data rate. The experimental results show that AODV
performs optimally well among the routing protocols under consideration.
Aujla G. S. et al studied the performance of AODV, DSR, TORA, OLSR, and GRP routing
protocols using OPNET simulator where regular nodes are considered only without any security
attacks [2]. The simulation results showed that AODV performs better than other protocols for
video conferencing for lower number of nodes, and OLSR can be used for high number of nodes.
Further OLSR protocol showed best performance for email traffic. GRP performance is better for
small number of nodes but the performance degrades with increase in number of nodes. TORA
showed poor results in both scenarios followed by DSR. In both scenarios GRP and AODV are
suitable for small number of nodes whereas OLSR is better for large number of nodes.
2.2 Misbehaving Nodes
Since there is no defined central authority in MANET network, then securing the routing process
becomes a difficult task and thus leaving MANETs vulnerable to security attacks. These attacks
result in deterioration in the performance characteristics and the reliability of such networks. The
authors presented an overview of the routing protocols in MANET networks, the known routing
attacks and the proposed countermeasures to these attacks in various works [3].
4. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
106
Identification of misbehaving nodes in MANET networks is important to detect security attack in
the network. Selfish nodes do not intend to directly damage other nodes in the network, but they
do not cooperate with other nodes and saving battery life for their own communications. But
malicious nodes do not have priority to save battery life, but intend to harm and damage other
nodes in the network [10]. As the nodes in MANET network are battery powered, then energy
becomes a valuable and limited resource, that makes the role of selfish nodes draws more
attention in MANET networks.
Vijithanand J. et. al. surveyed a number of methods that deal with the selfish behaviour of the
nodes in MANET networks [11]. Selfish nodes are considered as a real problem for MANET
networks since they affect the network performance. The authors compared the available methods
for reducing the effect of selfish nodes in MANET networks.
Gupta S. et. al studied the effect of selfish nodes concentration on the quality of service in
MANET networks [12]. The experimental results showed that up to a concentration level of 10%,
selfish nodes do not have remarkable negative effect on the network performance. As the
concentration of selfish nodes increases, QoS decreases and becomes poorer in the network.
Mishra M. K. et. al studied and compared the behavior of three routing protocols AODV DSDV,
and DSR under security attack using ns-2 network simulator. The simulation is carried out using
two types of node misbehavior [13]. The experimental results indicated that DSDV is the most
robust routing protocol under security attacks as compared to the other two routing protocols. In
addition, the results discovered that a proactive routing protocol reduces the effect of security
attack by excluding the misbehaving nodes from the routing process in advance, and thus
minimizing their effect.
Agrawal S. et. al. compared two reactive routing protocols AODV and DYMO using ns-2
network simulator. The simulation is conducted using varying speed of node mobility and varying
degree of malicious nodes in the network [3]. They compared the two routing protocols by
varying percentage of misbehaving nodes that drop packets in MANET. The simulation results
showed that DYMO routing protocol outperformed AODV routing protocol, because the increase
in the mobility speed of the nodes results in the increase of the latency and hence the Jitter for
AODV protocol.
Rao P. V. V. et al. investigated the impact of selfish node on the performance of AODV routing
protocol by varying simulation time through OPNET Modeler version 17.5 [14]. Experimental
results revealed that the impact of selfish node on performance of the throughput degrades by 40
times of the original AODV throughput. Similarly, the delay is reduced by more than 1000 times.
3. SIMULATION ENVIRONMENT
In order to measure the impact of selfish or misbehaving nodes on MANET network
performance, we use Riverbed Modeler Academic Edition 17.5 [15] to simulate the four routing
protocols with two types of misbehaving nodes: Type-1and Type-2 as described below:
1) Type-1 : partially selfish node : this node participates partially in the communication for few
nodes only in the network. In fact, the selfish node saves its own battery energy, thereby still
contributing to network.
2) Type 2 : fully selfish node : this node practically does not participate in the communication and
stays idle in the network. This type does not participate in the activities like packet forwarding,
packet receiving, route discovery, and network maintenance.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
107
Using Type-1 and Type-2 misbehaving nodes in our simulation, we evaluate the performance of
AODV, DSR, OLSR and GRP routing protocols, where a certain percentage of nodes behave as
selfish nodes and the remaining nodes being regular nodes.
The Simulation parameters used in our scenarios are shown in Table 1.
Table 1 Simulation Parameters
Network Parameters Values
Number of Mobile Nodes 20
Number of Misbehaving Nodes 1, 2, 3, 4, 5
Simulation Time 30 minutes
Simulation Area 1500 m x 1500 m
Routing Protocols AODV, DSR, OLSR, GRP
Data Rate 11 Mbps
Mobility Model Random waypoint
Speed 10 m/s
Pause Time 10 seconds
PHY Char. PHY 802.11g
Simulator Riverbed Modeler 17.5
The performance metrics that are used for evaluating and comparing the impact of node
misbehavior or selfish node attack on AODV, DSR, OLSR and GRP network performance are as
follow:
1. Packet Delivery Ratio (PDR): This is the ratio of total data received to total data sent
from source to destination. It measures the loss rate in the network. (PDR= data delivered
to the destination /data sent out by the source)
2. Average End-to-End Delay: This is the average End-to-end delay time that a packet takes
to traverse from the source node to the destination node in a MANET network in seconds,
i.e. the time elapsed between the creation of the MANET packet at the source node and
the delivery of the packet to the destination node.
3. Data Dropped: This represents the total number of packets discarded by all nodes in the
network. The total size of higher layer data packets (in bits/sec) dropped by all the
WLAN MACs in the network due to full higher layer data buffer, or the greater size of
the higher layer packet than the maximum allowed data size defined in the IEEE 802.11
standard.
4. Load: It signifies the entire load (in bits/sec) submitted to wireless LAN layers by all
higher layers by all nodes of the MANET network.
4. RESULTS AND DISCUSSION
In this section we illustrate and discuss the experimental results obtained by simulation for three
scenarios as follows.
4.1 Different percentages of Selfish nodes Scenario
In this scenario we study the performance of the routing protocols under considerations by
increasing the percentage of selfish nodes in the network, starting from all regular nodes (0% of
selfish nodes) to five selfish nodes (25%) of 20 nodes of the network.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
108
Figure 1 shows that the End-to-End Delay slightly increases with the increase of selfish nodes in
the network. Further, DSR protocol has maximum delay and OLSR protocol has the minimum
delay.
Figure 1 End-to-End Delay vs percentage of selfish nodes
Figure 2 shows that the data dropped (buffer overflow) increases with the increase of the
percentage of selfish nodes in the network. It is clear that when there are no selfish nodes in the
network, then the data dropped by all the routing protocols under consideration is zero. Also DSR
protocol has higher data dropped compared to the remaining protocols, and OLSR protocol has
the smaller data dropped.
Figure 2 Data Dropped vs percentage of selfish nodes
Figure 3 shows that, the total load submitted to the network increases with the increase of the
percentage of selfish nodes in the network . The figure shows that GRP protocol has maximum
load compared to the other routing protocols, whereas OLSR protocol has the minimum load
compared to the other routing protocols.
0
0.0005
0.001
0.0015
0.002
0.0025
0.003
0.0035
0.004
0% 5% 10% 15% 20% 25%
End-to-EndDelaysec
% of Selfish Nodes
AODV DSR OLSR GRP
0
5000
10000
15000
20000
25000
0% 5% 10% 15% 20% 25%
Datadropped(BufferOverflow)bits/sec
% of Selfish Nodes
AODV DSR OLSR GRP
7. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
109
Figure 3 Load vs percentage of selfish nodes
Figure 4 describes that the packet delivery ratio that measures the loss rate in the network
decreases with the increase of the percentage of selfish nodes. AODV protocol has the maximum
Packet delivery ratio compared to the other protocols, whereas OLSR protocol has minimum
Packet delivery ratio compared to the other protocols.
Figure 4 Packet Delivery Ratio vs percentage of selfish nodes
4.2 Impact of speed Scenario
In this scenario, we study the impact of increasing the speed of the mobile nodes on the
performance of the routing protocols under investigation. We run the simulations for 10% selfish
nodes in the network. One selfish node is of type-1 and the other one is of type-2 and the
remaining nodes are regular nodes.
Figure 5 illustrates that the End-to-End delay increases with the increase of speed of the mobile
nodes. DSR protocol has maximum End-to-End delay and OLSR has minimum End-to-End
delay.
0
20000
40000
60000
80000
100000
120000
0% 5% 10% 15% 20% 25%
Loadin(bitslsec) % of Selfish Nodes
AODV DSR OLSR GRP
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
1.1
1.2
0% 5% 10% 15% 20% 25%
PacketDeliveryRatio
% of Selfish Nodes
AODV DSR OLSR GRP
8. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
110
Figure 5 End-to-End Delay vs Speed
Figure 6 illustrates that the Packet delivery ratio slightly decreases with the increase of speed of
the mobile nodes in the network. AODV protocol has maximum Packet delivery ratio and OLSR
has minimum Packet delivery ratio.
Figure 6 Packet Delivery Ratio vs. Speed
4.3 Impact of Pause Time scenario
In this scenario, we study the impact of increasing the pause time of the moving nodes on the
performance of the routing protocols under consideration. We run the simulations for 10% selfish
nodes in the network. One selfish node is of type-1 and the other one is of type-2 and the
remaining nodes are regular nodes in the network.
Figure 7 illustrates that the End-to-End delay slightly increases with the increase of pause time of
the mobile nodes. DSR protocol has maximum End-to-End delay and OLSR has minimum End-
to-End delay.
0
0.002
0.004
0.006
0.008
0.01
0.012
0.014
0.016
0.018
0.02
10 20 30 40 50 60 70
End-to-EndDelaysec
Speed (m/s)
AODV DSR OLSR GRP
0.65
0.7
0.75
0.8
0.85
0.9
10 20 30 40 50 60 70
PacketDeliveryRatio
Speed (m/s)
AODV DSR OLSR GRP
9. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
111
Figure 7 End-to-End Delay vs Pause Time in sec
Figure 8 illustrates that the Packet delivery ratio slightly decreases with the increase of pause time
of the mobile nodes. AODV protocol has maximum Packet delivery ratio and OLSR has
minimum Packet delivery ratio.
Figure 8 Packet Delivery Ratio vs. Pause Time in sec
5.CONCLUSION
In this paper, we have compared the performance of AODV, DSR, OLSR, and GRP routing
protocols under the attack of node misbehavior using Riverbed modeler 17.5. This comparison
is achieved by varying the number of selfish nodes in the MANET network, changing the speed
of the mobile nodes, and varying the pause time of the mobile nodes.
The experimental results show that the performance of routing protocols under investigation is
degraded with the increase of the percentage of misbehaving nodes in the MANET network.
Further, the simulation results show that AODV routing protocol has higher packet delivery ratio
while OLSR routing protocol has the smaller packet delivery ratio. Regarding to End-to-End
delay, DSR protocol has maximum End-to-End delay and OLSR protocol has the minimum End-
to-End delay.
0
0.001
0.002
0.003
0.004
0.005
0.006
20 40 60 80 100 120
End-to-EndDelaySec
Pause Time Sec
AODV DSR OLSR GRP
0.68
0.7
0.72
0.74
0.76
0.78
0.8
0.82
0.84
0.86
20 40 60 80 100 120
PacketDeliveryRatio
Pause Time Sec
AODV DSR OLSR GRP
10. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
112
REFERENCES
[1] M. Abolhasan, T. Wysocki and E. Dutkiewicz , ( 2004), ” A review of routing protocols for mobile
ad hoc networks”, Elsevier Journal of Ad Hoc Networks, Vol. 2, No. 1, pp. 1-22.
[2] G. S. Aujla, S. S. Kang, (2013), “Comprehensive Evaluation of AODV, DSR, GRP, OLSR and
TORA Routing Protocols with varying number of nodes and traffic applications over MANETs”,
IOSR Journal of Computer Engineering, Vol. 9, No. 3, pp. 54 -61.
[3] S. Agrawal, S. Jain, S. Sharma, (2011 ), “A Survey Of Routing Attacks And Security Measures In
Mobile Ad-Hoc Networks”, Journal Of Computing, Vol. 3, No. 1, pp. 41-48.
[4] P. Manickam, , T. Guru Baskar, M.Girija, Dr.D.Manimegalai, (2011 ), “Performance Comparisons
Of Routing Protocols In Mobile Ad Hoc Networks”, International Journal of Wireless & Mobile
Networks, Vol. 3, No. 1, pp. 98-106
[5] C.E. Perkins and E.M. Royer, (1999), “Ad hoc on demand Distance Vector routing,”, Proceedings.
WMCSA ’99. Second IEEE Workshop on mobile computing systems and applications, pp. 90 - 100.
[6] D. Johnson, D. A. Maltz, (1996 ), “Dynamic source routing in ad hoc wireless networks,” in T.
Imielinski and H. Korth,( eds.), Mobile Computing, ( Kluwer Acad. Publ.,), pp. 152-181.
[7] T. Clausen and P. Jacquet, (2003), “Optimized Link State Routing Protocol (OLSR).” RFC 3626,
IETF Network Working Group, October.
[8] Zhiyuan Li, (2009 ), “Geographic Routing Protocol and Simulation”, Proceedings of International
workshop on Computer Science and Engineering, pp. 404-407
[9] M. K. Gulati and K. Kumar, (2014 ), “Performance Comparison Of Mobile Ad Hoc Network
Routing Protocols”, International Journal of Computer Networks & Communications, Vol. 6, No.2,
pp. 127-142.
[10] P. Michiardi and R. Molva., (2002), “ Simulation-based analysis of security exposures in mobile ad
hoc networks”, In Proceedings of European Wireless Conference, pp. 107-121.
[11] J. Vijithanand, and K. S. Murthy, (2012), “A Survey on Finding Selfish Nodes in Mobile Ad Hoc
Networks”, International Journal of Computer Science and Information Technologies, Vol. 3, No. 6,
pp. 5454-5461.
[12] S. Gupta, C. K. Nagpal and Singla ., (2011), “Impact Of Selfish Node Concentration In Manets”,
International Journal Of Wireless & Mobile Networks 3( 2), , 29-37.
[13] M. K. Mishra, B. K. Pattanayak, A. K. Jagadev, and N. Nayak, (2010 ), “Measure of Impact of
Node Misbehavior in Ad Hoc Routing: A Comparative Approach”, International Journal of
Computer Science Issues, Vol. 7, No. 4, pp. 10-16.
[14] P. V. V. Rao, and S. P. Shetty, (2015), ” Investigating the Impact of Selfish Node on AODV
Routing Protocol in MANETs in the Context of Simulation Time”, International Journal of
Computer & Organization Trends , Vol. 21, No. 1, pp. 10-13.
[15] Riverbed Modeler Academic Edition 17.5, Riverbed Technologies: website www.riverbed.com
AUTHOR
Khaled Ahmed Abood Omer has done B.E Electrical & Electronics Engineering from Faculty of
Engineering, Aden University, Aden, Yemen in 1994. He completed his M.Tech (Computer Engineering)
from IIT Kharagpur, West Bengal, India in 1999. Also he completed his Ph. D. from SCSS, JNU, New
Delhi, India in 2005. Currently he is working as an Associate Professor in Department of Computer Science
at College of Sciences and Arts, Najran university, Sharurah, Saudi Arabia. His current research interests
include Routing issues, Security issues, and performance evaluation of computer networks.