Recent Trends in Computer Science: Reliability Calculation of VANET With RSU Using UGFT

International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 2, Issue 12, December - 2015. ISSN 2348 4853, Impact Factor 1.317
Recent trends in Computer Science: Reliability calculation

of VANET with RSU using UGFT
Dr.P.Uma Maheswari/Professor1*,
Mrs.M.Rajeswari2/AP/CSE/Mrs.K.S.Meena3/AP/Maths/Dr.T.Vasanthi4/Professor
Anna University1, MIT Campus/Chennai/India, Angel College of Engineering and Technology2&3,
Tirupur/India, PSG College of Technology4, Coimbatore/ India
dr.umasundar@gmail.com,rajimanickam@gmail.com,darshu.meena@gmail.com
ABSTRACT
VANET is a subset of MANET where the moving vehicles are considered as nodes to enable
communication between vehicles. The primary goal of VANET is to disseminate road safety
messages including vehicles current speed, location, traffic messages, warning messages and
carter behavior in an efficient manner. In recent years many routing protocols have been
proposed which primarily focuses on safety and reliability. Here, Reliability of the VANET is
defined as the probability of successful transmission of message from the source vehicle to the
destination vehicle via RSU. Network reliability can be determined by using Universal Generating
Function Technique (UGFT). This paper explains the method of calculating the reliability of
VANET in the presence and absence of RSU. Reliability is calculated by defining the node UGF, UGF
of RSU and link UGF. The performance is evaluated using NS-2 simulation. The simulation results
show that the performance of VANET with RSU is high according to packet de-lay, drop and traffic
intensity.
Index Terms : VANET, RSU, UGFT, Reliability
I.
INTRODUCTION
There is an increasing demand and a big challenge to control the traffic in Vehicular Adhoc NETwork
(VANET). The traffic information are communicated to vehicles in the form of V2V (Vehicle to Vehicle) or
V2I (Vehicle to Infrastructure) interaction medium. VANET allows commercial Service Providers (SP) to
promote their business in the form of advertisements which shows great application potential. The
primary VANETs goal is to increase road safety by means of disseminating the valuable information from
a source vehicle to other ongoing vehicles on the road side. To achieve this, the vehicles act as relays and
exchange warning messages or more generally telemetric information (like current speed, location)
which enables the drivers to react early to abnormal and potentially dangerous situations like accidents,
traffic jams or glaze. In addition, authorized entities like police vehicle or firefighters should be able to
send alarm signals and instructions to other ongoing vehicles on the road side. E.g. to clear their way
when any accident occurs or stop other road users if any emergency situation arises. Besides that, the
VANET [1] should increase comfort by means of value added services like location based services and
other services like ad dissemination, providing internet access etc. The main goal of routing protocol is to
provide optimal paths between network nodes by reducing overhead when the packets are transmitted
in a dynamic environment [14]. Many routing protocols [6][7] have been developed for VANETs
environment according to nature of protocol, techniques adapted, transmission strategies, updating the
routing information and so on. However, the messages produced by vehicles may not be consistent if the
distance of destination vehicle is at distant. To make a consistent message delivery, there has been
significant research work done by combining information, communication and transformation
technologies. For effective routing, Road Side Units (RSUs) are deployed on the road side which will
7 | 2015, IJAFRC All Rights Reserved
www.ijafrc.org

