Conference PaperPDF Available

Cluster-based multi-hop vehicular communication with multi-metric optimization

Authors:
  • Karume Institute of Science and Technology (KIST)

Abstract and Figures

Dead spot and out of coverage problem are serious problems especially in the rural and suburban areas where the network infrastructure is not deployed. In this paper, a new end to end multi hop relay scheme for vehicular communication is proposed to extend the coverage or/and relaxing frequent handoff process. The scheme allows vehicles to continue connected to infrastructure network i.e. UMTS. Relay discovery, relay selection and gateway selection are discussed and examined. The proposed scheme can be implemented on top of any VANET routing protocols. AODV and DSDV were used as underlying protocol to evaluate our scheme. An integrated simulation environment combined of VanetMobiSim and NS2 is used to simulate our proposed scheme. The simplified gateway selection shows the best performance on top of AODV compare to DSDV.
Content may be subject to copyright.
International Conference on Computer and Communication Engineering (ICCCE 2012), 3-5 July 2012, Kuala Lumpur, Malaysia
978-1-4673-0479-5/12/$31.00 ©2012 IEEE
CLUSTER-BASED MULT-HOP VEHICULAR COMMUNICATION
WITH MULTI-METRIC OPTIMIZATION
Mahmoud A. Alawi, Rashid. A. Saeed, Aisha A. Hassan
Department of Electrical and Computer Engineering, IIUM
Jalan Gombak, 53100, Kuala Lumpur, MALAYSIA
Abstract-Dead spot and out of coverage problem are
serious problems especially in the rural and suburban
areas where the network infrastructure is not deployed. In
this paper, a new end to end multi hop relay scheme for
vehicular communication is proposed to extend the
coverage or/and relaxing frequent handoff process. The
scheme allows vehicles to continue connected to
infrastructure network i.e. UMTS. Relay discovery, relay
selection and gateway selection are discussed and
examined. The proposed scheme can be implemented on
top of any VANET routing protocols. AODV and DSDV
were used as underlying protocol to evaluate our scheme.
An integrated simulation environment combined of
VanetMobiSim and NS2 is used to simulate our proposed
scheme. The simplified gateway selection shows the best
performance on top of AODV compare to DSDV.
Keywords: VANET, heterogeneous network, UMTS, multi
hop relay scheme
I. INTRODUCTION
Heterogeneous wireless network is the one of the hot
research topics in wireless domain. It supports the
wireless devices with the capability to interoperate in
more than one wireless technology seamlessly. A good
example is the combination of Universal Mobile
Telecommunication System (UMTS) network and
IEEE802.11 based vehicular network (VANET) to form
more robust network in terms of speed and coverage area
[1]. VANET possesses many unsolved problems which
hinder the promising of intelligent transportation system
(ITS) to bring the safety and entertainment in
transportation system. Firstly, frequency network
disconnection caused by high speed of the vehicles
makes the inter connection time between V2V and V2I
to be very small due to the unpredictable motion of
vehicles which is difficult to predict when the vehicles
will change their speed and cause unexpected network
disconnection. Secondly is the limitation of the network
coverage especially in rural and suburban areas whereby
the infrastructure network is not well deployed. Lastly,
VANET signaling uses broadcast mechanism to
disseminate the data and control signals, this easily
causes flood to the network which results to extra
overhead and create network scalability problems[2] [3].
In [2][4][6] problems of establishment and
maintaining a connection to the Internet were discussed
and new protocols were proposed. The protocols use the
lifetime prediction of the link to select the best route to
the gateway. The longer life time the better the route in
the sense that, it reduce frequent link breakage which
have high impact on Quality of Service (QoS). A multi
hop relay mechanism to connect VANET to the
Infrastructure network was studied in [4]. The work
involves experimental evaluation of using relay vehicle
when the source vehicle moves towards the base station
(Node B) and when it moves away from the base station.
In [1], Clustering- based Multi-metric adaptive
mobile Gateway Management mechanism (CMGM) was
proposed. CMGM allows minimum number of vehicles
to connect to UMTS network by allowing normal
vehicles to use the GWC to communicate with the
UMTS network. Clustering mechanism was used to
cluster the gateway candidates, which depends on
direction of movement, UMTS-RSS (Received Signal
Strength), and IEEE802.11p transmission ranges. GWCs
closed to the cluster center are always selected as Cluster
head. Normal vehicles use cluster heads to communicate
to UMTS network. Three metrics are used for mobile
gateway selection; mobility speed, UMTS RSS and link
stability. However, this algorithm is complex in terms of
cost of creating and maintaining the clusters for rapid
environment as in VANET. In addition to that, the
signaling traffic and time that is used for clustering
formation and cluster head selection is larger than the
time of data traffic exchange.
In this paper we used hybrid metrics of the link life
time to determine the stability of the link between the
source vehicle and the relay vehicle along with best
route capacity selection to avoid overload and hence
bottleneck in one gateway. The remainder of this paper
is organized as follows; section II reviews the related
work. Section III introduces the simplified gateway
selection through multi hop scheme, while section IV
deals with the simulation and performance evaluation of
the proposed scheme and section V concludes the paper.
In our work we proposed a simplified mechanism to
formulate a cluster and gateway selection by formulating
clusters only at the UMTS cell edges. This done by
using received signal strength (RSS) threshold as a
cluster formation indicator, in addition to use the best
available route capacity for gateway selection.
22
II. SIMPLIFIED GATEWAY SELECTION (SGS)
SCHEME
Here we proposed simplified gateway selection
(SGS) to enable vehicles to continue connecting to
Internet or other mobile service (i.e. location map
download). Also we assumed that each vehicle has two
interfaces one to connect to infrastructure mode which is
UMTS UTRAN interface and another one is to connect
to the ad-hoc mode (IEEE802.11), both of these
interfaces must be active all the time. Our system model
shown in Figure 2, involves vehicles moving on the
highway into two opposite directions. All vehicles
access the UMTS network via UMTS Node B over the
UMTS radio interface (UTRAN) [1][5]. The vehicles
will experience different signal strength (RSS) from
Node B. All vehicles connect directly to Node B if they
are inside of the coverage (using UMTS UTRAN
interface) and once UMTS RSS fall to certain predefined
threshold the vehicle will use it IEEE802.11 interface to
find the partner to act as relay to connect to the UMTS
BST.
Fig 2: System model and scenario
A. Scheme overview
All the vehicles in the UMTS coverage zone use
UMTS UTRAN interface to connect to UMTS network.
When the UMTS receive signal strength (RSS) degrades
below the threshold it means that the vehicle is nearly to
move outside the UMTS cell area to handoff to other cell
or enter to the dead spot zone.
When vehicle receive RSS less than the RSS
threshold, the vehicle send broadcast message using
IEEE802.11 interface to search for relay to connect to
UMTS network. The source vehicle starts to broadcast
Relay request message (RReq) asking for the vehicle
which its UMTS-RSS is greater than the predefined
threshold (γ). All intermediate vehicles (IV) upon the
receiving of the RReq compute their received signal
strength and compare to the one sent in RReq, if
received signal strength is greater than the one
mentioned in RReq, the vehicle identified itself as one of
the relay candidates and unicast the relay respond
message (RRep) to the source vehicle. The source
vehicle can receive numbers of RRep but choose the best
one according to our proposed algorithm of selecting the
best relay (in section D). When this relay loses its
optimality, it will apply the same algorithm to select
another relay and continue to help the source vehicles to
forward their packets otherwise it will notify the source
vehicle the need of performing the handoff to new relay
and the source vehicle will broadcast again the RReq to
discover other relay vehicles. Figure 3 shows the flow
chart of our proposed scheme.
Fig. 3. Flow chart of the relay selection algorithm
B. Relay Discovery
After detecting the need of finding the relay, the
source vehicle (SV) uses IEEE802.11 interface to
broadcast the relay request packets (RReq). To mitigate
the broadcast storm, RReq will include time to live
(TTL) value that specifies the number of hops to search
for the relay that can assist the source vehicle (SV) to
connect to the UMTS network. Upon receiving RREq,
the intermediate vehicle will employ algorithm1 to
decide if it is the right candidate to be the relay. When
the intermediate vehicle receives RReq, it checks the
TTL value and sequence number (SeqNo) of the received
23
RRep, if the TTL value is greater than one (TTL>1) and
the sequence number (SeqNo) is greater than any
prevision RReq packet the intermediate vehicle will
compare its UMTS-RSS with one specified in RReq,
otherwise it will discard the packet.
If the UMTS-RSS of the intermediate vehicle is
smaller than the RSS threshold () it will reduce TTL
value by one and forward the packet to all its neighbors
except from source vehicle (SV) of the RReq. When the
vehicle found that its UMTS-RSS is greater then, it will
create the relay respond packet (RRep) and send back to
the SV using the same chain of nodes specified in RReq
packet. The SV selects the relay based on the certain
policy and starts to handoff vertically and connects to
the UMTS network in relaying mode.
C. Relay Selection parameters
Most of the prevision works are mainly focused on
the number of hops and route life time (RLT) as the
main parameters for optimal relay or gateway selection
[2][4][6], however using only these parameters will not
guarantee the best selection of the relay or gateway. In
this paper, multi metric relay selection algorithm is
proposed which is based on the three metrics, UMTS
received signal strength (RSS), route life time (RLT) and
available relay capacity (λ).
1. UMTS RSS
In VANET, the nodes are moving in high speed
which causes frequent change of the UMTS received
signal strength. Normally, when the vehicle moves
towards the Node Bits RSS is increasing and if it is
moving away from the Node Bits RSS is degraded.
However, the faster a vehicle moves towards or away
Node B, the faster will be the increase or decrease in its
UMTS RSS.
The UMTS  of the vehicles at the time is
computed as in [1].Suppose the velocity of the vehicle at
time is and at the time −1 its velocity was
 so the current  is calculated using equation 1,
