P2P Computing in Design of VANET Routing Protocol
Song Haibin1, Meng Qi2, Men Aidong3
2
IEEE student member, 1,2,3School of Telecommunication Engineering,
Beijing University of Posts and Telecommunications
Rd. Xitucheng 10th, 100876, Beijing
victorymeng@gmail.com
Abstract——The study of peer-to-peer network and vehicle ad hoc
network (VANET) are currently two hotspots in distributed
computing and mobile communication researching domain. By
building up a P2P overlay network on top of VANET's physical
infrastructure, we effectively integrated P2P network’s advantage
on sustaining highly dynamic network into the design of VANET
routing protocol. By deploying passive VANET routing algorithms
with innovative P2P routing mechanisms, we propose a new kind
of VANET routing protocol named Peer Computing based Ad hoc
On Demand Vector (PAV). A detailed description of the P2P
decentralized naming, route discovering, route querying and
updating algorithm used in PAV is presented in this paper. The
simulation results indicate that PAV has an improved routing
performance in comparison with the popularly used AODV
protocol.
Keywords: VANET, Peer-to-Peer, Structured P2P systems
1. INTRODUCTION
Peer-to-peer (P2P) network is currently a hotspot in the
international network researching domain [1]. Recently,
different kinds of P2P network models such as Napster, Freenet
and Gnutella have already been popularly used. However, each
of them has some open problems [2] [3]. To solve these
problems, structured P2P overlay networks (SON) such as CAN,
Chord [4], Pastry and Tapestry are proposed to provide a kind
of mechanism to improve network scalability [5]. All of these
SON algorithms have a common ground that they all assign
keys to data and nodes through a hashing function, and at the
same time they use these keys to store and maintain data which
are shared in the network [6].
On the other side, nowadays mobile ad hoc network (VANET)
technology also draws great attention of worldwide researchers
and scientists. Vehicle Ad hoc Network (VANET) has become a
major topic during the last few years. Within the FleetNet
project [7] a novel mobile ad hoc network will be developed to
interconnect vehicles and roadside gateways via a mobile
Internet. 1Major services, supported by FleetNet will be road
traffic telematics and communication for business and
entertainment purposes. [8].
Currently, the research of P2P network and vANET are
always taken as two separated areas. But the results of our study
indicate that there are lots of joints between these two
technologies.
1-4244-1312-5/07/$25.00 © 2007 IEEE
In Section 2, we provides a new routing protocol for VANET
named PAV, which efficiently integrates P2P computing with
VANET routing algorithms. The Simulation is made in section
3 by comparing the overall routing performance of PAV with
that of AODV. Finally the conclusion is achieved in Section 4.
2. DESIGN OF PAV PROTOCOL
A. Architecture of PAV Model
The object of our design is to construct a new type of
VANET routing model based on P2P computing technology.
Figure 1 depicts the architecture of PAV model, which can be
used for providing file discovery service, information
administration service, file transfer service and communication
security service.
File Information File Communicat
Discovery Administration Transfer ion Security
Service Service Service Service
P2P Computing Based VANET Routing Algorithm
P2P Overlay Network (Node Naming and Indexing)
VANET Physical Network
Figure 1.Architecture of PAV Model
B. Basic design
1) Node naming mechanism
PAV adopts the similar node naming mechanism used in
Chord and HASN. By adopting a consistent hashing algorithm
[9][10], PAV assigns each node an m-bit node identifier (NID)
(N<=2m). NID is chosen by hashing the node's IP address,
which can be used to specify the location of node in a hash ring.
When a node joins the network for the first time, a NID ranges
from 0 to (2m-1) will be automatically assigned to it based on
the adopted hashing algorithm. In contrast to HASN, the
relationship between a key identifier (KID) and a NID is one to
one mapping. In order to simplify the routing algorithm, PAV
adopts the discontinuous naming mechanism like Chord.
Fig.2 depicts the node naming mechanism used in PAV,
while Fig.2 (a) depicts the physical structure of VANET and (b)
depicts the corresponding hash ring structure in the logical
namespace.
1502
2) Node state
PAV routing table (PRT) has a similar structure to that of the The following concepts are related to a mobile node's PRT in
routing table in dynamic source routing protocol. The difference an m-bit namespace.
lies in that the destination node and next hop node are all
depicted by node’s NID in PAV instead of their IP addresses. • Predecessor: the first node in the counterclockwise direction of
hash ring from current node;
• Successor: the first node in the clockwise direction of hash
ring from current node;
• PRTEntry[K].start: the starting location of the ring rangethat
the Kth PRT entry covers.
HPRTEntry[k ].start = (n + 2k −1 ) mod 2m ,1 ≤ K ≤ m
(1)
• Next Hop Ring Interval (NRI): the ring range that the Kth PRT
entry covers.
NRI [k ] = [ PRTEntry[ K ].start ,
PRTEntry[ K + 1].start ],1 ≤ K ≤ M (2)
• Next Hop Identifier (NHID): the NID of the first active node
G in the clockwise direction of NRI.
PRTEntry[ K ].start → NID(G ),1 ≤ K ≤ M (3)
• Next Hop Source Route (NHSR): the source route to the
corresponding next hop node G in PRTEntry[K]. Suppose
current node is S1, NHSR satisfies the following formula.
NHSR =< S1 , S2 , S3 ,..., G > (4)
A PRT is composed of PRTEntry[K].start, NHID and NHSR.
Fig.3 depicts the structure of PRT.
24 | 0
PRTEntry[K].start NHID NHSR