deliver the information to the desired vehicle in a shorter time. This paper focuses on forwarding the
traffic information with reliable route discovery process that includes calculating the node and link
consistency to obtain the VANET reliability. In a conventional reliability system, binary system reliability
techniques have been widely used. Compared with binary system model, a Multi State System (MSS)
model has been proven to be a flexible tool for representing the engineering systems in real life. For
dynamic systems which consist of moving vehicles as components and states, the calculation of system
reliability requires a significant amount of time. Fortunately, in many situations UGFT is a universal
technique to calculate the system reliability that includes the need of node and link consistency. For a
dynamic system like VANET, UGFT is an important technique for evaluating reliability in complex
systems that reduces the computational complexity for the MSS.
II.
RELATED WORK
Maxim Raya et al. [3] demonstrated that the vehicular networks are very likely to be deployed in the
coming years and thus become the most relevant form of Mobile Adhoc Networks. They explained the
basics of Vehicular Adhoc Network and the method of securing the nodes. Lochert et al. [15] have
demonstrated the Geographic Source Routing (GSR) for Vehicular Adhoc Networks in city environment,
which combines position based routing with the topological knowledge. Here, the position information is
used to define the routing along with the normal parameters. Zhao et al. [8] designed VADD: Vehicle
Assisted Data Delivery in Vehicular Adhoc Networks in order to concentrate on the problem of delay
tolerant application in sparse network. Jin-Jia chang et al. [2] explained STAR (Shortest path based
Traffic-light Aware Routing) for VANETs with the traffic light consideration which is an intersection
based routing protocol in dense areas where the traffic density is high, traffic lights exist at intersections
and vehicles may halt and go. Xue Yang et al. [17] proposed a vehicle-to-vehicle communication protocol
for cooperative collision warning to reduce the number of fatal roadway accidents by providing early
warnings.
Mershan et al. [4] defined CAN DELIVER (CArry and forward mechaNisms for Dependable
mEssage deLIvery in VanEts using Rsus) that depends on RSUs to relay packets to distant vehicles which
performs well under both dense and sparse condition. Routing messages through RSUs enable distant
users to communicate with each other with minimum delay. Lochert et al. [15] proposed that the Vehicleto-Infrastructure (V2I) communication system is based on the geographic coverage provided by cellular
networks. General Packet Radio Service (GPRS) and Universal Mobile Telecommunications System
(UMTS) are used to connect each vehicle with the central control unit. Zhengming li et al. [19] proposed
three algorithms for message dissemination in VANET. The three algorithms are distance based gradient
algorithm, privacy preserving & incentive centered cash in algorithm. Incentive centered architecture is
proposed to encourage the SPs to set reasonable cost and effect requirements for ad dissemination. A
novel Distance-Based Gradient (DBG) algorithm is proposed to disseminate ads to emulate the ad posting
patterns in the physical world and control the cost and effect of ad dissemination. An efficient, secure,
and privacy-preserving incentive cash-in algorithm is proposed to encourage the cooperation of
vehicular nodes and support economic value creation. In MOPR [18], a MOvement Prediction-based
Routing algorithm was proposed that predicts the future position of a vehicle and searches for a stable
route. If several potential routes between the source vehicle and the destination vehicle exist, then it
chooses the route which is the most stable when considering the movement conditions of the
intermediate nodes with respect to the source and destination nodes. Proposed technique demonstrates
the route discovery with RSU, without RSU and their performance.
III.
RELIABLE VEHICULAR DESIGN
The purpose of this work is to reduce the delay that occurs in the existing work and also to achieve
www.ijafrc.org