which will be equal to the prevision RSS which is
 plus the function that denote the variation of
the UMTS receive signal strength i.e. 1+ ||
.
To compute the UMTS RSS when the vehicles moves
toward or a way of the BST Node B we use equation 1.
Where ∞ is constant that defines the rate of variation of
UMTS signal strength
= ±1+||
(1)
2. Route Lifetime
Rapid changes of the nodes position in VANET
results frequent route failure [1][2][5]. Thus, it is very
important to know the route lifetime (RLT) in order to
select the best route which can stay longer without
break. Hence, good prediction of the route lifetime can
significantly reduce the repairing of existing route or
reconstructing of the new route. We adopted the route
lifetime prediction algorithm proposed in [2].
When the RRep packet is created, the Relay vehicle will
insert its location as well as its velocity, and set the route
life time to infinity (RLT=∞). Again, when the
intermediate node receives the RRep, it extracts the
information from the packet (location and velocity) and
calculates the link life time (LLT) by using;
 = ||
|| (2)
Where if R is the range of IEEE802.11 radio,  is the
absolute distance between adjacent nodes and and
is the velocity of the adjacent nodes.
If the value is smaller than the route life time
mentioned in the RRep, the life time field in the packet
is changed to the new value otherwise the current value
is kept unchanged. In this way, the route lifetime value
continues to change until the RRep packet reaches the
SV. RRep packet contains the route predicted lifetime
(RLT) which is the minimum life time of all the links
(equation 3). Figure 4, shows the process of route link
life time prediction
RLT= min {
 } (3)
