An Analysis of Peer-to-Peer Traffic
over an Ad-Hoc Network
Ensc 427 : Communication Networks
Spring 2013
Final Presentation
Team 13 www.sfu.ca/~yha64/ENSC327
Ian Brown,
301072798
itb at sfu dot ca
Yumin O. Huang, 301072798
yha64 at sfu dot ca
1
Presentation Overview
• Introduction
– Project Scope & Goal
• Peer-to-Peer over Ad-hock Network
• Simulation – Scenarios
• Simulation – Result
• Related Work
• Conclusion
2
Introduction
Project Scope
• QoS of P2P network of wireless nodes
in the AODV routing
• Introducing noise to the network
– Movement and background traffic
• Inquiry Packet Interference
– Single node interference
– Multiple nodes interference
Qos : Quality of Service AODV : Ad-hoc On-Demand Distance Vector 3
Peer-to-Peer over Ad-hoc
network
Peer-to-Peer Architecture
• All nodes are both client and servers – Provide and consume
data
– Any node can initiate a connection
• No centralized data source – “The ultimate form of
democracy on the Internet”
– “The ultimate threat to copy-right protection on the Internet”
Node
Node
Node Node
Node
Internet
4
Cont.
Benefits • Efficient use of resources • Scalability:
– Consumers of resources also donate resources – Aggregate resources grow naturally with utilization
• Reliability – Replicas – Geographic distribution – No single point of failure
• Ease of administration – Nodes self organize – No need to deploy servers to satisfy demand – Built-in fault tolerance, replication, and load balancing
5
Ad-Hoc Network
• Collection of mobile wireless nodes forming a network without the aid of any infrastructure or centralized administration
• Nodes have limited transmission range
• Nodes act as a routers
6
Cont.
• Characteristics – Dynamic topologies
– Limited channel bandwidth
– Variable capacity links
– Energy-constrained operation
– Limited physical security
• Applications – Military battlefield networks
– Personal Area Networks (PAN)
– Disaster and rescue operation
– Peer to peer networks
7
Relative Work
• Peer-to-Peer Ad-hoc Networks:
(Re)Configuration Algorithms – Marisa A. Vasconcelos , Rainer P. Couto , Antonio A.F. Loureiro Fernanda P.
Franciscani, "(Re)configuration algorithms for peer-to-peer over ad hoc
networks," Journal of Parallel and Distributed Computing, vol. 65, no. 2, pp. 234-245, February 2005.
• Minimization of average Delay, Routing Load
and Packet Loss Rate In AODV Routing Protocol – P.C.Gupta, "Minimization of Average Delay, Routing Load and Packet Loss
Rate in AODV Routing Protocol," International Journal of Computer
Applications, vol. 44, no. 15, pp. 14-17, April 2012.
8
Simulation
Scenario
To observe the effects of noise on
the Quality of Service over a mobile
network
3 different scenarios.
9
Scenario 1: Two Mobile Nodes
• Scenario 1 will serve as a reference for Scenario 2 and 3
shows in Figure 5. This simulation tests an Ad-hoc network
using the ADOV protocol.
10
Scenario 2: AODV Movement Baseline
• Scenario 2 involves 5 nodes; four nodes are positioned at same
distance away from each other and one node moves right to left
parallel to other four nodes and then once the node pass all four
nodes it moves up and away from the range of all the nodes.
11
Scenario 3
• This last simulation tests QoS of Ad-hoc network using
AODV protocol when the background traffic is
introduced. The specific types of data, constant bit rate,
and pack drop rate will be compared for analysing the
QoS of the network.
12
Simulation
Results
• Ongoing
• Currently analysing baseline
scenarios
• Focus will be on QoS between
expected trends and observed
trends
13
Simulation
Window Size vs Time
Scenario 2 : Topology
14
Future Works
• Adding Movement and background traffic – How the network behave and traffic changes
– Observe and analysis the changes in the traffic over the
network
• Multiple nodes interference testing – How does the Ad-hoc network changes
15
Thank you
Reference
[1] Charles E. Perkins, Elizabeth M. Royer, Ad hoc On-Demand Distance Vector Routing,
2nd ed. New Orleans, LA, 1999.
[2] Piotr Wydrych, "Mobile Peer to Peer," IEEE Communications Magazine, vol. 48, no. 6, pp. 10-10, June 2010.
[3] T. Hong, "Peer-to-Peer," Harnessing the Power of Disruptive, vol. 43, no. 5, pp. 31-31, September 2001.
[4] The Network Simulator - ns-2. [Online]. http://www.isi.edu/nsnam/ns/
[5] Marisa A. Vasconcelos , Rainer P. Couto , Antonio A.F. Loureiro Fernanda P. Franciscani, "(Re)configuration algorithms for peer-to-peer over ad hoc networks," Journal of Parallel and Distributed Computing, vol. 65, no. 2, pp. 234-245, February 2005.
[6] P.C.Gupta, "Minimization of Average Delay, Routing Load and Packet Loss Rate in AODV Routing Protocol," International Journal of Computer Applications, vol. 44, no. 15, pp. 14-17, April 2012.
[7] Gerson Sunyé, Yves Le Traon, Patrick Valduriez Eduardo Cunha de Almeida, "Testing peer-to-peer systems," Empirical Software Engineering, vol. 15, no. 4, pp. 346-379, August 2010.
[8] R. R. Brooks, Disruptive Security Technologies with Mobile Code and Peer-to-Peer Networks.: CRC Press, 2004.
[9] D. Azzi, "Ad-hoc Networks Energy Consumption: A review of the Ad-Hoc Routing Protocols," Journal of Engineering Science and Technology Review, vol. 3, no. 1, pp. 162-167, 2010. [Online]. http://jist.ece.cornell.edu/docs/040421-swans-aodv.pdf
16
The End
17