reliability while transferring the packets. RSUs are deployed on the road side in addition to the moving
vehicles. Connection is made between RSU and vehicles or between vehicles and RSU. For effective route
discovery, connection is established between the RSUs. Various approaches that have been used for
designing the RSU are as follows. Some RSUs are standalone, some are wired with each other, and others
are wired to neighboring RSUs. RSUs can also be connected using internet. In all these cases, each RSU
has a way to connect (directly or via other RSUs) to other RSU. When a source vehicle wishes to send a
packet to the destination vehicle through RSU, it examines whether the desired RSU is within its
transmission range. If so, source sends packet directly through the wireless channel. Else, source vehicle
finds its nearest RSU to carry the packet to the destination. RSU that needs to send a packet to a
destination vehicle will get the location, speed and direction of vehicle from previous vehicles last
beacon message. In this way, RSU is able to forward the message to a single vehicle or to a group of
vehicles. Figure 1 illustrates the communication from VANET 1 to VANET 2. VANET 1 is formed by
grouping 5 vehicles from 1 to 5 and VANET 2 consists of 4 vehicles numbered from 6 to 9. Two RSUs are
placed between VANET 1 and VANET 2. First RSU which receives the information from VANET 1 is
designated as RSUD whereas the second RSU that delivers the packets to VANET 2 acts as a source and is
named as RSUS. RSUD covers vehicles from 1 to 5 as they are in the same radio coverage area. Vehicles
from 6 to 9 are handled by RSUS which is capable of receiving the information either from neighboring
RSU or from the vehicles that are in the same coverage area. It is assumed that any vehicle from VANET 1
communicates to the set of vehicles in VANET 2 through the RSUs that are inserted between the two
networks. Nodes can have one time registration. If the node moves to another RSU region then it need not
register again because the new RSU gets the information from the previous one. By this, the overhead
caused by the same RSU is reduced. This works well at the sparse condition.
Figure 1 Communication from VANET-1 to VANET -2
For e.g., if vehicle 1 detects any accident and if it leads to congestion, then this information is
disseminated to the RSUD which is responsible for that region. This RSUD forwards the alert messages to
its nearest RSUS which, in turn delivers the packet to all the vehicles in VANET2. This concept sends alert
message both to the vehicles and to the nearby hospital for immediate action. It reduces the overhead
and the delay in delivery when communicating between RSUs. DBG (Distance Based Gradient) algorithm
is used to calculate the shortest distance among the nodes and designates the node with the shortest
average distance as the next forwarder. Thus each vehicle is made to act as source. Traffic messages are
disseminated to ensure pragmatic cost and effect control. Thus the content of the message is reduced by
avoiding unnecessary details which may lead to major threats and also calculates the threshold value for
each type of message. Other information can be delivered on demand when it is requested with the help
of threshold value. Threshold value here indicates the weight of the message which is calculated with the
help of content packed inside the message. This method includes DBG algorithm in addition to RSU
technique for transmitting the information effectively. Reliability is also calculated by using UGF
technique so that the performance of the entire VANET outperforms other existing schemes.
www.ijafrc.org

IV.
UGFT IN VANET
Reliability theory has been applied extensively in many real-world systems. Reliability evaluation
approaches exploit a variety of tools for system modeling and reliability index calculation. Most of the
network reliability evaluation methods are formulated in terms of either Minimal paths or Minimal cuts
[12]. Universal Generating Function (UGF) based algorithm outperforms other related methods. The
UGFT is straight forward, effective and universal [16]. It involves intuitively simple recursive procedures
combined with simplification techniques, and it is suitable for reliability evaluation of dynamic systems.
It allows one to find the entire system performance based on the performance distribution of its nodes
using algebraic procedures and also using the reliable communication between vehicles and RSU. The
first UGFT was proposed for the one-to-many-targets acyclic MIN (Multi Information Network) reliability
problem by Levitin [12], and was improved by Yeh [5][9] using some simplified techniques. The UGFT is
proven to be very effective for evaluating the reliability of different types of acyclic multistate networks
especially for the MIN. In recent years, Yeh [11] extended the UGFT further for general multistate
network reliability, which is more practical and reasonable than acyclic multi-state networks. So far
UGFT is used for reliability calculation of MIN, MSS (Multi State System), BSN (Binary State Network) and
ABSN (Acyclic Binary State Network), MANET (Mobile Adhoc Network). [5], [9], [10], [13] & [20]. This
work concentrates on calculating the VANET reliability using UGFT. In this pilot study, both node-UGF
and path-UGF are applied in which SDPs (State Dependent Probability) are built for each node and link in
the VANET. The UGF is used to mathematically represent the links and combine their SDPs through a
formally introduced multiplication operator to find the final VANET reliability.
Definition 4.1: The node UGF is defined as a polynomial in X such as
u (n i ) = ( Pni :RSU D ) X RSU D

where ( Pni :RSU D ) is the probability of passing the information from node ni to RSUD: For Example, in
Figure 1, the node UGF of u(ni) is given by u(1) = 0.75.
Definition 4.2: The node UGF for RSUS is defined as
Nn
u ( RSU S ) = ( PRSU S :Ni ) X Ni

i =1
where PRSU S :Ni is the probability that the information is received by the nodes of Ni directly from RSUS at
a time. For Example, in Figure1,
N1