F <PRTEntry X> <NHID Y> <S1, S2, …Sx>

NID=0000 A
Figure 3 The structure of PRT
NID=0001

C. PAV route discovering algorithm

B The function of PAV route discovering method is to discover
the source route to destination node reactively.
NID=1100 NID=0010
F Generally, PAV route discovering method is triggered by
mobile nodes’ route updating method under the following
status:
i. When a node initiates a route query procedure or has received
NID=0100
a route query message (RREQ), it will first query its PRT. If the
corresponding route entry is null or outdated, it will trigger
NID=1000
C route discovering method.
D ii. When a middle node in the source route returns a route error
message (RERR) to the node which initiates the data packet, the
initiating node will start the related route updating method,
which will then trigger the route discovering method.
(b). The structure of hash ring in logical namespace
PAV route discovering algorithm can be depicted as follows:
1). When a node M initiates or receives a RREQ message,
Figure 2. PAV Naming Mechanism it will firstly compare the source id and request id of the
message with those RREQ it has cached. If they are

1-4244-1312-5/07/$25.00 © 2007 IEEE 1503

matched, it means the RREQ message has been received
already, M will then discard it. Otherwise, go to step 2;
2). M will check the Route_record of RREQ message to
verify whether it contains NID(M). If it does, M will
discard the message. Otherwise, go to step 3;
3). M will check whether destination node belongs to the
PRT entries. If it does, go to step 5; otherwise, go to step 6;
4). M will check whether destination node is M itself. If it
is, go to step 5; otherwise go to step 6;
5). M will check whether the communication channel is
bi-directional. If it is, M will return route reply message
(RREP) to the query initiating node S directly. Otherwise,
M will trigger route discovering method to discover source
route to S and then return RREP to S;
6). M will add itself into the Route_Record, and broadcast
the RREQ message to its neighbors.
D. PRT querying algorithm
PRT querying algorithm can be depicted as follows:
1). When a node M initiates or receives a RREQ message,
it will firstly compare the destination node id of RREQ
with NID(M). If they are matched, M will return RREP to
querying initiating node S. Otherwise, go to step 2;
2). M will n node id (D) with PRT entries to find the NRI
which D belongs to. If the PRT entry is found, M will
compare D with the corresponding NHID. If D >
PRTEntry[i]. NHID then transfer the message to the
corresponding next hop node. Otherwise go to 3.
3). M will trigger route discovering method for destination
node D and wait for response. If the source route to D is
returned, M will update the NHID and NHSR of the PRT
entry with D and source route to D, respectively. At the
same time, M will return a RREP message to S. Otherwise,
M will return a query failure message to S.
4). During the process, each time a node M queries its
route table, it will pick up the PRT entry whose NRI is
closest to D. And by comparing D with the corresponding
NHID, M will determine whether it should trigger the route
discovering process for D. If it is unnecessary to trigger a
route discovering process, M will transfer the RREQ
message to next hop node in the PRT entry. This process
goes on until a RREP is returned.
To sum up, PRT querying algorithm performs the
following two functions:
i. Route the RREQ message according to the PRT cached
by each node.search into the PRT and compare destinatio
ii. Update the outdated PRT entries cached by each node
reactively.
1-4244-1312-5/07/$25.00 © 2007 IEEE
Table 1.PAV route discovering algorithm
D: destination node id;
When vehicle M initiates a Route_Request or receives
Route_Request_Packet{
//To avoid processing duplicate packets
If(<source NID, req_id> ∈ (Taken RREQ[])) then
{ discard the packet;}
Else if (NID (current_node) ∈ Route_Record[])) then
{ discard the packet;}
Else {Pick up D from RREP packet;}
//Optimized method: return RREP directly from PRT
If (D ∈ NHID[]) then {return RREP_Hit;}
Else if (D== NID(current)) then {
If (the link is bi-directional) {return RREP_Hit;}
Else{Create Route_Request packets to find Sender;}
}
//M is between Sender and Destination
Else{
Append NID(M) in Route_Record[] and broadcast RREQ
Packets;}}
}
E. PAV route maintenance algorithm
1) Mobile Node Join and Depart
Due to the highly dynamic character, mobile nodes may
join and leave the network at any time. To save the route
maintenance cost, when a node joins the network, PAV
will not initialize its PRT. On the contrary, the node will
construct its PRT on demand.
The node join procedure can be depicted as follows:
i. Node M will firstly choose a member node B as its
bootstrap node. And B must satisfy the following criterion:
A) B is inside M's transmitting scope, or we can say B is a
neighbor of M; B) Among all M's neighbors, B has a NID
which is closest to M's.
ii. M will find its successor S on hash ring by the help of B.
iii. M will get information of S's predecessor P. Then M
will send a join message to both P and S. when they
receive the message, P will update its successor with M
and S will update its predecessor with M. Till now, the
integrity of hash ring is guaranteed.
iv. M will then construct and update its PRT entries
reactively. And the triggering event is the corresponding
PRT entry querying procedure.
v. PAV classifies node departure event into two types:
1504

