1. Trang chủ
  2. » Tất cả

NETWORK MODELING AND SIMULATION FINAL

34 1 0

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Định dạng
Số trang 34
Dung lượng 2,83 MB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

 DSDV packet delivery fraction is very low for high mobility network.. The DSDV protocol is good for communication in low mobility network whereas AODV presents the dominance in high m

Trang 1

MINI-PROJECT: AD-HOC NETWORK

GROUP MEMBERS

Trang 2

Overview about Wireless Network.

Ad-hoc routing protocol.

Systematic Approach.

Conclusion.

CONTENDS

Trang 3

OVERVIEW ABOUT WIRELESS NETWORK.

1

NETWORK MODELING AND SIMULATION

Trang 4

• Mobile stations communicate with each

other with the help of Base Station or

Access Point (AP)

• Access Point makes communication

easier between the nodes

1.1 Infrastructure Networks.

OVERVIEW ABOUT WIRELESS NETWORK

Trang 5

• A collection of wireless nodes that can

be dynamically set up anywhere and

anytime without using any

pre-existing network infrastructure

• The network’s wireless topology may

change rapidly and unpredictably

1.2 Infrastructure less (Ad-hoc) network.

OVERVIEW ABOUT WIRELESS NETWORK

Trang 6

AD-HOC ROUTING PROTOCOLS.

2

2.1

• Destination sequenced distance vector (DSDV).

Trang 7

AD-HOC ROUTING PROTOCOL

Trang 8

• Based on the classical Bellman-Ford

algorithm with certain improvement

• Nodes maintain a routing table with all

available destinations along with

information of the next hop, the number

of hops to reach to the destination,

• The routing table updates can be of two

ways: “full dump” and “incremental”

2.1 Destination Sequenced Distance Vector (DSDV)

AD-HOC ROUTING PROTOCOL

Trang 9

• Discovers routes only as needed.

• The source broadcasts a Route Request

packet (RREQ) to its neighbors The

neighbors in turn broadcast the packet

to their neighbors till it reaches either

to destination or an intermediate node

that has a valid route to destination

2.2 Ad-hoc On-Demand Distance Vector Routing (AODV).

AD-HOC ROUTING PROTOCOL

Trang 10

SYSTEMATIC APPROACH.

3 3.1 • State goals and defines the system.

3.2 • Services and Outcomes.

Trang 11

3.1 State Goals and Define the system.

REALIABILITY • Able to detect topology changes

within a few seconds.

• Link layer detection.

• Link and network layer detection.

• Routes may be chosen based on stale information.

EFFECTIVES –

RESOURCE USAGE

• Less computation intensive.

• Less wastage of bandwidth by only

on hop periodic broadcast.

• Computationally more efficient.

• High waste of bandwidth.

• Ineffective for rapid topological changes.

SCALABILITY More scalable Poor scalability

SYTEMATIC APPROACH

Trang 12

3.1 State Goals and Define the system.

 Both of the protocols deliver a greater percentage of the originated data packets

when there is little node mobility and when there is no node motion

 The packet delivery of AODV is almost independent of the node mobility.

 DSDV packet delivery fraction is very low for high mobility network.

The DSDV protocol is good for communication in low mobility network whereas

AODV presents the dominance in high mobility network

GOALS

SYTEMATIC APPROACH

Trang 13

Services Outcomes

3.2 Services and Outcomes

SYTEMATIC APPROACH

Trang 14

Packet loss

• A percentage of packets lost with respect to packets sent

SYTEMATIC APPROACH

Trang 15

 Simulation Parameter.

3.3 Select Metrics, Parameters and Factors.

NUM PARAMETER VALUE

Trang 16

 Select Factors.

3.3 Select Metrics, Parameters and Factors.

Factor to study.

Num of Nodes, simulation time

Throughput, Packet loss and delay

SYTEMATIC APPROACH

Trang 17

 Evaluation Technique: Simulation.

Simulation Tool: Ns-2 simulator

3.4 Select Evaluation Techniques and Workload.

SYTEMATIC APPROACH

Trang 18

 Select Workload:

3.4 Select Evaluation Techniques and Workload.

The workload can be the routing overhead.

How much information the table can

maintain.

The capacity of the routing

table.