i =1
= 0.8*0.7*0.6*0.9=0.3024.
Definition 4.3: The node UGF for RSUD is defined as
n
u ( RSU D ) = ( Pni :RSU D ) X RSU D , ni Ni

i =1
where Pni :RSU D is the probability that the message is directly received by RSUD from node set Ni. For
Example, in Fig.1,
2
u ( RSU D ) = ( Pni :RSU D ) X RSU D

i =1
= P1:RSU D * P2:RSU D = 0.75*0.7=0.525

Definition 4.4: Link Reliability of VANET is defined as the probability of successful transmission of
www.ijafrc.org

messages from a particular vehicle in VANET 1 to all vehicles of VANET 2 via RSU. It is defined as the
composition of individual UGF of ni, RSUD, RSUD&S and RSUS.
RLi = u (ni ) * u ( RSU D ) * u ( RSU D & S ) * u ( RSU S )

Definition 4.5: Reliability of VANET is defined as the probability of successful transmission of valid
traffic messages from one sort of vehicles to another sort of vehicles through RSU.
Ni
RVAN = RLi
i =1
Special features
Rule 1: A set of nodes are called as node set and is denoted by Ni. Each node set is treated as a single
VANET. RSUs are used to make effective communication between VANETs. RSU will play a multiple role
in this transmission. If the RSU receives information form Ni , then it is called as destination RSU. If the
RSU disseminates the information to set of vehicles, then it is considered as source RSU. Apart from these
roles, RSU may receive message from any RSU and relay it to nearby VANET immediately. In this case,
RSU plays the role of both destination and source RSU.
Rule 2: Each transmission requires a unique representation. The probability of transmission of
information from node set Ni to RSU, RSU to Ni and within RSU are denoted by
( PNi :RSU D ) X RSU D , ( PRSU S :Ni ) X Ni , ( PRSU D :RSU S ) X RSU S

For e.g. in Figure 1, the information from a particular node of VANET 1 to the set of nodes in VANET 2
through RSU is represented by
( P1:RSU D , RSU S ::{5,6,7,8} ) X {5,6,7,8}

Vehicular Node 1 sends the traffic message to RSUD which in turn forwards the message to RSUS . This
RSUS then disseminates the information to nodes 5,6,7,8 of VANET 2.
Rule 3: The inclusion of State Dependent Probability like P i : plays a prominent role in identifying the
working states. Here P i :
denotes that the information is terminated at node i. Hence by introducing
state dependent probability, we can reduce the number of non-working states and include all the
possible working states in UGF.
Rule 4: If the information initiated from a particular node of VANET 1 is transmitted to the set of nodes in
VANET 2 through RSU successfully then the corresponding probabilities are multiplied.
( P1:RSU D , RSU S ::{5,6,7,8} ) X {5,6,7,8}

= 0.75 * 0.8 * 0.8 * 0.7 * 0.6 * 0.9 = 0.18144
Rule 5: In link reliability calculation of VANET without RSU, vehicles may communicate with other
vehicles directly. There are several possibilities for the information that are initiated from any one
vehicle in the source VANET. The vehicle may pass the message to all the vehicles in the destination
VANET. Hence the link reliability is defined as RLi = Pn:Ni X iN with i= 1,2,3,.n, where n is any node in
source VANET and Ni is the destination VANET. For e.g. in Fig. 1, in the absence of RSUs, node 1 of VANET
www.ijafrc.org

1 will send message to nodes 6 (or) 7 (or) 8 (or) 9 of VANET 2. Therefore the link reliability with SDP via
node 1 is RL1 = 0:2 + 0:3 + 0:2 + 0:1 = 0:8
Rule 6: The VANET reliability without RSU is defined as the probability of successful transmission of valid
traffic messages from one sort of vehicles to another sort of vehicles and is given by
Ni
RVAN = RLi
i =1
Algorithm
Step 1: Define the UGF for RSUD, RSUS , RSUD&S
n
u ( RSU D ) = ( Pni :RSU D ) X RSU D , ni Ni

i =1
Nn

