Академический Документы
Профессиональный Документы
Культура Документы
Zupeng Li
1
, Xiaochuan Yin
1
, Peiyang Yao
1
, and Jinnan Huang
2
1
Telecommunication Engineering Institute, Airforce Engineering University
No. 1 Feng Gao Road, 710077, Xi'an, Shanxi, P.R. China
2
Lenovo Corporate Research & Development, Lenovo China
No. 6 Shang Di West Road, Haidian District, Beijing, P.R. China
Zupengli@hotmail.com
Abstract
The study of peer-to-peer network and mobile ad hoc
network (MANET) are currently two hotspots in distributed
computing and mobile communication researching domain.
By building up a P2P overlay network on top of MANET's
physical infrastructure, we effectively integrated P2P
networks advantage on sustaining highly dynamic network
into the design of MANET routing protocol. By deploying
passive MANET routing algorithms with innovative P2P
routing mechanisms, we propose a new kind of MANET
routing protocol named Peer Computing based Dynamic
Source Routing (PDSR). A detailed description of the P2P
decentralized naming, route discovering, route querying
and updating algorithm used in PDSR is presented in this
paper. The simulation results indicate that PDSR has an
improved routing performance in comparison with the
popularly used DSR protocol.
Keywords: Detour, Hashing, MANET, 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
(MANET) technology also draws great attention of
worldwide researchers and scientists. Since the first
appearance of wireless ad hoc networks in the DARPA
packet radio networks in the 1970s, it becomes an
interesting research object in the computer industry. During
the last couple of years tremendous improvements are made
in the research of ad hoc networks. Due to its possibility to
create and organize a network without any central
management, MANET is characterized as the art of
networking without a network [7].
Currently, the research of P2P network and MANET are
always taken as two separated areas. But the results of our
study indicate that there are lots of joints between these two
technologies.
In Section 2, we analyze the synergy of P2P network and
MANET from different aspects. By doing this, Section 3
provides a new routing protocol for MANET named PDSR,
which efficiently integrates P2P computing with MANET
routing algorithms. Optimizations are introduced in section
IV for PDSR to overcome the popularly detouring problem
in structured P2P systems. The Simulation is made in
section V by comparing the overall routing performance of
PDSR with that of DSR. Finally the conclusion is achieved
in Section 6.
2. Similarities between MANET and P2P
networks
By analyzing the synergy of MANET and P2P networks,
we summarize the similarities between them as follows (see
Figure 1):
A. Dynamic network topology
Nodes in P2P networks may randomly join and leave the
network without any signs, which causes the network
topology changes frequently with time. It is the same with
MANET. And the mobility character of mobile nodes in
MANET can make network topology changes much more
frequently [8].
B. Multi-hop connection
Nodes in both of two networks connect with each other
via multi-hop routing. Hop-to-hop connections in P2P
network are typically via TCP links with physically
unlimited range, while hop-to-hop connections in MANET
Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)
0-7695-2581-4/06 $20.00 2006 IEEE
are via wireless links, which are limited by the radio
transmission range.
C. Decentralized control
Both P2P network and MANET have a decentralized
structure. And there is no such an administration point in the
network as what is in a Client/Server mode network. Nodes
in the network are all peers and can communicate directly to
each other. Network will not suffer the paralysis caused by
central server, which improves the robustness of network.
D. Nodes multi-identity
Nodes in P2P network and MANET act both as a client
and a server, at well as a router. Each node can route and
transfer messages independently. And they can also provide
resource downloading and communicate with each other
directly [9].
(a). Architecture of P2P Network
(b). Architecture of MANET
Figure 1. Comparison of P2P network and MANET
Besides these, unstructured p2p networks such as
Gnutella share additional similarities with MANET such as
(i) flooding-based routing protocols and (ii) limited
scalability due to bandwidth consuming traffic from
flooding.
3. Design of PDSR Protocol
A. Architecture of PDSR Model
The object of our design is to construct a new type of
MANET routing model based on P2P computing
technology. Figure 2 depicts the architecture of PDSR
model, which can be used for providing file discovery
service, information administration service, file transfer
service and communication security service.
B. Basic design
1) Node naming mechanism
PDSR adopts the similar node naming mechanism used in
Chord and HASN. By adopting a consistent hashing
algorithm [11][12], PDSR assigns each node an m-bit node
identifier (NID) (N
d
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 (2
m
-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, PDSR adopts the
discontinuous naming mechanism like Chord.
Fig.3 depicts the node naming mechanism used in PDSR,
while Fig.3 (a) depicts the physical structure of MANET
and (b) depicts the corresponding hash ring structure in the
logical namespace.
Figure 2. Architecture of PDSR Model
2) Node state
PDSR routing table (PRT) has a similar structure to that
of the routing table in dynamic source routing protocol. The
difference lies in that the destination node and next hop
node are all depicted by nodes NID in PDSR instead of
their IP addresses. The following concepts are related to a
mobile node's PRT in an m-bit namespace.
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 range
File
Discovery
Service
Information
Administration
Service
File
Transfer
Service
Communication
Security Service
P2P Computing Based MANET Routing Algorithm
P2P Overlay Network (Node Naming and Indexing)
MANET Physical Network
Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)
0-7695-2581-4/06 $20.00 2006 IEEE
that the K
th
PRT entry covers.
1
[ ]. ( 2 )mod2 1 (1)
k m
HPRTEntry K start n K m
d d
Next Hop Ring Interval (NRI): the ring range that
the Kth PRT entry covers.
[ ] [ [ ]. , [ 1]. )
1 K (2)
NRI k PRTEntry K start PRTEntry K start
M
d d
Next Hop Identifier (NHID): the NID of the first active
node G in the clockwise direction of NRI.
[ ]. ( ) 1 (3) PRTEntry K start NID G K M o d d
Next Hop Source Route (NHSR): the source route to the
corresponding next hop node G in PRTEntry[K].
Suppose current node is S
1
, NHSR satisfies the
following formula.
) 4 ( ,..., , ,
3 2 1
! G S S S NHSR
A PRT is composed of PRTEntry[K].start, NHID and
NHSR. Fig.4 depicts the structure of PRT.
PRTEntry[K].start NHID NHSR
< PRTEntry X> < NHID Y> <S
1
S
2
S
x
>
Figure4. The structure of PRT
C. PDSR route discovering algorithm
The function of PDSR route discovering method is to
discover the source route to destination node reactively.
Generally, PDSR 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 a route query message (RREQ), it will first query
its PRT. If the corresponding route entry is null or outdated,
it will trigger route discovering method.
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.
PDSR route discovering algorithm can be depicted as
follows:
(a). The structure of physical MANET
Nl D=0001
B
A
E
F
Nl D=0100
Nl D=0000
Nl D=1100
0 2
4
Nl D=0010
D
Nl D=1000
C
(b). The structure of hash ring in logical namespace
Figure 3. PDSR Naming Mechanism
1). When a node M initiates or receives a RREQ message,
it will firstly compare the source id and request id of the
message with those RREQ it has cached. If they are
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 search into the PRT and compare destination
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.
A
C
F
D
E
B
Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)
0-7695-2581-4/06 $20.00 2006 IEEE
Table 1. PDSR route discovering algorithm
Ddestination node id
When mobile M initiates a Route_Request or receives
Route_Request_Packet {
//To avoid processing duplicate packets
if (<source NID, req_id>
Route_Record[ ]) then{
discard the packet;}
else {Pick up D from RREP packet;
// Optimized method: return RREP directly from PRT
if (D
NID(current_node)) then {
return RREP_Hit; }
else { //search in PRT
for k=1 upto M {
if ((D