Table 2. PRT querying algorithm
PRTEntry[i]: the ith entry in PAV routing table
(PRT), 1 ≤ i ≤ M;
D: destination node id;
When vehicle M initiates a Rout_Request or receives
Route_Request_Packet
{ packet will broadcast a route overdue message into the
Pick up D from RREP packet;
If (D∈ NID(current_node)) then {
Return RREP_Hit;}
Else {// search in PRT
For k=1 to M {
If ((D∈ [PRTEntry[i].start, PRTEntry[i+1].start]) &
(D> NHID[i] )){ forward to NHID[i];}
Else {Invoke Route Discovery for D;
Wait for Reply;
If (Source route to D is Found)
{ terminate the route discovering process and mark the
Update PRTEntry[i].NHID with NID(D);
Update PRTEntry[i].NHSR with Source
route to D;
Return RREP_Hit;}
Else{return RREP_Failed;} }}
}}
vi. Normal departure: nodes leave the system deliberately.
vii. Abnormal departure: nodes leave the system without
any signs.
To reduce route maintenance overhead, PAV takes no
action for a mobile node's abnormal departure. As for a
node’s normal departure, PAV will take the following
actions:
The quitting node will firstly send a QREQ to its
predecessor P and successor S. When S and P receive the
message, S will update its predecessor as P and P will
update its successor as S. Till now, the integrity of hash
ring is guaranteed.
2) PAV route updating algorithm
As a VANET routing protocol, PAV must handle the
problem of nodes’ mobility. In VANET, a node’s position
is changing with time, which leads to the dynamic network
topology. When a destination node is out of reach, this may
be caused by some corresponding nodes’ normal or
abnormal departure, or some nodes have move out of
transmitting scope of others. Once this happens, PAV will
trigger routing updating algorithm reactively.
Generally, there are two kinds of triggering event:
• As for a mobile node’s normal departure, it will broadcast
1-4244-1312-5/07/$25.00 © 2007 IEEE
a QREP to its neighbors. The node which has received
QREP will act as the triggering node of route updating
process.
• As for a data packet’s transferring failure, which will be
caused by nodes’ abnormal departure or movement, the
node who initiates the data packet will act as the triggering
node of route updating process.
PAV route updating algorithm can be depicted as
follows:
i. As for condition II, the node N who initiates the data
network. And those related nodes will delete the outdated
PRT entries accordingly. Then go to step 2. As for
condition I, go to step 4.
ii. N will trigger a route discovering process for the
destination node. If the destination node is found and a
RREP is returned, N will update the outdated source route
in PRT with the currently discovered one.
iii.If the route discovering process ends with a failure result,
this denotes that the destination node may be down or has
already left the network. In such a condition, N will
destination node as invalid. Then go to step 4.
iv.The triggering node will broadcast the destination node
invalid message into the network, the predecessor and
successor of the invalid node will update their successor
and predecessor after they receive the message,
respectively.
Till now, the integrity of hash ring is guaranteed.
Other related nodes will then delete the outdated entries
from their local PRT after they receive the message.
3. SIMULATION OF PAV MODEL
H. Simulation environment
1). Simulation parameters:
Simulation is done with fifty nodes within a
1000m*1000m space. The physical parameters of each
node can be depicted as follows:
• Antenna is a full-direction antenna with a height of 1.5
meter, the reception and transmission increments are both
1.0 dB.
• The bandwidth of wireless radio is 2 Mb/s, which adopts
a two-path channel model.
• The transmission power is 17.6 mw and the radius of
wireless radio broadcasting scope is 110 meters.
2). Mobile model:
Fifty nodes are randomly distributed in the simulation
scope. And each node performs a Brown movement during
the simulation period. Besides these, we adopt the
traditional pause time (PT) to define the mobile character
of our model. At the beginning of simulation, a node keeps
static for a PT.
Then it will randomly choose a destination node and
move toward it with a certain aped. When it arrives, the
node will keep static for a PT and then choose a node as
1505
the next destination. This process will be repeated till the
simulation ends. We choose for different values of PT: 1,
60, 120, 180 and 360.
3). Service model:
In order to simulate the network services’ influence on
PAV’s performance, we randomly choose 20 pairs of
nodes to transmit CBR packets to each other. The CBR
packets are 128 bytes packets with a transmission rate of 4
contrary, PAV improves the route discovery efficiency by
building up a P2P overlay network on VANET’s physical
topology and introducing PRT to accelerate the route
discovery process.But due to the detouring problem, the
AED of PAV is still relatively high.
400
350 AODV