i =1
u ( RSU D & S ) = ( PRSU D :RSU S ) X RSU S
Step 2: Obtain link UGF for all possible links using rule 4
RLi = u (ni ) * u ( RSU D ) * u ( RSU D & S ) * u ( RSU S )

Step 3: Calculate RVAN using rule 5
Ni
RVAN = RLi
i =1
Illustration
Table 1 summarizes all the possible working states and the corresponding transmission probabilities of
the VANET with RSU. The algorithm proposed in the previous section can be applied to the above
network (Figure 1) with the data given in the Table 1 is as follows.
Table 1 Working States
VAN 1
SDP
VAN 2
SDP
1-RSU
0.75
RSU-6
0.8
2-RSU
0.7
RSU-7
0.7
3-RSU
0.8
RSU-8
0.6
4-RSU
0.9
RSU-9
0.9
5-RSU
0.6
A State dependent probability has been assigned to each working state and the reliability has been
calculated. Table 2 describes the working states and their probability without using RSU.
www.ijafrc.org

Table 2 Working States without RSU
Node
SDP
Node
SDP
1_6
0.2
2_6
0.4
1_7
0.3
2_7
0.3
1_8
0.2
2_8
0.2
1_9
0.1
2_9
0.1
3_6
0.5
4_6
0.2
3_7
0.1
4_7
0.3
3_8
0.2
4_8
0.1
3_9
0.1
4_9
0.4
5_6
0.3
5_8
0.1
5_7
0.2
5_9
0.1
Reliability Calculation of VANET with RSU

The link reliability of a VANET can be calculated as follows:
RL1 = U(1) = u(1) * u(RSUD&S ) * u(RSUS ) = 0.75*0.8*[0.8*0.7*0.6*0.9]

5
RVAN = RLi = RL1 * RL2 * RL3 * RL4 * RL5

i =1
=0.18144+0.19934+0.19353+0.28772+0.14525 =0.9
Reliability Calculation of VANET without RSU
The link reliability of a VANET without considering RSU can be calculated as follows:
RLi = U(1) = 0.2+0.3+0.2+0.1

RL2 = U(2) = 0.4+0.3+0.2+0.1
RL3 = U(3) = 0.5+0.1+0.2+0.1
RL4 = U(4) = 0.2+0.3+0.1+0.4
RL5 = U(5) = 0.3+0.2+0.1+0.1
5
RVAN = RLi = RL1 + RL2 + RL3 + RL4 + RL5

i =1
= 0.8 * 1.0 * 0.9 * 1 * 0.7 = 0.5

Reliability of VANET is high when the RSU is placed in between set of vehicles. Table 1 describes the
probabilities as-signed between RSU and vehicle whereas Table 2 describes the probabilities assigned
between a vehicle and other vehicle. Reliability calculation by using UGF technique clearly depicts the
improvement in calculating the reliability when RSU is being used. This helps the vehicle to disseminate
the packets in a reliable manner.
www.ijafrc.org

V.
RESULTS AND DISCUSSION
The simulation task should offer a network environment as close as possible to the real world
environment. Simulation is done by considering Junctions, without considering Junctions, between RSU
and between RSU and vehicle. Junction is taken to show the performance of VANET comparatively with
RSU and without RSU. Network scenario is classified into 3 types according to the area size denoted in
meter and number of vehicles used. Number of packets delivered successfully in the above network is
described in the table.
Figure 2 Average Delivery Ratio
Figure 3 Average Drop
The packet delivery is estimated based on the request rate and delivery ratio. When the request is
increased the change in delivery ratio is simulated. In Figure 2, the delivery is maximized, when there is a
communication between RSUs. But the delivery is low when there is no junction consideration or when
there are no vehicles to carry the packets to destination. Also when compared to the communication
between the vehicle to RSU or between RSU to vehicle the communication between RSUs outperforms
all. So the delivery can be calculated using the following equation,
PDR = Number of Packets Delivered Successfully / Total Number of Packets Requested
The packet drop is estimated based on packets loaded and the packets drop. When the packets are
loaded, the change in drop is simulated. In Figure 3, when there is light load all the methods performs
with less drop. When it is slightly increased the drop gets gradually increased. The drop is very less when
there is an RSU compared with other two. All the three methods perform well when load is heavy but
there drop without considering junction issues. The communication using RSU has fewer drops
compared to all the other techniques. The average packet drop can be evaluated by,
Average Drop = (Total no of Packets Send by Source) - (Total no of Packets Received by Destination)
Figure 4 Average Packet Received
Figure 5 Average Packet Delay
The average packets received is estimated between the packets loaded and the packets delivered. When
the packets are loaded, the change in receiving ratio is simulated. In Figure 4, when there is a light load
the packets are received properly. The receiving ratio gets increased when the load is increased. But the
www.ijafrc.org