Fig. 4. Shows the process of predicting the route life time
3. Available route Capacity ()
In the relay scenario, if the selected relay serves a
number of vehicles more than its capability, it can result
in higher packet loss and delay due to the congestion on
that selected relay. Also in multi hop scenario, a multiple
24
route can have some vehicles in common in the route
from the source vehicle to relay or gateway vehicles.
This Also causes bottleneck problem on that route or on
the relay node buffer. To overcome these problems, the
source vehicle (SV) selects the route based on the
available route capacity.
Available route capacity can be defined as the
minimum available load capacity at any node [7][5],
including intermediate nodes and the gateway node.
During the relay discovery phase, when the relay vehicle
receives the RReq, before replies with the RRep
message, it computes its available capacity. Suppose the
maximum load capacity of a node is  and the
current traffic load handled by is  then the
available load capacity of the node is at , it is
computed as follows :
=  −− (4)
The current traffic load ( ) can be calculated using
equation 5, where  is the current traffic load on the
node that is relaying traffic from traffic sources and
P and  denote the average packet arrival rate and
average packet size of the traffic from source and b is
back off value which protects the vehicles from being
overloaded.
=
 (5)
The overall residual load capacity of route i is
computed as in equation 6 where j is vehicles in a route
including relay vehicle.
= min {
 } (6)