Average Delay(ms)
packets per second. PAV
300
4). MAC layer:
A distributed coordination function (DCF) 250
mechanism is adopted in MAC layer. 200
I. Performance results
150
1). Packet Deliver Ratio (PDR)
Packet deliver ratio is an important criterion in 100
estimating a routing protocol’s performance in how well it 50
adapts to the change of network topology and how efficient 0 50 100 150 200 250 300 350 400
it provides a route discovery. Figure 7 depicts the Pause time(s)
relationship of PDR in PAVand AODV with PT.
As we can see in figure 4, the probability of link failure Figure 5. The comparison of AED between AODV and
between nodes and route failure decreases when the PAV
mobility of nodes decreases. The success rate and stability
of packet transmission in PAV is much better than those in 3). Node Storage Overhead (NSO)
AODV. The reason is that PAV has improved the node Node Storage Overhead is an important criterion in
discovery and packet delivery performance by taking estimating how much extra storage overhead that the
advantages of structures P2P routing mechanisms. routing protocol puts on each node. Figure 6 depicts the
However, the caching mechanism adopted in AODV is the relationship of NSO in PAV and AODV with the number
origin of its problem in providing out-of-time network of nodes in the network.
status and its low Packet deliver ratio. As we can see in figure 6, the cached routes for a mobile
node in AODV are in a direct proportion to the number of
0.92 nodes in network. That is to say, as for a VANET with N
0.90
Packet deliver ratio

nodes, the cached routes for each node is O(N). On the

0.88
contrary, by implementing structured P2P routing
0.86
mechanism, the relationship of cached routes for each node
0.84
0.82
in PAV with the number of nodes is O(logN). By doing
0.80
this, PAV effectively decreases the route storage overhead
0.78 AODV for each node, and at the same time it decreases the route
0.76 PAV discovery and maintenance overhead related to these
0.74 cached routes as well.
0.72
0 50 100 150 200 250 300 350 400
Pause time(s)

Figure 4 The comparison of PDR between AODV and

PAV

2). Average End-to-end Delay (AED)

Average end-to-end delay is an important criterion in
estimating a routing protocol’s performance in how
efficient and fast it provides a route discovery. Figure 5
depicts the relationship of AED in PAV and AODV with
PT.
As we can see in figure 5, due to the broadcasting based
routing discovery mechanism, it takes AODV longer time
to rediscover route when current path is failed. On the