ratio of the received packet is low when there is a junction issue and also when there are no vehicles or
RSU to transfer packets. Of all the communication between the RSU have low traffic intensity when the
load generated on them is very low. The average packet received can be determined by,
Packet Received = Packets Received by Destination / Packets Sent by Source
The delay is estimated based on load of packets send per sec and the delay in receiving the packets/sec.
The change in delay is simulated. In Figure 5, the delay is low when there is a fair load. The delay fairly
gets increased when load also increases. Again the delay gradually gets increases when the load
increases. Simulation results show that the delay is low when there is a communication between RSUs.
The delay can be evaluated by using the below equation,
Delay = Time Received by Destination Time Sent by Source
The average traffic is calculated with respect to the distance between the source and destination. As of
Figure 6, the change in distance makes the change in traffic. When the distance between the source and
destination is nearer there is no condition for traffic to occur.
Figure 6 Traffic Intensity
When the distance is average there is an occurrence of moderate traffic. When the distance is distant the
traffic gets increased. In that the traffic is comparatively low when there is RSU for communication. Since
the RSU has the capability of storing messages and delivering it to the desired node, the chance of traffic
is less. But the other two methods suffer with extreme traffic. From the simulation results, it is proved
that the presence of RSU in the VANET ensures reliable communication and its absence shows poor
communication. Table 5shows the comparison and evaluation of parameters used in the simulation. It
clearly indicates that the presence of RSU in the VANET improves packet delivery, retransmission, packet
loss and packet overhead. All the parameters in Table 5 differentiate the communication without
considering junctions, considering junctions; Between Vehicle-RSU/RSU-Vehicle also. The above table
explains various parameters for different concepts and their performance.
Table 5 Performance Comparison Table
Parameters
Route Lifetime
Packet
Overhead
Infrastructure
Retransmissions
Recovery of
packets
Packet Loss
Ratio
Without
Considering
Function
Very Short
Moderate
Vehicle to
RSU/ RSU
to Vehicle
Low
Very Low
High
High
Low
Very Low
Not Present
High
Not Present
Moderate
Present
Low
Present
Very Low
Very Low
Low
High
Very High
Very High
High
Low
Very Low
Considering
Junction
Between
RSU
www.ijafrc.org