D. Multi Metrics Relay Selection Algorithm
As we have mentioned in the searching phase in
section 2.4, the source vehicle will receive a number of
RRep from different relays which fulfill the condition
mentioned in the request message (RSS>). Upon
receiving the number of RRep, the source vehicle
applied our multi metric relay selection algorithm which
is based on Simple Additive Weighting (SAW)
technique to select the best relay.
E. Relay Handoff Mechanism
In SGS scheme, when the relay vehicle losses its
optimality (UMTS-RSS< or RLT<), the source
vehicle has to handoff its connection from one relay to
another. The Relay vehicle will assist the source vehicle
to perform the handoff if its RLT with source vehicle is
above the Threshold. The Relay vehicle will start to find
another best relay and forward the incoming data to new
relay and notify the source vehicle about the new relay.
But when the route life time between the relay and
source vehicle is near to finish the relay vehicle, it will
notify the source vehicle on the need for performing the
handoff process.
The source vehicle will start to search for the new
relay .When the source vehicle succeeds to find another
best relay it will perform handoff to new relay and
notifies the old relay in order to release the resource
allocated for that source vehicle.
Begin Multi Metric Relay Selection Algorithm
A source vehicle broadcast the RReq using 802.11 interface
asking for the vehicle UMTS-RSS > .
When the RReq message receiving by a vehicle
If UMTS-RSS [VEHICLE]> then
send the RRep contain three metrics(UMTS-
RSS, RLT , )
Ignore duplication RReq from the same source.
else
Continue to broadcast the message to the
neighbor vehicles.
end if
When source vehicle Receive RRep
Calculate the scale metric Si
for each metric Mi of the P/R, where 1<i<3 do
If Mi [CRITERION] is POSITIVE then
=−

 −

else
if Mi [CRITERION] is NEGATIGE then
= −
 −

end if
end if
end for
The source vehicle calculates the weight of each Relay by
/ =∑(
[]∗ )