1-4244-1312-5/07/$25.00 © 2007 IEEE 1506

 protocols operating in a logical namespace with those of
700 VANET routing protocols operating in a physical
namespace. By this means, PAV has inherited all the
600
advantages of P2P networking technology in sustaining
Overhead(Bytes)

500 highly dynamic networks and maintaining network

Node Storage

scalability. Besides these, PAV introduces a series of

400
300
200
100
0
0 10
Figure 6. The comparison of NSO between AODV and
PAV
4). Routing Overhead (RO)
Routing Overhead is an important criterion in estimating
a routing protocol’s efficiency. Figure 10 depicts the
relationship of RO in PAV and AODV with PT. As we can
see in figure 7, the number of route packets in AODV is
huge due to the number of cached routes for each node is
huge as well (the number of cached routes for each node in
AODV has a relationship of O(N) with node number N).
The route maintenance and update processes caused by
these cached routes consume lots of network bandwidth
and decrease the performance of AODV. On the contrary,
PAV improves the routing performance by introducing
structured P2P overlay network technology and limiting
the number of cached routing within O(logN).
4500
Routing Overhead(packets)
optimizing mechanisms to solve the detouring problem of
AODV structured P2P overlay network and to further improve
PAV routing efficiency. The simulation results indicate that the
overall routing performance of PAV is remarkably better
over AODV.
[1] L. Z. Granville, D. A. Panisson, C. Melchiors, M.
Janilce B. Almeida, "Managing computer networks using
20 30 40 50 60 peer-to-peer technologies,", IEEE Communications
Node number Magazine, Vol. 43, No. 10, October 2005.
[2] J. Xu, "On the fundamental tradeoffs between routing
table size and network diameter in peer-to-peer networks,"
IEEE INFOCOM, 2003 - The Conference on Computer
Communications, Vol. 22, No. 1, Mar 2003, pp.
2177-2187.
[3] S. Sen and J. Wang, "Analyzing peer-to-peer traffic
across large networks," IEEE/ACM Transactions on
Networking, Vol. 12, No. 2, Apr 2004, pp. 219-232. [4] I.
Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F.
Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A
scalable peer-to-peer lookup protocol for internet
applications," IEEE/ACM Transactions on Networking,
Vol. 11, No. 1, Feb 2003, pp. 17-32.
[5] J. Xu, A. Kumar, and X. Yu, "On the fundamental
tradeoffs between routing table size and network diameter
in peer-to-peer networks," IEEE Journal on Selected Areas
in Communications, Vol. 22, No. 1, Jan 2004, pp. 151-163.
[6] S. Jain, R. Mahajan, and D. Wetherall, "A study of the

4000 performance potential of DHT-based overlays," 4th

AODV USENIX Symposium on Internet Technologies and Systems
3500 PAV
(USITS 2003), March 2003.
3000 [7] H. Hartenstein, et al., “Position-Aware Ad Hoc
2500 Wireless Networks for Inter-Vehicle Communications: the
2000 FleetNet Project“, in Proc. ACM MobiHOC 2001, Long
1500 Beach, USA, Oct. 2001.
1000
[8]S. Jiang, Y. Liu, Y. Jiang, and Q. Yin, "Provisioning of
adaptability to variable topologies for routing schemes in
500
MANETs," IEEE Journal on Selected Areas in
0 50 100 150 200 250 300 350 400
Communications, Vol. 22, No. 7, Sep 2004, pp. 1347-1356.
Pause time(s) [9] J. Mischke and B. Stiller, "Efficient protocol
Figure 10. The comparison of RO between AODV and specification and implementation for a highly scalable
PAV peer-to-peer search infrastructure," NOMS 2004 -
IEEE/IFIP Network Operations and Management
4. CONCULUSION Symposium, Vol. 9, No. 1, Apr 2004, pp. 411-424.
Based on the study of synergies between P2P network [10] A. Duran and C.-C. Shen, "Mobile ad hoc P2P file
and VANET, we propose a new type of VANET routing sharing," WCNC 2004 - IEEE Wireless Communications
protocol named PAV. By building up a P2P overlay and Networking Conference, Vol. 5, No. 1, March 2004, pp.
network on top of VANET's physical infrastructure, PAV 114-119.
seamlessly integrates the functions of p2p overlay routing

1-4244-1312-5/07/$25.00 © 2007 IEEE 1507