Far Distance
Low
Moderate
High
Very High
This method clearly shows that communication with RSU outperforms all the other techniques. The
above table explains various parameters for different concepts and their performance. This method
clearly shows that communication with RSU outperforms all the other techniques.
VI.
CONCLUSION
The Adhoc nature of VANET made clear that the routing protocols designed must be efficient, reliable and
secure. Routing in VANET is done normally in two different ways. One is routing from vehicles to RSU and
the other is routing from RSU to vehicles. Reliability in VANET is increased by introducing additional
RSUs in the network as the RSUs take the responsibility to route the messages to the vehicles. Calculating
reliability between RSUs make the UGFT is used in calculating the reliability of VANET. This work mainly
focuses on calculating VANET reliability using UGFT. Our simulation results show that communication is
effective and reliable between V2RSU, RSU2V and between RSUs. The performance comparison clearly
depicts the importance of RSU and communication between RSUs with respect to different parameters
for reliable communication.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
Fernando terroso-saenz, Rafael toledo-moreo, A cooperative approach to tra c congestion detection with complex
event processing and vanet, IEEE transactions on intelligent transportation systems. Vol.13, no.2, June 2012.
Jin-Jia Chang, Yi-HuaLi,Wanjiun Liao,Ing-chau chang, Intersection based routing for urban vehicular
communications with traffic light considerations, in IEEE wireless communications, pp.82-88, Feb 2012.
Maxim Raya and Jean-Pierre Hubaux, Securing vehicular ad hoc networks, Journal of Computer Security , Issue
7, Oct 12.
K.Mershan, H.Artail and M.Gerla, We can Deliver Messages to far vehicles, in IEEE Transactions ITS.,
vol.13,no.3, pp 1099-1115, sep-2012.
Wei-Chang Yeh, IEEE, and Yuan-Ming Yeh, A Novel Label Universal Generating Function Method for
Evaluating the One-to-all-Subsets General Multistate Information Network Reliability, IEEE Transactions on
Reliability, vol. 60, no. 2, pp. 470-477, 2011.
R.Frank, E.Giordano, and M.Gerla, TrafRoute: A different approach routing in vehicular networks, in Proc,
VECON, Niagrara Falls, ON,Canada, pp.521-528, 2010.
G.Yan, S.EI-Tawab, and D.B.Rawat, Reliable Routing Protocols in VANET, Mohamed Watfa, Ed.IGI Global,
2009.
J.Zhao and G.Cao, VADD: vehicle-assisted data delivery in vehicular adhoc networks, IEEE Trans,
Veh.Technology, vol.57,no.3, pp.1910-1922, May 2008.
W. C. Yeh, The K Out Of N Acyclic Multistate Node Networks Reliability Evaluation using The Universal
Generating Function Method, Reliability Engineering & System Safety, vol. 91, no. 7, pp. 800-808, 2006.
Lisnianski.A and G. Levitin, Multi-State System Reliability, Assessment, Optimization and Applications, New
York: World Scientific, 2003.
W. C. Yeh and X. He, A New Universal Generating Function Method for Estimating the Novel Multi-Resource
Multistate Information Network Reliability, IEEE Transactions on Reliability, 2007.
Levitin.G, Universal Generating Function in Reliability Analysis and Optimization, Springer-Verlag, 2005.
W. C. Yeh, A Simple Universal Generating Function Method For Es-timating General Multistate-Node Networks
Reliability, IIE Trans., vol. 41, no. 1, pp. 311, 2009.
Malinowski.J and W. Preuss, Reliability evaluation for tree-structured systems with multistate components, Micro
electronics Reliability, vol. 36, pp. 917, 1996.
C. Lochert, H. Hartenstein, J. Tian, H. Fugler, D. Hermann, and M. Mauve, A Routing Strategy for Vehicular Ad
Hoc Networks in City Environments, in IEEE Intell,ven. Symp., pp.156-161, Jun 2003.
Ushakov.I, Universal generating function, Sov. Journal of Comput-ing System Science, vol. 24, no. 5, pp. 118129, 1986.
Xue yang, jieliu, fengzhao, A vehicle-to- vehicle communication protocol for cooperative collision warning,
Journal of network and computer applications in science direct.
Ziahmoud Hashem Eiza and Qiang Ni, An Evolving Graph-Based Reliable Routing Scheme for VANETs, IEEE
Transactions on Vehicular Technology, Vol. 62, NO. 4, May 2013.
Zhengming li, congyi liu, and chunxiao chigan, On Secure Vanet-Based Ad Dissemination with Pragmatic Cost
and Effect Control, IEEE transactions on intelligent transportation systems June 2013
www.ijafrc.org

[20]
Meena K.S. and T.Vasanthi, Reliability evaluation of a flow network through m number of minimal paths with
time and cost, European journal of scientific research, Vol.5, 2012.
www.ijafrc.org

Recent Trends in Computer Science: Reliability Calculation of VANET With RSU Using UGFT

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Recent Trends in Computer Science: Reliability Calculation of VANET With RSU Using UGFT

Uploaded by

Copyright:

Available Formats

International Journal of Advance Foundation and Research in Computer (IJAFRC)