The source determines the Relay with the maximum weight
and selects it as the GATEWAY.
End of Multi metric relay selection algorithm
III. PERFORMANCE EVALUATION
In this section effectiveness of SGS scheme is
evaluated by using the combination of VanetMobiSim
[8] and NS2 [9]. VanetMobiSim is used to generate the
vehicular mobility model to be used in evaluating SGS
scheme while NS2 is used to measure the network
performance of SGS scheme. The vehicle mobility
model generated by VanetMobiSim is passed to NS2 to
define the node movement and speed. SGS scheme can
be implemented in any VANET routing protocol, we
compare SGS scheme performance on top of reactive
(i.e. Ad-hoc on demand routing protocol (AODV)[10])
and proactive (i.e. Destination sequence distance vector
(DSDV)[11]) routing protocols .In addition to that pure
AODV protocol and AODV with SGS were also
studied their performance VANET-UMTS scenario.
25
A. Simulation Environment
In this research NS2.33 version was used, patched with
NSMIRICLE [12] to support multiple interfaces in
wireless node. The mobility file obtained from the
VanetMobiSim was used in NS2 to define the node
motion during the simulation. Our simulation involves
one Base station (Node B) which is connected to the
UMTS network and the number of vehicles which use
that Node B to connect to the UMTS network as
illustrated in Figure 2. Table I and Table II shows the
parameter used to configure VanetMobiSim and NS2
respectively.
TABLE I
VANETMOBISIM MOBILITY GENERATOR PARAMETERS
Mobility Feature
Parameters/Value
Type of road
Highway
Number of lanes
2 lanes
Maximum speed
Varies from 20 to 160km/hr
Number of vehicle
Varies between 10 to 50
Simulation period
500s
Stop time
1 to 3s
TABLE II
NS2 SIMULATION PARAMETERS
Parameter
Value
Simulation Area
9000 * 1500 ()
Channel
Channel/WirelessChannel
Radio-propagation model
Propagation/TwoRayGround
Network Interface
MAC interface
Mac/802 11Ext
Routing protocol
AODV/DSDV
Interface queue
Antenna/.OmniAntenna
UMTS-RSS Threshold
-94 dBM
Base station Wireless
transmission range
Application
Packet size
Initial TTL value
B. Simulation Result
In Figure 7, the packet delivery ratio of SGS scheme
implemented on top of AODV is higher compared to the
one implemented in DSDV. For lower speed of vehicles
AODV and DSDV show closed packet delivery ratio
but when the speed of the vehicles increase the packet
delivery ratio of SGS scheme on top of AODV
outperform its counterpart. It can be observed that the
above elaboration is true because DSDV is designed for
lower mobility speed and that is the reason, when the
mobility of the vehicles increases, the packet drop for
DSDV grows up which lead the packet delivery ratio to
become lower. It has been shown from the graph that,
the packet delivery ratio of SGS scheme on top of
AODV is almost 21% higher than the packet delivery
ratio of SGS scheme on top of DSDV. Therefore, it can
be concluded that SGS scheme performed better in terms
of packet delivery ratio if we are implementing on top of
AODV rather than DSDV.
Figure 8 indicates that the throughput of SGS scheme
shows negative trends, when the vehicle speed increases
the throughput goes down. In this respect, when the
speed of the vehicles reaches above 100km/hr, the
throughput decreased rapidly for both AODV and
DSVD as underlying protocols. However, it can be
observed that the throughput of SGS scheme on top of
AODV is higher compared to SGS scheme implemented
on top of DSDV. The results in Figures 7 and 8 indicate
that SGS performed well when implemented on top of
AODV rather than DSDV. For that reason, AODV
protocol is selected to be underlying protocol of SGS
scheme.
Fig. 7. Packet delivery ratio of SGS scheme on top of Reactive
and proactive routing protocol with variation of mobility
speed of vehicles.
In Figure 9 we compare the packet delivery ratio of
AODV with SGS scheme and pure AODV (AODV
without SGS scheme) with different vehicles mobility
speed. It can be seen that, the packet delivery ratio of
AODV with SGS is higher compared to the packet
delivery of AODV without SGS scheme.
Fig. 8. Throughput of SGS scheme on top of Reactive and
Proactive routing protocol with variation of mobility speed of
the vehicles.
AODV with SGS shows insignificant decrease in
packet delivery ratio for the vehicles mobility speed
below 120km/hr. However, when the speed of the
vehicles increased above 120km/hr, there is noticeable
decrease in packet delivery ratio. Above this speed,
frequency migration of one relay to another by source
vehicles is likely to occur. In contrast, pure AODV
26
cannot sustain itself in this highly dynamic environment
because as it is shown in the graph its packet delivery
ratio goes down continuously when speed of the vehicles
goes up.
The variation of throughput against the vehicle
mobility speed of AODV with SGS and the AODV
without SGS is shown in Figure 10.AODV with SGS
shows an improvement of 31.7% of throughput
compared to AODV without SGS. Pure AODV using
pure flooding mechanism for the gateway discovery
which results in high number of routing traffic packet to
be sent when the vehicles speed is high and fewer
channels to be used for send data packet, the
consequence of this is the falling of throughput of the
network in pure AODV scheme. In contrast, AODV with
SGS improve the flooding mechanism used in pure
AODV by restricting the flooding area using incremental
TTL value.
Fig. 9. Packet delivery ratio of AODV with SGS scheme and
AODV without SGS scheme with variation in the mobility
speed of VANET vehicles
Fig. 10. Throughput of AODV with SGS scheme and AODV
without SGS scheme with variation in the mobility speed of
VANET vehicles.
IV. CONCLUSION
VANET–UMTS integration is the promising
architecture in the future. Vehicles may contain more
than one network interfaces which makes possible for
the vehicles to connect to either infrastructure mode or
ad hoc mode. This will help the Vehicles enjoy steady
Internet connection through UMTS network and at the
same time can communicate with other vehicles for
safety or entertainment information. In this paper, new
simplified scheme (SGS) is proposed to reduce dead spot
and increase the network coverage area in integrated
vehicle to UMTS network. The proposed SGS scheme
can be implemented below any VANET routing protocol
i.e. AODV and DSDV. In our future work, SGS scheme
will be compared with clustering based scheme proposed
in VANET-UMTS integration.
References
[1] Benslimane A., Talib T. and Sivaraj R., Dynamic
Clustering Adaptive Mobile Gateway Management in
integrated VANET-3G Heterogeneous Wireless Network,
IEEE Journal on Selected Areas in Communication vol
29. No. 3 2011.
[2] Vinod Namboodiri and Lixin Gao, “Prediction-based
routingfor vehicular ad hoc networks,”in Vehicular
Technology, IEEE Transactions on. Jul 2007, vol. 56(4),2,
pp.2332–2345.
[3] Fatma Hrizi and Fethi Filali, “On congestion-Aware
Broadcasting in V2X Networks.” EURECOM Mobile
Communication Department 2009.
[4] S.Bargi A., Benslimane and C.Assi., “A Lifetime based
routing for connect VANETs to the Internet” In Proc.of
IEEE International Symposium on World of
Wireless,pages 1-9,June 2009.J. Zhao, T. Arnold, Y.
Zhang, G. Cao, “Extending DriveThru Access byVehicle-
to-Vehicle Relay,” ACM VANET, 2008
[5] Mahmoud A. Alawi, Rashid A. Saeed, Aisha A. Hassan,
Othman Khalifa, “Simplified Multiple Metrics Gateway
Selection Mechanism For VANET To Infrastructure
Wireless Network”, The 6th international conference
SETIT 2012: Sciences of Electronic, Technologies of
Information and Telecommunications (SETIT2012), April
2012, Tunisia.
[6] S. Wan, J. Tang, and R. S.Wolff, “Reliable routing for
road side to vehicle Communications in rural areas,” in
Proceedings of IEEE International Conference on
Communications, 2008, pp.3017- 3021
[7] Safda H. and Sasase I, “Multiple End- to-End QoS Metrics
Gateway Selection Scheme in Mobile Ad hoc Networks,”
International Conference on Emerging Technologies 2009.
[8] Haerri J, Fiore M, Fethi F, Bonnet C. “VanetMobiSim:
generating realistic mobility patterns for VANETs”,
Institute Eurécom and Politecnico Di Torino, 2006.
Available at: http://vanet.eurecom.fr/
[9] The network simulator- ns2, http://www.isi.edu/nsnam/ns/
[10] C. Perkins and E. Royer. ”Ad hoc On-Demand
Distance Vector Routing.” In Proc. 2nd IEEE Workshop
on Mobile Computing Systems and Applications, USA,
Feb. 1999.
[11] C.E. Perkins and P. Bhagwat, “Highly dynamic
destination-sequenced distance vector routing (DSDV)
for mobile computers,” in Proc. ACM SIGCOMM 94,
London, UK, pp. 234-244 , Oct. 1994.
[12] N. Baldo, F. Maguolo, M. Miozzo, M. Rossi, and M.
Zorzi, ”ns2- MIRACLE: a modular framework for multi-
technology and cross-layer support in network simulator
2”, In Proc. 2nd International Conference on Performance
Evaluation Methodologies and tools, France, Oct. 2007.
27
... It was built using library standards and protocols that allow Koha to interact well with other existing workflows from different systems. Koha works using OPAC, and it is compliant with XHTML, CSS and JavaScript, making its platform-independent [22]. Koha is the enterprise resource planning system used for automating and integrating information management practices in an organization. ...
Article
Most public and private libraries are inclined to adopt using Koha ILS around the globe. However, several Arab schools could not implement the Koha ILS application to automate their school libraries for ease of use. Deploying technology in managing libraries can solve several identified issues in public and private schools. This provides efficiency, ease and improves the performance of library services. Therefore, this paper is based on qualitative research that implements an efficient open-source application known as Koha ILS in two Arab schools, namely Baseerah International School (BIS) and International Modern Arab School (IMAS), Kuala Lumpur, Malaysia. In our analysis, we consider analyzing the proposed Koha ILS by providing backend accessibility so as library consumers can make a further enhancement to upgrade the application. The proposed Koha presents several positive impacts such as an efficient cataloging system, remote management of library consumer records such as books or room reservations and customizable searching interface for efficient usage. The application also presents multiple operating system support for a user’s flexibility. In our results, an analysis was made by comparing the two schools based on gender, position/ranks available in the school library, and IT gadgets. Toward this end, some limitations were noted and recommended as a future research direction.
... In [4], the algorithm is based on the signal strength of the nodes received. The model designed in this paper is intended to improve the clustering and stable relationship between network nodes in outlying areas and the lack of appropriate infrastructure for roadside stations. ...
Article
Full-text available
VANET networks are classified as one of the applications of mobile case networks designed to improve road safety and provide passengers with comfort. Vehicle case networks are different in terms of architecture, features, challenges, and applications with mobile moving networks. Before many car networks are deployed, a number of technical challenges need to be addressed in order to exploit the benefits of these networks. Some of these challenges are common in car networks with other wireless networks, while others are due to the unique properties of car networks. In this research, we are trying to provide a new method for the exchange of information on highway roads based on the inter-car network. The main issues in this area are considering the distance between vehicles, type of protocol and standards. Also, modulation techniques, channel selection and channel replacement methods are based on weighted-based modulation, which explored in this research. Also SPA-(S, P) modeled in this work to optimizing more which applied to routing schema. This approach has been carried out in mountainous environments, especially in tunnels, and the results show improvements in the proposed approach compared to previous approaches in semi-mountainous roads rather than tunnels.
... In addition, the cluster supports interest classification to better satisfy user preferences. Since nodes could not connect infrastructure quickly and efficiently in the areas where the infrastructure is not covered fully, Alawi et al. [29] designed a cluster-based end-to-end routing scheme in which nodes access the infrastructure according to the strength of the signal. ...
Article
Full-text available
The vehicular ad hoc networks (VANETs) have recently received much attention. However, the efficiency of network transmission is low because of the dynamic characteristics. To improve transmission performance, many studies introduce Content Centric Networks (CCN) into VANETs forming information-centric VANETs. Due to dynamic of network topology, the efficient design of data transmission is a great challenge. In this paper, we propose the encounter-aware and clustering-based routing algorithm (ECRA) for information-centric VANETs. The awareness of encounter allows vehicles to record the movement track of other vehicles to find the destination node quickly. The clustering can better manage data exchange among nodes in urban traffic networks. The cluster heads exchange historical encounter information (e.g., encounter node, encounter time and encounter location) with each other to maintain a g-ECRA table, which is used to determine the position of the next anchor. The experimental results verify the effectiveness of ECRA in information-centric VANETs.
... Alawi et al. wanted to extend the coverage and enhance the frequent handoff process. They proposed a new end to end multi-hop relay scheme called (SGS) for vehicular communication [116] . This new simplified scheme proposed for the integrated VANET-UMTS network to reduce dead spot and increase the network coverage area. ...
Article
Vehicular communications have developed rapidly contributing to the success of intelligent transportation systems. In VANET, continuous connectivity is a huge challenge caused by the extremely dynamic network topology and the highly variable number of mobile nodes. Moreover, message dissemination efficiency is a serious issue in traffic effectiveness and road safety. The heterogeneous vehicular network, which integrates cellular networks with DSRC, has been suggested and attracted significant attention recently. VANET-cellular integration offers many potential benefits, for instance, high data rates, low latency, and extended communication range. Due to the heterogeneous wireless access, a seamless handover decision is required to guarantee QoS of communications and to maintain continuous connectivity between the vehicles. On the other hand, VANET heterogeneous wireless networks integration will significantly help autonomous cars to be functional in reality. This paper surveys and reviews some related studies in the literature that deals with VANET heterogeneous wireless networks communications in term of vertical handover, data dissemination and collection, gateway selection and other issues. The comparison between different works is based on parameters like bandwidth, delay, throughput, and packet loss. Finally, we outline open issues that help to identify the future research directions of VANET in the heterogeneous environment.
Chapter
This chapter provides an overview of the diverse applications of ML in UAVs for object and people detection and tracking. It begins by examining the current landscape of ML-driven UAV technologies and their potential. The related work section discusses the advancements in object and people detection and tracking. The subsequent sections delve into the technical aspects, focusing on the next generation of UAV convolutional neural network (CNN) backbones, including the contextual multi-scale region-based CNN (CMSRCNN), single shot multibox detector (SSD), and you only look once (YOLO), highlighting their significance in enhancing detection capabilities. Furthermore, it explores practical applications of ML in UAVs, encompassing object and people detection and tracking, path planning, navigation, and image and video analysis. Challenges and complexities in vision-based UAV navigation are addressed. Additionally, it showcases the potential for UAV networks to locate objects in real time.
Article
Full-text available
The emerging Vehicle-to-Everything (V2X) communication technologies, i.e. Dedicated Short-Range Communications (DSRC) and Cellular-V2X (C-V2X), enhance the performance of the vehicular safety applications by increasing the range of perception, leading to more reliable vehicles' situational awareness. However, the scalability issue of such communication technologies, especially in congested urban areas, requires the employment of information dissemination strategies that avoid wasting network resources. Piggybacking compressed information over periodic Basic Safety Messages (BSM) and Model-Based Communication (MBC) are amongst such strategies to enhance situational awareness while addressing the scalability issue. Leveraging these notions, we propose a network-aware error-driven content selection technique to piggyback the information that is of more importance to the receiving vehicles. In addition, two different modeling schemes, i.e. a deterministic constant acceleration and yaw rate, and a probabilistic Bayesian inference modeling scheme have been introduced and their prediction performances under such content selection technique are compared to an existing distance-dependent piggybacking algorithm. Through simulations based on realistic traffic data, we show that our proposed Bayesian modeling scheme combined with the proposed content selection algorithm can improve the overall tracking accuracy by 53% compared to existing distance-dependent content selection approaches.
Article
Full-text available
This paper evaluates throughput to improve interest and data content transmission in the proposed distributed rendezvous server stream. An anchor within the network core is not considered but hence anchorless connection is adopted to aid routing between different locations of producer and rendezvous servers.This technique is simulated to present a seamless communication between producers and rendezvous servers.Using ndnSIM 2.1, performance analysis is measured to determine best route forwarding strategy and ensure minimal signalling cost and overhead. The mobile producers and servers were interfaced with Wireshark to capture packet and analyse the network statistics for throughput (moving average), segment length, round-trip time, sequence number and window scaling.
Conference Paper
Full-text available
The demands for vehicular Internet access are proliferating. Access points (APs) can be deployed along the roadside to provide wireless coverage and network access for mobile vehicles. However, high mobility may cause frequent link breakages, which will seriously impact quality of service (QoS). In this paper, we study reliable routing for roadside to vehicle (R2V) communications in rural areas where rough terrain poses additional challenges. We propose a novel routing protocol where the stationary APs play a key role in route maintenance. The protocol includes a prediction algorithm which can predict the lifetimes of wireless links with consideration for terrain effects, as well as routing algorithms which can find stable paths for packet forwarding based on the prediction. Simulation results based on OPNET modeler and the rural roadways in the Yellowstone National Park show that the proposed protocol substantially outperforms existing ad-hoc routing protocols.
Article
Full-text available
Coupling the high data rates of IEEE 802.11p-based VANETs and the wide coverage area of 3GPP networks (e.g., UMTS), this paper envisions a VANET-UMTS integrated network architecture. In this architecture, vehicles are dynamically clustered according to different related metrics. From these clusters, a minimum number of vehicles, equipped with IEEE 802.11p and UTRAN interfaces, are selected as vehicular gateways to link VANET to UMTS. Issues pertaining to gateway selection, gateway advertisement and discovery, service migration between gateways (i.e., when serving gateways lose their optimality) are all addressed and an adaptive mobile gateway management mechanism is proposed. Simulations are carried out using NS2 to evaluate the performance of the envisioned architecture incorporating the proposed mechanisms. Encouraging results are obtained in terms of high data packet delivery ratios and throughput, reduced control packet overhead, and minimized delay and packet drop rates.
Conference Paper
Full-text available
Several gateway selection schemes have been proposed that select gateway nodes based on single QoS metric, for instance link availability, link capacity etc. or multiple non-QoS metrics, such as the combination of gateway node speed, residual energy, and number of hops, for mobile ad hoc networks (MANETs). Each scheme just focuses to improve only single network performance such as network throughput, packet delivery ratio, end-to-end delay or packet drop ratio. However, none of those schemes improves overall network performance. To improve the overall network performance, it is necessary to select a gateway with stable connection, maximum link capacity and less latency. In this paper, we propose a gateway selection scheme that considers multiple end-to-end QoS parameters such as route availability period, route capacity and route latency, to select a potential gateway node. The precise estimation and propagation of end-to-end QoS metrics are proposed in this paper. We simulate our gateway selection scheme with a simple hybrid gateway discovery algorithm and it shows that our gateway selection scheme improves throughput, packet delivery ratio with less energy consumption per node. Also it improves the end-to-end delay compared to the single QoS gateway selection schemes.
Conference Paper
Full-text available
Due to the dramatic increase in the number of accidents all over the world, a rapid emergence of wireless vehicular networks has been perceived in the last few years, particularly, aiming at improving safety and efficiency in the road. Such applications require broadcast communications to disseminate emergency information in brief delay for all the vehicles in the area of danger. Designing an efficient broadcast scheme is crucial. For this reason, a large variety of approaches have been proposed. In this paper, we present a survey on various efforts for designing suitable multi-hop message dissemination schemes for vehicular systems especially which have been focused on reducing channel congestion. Furthermore, we propose a comparison of message dissemination proposals. Their performance evaluation and their advantages and limitations are also highlighted.
Conference Paper
Full-text available
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm
Conference Paper
Full-text available
In this paper, we present and describe VanetMobiSim, a generator of realistic vehicular movement traces for telecommunication networks simulators. VanetMobiSim mobility description is validated by illustrating how the interaction between featured macro- and micro-mobility is able to reproduce typical phenomena of vehicular traffic.
Conference Paper
Inter-Vehicle Communications have recently attracted research from both academia and industry. In such networks, vehicles should be able to communicate among each other (V2V) as well as with roadside Infrastructure units (V2I). These units provide some services such as driver information systems and Internet access. Because of the high speed and high mobility of vehicles, establishing and maintaining a connection to these units is very challenging. We introduce a new protocol which uses the characteristics of vehicle movements to predict the vehicle behavior and select a route with the longest life time to connect to the wired network. It aims at spreading the advertisement messages through multi-hops without flooding the network, do seamless hand-overs and select the most stable routes to these units. We performed some simulations and compared the performance of our work with some well-known protocols.