is the number

of RREQs and RREPs.

How many intermediate nodes joining in the data

transmission process.

AODV

SYTEMATIC APPROACH

Trang 19

• We do the experiment three times

• To see that how networks (one uses DSDV and one uses AODV routing

protocol) change as we change the velocity of mobile nodes

• The experiment are implemented with 22 nodes in different values of

velocity

3.5 Design Experiments.

SYTEMATIC APPROACH

Trang 20

3.6 Analyze and Interpret Data.

Advantages Disadvantages

DSDV - Suitable for creating ad-hoc

network small or medium number

of nodes

- Can avoid extra traffic with incremental updates instead of full dump updates.

- Requires a regular update of its routing tables, uses up battery power and a small amount of bandwidth even when the network is idle

- DSDV is not suitable for highly dynamic networks.

AODV - Routes are established on demand

and destination sequence number are used to find the latest route to the destination

- Lower delay for connection setup.

- Multiple Route Reply packets in response to a single Route Request packet can lead to heavy control overhead.

- Periodic beaconing leads to unnecessary bandwidth consumption

SYTEMATIC APPROACH

Trang 21

• We predict that DSDV may perform better with the low mobility of

nodes than AODV However, in general, the throughput of AODV is

expected to be higher than that of DSDV

3.6 Analyze and Interpret Data.

SYTEMATIC APPROACH

Trang 22

3.7 PRESENT RESULTS.

SYTEMATIC APPROACH

Trang 23

• Equal throughput.

• DSDV protocol take a few

second to establish route

table and send packets

3.7.1 Throughput.

 When nodes are static (v = 0 m/s)

SYTEMATIC APPROACH

PRESENT RESULTS

Trang 24

• Throughput values are

different

• AODV protocol has more

stable throughput than

Trang 25

• DSDV protocol takes

longer time to re-establish

connection lead to the time

Trang 26

• The increase of nodes velocity lead to the fall of throughput

• When network topology changes:

 AODV protocol still keeps the connection but throughput decrease dramatically.

 DSDV protocol make the in-connection intervals that throughput equals to zero.

 DSDV’s throughput falls dramatically with the increasing of nodes velocity.

3.7.1 Throughput.

SYTEMATIC APPROACH

PRESENT RESULTS

Trang 27

3.7.2 Delay and Packet loss.

 When nodes are static (v = 0 m/s)

SYTEMATIC APPROACH

PRESENT RESULTS

Trang 28

3.7.2 Delay and Packet Loss.

 When nodes move with v = 5m/s.

SYTEMATIC APPROACH

PRESENT RESULTS

Trang 29

3.7.2 Delay and Packet Loss.

 When nodes move with v = 10m/s.

SYTEMATIC APPROACH

PRESENT RESULTS

Trang 30

 Review:

• Delay time grows up with the increasing of velocity

 Packet delay time seem not to have any significant change during the

transmission process with AODV protocol.

 DSDV has high packet delay interval at the time it start or restart the packet

transmission process.

• The Packet loss values is proportional with Packet delay

3.7.2 Delay and Packet Loss

SYTEMATIC APPROACH

PRESENT RESULTS

Trang 31

4

NETWORK MODELING AND SIMULATION

Trang 32

• This mini-project focus on examining and review about the effect of

moving of nodes to the performance of AODV and DSDV protocols in

Ad-hoc network

• Results of mini-project are generated by simulation in NS-2 base on

theoretical basis

4 Conclusion.

DSDV • Give a good results when the network has low topology speech change

AODV • Presents good performance in the case the network varies in topology and network

loads

NETWORK MODELING AND

SIMULATION

Trang 33

• [1] https://github.com/softvar/ns2-roadv/blob/master/aodv.tcl

[2] Rai Jian, Art of Computer Systems Performance Analysis Techniques

For Experimental Design Measurements Simulation And Modeling,

Wiley Computer Publishing, John Wiley & Sons, Inc

• [3] http://airccse.org/journal/ijdps/papers/0312ijdps10.pdf

REFERNECES:

NETWORK MODELING AND

SIMULATION

Trang 34

THANKS FOR YOUR ATTENTION!

NETWORK MODELING AND SIMULATION

Ngày đăng: 30/04/2018, 13:45