Routing plays a very significant role in multi hop data dissemination in Vehicular Ad-Hoc Networks
(VANETs). Wehave proposed a Position based Adaptive Routing (PAR) protocol which is scalable for different
network densities in VANETs. This scheme uses Preferred Group Broadcasting (PGB) for route discovery.
In this mode, after broadcasting the request for route discovery the source node starts listening to
the channel. If the packet is not further rebroadcasted by any neighbor in a set timeout, then it repeats the
broadcast. This process is repeated until the request reaches the destination. The destination keeps on accumulating
route requests coming from different paths until predefined time. It then chooses the least cost
path as route reply. It uses the set of traversed anchors for sending the unicast route reply to the source
node. PAR uses Advance Greedy Forwarding (AGF) for data forwarding and greedily forwards the data
packet to the next anchor towards destination node. It switches to carry and forward mode once it finds
partitions in the network. The intermediate vehicle buffers the packet until next junction and switches back
to position based scheme and greedily forwards to next node in range which is closest to the destination. To
have an end to end connectedpath, it uses guards to guard anchors tied to different junction and geographical
locations in the network. The algorithm is scalable and exploits advantages of existing techniques
already developed for specific scenarios in VANET. Results show that the service ratio and packet
delay of PAR are higher than its counterparts.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
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.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
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.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
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.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
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, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Vehicular Ad-hoc Network (VANET) is a multi-hop
wireless ad-hoc network created by using mobile vehicles to
transmit safety message for vehicle drivers. Since vehicles are
mobile so they change their location frequently, therefore; robust
data delivery is a challenging task in the VANET. Due to
frequently network topology change characteristic, selection of a
routing protocol in VANET is challenging task. In this paper
performance of location-based routing protocols Directional-
Location Aided Routing (D-LAR), Location-Aided Routing (LAR)
and DIrectional Routing (DIR) are analyzed to decide best
routing protocol for VANET. LAR protocol limits the route
discovery area in the forward direction using GPS technology
and DIR protocol uses direction information from the baseline
drawn from the source and destination node. The D-LAR
protocol uses concepts of the both LAR and DIR protocols. Using
greedy forwarding approach D-LAR protocol selects next hop
forwarding node in the forward direction of the communication
range. Feasibility of D-LAR protocol has justified through
simulation in NS2 using routing metrics such as node distribution
at the border area of the communication range R, expected one
hop distance ࡱ൫ࡺ(, ࢘)൯ , expected hop counts E(H) between
source and destination node, expected delay E(delay), routing
overhead and packet loss. Through simulation work, it has shown
D-LAR protocol performs better as compared to LAR and DIR
protocol.
Efficient Destination Discovery using Geographical Gossiping in MANETsidescitation
Due to dynamic topology of Mobile ad hoc networks (MANETS), early designs of
routing protocols incur a large number of discovery packets while trying to discover a route
to a destination node in the network. To reduce the number of discovery packets,
geographical information assisted routing protocols came into picture. In case of
geographical ad hoc routing protocols, there is no need to discover a route to a destination
node. But, they need to discover the fresh location of a destination node to deliver data
packets to the destination location. Geographical information assisted ad hoc routing
protocols reduce discovery packet overhead using past information about the destination
node such as location, velocity and direction of motion. When a source node does not have
any information about a destination node, the existing geographical routing protocols use
flooding techniques or location database server to know the present location of the
destination. A flooding technique or a location database server induces large number of
control packets in the network. To reduce the number of control packets during location
discovery, we propose a novel geographical gossiping technique for MANETs. The
technique basically uses two types of gossiping viz. selective and random gossiping. We have
evaluated the performance of the proposed technique using qualnet simulator and
compared its performance with flooding technique and probability based gossiping
technique. The simulation results clearly show that our technique has considerably reduced
control packet overhead compared to flooding and probability based gossiping technique.
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.
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.
Joint Routing and Congestion Control in Multipath Channel based on Signal to ...IJECEIAES
Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate the reliability and robustness of routing protocol and congestion control algorithms in dealing with such situation. In this paper, we develop a detailed approach and analytical throughput performance with a cross layer scheme (CLS) between routing and congestion control mechanism based on signal to noise ratio (SNR) in Rician and Rayleigh as multipath fading channel. We proposed joint routing and congestion control TCP with a cross layer scheme model based on SNR (RTCP-SNR). We compare the performance of RTCP-SNR with conventional routing-TCP and routing-TCP that used CLS with routing aware (RTCP-RA) model. The analyses and the simulation results showed that RTCP-SNR in a multipath channel outperforms conventional routing-TCP and RTCP-RA.
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.
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 IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
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.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
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, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Vehicular Ad-hoc Network (VANET) is a multi-hop
wireless ad-hoc network created by using mobile vehicles to
transmit safety message for vehicle drivers. Since vehicles are
mobile so they change their location frequently, therefore; robust
data delivery is a challenging task in the VANET. Due to
frequently network topology change characteristic, selection of a
routing protocol in VANET is challenging task. In this paper
performance of location-based routing protocols Directional-
Location Aided Routing (D-LAR), Location-Aided Routing (LAR)
and DIrectional Routing (DIR) are analyzed to decide best
routing protocol for VANET. LAR protocol limits the route
discovery area in the forward direction using GPS technology
and DIR protocol uses direction information from the baseline
drawn from the source and destination node. The D-LAR
protocol uses concepts of the both LAR and DIR protocols. Using
greedy forwarding approach D-LAR protocol selects next hop
forwarding node in the forward direction of the communication
range. Feasibility of D-LAR protocol has justified through
simulation in NS2 using routing metrics such as node distribution
at the border area of the communication range R, expected one
hop distance ࡱ൫ࡺ(, ࢘)൯ , expected hop counts E(H) between
source and destination node, expected delay E(delay), routing
overhead and packet loss. Through simulation work, it has shown
D-LAR protocol performs better as compared to LAR and DIR
protocol.
Efficient Destination Discovery using Geographical Gossiping in MANETsidescitation
Due to dynamic topology of Mobile ad hoc networks (MANETS), early designs of
routing protocols incur a large number of discovery packets while trying to discover a route
to a destination node in the network. To reduce the number of discovery packets,
geographical information assisted routing protocols came into picture. In case of
geographical ad hoc routing protocols, there is no need to discover a route to a destination
node. But, they need to discover the fresh location of a destination node to deliver data
packets to the destination location. Geographical information assisted ad hoc routing
protocols reduce discovery packet overhead using past information about the destination
node such as location, velocity and direction of motion. When a source node does not have
any information about a destination node, the existing geographical routing protocols use
flooding techniques or location database server to know the present location of the
destination. A flooding technique or a location database server induces large number of
control packets in the network. To reduce the number of control packets during location
discovery, we propose a novel geographical gossiping technique for MANETs. The
technique basically uses two types of gossiping viz. selective and random gossiping. We have
evaluated the performance of the proposed technique using qualnet simulator and
compared its performance with flooding technique and probability based gossiping
technique. The simulation results clearly show that our technique has considerably reduced
control packet overhead compared to flooding and probability based gossiping technique.
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.
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.
Joint Routing and Congestion Control in Multipath Channel based on Signal to ...IJECEIAES
Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate the reliability and robustness of routing protocol and congestion control algorithms in dealing with such situation. In this paper, we develop a detailed approach and analytical throughput performance with a cross layer scheme (CLS) between routing and congestion control mechanism based on signal to noise ratio (SNR) in Rician and Rayleigh as multipath fading channel. We proposed joint routing and congestion control TCP with a cross layer scheme model based on SNR (RTCP-SNR). We compare the performance of RTCP-SNR with conventional routing-TCP and routing-TCP that used CLS with routing aware (RTCP-RA) model. The analyses and the simulation results showed that RTCP-SNR in a multipath channel outperforms conventional routing-TCP and RTCP-RA.
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.
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.
As pioneers in Outdoor Advertising we recognize and understand the intrinsic value of our Clients and their Products. We believe our continued success stems from a passion for creating value for our Customers, employees and the community of large.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Improved greedy routing protocol for VANETEditor IJCATR
VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different
approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in
increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for
efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols and along with its advantages and
disadvantages. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols
Improved greedy routing protocol for VANETEditor IJCATR
VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols and along with its advantages and disadvantages. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols.
Auction Game Theory Based Adaptive Position Update Strategy for Geographic Ro...IJSRD
The Auction game based Adaptive Position Update strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Adaptive position update is based on three simple principles: first principle is nodes whose movements are harder to predict update their positions more frequently (and vice versa), then the second principle is nodes closer to forwarding paths update their positions more frequently (and vice versa) and last principle is Forwarding nodes are selected based on distance and residual energy with bidding among the neighbors. Several experimental analyses, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that game based Adaptive Position Update strategy for geographic routing can significantly improve the packet delivery ratio and improve the routing performance in terms of throughput in comparison with periodic beaconing and other recently proposed updating schemes. Finally give a better result in throughput and packet delivery ration by incurring a relatively smaller delay in delivering the packets. As the no. of nodes increases, this results in better packet delivery ratio of around 98%. The tradeoff between packet delivery ratio and Routing Over Head is slightly increased, The benefits of our work further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
Auction Game Theory Based Adaptive Position Update Strategy for Geographic Ro...IJSRD
The Auction game based Adaptive Position Update strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Adaptive position update is based on three simple principles: first principle is nodes whose movements are harder to predict update their positions more frequently (and vice versa), then the second principle is nodes closer to forwarding paths update their positions more frequently (and vice versa) and last principle is Forwarding nodes are selected based on distance and residual energy with bidding among the neighbors. Several experimental analyses, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that game based Adaptive Position Update strategy for geographic routing can significantly improve the packet delivery ratio and improve the routing performance in terms of throughput in comparison with periodic beaconing and other recently proposed updating schemes. Finally give a better result in throughput and packet delivery ration by incurring a relatively smaller delay in delivering the packets. As the no. of nodes increases, this results in better packet delivery ratio of around 98%. The tradeoff between packet delivery ratio and Routing Over Head is slightly increased, The benefits of our work further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
An Improved Greedy Parameter Stateless Routing in Vehicular Ad Hoc NetworkIJAAS Team
Congestion problem and packet delivery related issues in the vehicular ad hoc network environment is a widely researched problem in recent years. Many network designers utilize various algorithms for the design of ad hoc networks and compare their results with the existing approaches. The design of efficient network protocol is a major challenge in vehicular ad hoc network which utilizes the value of GPS and other parameters associated with the vehicles. In this paper GPSR protocol is improved and compared with the existing GPSR protocol and AODV protocol on the basis of various performance parameters like throughput of the network, delay and packet delivery ratio. The results also validate the performance of the proposed approach.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
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.
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.
Understanding Vehicular Ad-hoc Networks and Use of Greedy Routing Protocolijsrd.com
Vehicular Ad Hoc Networks (VANET) belong to a subclass of Mobile ad hoc networks . VANET provides a distinguished approach for Intelligent Transport System (ITS). VANET has become an active area of research and development since it has tremendous potential to improve vehicle and road safety, traffic efficiency, and convenience as well as comfort to both drivers and passengers. In this paper we discuss the characteristics and architecture of VANET. Further we provide an overview of Greedy Perimeter Stateless Routing Protocol. Efficient routing protocols are essential for smart ITS.
Power Aware Geocast Based Geocast Region Tracking Using Mobile Node in Wirele...inventionjournals
One of the most significant challenges introduced by mobile networks is the difficulty in coping withthe unpredictable movement of Geocast mobile nodes. If, instead, the Geocast mobile nodes could be programmed totravel through the world in a predictable and useful manner, the task of designing algorithms for mobile networks would be significantly simplified.Geocasting represents today a challengingfield of research due to the numerous application scenariosoffered by ad hoc and sensor networks. Recently, the some Geocast routing protocols have beenproposed, most of which are basically inherited from unicastrouting solutions and consequently are not optimizedfor Geocast applications. Another, more interesting, classof region, which will be referred to as position-awareGeocast routing Algorithm, follow a progressive reductionin the distance to the destination, every time a relaynode must be chosen for forwarding a data packet. Thisallows to avoid the unnecessary dissemination of datapackets to nodes farther away from the destination andthe consequent useless energy consumption. This paperwill focus on the exploitation of this interesting positionawareapproach which seems to be more suitable forthe scenarios under consideration.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
Location and Mobility Optimized On-demand Geographical Multipath Routing Prot...Eswar Publications
The advancement of science and technology had made mobile ad hoc network an important tool to access network of next generation. Recently, numerous multipath routing protocols for mobile ad hoc network are reported in literature. Each routing methods works based on their salient feature, but failed to control congestion, energy efficiency, overhead packets, signal stability during data transmission which leads to edge effect, signal decay and bottleneck situation of the bandwidth consumption. In this paper a novel approach havely Geographical Distance based Ad Hoc On-demand Distance Vector Routing (GD-AOMDV), which selects the path based on transmission distance value to limit and control the congestion and control overheads has been proposed. The salient feature of the proposed model is that it establishes a relationship between path distance and MANET design parameters
including transmission range, consumption of energy and bandwidth. The accuracy of the proposed scheme is
analyzed and validated with the experimental results in respect to various flow using NS2 simulations.
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.
Similar to POSITION BASED ADAPTIVE ROUTING FOR VANETS (20)
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.
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.
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.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...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.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIVladimir Iglovikov, Ph.D.
Presented by Vladimir Iglovikov:
- https://www.linkedin.com/in/iglovikov/
- https://x.com/viglovikov
- https://www.instagram.com/ternaus/
This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation.
Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners.
This case study covers various aspects, including:
People: The contributors and community that have supported Albumentations.
Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions.
Challenges: The hurdles in monetizing open-source projects and measuring user engagement.
Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration.
Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community.
Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations.
Mental Health: Maintaining balance and not feeling pressured by user demands.
Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth.
Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects.
Explore more about Albumentations and join the community at:
GitHub: https://github.com/albumentations-team/albumentations
Website: https://albumentations.ai/
LinkedIn: https://www.linkedin.com/company/100504475
Twitter: https://x.com/albumentations
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
POSITION BASED ADAPTIVE ROUTING FOR VANETS
1. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
DOI: 10.5121/ijcnc.2017.9105 55
POSITION BASED ADAPTIVE ROUTING FOR
VANETS
Ajay Guleria1
and Kuldeep Singh2
1
Computer Centre, Panjab University, Chandigarh, India
2
Computer Science & Application Department, Panjab University, Chandigarh, India
ABSTRACT
Routing plays a very significant role in multi hop data dissemination in Vehicular Ad-Hoc Networks
(VANETs). Wehave proposed a Position based Adaptive Routing (PAR) protocol which is scalable for dif-
ferent network densities in VANETs. This scheme uses Preferred Group Broadcasting (PGB) for route dis-
covery. In this mode, after broadcasting the request for route discovery the source node starts listening to
the channel. If the packet is not further rebroadcasted by any neighbor in a set timeout, then it repeats the
broadcast. This process is repeated until the request reaches the destination. The destination keeps on ac-
cumulating route requests coming from different paths until predefined time. It then chooses the least cost
path as route reply. It uses the set of traversed anchors for sending the unicast route reply to the source
node. PAR uses Advance Greedy Forwarding (AGF) for data forwarding and greedily forwards the data
packet to the next anchor towards destination node. It switches to carry and forward mode once it finds
partitions in the network. The intermediate vehicle buffers the packet until next junction and switches back
to position based scheme and greedily forwards to next node in range which is closest to the destination. To
have an end to end connectedpath, it uses guards to guard anchors tied to different junction and geo-
graphical locations in the network. The algorithm is scalable and exploits advantages of existing tech-
niques already developed for specific scenarios in VANET. Results show that the service ratio and packet
delay of PAR are higher than its counterparts.
KEYWORDS
PAR, PGB, AGF
1. INTRODUCTION
The coverage of road side unit (RSU) is limited by its radio range, so vehicles entering in its
range only can seek or upload data. The data disseminated by road side unit may be beneficial to
the other vehicles driving miles away. People driving in a specific area may be interested to re-
serve a parking place, book an accommodation, finding out petrol prices, find out the best dining
outlet in the area. There may be distant vehicles, who have acquired some urgent information like
accident on a particular road segment, traffic congestion or other safety related information to be
uploaded on RSU server. Data deliveries for all these applications are feasible by wireless tech-
2. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
56
nologies like 4G, 3G, etc., but the cost of providing them through these platforms is very costly.
These applications are also feasible by multi-hop data dissemination in VANET. In multi-hop
data dissemination vehicles use intermediate vehicles as relays to reach other vehicles and the
road side units.
Multi-hop communication in VANET does add its own complexities into the network. These
networks are highly mobile, and have intermittent connectivity issues. Urban area observes heavy
network density during peak hours, while rural areas or highways generally have sparse traffic
during night time. Designing a data dissemination strategy which can handle these two extreme
situations is a challenging task. On one hand, in highly dense urban scenario selection of interme-
diate nodes for multi-hop data dissemination is based on reduction of too much control packets
from wireless channel, while on the other side in case of sparse network when no neighbor exists
in its range towards destination, carry and forward of data packets by vehicles is the only way out
[5].
An efficient and scalable routing is one of the key aspect of a successful multi-hop communica-
tion algorithm for VANET. Research in past [1-3, 10- 12] has shown that existing routing algo-
rithms for mobile ad hoc networks (MANETs) are not able to adapt to unique requirements of
vehicular ad hoc networks. These new technical challenges include highly unstable network to-
pology, scalability issues as network may be very dense or have partitions. So the routing solu-
tions designed for VANET must address all these new requirements in addition to the basic de-
sign issues. However, few additional information is available in vehicular ad hoc networks like
predicted mobility pattern as vehicle plies on certain road only, trajectory of routing path can be
precomputed, vehicles use stored digital maps, they use navigation software. All this information
can be used to make better routing decisions.
Routing algorithms used in vehicular networks can be divided into three categories: (1) proactive,
(2) reactive, and (3) geographical. In case of proactive algorithms, nodes taking part in routing
maintain a routing table, which is built by exchanging link state messages with other nodes of the
network. Thus, routes are computed and maintained in advance, even if there is no data for ex-
change in the network. The performance of these protocols degrades when the traffic density be-
comes very large as nodes exchange too much control information and leaves very less channel
for data transmission. The second approach, reactive routing only searches for a route when it is
needed. The sending node does not know in advance how to reach the destination. Route discov-
ery is done on demand. This requires flooding of route requests in the network which usually in-
creases the end to end delay as the source has to wait for more time before the routing path is es-
tablished. On demand reactive protocols use broadcasting for the route discovery, so control
packets may flood and congest the channel. Moreover, there may be a case when the intermediate
vehicle or source vehicle may not find any neighbor for relaying request. Geographic routing
generally also works on demand. However, the technique used by them is very different from on
demand routing protocols. Geographic routing protocols do not use the topology of the network
for routing information rather these algorithms uses geographic coordinates of nodes and take
routing decisions hop-by-hop in a per-packet basis. Each relay selects its next hop based on its
position, its neighbors’ positions, and the position of the destination. These algorithms also suffer
due to radio obstacles or intermediate nodes might find them in local maximum [2, 4]. Special
requirements, like highly mobile network topology, varying densities and intermittent connectivi-
3. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
57
ty makealready existing routing protocols of the above categories unsuitable for all kind of scena-
rios possible in VANET. So the better idea is to make an adaptive routing protocol which adapts
according to the situations.
This paper discusses a new routing strategy for the multi-hop efficient data dissemination in vehi-
cular ad hoc networks. The proposed Position based Adaptive Routing (PAR) scheme is a posi-
tion based algorithm which uses Preferred Group Broadcasting (PGB) for route discovery [3]. It
switches to carry and forward [5] until next junction, once theintermediate node fails to find any
vehicle to handover information towards destination. The scheme uses anchors to record the list
of junctions traversed by the packet on its way to the destination. For path maintenance it uses the
concept of guards [6].
Our work is aimed to provide an adaptive routing scheme which switches between geographical
and carry and a forward mode based on actual traffic scenario and is scalable for all kinds of net-
work densities in VANET. The rest of this chapter is organized as follows. Section 2 describes
preliminaries and system model. Section 3 describes PAR routing scheme, and Section 4 eva-
luates the performance of the proposed scheme. Concluding remarks are given in Section 5.
2. PRELIMINARIES AND SYSTEM MODEL
2.1. Preliminary
Vehicular ad hoc network’s predictive mobility patterns and highly dynamic topology pose chal-
lenging demands on routing methods to deal with such environment [2, 3, 7, 8]. These demands
make routing algorithms to use positions of nodes in order to provide successful communication
from the source to the destination. Most of proactive and reactive routing protocols do not per-
form well in these kinds of environments [1, 2, 6, 8]. So position based routing in which geo-
graphical positions of nodes are used to perform data routing is preferred [2, 4]. In the position
based routing approaches an intermediate node forwards a packet to the direct neighbor,who is
closest to the geographic position of the destination, this is called Greedy Forwarding [2]. To par-
ticipate in position based routing, each node has to be aware of:
• Its own position.
• Position of its direct neighbors.
• Position of the destination.
A node determines its own position by using GPS, the position of the neighbors is received
through one hop beacon messages transmitted periodically by all nodes and the position of the
final destination is provided by a location service [2, 4]. Greedy forwarding uses only local in-
formation to select the next hop towards the destination, so it may end up in local optimum [2]
i.e., no neighbor exists which is closer to the destination than the intermediate node itself. In order
to escape from a local optimum a repair strategy is used. Greedy Perimeter Coordinator Routing
(GPCR) is a solution for this problem [2, 4, 6]. This algorithm uses restrictive greedy routing
along with perimeter coordinate routing. Another case can arise when traffic is sparse and inter-
4. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
58
mediate node is not able to find any neighbor to hand over the data packet towards thedestination,
in such cases carry and forward mechanism is deployed [5].
2.2. Assumptions and Model
The following assumptions are made:
• Vehicles are equipped with wireless transceivers.
• Vehicles are equipped with dedicated short-range communications radio modules as well
as Global Positioning System (GPS), by which vehicles can determine their geographical
location.
• Vehicles find location of the destination through location service.
• Vehicles find neighbors through one hop beacon messages.
• Vehicles place packet delivery information such as packet source id, its vector velocity,
packet generation time, destination location, expiration time, etc., in the packet header.
• Vehicles are preloaded with digital maps, which provide street maps and traffic statistics
at different times of the day in the area.
• The communication paths are available via the ad hoc network when there is no other
communication infrastructure.
• Battery power and processing power of the vehicular node is not the limiting factor for
the design.
The model is described in the following section:
Each vehicle in VANET is equipped with On Board Unit (OBU) which is transceiver with com-
putational power and omni-directional antenna. Vehicles communicate witheach other through a
short range wireless channel. OBU on the vehicles is capable of calculating average speed of ve-
hicles. Vehicles can request the desired data from theother vehicles or from a nearby RSU. We
have assumed a road network of multiple segments forming diagonal streets in city or rural area.
A typical network is shown in Figure 1. As shown, source vehicle and destination vehicle are
moving in different road segments. Source vehicle uses theintermediate vehicles for sending in-
formation to the destination vehicle. As shown in Figure 1, there are multiple paths possible from
the source vehicle to the destination vehicle. The proposed algorithm selects the most populated
path to send information to the destination.
We also assumed that the arrival rate of avehicle in the particular road segment Rij follows Pois-
son distribution with mean arrival rate λ vehicles per second. So the inter-arrival times of vehicles
are exponentially distributed with expected inter arrival time equal to 1/λ. Let the vehicle density
of the road segment Rij be ρij. We have also assumed that there is no congestion in road segment
Rij and vehicles travel at free flow at speed v meters per second. Then by assuming an M/M/1
queue model for a free flow road, we have arrival rate = × . Let each vehicle has a radio
range Tx. Two vehicles are connected if the physical distance between two vehicles is less than
Tx. The inter-arrival time between two vehicles i and i+1 is denoted by the random variable Ti.
The density function of Tiis given by:
=
, ≥ 0 (1)
5. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
59
Let the inter vehicle distance between vehicle i and i+1 be denoted by Di.When using a free flow
for road segment Rij, and assuming v as the nominal speed of the vehicles on this segment we
have = × .
= × , ≥ 0 (2)
The spatial distribution of vehicles on the road segment is also a Poisson process. The probability
Pd that any moving vehicle will find at least one vehicle in its transmission range Txfor transmit-
ting packet is given by:
! "# (3)
So, the probability of not finding any vehicle in its radio range is when = "#
. So in that
case vehicle will use carry and forward method and when ! "# it finds another vehicle
which is selected as next hop to forward data packet to the destination.
The proposed PAR works on following principles:
Use restive greedy forwarding to forward a packet to the direct neighbor which is closest to the
geographic position of the destination. Transmit through wireless channels, as much as possible
[5].
a) In case of intermediate node getting stuck up in local maximum or in absence, a direct
neighbor who can progress requests towards destination, use carry and forward method.
b) Switch to radio transmission channel as soon a vehicle moves into the vicinity which can
be selected as thenext hop towards the destination
Figure 1. Scenario for Vehicle-to-Vehicle communication
6. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
60
3.PROPOSED ROUTING ALGORITHM
Position based Adaptive Routing (PAR) Protocol
The proposed Position based Adaptive Routing (PAR) protocol is split into four phases:
• Destination location and path discovery.
• Data packet forwarding along the found path.
• Path maintenance.
• Error recovery.
3.1. Destination Location and Path Discovery
The source node knows its position through GPS and gets the location and the velocity vector of
the destination with the help of a location service. The Algorithm uses one hop beacon messages
from surrounding nodes to construct neighbor table at each node. The beaconing internal of nodes
in a specific area depends on the amount of vehicle density in that area. The beacon interval is
more when network density is high and in case of fewer neighbors it is less. The beacons used by
vehicles include its location, moving direction and speed. The source node generates a route re-
quest (RREQ). The RREQ packet contains (the) position of source node (S_id), its own velocity
vector (S_v), TTL for of that packet, destination’sposition (D_id) and destination’s velocity vec-
tor (D_id). RREQ is sent by using the preferred broadcasting mode by the source. In this mode
the source node after broadcasting the route request starts listening to the channel. If the packet is
not further rebroadcasted by any neighbor in a set timeout, then it repeats the broadcast. This
process is repeated until the request reaches the destination. Any intermediate node N which is in
junction or if its angle with previous node which handed it the packet is > 180, updates the packet
header and records the current geographical position (ties an anchor Ii) in it. So the header of
route request (RREQ) packet records all the list of anchor points traversed by it on its way toward
the destination.
If intermediate node N finds no neighbors in itsrange which can progress data delivery towards
the destination, then it switches to carry and forward mode until next junction. From junction
again node switches back to preferred group broadcasting mode. This process continues until the
packet reaches destination D or its TTL becomes zero. On receipt of RREQ destination D waits
for preset some time, record more possible Route Requests. D selects the shortest path among
those received route requests. It sends the RREP which is a unicast packet to thesource S. RREP
contains the destination coordinates, its velocity vector together with theinformation recorded
during the route request phase. Advance greedy forwarding is used to send RREP through record-
ed anchors point to the source.
3.2. Data Packet Forwarding Along the Found Path
Once the source node receives RREP packet from the destination, now it has determined a path to
reach the destination. Data packets are routed geographically from one anchor node to the next
anchor node until they reach the destination. This is done by the source node S by using source
routing approach. The list of anchor nodes to be traversed is included in every transmitted data
7. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
packet by the source. PAR does it by greedily transferring information between two anchor
nodes. The authors of CAR [6] used anchor points to work with the Advance Greedy Forwarding
(AGF). AGF presumes that velocity vectors are exchanged by the source and the destinations.
The intermediate forwards the packet node to a neighbor closest to the
of forwarding a data packet to a neighbor that is geographically closer to the destination. Each
forwarding node relays to anchor if the distance is less than half coverage to avoid multiple a
tempts to gradually get closer to t
tion and the position of the next anchor point are separated by less than half of the node
age range. The process continues until the packet reaches its destination.
[6] (Shown in Figure 2) to help intermediate node N to find out if a message has reached a certain
anchor node or not. Two types of guards are used i.e., stationary guards and moving guards. A
standing guard represents temporary state information that is t
than to a specific node.If two intermediate node
is set [3, 6]. Anchor contains coordinates and velocity vector of the current node and previous
node. The nodes located in the area are kept alive by the guard. The beacon message of a node
contains the guard entry.
The new entry contains an id, a TTL counter, a guarded location coordinates and the radius. An
intermediate node with a guard can filter or redirect packets or a
which is further transmitted to a node geographically near to the destination [6]. Once TTL reac
es zero, the guard is removed from the node
not finding any neighbor, the algorith
packet. Based on the existing traffic pattern, a vehicle can find the next road to forward the packet
to reduce the delay [5, 8].
Figure
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
packet by the source. PAR does it by greedily transferring information between two anchor
nodes. The authors of CAR [6] used anchor points to work with the Advance Greedy Forwarding
(AGF). AGF presumes that velocity vectors are exchanged by the source and the destinations.
The intermediate forwards the packet node to a neighbor closest to the next anchor point, instead
of forwarding a data packet to a neighbor that is geographically closer to the destination. Each
forwarding node relays to anchor if the distance is less than half coverage to avoid multiple a
tempts to gradually get closer to the next anchor point. Each forwarding node checks if its pos
tion and the position of the next anchor point are separated by less than half of the node
age range. The process continues until the packet reaches its destination.PAR employs the guards
[6] (Shown in Figure 2) to help intermediate node N to find out if a message has reached a certain
anchor node or not. Two types of guards are used i.e., stationary guards and moving guards. A
standing guard represents temporary state information that is tied to a geographical area, rather
than to a specific node.If two intermediate node’s velocity vectors angle is more than 18
is set [3, 6]. Anchor contains coordinates and velocity vector of the current node and previous
the area are kept alive by the guard. The beacon message of a node
The new entry contains an id, a TTL counter, a guarded location coordinates and the radius. An
intermediate node with a guard can filter or redirect packets or adds information to a packet
which is further transmitted to a node geographically near to the destination [6]. Once TTL reac
es zero, the guard is removed from the node’s HELLO beacon. In the event of the intermediate
not finding any neighbor, the algorithm switches to carry and forward mode [5] and carries the
packet. Based on the existing traffic pattern, a vehicle can find the next road to forward the packet
Figure 2. Guard being exchanged by vehicles
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
61
packet by the source. PAR does it by greedily transferring information between two anchor
nodes. The authors of CAR [6] used anchor points to work with the Advance Greedy Forwarding
(AGF). AGF presumes that velocity vectors are exchanged by the source and the destinations.
next anchor point, instead
of forwarding a data packet to a neighbor that is geographically closer to the destination. Each
forwarding node relays to anchor if the distance is less than half coverage to avoid multiple at-
he next anchor point. Each forwarding node checks if its posi-
tion and the position of the next anchor point are separated by less than half of the node’s cover-
PAR employs the guards
[6] (Shown in Figure 2) to help intermediate node N to find out if a message has reached a certain
anchor node or not. Two types of guards are used i.e., stationary guards and moving guards. A
ied to a geographical area, rather
s velocity vectors angle is more than 18°, anchor
is set [3, 6]. Anchor contains coordinates and velocity vector of the current node and previous
the area are kept alive by the guard. The beacon message of a node
The new entry contains an id, a TTL counter, a guarded location coordinates and the radius. An
dds information to a packet
which is further transmitted to a node geographically near to the destination [6]. Once TTL reach-
of the intermediate
m switches to carry and forward mode [5] and carries the
packet. Based on the existing traffic pattern, a vehicle can find the next road to forward the packet
8. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
The VADDmodel proposed by the authors [5] share the idea of storing and forwarding the data
packet. In the VADD the main goal is to select the path with the smallest packet delay. The delay
model used in VADD is shown in Figure 3. A vehicle located near junction I
for the road between Ia and Ib (Dab
ing the road between Ib and Ix, the one between I
next road has been selected, next is to
rithm switches back to position based routing when it is able to find a connected path between the
source and the destination. The flowchart of the proposed algorithm is shown in Figure 4. The
algorithm is described in Figure 5.
Figure
3.3. Path Maintenance
Similar to [3, 6] PAR uses anchor points for data forwarding. If no node is guarding a particular
anchor point, the algorithm employs carry and forward strategy. If the destination node is moving
and it changes direction then it activates a standing guard.
and the new velocity vectors of the destination. Whenever a node which is guarding a particular
location receives a message addressed
adds the guarded location as an anchor point to the packet header, updates the new estimated l
cation of the destination, and forwards the packet.
area, rather than to a specific node. A traveling guard is activated if the intermediate
nation node changes direction against the direction of communication [6].Traveling guard co
tains position, velocity vector, and radius. A traveling guard runs as the end node
and speed, and routes the packets to the new positi
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
d by the authors [5] share the idea of storing and forwarding the data
packet. In the VADD the main goal is to select the path with the smallest packet delay. The delay
model used in VADD is shown in Figure 3. A vehicle located near junction Ia computes the delay
ab) by taking into consideration also the estimated delay of choo
, the one between Ib and Iy or the one between Ib and I
next road has been selected, next is to choose a relay vehicle towards the destination. PAR alg
rithm switches back to position based routing when it is able to find a connected path between the
source and the destination. The flowchart of the proposed algorithm is shown in Figure 4. The
hm is described in Figure 5.
Figure 3. Scenario for VADD model
Similar to [3, 6] PAR uses anchor points for data forwarding. If no node is guarding a particular
anchor point, the algorithm employs carry and forward strategy. If the destination node is moving
and it changes direction then it activates a standing guard. The newly created guard stores the old
and the new velocity vectors of the destination. Whenever a node which is guarding a particular
location receives a message addressed tothe node that has initiated the guard, the guarding node
on as an anchor point to the packet header, updates the new estimated l
cation of the destination, and forwards the packet.Standing guard is attached to a geographical
area, rather than to a specific node. A traveling guard is activated if the intermediate
nation node changes direction against the direction of communication [6].Traveling guard co
tains position, velocity vector, and radius. A traveling guard runs as the end node’s old direction
and speed, and routes the packets to the new position of the destination.
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
62
d by the authors [5] share the idea of storing and forwarding the data
packet. In the VADD the main goal is to select the path with the smallest packet delay. The delay
computes the delay
) by taking into consideration also the estimated delay of choos-
and Iz. Once the
choose a relay vehicle towards the destination. PAR algo-
rithm switches back to position based routing when it is able to find a connected path between the
source and the destination. The flowchart of the proposed algorithm is shown in Figure 4. The
Similar to [3, 6] PAR uses anchor points for data forwarding. If no node is guarding a particular
anchor point, the algorithm employs carry and forward strategy. If the destination node is moving
The newly created guard stores the old
and the new velocity vectors of the destination. Whenever a node which is guarding a particular
the node that has initiated the guard, the guarding node
on as an anchor point to the packet header, updates the new estimated lo-
Standing guard is attached to a geographical
area, rather than to a specific node. A traveling guard is activated if the intermediate or the desti-
nation node changes direction against the direction of communication [6].Traveling guard con-
s old direction
9. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
63
3.4 Error Recovery
PAR algorithm uses preferred group broadcasting (PGB) to find connected paths between the
source and the destination. It uses store and forward technique until next junction if gets stuck up
in local maximum [2]. It uses only anchor nodes for data forwarding to the destination. Due to the
varying network density, routing errors may still cause problems. A message may reach the esti-
mated destination position but fails to find the node there. This happened as destination node be-
fore moving could not activate guard due to lack of neighbors in its radio range.The algorithm in
such cases uses store carry and forward method and hands over the packet as soon as it finds any
node moving in its vicinity and geographically closer to the destination. In another case, the in-
termediate node changes its direction from the direction ofthe communicationand does not find
any neighbor to activate a guard then it sends an error notification to the source node. Source
stops sending any data packet on the current discovered path and starts a new path discovery
process.
4.PERFORMANCE EVALUATION
To evaluate the proposed routing algorithm, PAR, we have used a simulator based on SUMO [18]
for traffic simulation and NS2 [20] for network simulation. We have also simulated GPSR [13],
GPCR [2], and CAR [6] for comparison with PAR algorithm.
4.1. Performance Metrics
The prime goal of any routing scheme is to increase packet delivery or service ratio and at the
same time reduce average packet delay betweenthe source and the destination. A good routing
algorithm should also have low message overhead. We use the following metrics for performance
evaluation.
• Service ratio (%). Itis defined as the ratio of the number of packets sent by the source ve-
hicle to the number of packets received by the destination vehicle. A better routing algorithm
should have a high service ratio.
• Average delay of a data packet (s). It is the average time taken by the packets from the
source vehicle to the destination vehicle.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
4.2 Experimental Setup
The experiment is based on a 2000x2000
roads, mobility pattern and vehicles are generated by using SUMO [18]. The generated mobility
trace is transformed into a data format that is used as input to NS2 [20]. To have different ne
work densities, the number of vehicles moving into the area has been varied between 10 and 60.
All these vehicles are moving forward and backward during the simulation to have the continuous
traffic flow in the street area. When one vehicle reaches the end of the r
hicle will move out of the grid area, it no more participates in the network. Various simulation
parameters with their corresponding values are listed in Table 1.
1. Node S get destination D location from location server
the starting words)
2. Construct neighbor table from one hop beacon packets
3. Forward the packet to the neighbor that is geographically closer to destin
tion
4. If intermediate nodes N towards destination is in range i.e.
go to Step 6
5. Otherwise, carry the packet until next junction
6. If node N is in junction or angle between communicating
7. Set anchors Ii and tie it to that particular locatio
8. Keep forwarding packet to the next node until reaches the destination D or
its TTL = 0
9. Destination D waits for some time record all possible Route Requests
10. Destination D selects the
11. Use the recoded anchors in packet header of Route Reply to transfer data
12. Set static guard for moving stationary source, intermediate or destination
node
13. Set moving guard for a node which moves opposite to the direction of
communication
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
Figure 4. PAR algorithm
2000x2000m2
square street area in a grid layout. The street layout,
roads, mobility pattern and vehicles are generated by using SUMO [18]. The generated mobility
trace is transformed into a data format that is used as input to NS2 [20]. To have different ne
ities, the number of vehicles moving into the area has been varied between 10 and 60.
All these vehicles are moving forward and backward during the simulation to have the continuous
traffic flow in the street area. When one vehicle reaches the end of the road, which means the v
hicle will move out of the grid area, it no more participates in the network. Various simulation
parameters with their corresponding values are listed in Table 1.
get destination D location from location server (I have capitalized
neighbor table from one hop beacon packets
packet to the neighbor that is geographically closer to destin
intermediate nodes N towards destination is in range i.e.
carry the packet until next junction
node N is in junction or angle between communicating nodes is > 180
anchors Ii and tie it to that particular location
forwarding packet to the next node until reaches the destination D or
D waits for some time record all possible Route Requests
D selects the lowest delay path to send route reply to source
the recoded anchors in packet header of Route Reply to transfer data
static guard for moving stationary source, intermediate or destination
moving guard for a node which moves opposite to the direction of
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
64
square street area in a grid layout. The street layout,
roads, mobility pattern and vehicles are generated by using SUMO [18]. The generated mobility
trace is transformed into a data format that is used as input to NS2 [20]. To have different net-
ities, the number of vehicles moving into the area has been varied between 10 and 60.
All these vehicles are moving forward and backward during the simulation to have the continuous
oad, which means the ve-
hicle will move out of the grid area, it no more participates in the network. Various simulation
(I have capitalized
packet to the neighbor that is geographically closer to destina-
nodes is > 180
forwarding packet to the next node until reaches the destination D or
lowest delay path to send route reply to source
the recoded anchors in packet header of Route Reply to transfer data
static guard for moving stationary source, intermediate or destination
moving guard for a node which moves opposite to the direction of
11. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
Figure
Maximum Communication Range
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
Figure 5. Flowchart of PAR algorithm
Table 1.Simulation Parameters.
Parameter Value
Simulation Time 1000s
Maximum Communication Range 200m
Vehicle Speed 30km/hour
Transmission Rate 11Mbps
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
65
12. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
Inter Vehicle Distance
Vehicle Beacon Interval
We have evaluated GPSR, GPCR, CAR and the proposed algorithm
formance.
4.3 Results
Effect of Vehicle Density on Service Ratio
Figure 6 shows the service ratio as a function of vehicle density in the area. The item size is set to
2500 bytes for the experiment. The vehicle density
mum 60 vehicles in the grid area. For all traffic volumes, GPSR does not perform well as it has a
poor delivery ratio. The GPSR does not perform well in this scenario because it uses
warding for selection of the next hop so more often gets stuck up in local maximum. The GPCR
however has a better delivery ratio as compared to GPSR and
the area. This uses perimeter coordinator routing for se
The CAR protocol uses preferred group broadcasting for route discovery and uses advance gre
dy forwarding for data forwarding so achieves high service ratio. The service of CAR increases
with number of vehicles as chances of void in the network are reduced.
Figure 6.
The performance of PAR is almost similar or better than CAR algorithm as the number of v
hicles increase from 10 to 60. The PAR algorithm uses two modes
in mode one, when a vehicle is not able to find a neighbor to route
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
Item Size 10B-4KB
Inter Vehicle Distance 20m
Vehicle Beacon Interval 0.5sec
Packet TTL 128sec
GPSR, GPCR, CAR and the proposed algorithm, PAR, and compared the pe
Effect of Vehicle Density on Service Ratio
Figure 6 shows the service ratio as a function of vehicle density in the area. The item size is set to
experiment. The vehicle densityvaries between minimum 10 vehicles to max
mum 60 vehicles in the grid area. For all traffic volumes, GPSR does not perform well as it has a
poor delivery ratio. The GPSR does not perform well in this scenario because it uses
warding for selection of the next hop so more often gets stuck up in local maximum. The GPCR
however has a better delivery ratio as compared to GPSR and increaseswith number of vehicles in
the area. This uses perimeter coordinator routing for selection of next hop so better service ratio.
The CAR protocol uses preferred group broadcasting for route discovery and uses advance gre
dy forwarding for data forwarding so achieves high service ratio. The service of CAR increases
as chances of void in the network are reduced.
Figure 6. Effect of vehicle density on service ratio
The performance of PAR is almost similar or better than CAR algorithm as the number of v
hicles increase from 10 to 60. The PAR algorithm uses two modes and works similar to CAR [6]
in mode one, when a vehicle is not able to find a neighbor to route a packet to the destination and
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
66
and compared the per-
Figure 6 shows the service ratio as a function of vehicle density in the area. The item size is set to
between minimum 10 vehicles to maxi-
mum 60 vehicles in the grid area. For all traffic volumes, GPSR does not perform well as it has a
poor delivery ratio. The GPSR does not perform well in this scenario because it uses greedy for-
warding for selection of the next hop so more often gets stuck up in local maximum. The GPCR
with number of vehicles in
lection of next hop so better service ratio.
The CAR protocol uses preferred group broadcasting for route discovery and uses advance gree-
dy forwarding for data forwarding so achieves high service ratio. The service of CAR increases
The performance of PAR is almost similar or better than CAR algorithm as the number of ve-
and works similar to CAR [6]
packet to the destination and
13. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
switches to VADD [5] mode. The
radio range then it carries the packet until the next junction.
Effect of Vehicle Density on Average Packet Delay
The item size is again set to 2500 bytes for the experiment. The average packet delay for all alg
rithms gets reduced with the increase in number of vehicles. The
GPSR and GPCR that use only geographical data for route discovery and data forwarding. These
algorithms often fail due to local maximum. With the increase in number of vehicles in the ne
work the chances of finding at least on
current traffic pattern and vehicle density, so have lower packet delay and it further reduces with
increase in the number of vehicles as more connected paths are found between the source and the
destination. Further CAR easily tolerates short term disconnections due to partitions or temporary
interference.
PAR algorithm has the lowest average packet delay because most of the
end to end connected path between the source and
fer and forward mode when partitions are formed in the network. The destination node on receipt
of a request does not reply back immediately rather it waits for some time, keeps on accumulating
route requests from the source node and selects the minimal path request from these accumulated
requests. So PAR algorithm has the auto
path between the source and the destination and has the lowest average delay as
7.
Figure 7. Effect of vehicle density on average packet delay
Effect of Data Packet Size on Service Ratio
Larger packet size consumes more bandwidth. So as we increase the data packet size from 10
bytes to 4000 bytes the contention for wireless channel increases. In this case we have assumed
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
Theintermediate vehicle when does not find any other vehicle in its
packet until the next junction.
Effect of Vehicle Density on Average Packet Delay
The item size is again set to 2500 bytes for the experiment. The average packet delay for all alg
rithms gets reduced with the increase in number of vehicles. The reduction is least in case of
GPSR and GPCR that use only geographical data for route discovery and data forwarding. These
algorithms often fail due to local maximum. With the increase in number of vehicles in the ne
work the chances of finding at least one neighbor for packet forwarding increases. CAR considers
current traffic pattern and vehicle density, so have lower packet delay and it further reduces with
increase in the number of vehicles as more connected paths are found between the source and the
stination. Further CAR easily tolerates short term disconnections due to partitions or temporary
PAR algorithm has the lowest average packet delay because most of the time itis able to find an
end to end connected path between the source and the destination. This algorithm switches to bu
fer and forward mode when partitions are formed in the network. The destination node on receipt
of a request does not reply back immediately rather it waits for some time, keeps on accumulating
from the source node and selects the minimal path request from these accumulated
requests. So PAR algorithm has the auto-adjustability capability to maintain a least delay sub
path between the source and the destination and has the lowest average delay as shown in Figure
Effect of vehicle density on average packet delay
Effect of Data Packet Size on Service Ratio
Larger packet size consumes more bandwidth. So as we increase the data packet size from 10
bytes to 4000 bytes the contention for wireless channel increases. In this case we have assumed
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
67
ntermediate vehicle when does not find any other vehicle in its
The item size is again set to 2500 bytes for the experiment. The average packet delay for all algo-
reduction is least in case of
GPSR and GPCR that use only geographical data for route discovery and data forwarding. These
algorithms often fail due to local maximum. With the increase in number of vehicles in the net-
e neighbor for packet forwarding increases. CAR considers
current traffic pattern and vehicle density, so have lower packet delay and it further reduces with
increase in the number of vehicles as more connected paths are found between the source and the
stination. Further CAR easily tolerates short term disconnections due to partitions or temporary
is able to find an
the destination. This algorithm switches to buf-
fer and forward mode when partitions are formed in the network. The destination node on receipt
of a request does not reply back immediately rather it waits for some time, keeps on accumulating
from the source node and selects the minimal path request from these accumulated
adjustability capability to maintain a least delay sub-
shown in Figure
Larger packet size consumes more bandwidth. So as we increase the data packet size from 10
bytes to 4000 bytes the contention for wireless channel increases. In this case we have assumed
14. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
25 vehicles are always available in the grid area. The service ratio
GPCR as compared to CAR and PAR algorithms. PAR has the least decrease in the service ratio
because it does not forward data to the next vehicle which is closer to the destination rather it
forwards it to the next junction, so
compared to CAR algorithm shown in Figure 8. In case of GPSR the service ratio more or less
remain same for all data packet size as it only uses greedy forwarding for route discovery and
data forwarding phases. This intermediate node in GPSR more often gets stuck up in local max
mum.
Figure
Figure 9. Effect of data packet size on average packet delay
Effect of Data Packet Size on Average Packet
Effect on data packet size on average packet delay is shown in Figure 9. The average packet delay
increases across all compared algorithms as we increase the data packet size from 10 bytes to
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
25 vehicles are always available in the grid area. The service ratio drops much faster in case of
GPCR as compared to CAR and PAR algorithms. PAR has the least decrease in the service ratio
because it does not forward data to the next vehicle which is closer to the destination rather it
next junction, so in this case header will have lesser control information as
compared to CAR algorithm shown in Figure 8. In case of GPSR the service ratio more or less
remain same for all data packet size as it only uses greedy forwarding for route discovery and
arding phases. This intermediate node in GPSR more often gets stuck up in local max
8.Effect of data packet size on service ratio
Effect of data packet size on average packet delay
Effect of Data Packet Size on Average Packet Delay
Effect on data packet size on average packet delay is shown in Figure 9. The average packet delay
increases across all compared algorithms as we increase the data packet size from 10 bytes to
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
68
drops much faster in case of
GPCR as compared to CAR and PAR algorithms. PAR has the least decrease in the service ratio
because it does not forward data to the next vehicle which is closer to the destination rather it
in this case header will have lesser control information as
compared to CAR algorithm shown in Figure 8. In case of GPSR the service ratio more or less
remain same for all data packet size as it only uses greedy forwarding for route discovery and
arding phases. This intermediate node in GPSR more often gets stuck up in local maxi-
Effect on data packet size on average packet delay is shown in Figure 9. The average packet delay
increases across all compared algorithms as we increase the data packet size from 10 bytes to
15. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
69
4000 bytes. The large data packet size will consume more bandwidth so less fewer wireless chan-
nels remains available. So more data packets get dropped as the bit error rate (BER) increases
which in turn increases the average packet delay in the network. In this case also we have taken
total 25 vehicles for the experiment. The experiment is carried out with a fixed transmission rate.
The GPCR observers more increase as compared to CAR and PAR both of them very much simi-
lar increase in average packet delay. This pattern is because the packet forwarding is not done
hop-by-hop rather it is done junction wise in CAR and PAR.
5. CONCLUSIONS
In this paper we have proposed a Position based Adaptive Routing (PAR) scheme which is scala-
ble to different densities of vehicular ad hoc networks. This scheme uses preferred group broad-
casting for route discovery. In this mode, after broadcasting the request for route discovery the
source node starts listening to the channel. If the packet is not further rebroadcasted by any
neighbor in a set timeout, then it repeats the broadcast. This process is repeated until the request
reaches the destination. The destination keeps on accumulating route requests coming from dif-
ferent paths until apredefined time. It then chooses the least cost path as route reply. It uses the set
of traversed anchors for sending the unicast route reply to the source node. PAR uses advance
greedy forwarding for data forwarding and greedily forwards the data packet to the next anchor
towards destination node. It switches to carry and forward mode once it finds gaps in the network.
The node buffers the packet till next junction and switches back to position based scheme and
greedily forwards it to the next node in its range which is closest to the destination. To have an
end to end connected path, it uses guards to guard anchors tied to the different junction(s) and
geographical locations in the network. The algorithm is scalable and exploits (the) advantages of
existing techniques already developed for the specific scenarios in VANET.
REFERENCES
[1] Z. Haas, J. Halpernand and L. Li, “Gossip Based Ad Hoc Routing,” Proceedings of IEEE INFOCOM,
pp. 1707–1716, 2002.
[2] C. Lochert, M. Mauve, H. Hartenstein and S. Holger, “Geographic Routing in City Scenarios,” ACM
SIGMOBILE Mobile Computing and Communications Review, Vol. 9, No. 1, pp. 69-72, 2005.
[3] V. Naumou, R. Baumann and T. Gross, “An Evaluation of Inter-Vehicle Ad Hoc Networks Based on
Realistic Vehicular Traces,” ACM International Symposium on Mobile Ad Hoc Networking and
Computing, Florence, Italy, pp. 108-119, 2006.
[4] M. Jerbi, S. Senouci, M. Meraihi and R. Ghamri, “An Improved Vehicular Ad Hoc Routing Protocol
for City Environments,” IEEE International Conference on Communications (ICC 2007), Glasgow,
Scotland, pp. 3972-3979, 24-28 June 2007.
[5] J. Zhao and C. Cao, “VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks,” IEEE
International Conference on Computer Communications (INFOCOM 2006), pp. 1-12, 2006.
[6] V. Naumov, and T. Gross, “Connectivity Aware Routing (CAR) in Vehicular Ad Hoc Networks,”
IEEE International Conference on Computer Communications (INFOCOM 2007), pp. 1919-1927,
2007.
[7] K. Katsaros, M Dianati and K. Roscher, “A Position-Based Routing Module for Simulation of
VANETs in ns-3,” SIMUTOOLS '12, pp 345-352, 2012.
[8] M. Boban, G. Misek and O. Tonguz, "What is best acheivableQos for Unicast routing in VANETs ?,”
IEEE GLOBECOM Workshops, pp.1-10, Jan 2008.
16. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
70
[9] S. Wang, "The Effects Of Wireless Transmission Range On Path Lifetime In Vehicle-Formed Mobile
Ad-Hoc Networks On Highways,” IEEE International Conference on Communications, Vol. 5, pp.
3177-3181, May 2005.
[10] D.E. Cooper, P. Ezhilchelvan and I. Mitrani, “A Family of Encounter-Based Broadcast Protocols for
Mobile Ad-Hoc Networks,” International Workshop of the EURO-NGI Network of Excellence, pp.
235-248, June 2004.
[11] F. Bonnet, P. Ezhilchelvan and E. Vollset, “Quiescent Consensus in Mobile Ad- Hoc Networks Using
Eventually Storage-Free Broadcasts,” Annual ACM Symposium on Applied Computing, pp. 670-674,
April 2006.
[12] O. Abedi, M. Fathy and J. Taghiloo, “Enhancing AODV Routing Protocol Using Mobility Parameters
in VANET,” IEEE/ACS International Conference on Computer Systems and Applications, pp. 229-
235, 2008.
[13] B. Karp and H. T. Kung, “Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. of 6th
Annual ACM/IEEE Int. Conf. on Mobile Computing, pp. 243-54, Aug 2000.
[14] C. Lochert, H. Hartenstein, J. Tian, H. Fubler, D. Hermann and M. Mauve, “A Routing Strategy for
Vehicular Ad Hoc Networks in City Environments,” Proc. of IEEE on Intelligent Vehicles Sympo-
sium, pp. 156-161, June 2003.
[15] B. Seet, G. Liu, B. Lee, C. Foh, K. Wong and K. Lee, “A-STAR: A Mobile Ad Hoc Routing Strategy
for Metropolis Vehicular Communications,” Lecture Notes in Computer Science, Vol. 3042, pp. 989-
999, Jan 2004.
[16] J. Tian, L. Han, K. Rothermel and C. Cesh, “Spatially Aware Packet Routing for Mobile Ad Hoc Inter
Vehicle Radio Networks,” Proc. of IEEE on Intelligent Transportation systems, Vol. 2, pp. 1546-
1551, Oct 2003.
[17] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc
[18] MOVE (Mobility model generator for vehicular networks), http://lens.csie.ncku.edu.tw/.
[19] NoW (Network on Wheels), http://www.network-on-wheels.de.
[20] NS2 (the Network Simulator), http://www.isi.edu/nsmam/ns/.