Project Report

A PROJECT REPORT ON
“PERFORMANCE EVALUATION OF RB SWITCHING

AND NRB SWITCHING IN AD HOC WIRELESS
NETWORK”
SUBMITTED TO THE UNIVERSITY OF PUNE, PUNE

IN THE PARTIAL FULFILLMENT OF THE REQUIREMENTS
FOR THE AWARD OF THE DEGREE
OF
MASTER OF ENGINEERING (COMPUTER NETWORK)
BY
Mr. Vikas G. Bhowate Exam No: 2197
DEPARTMENT OF COMPUTER ENGINEERING

STES’S SINHGAD COLLEGE OF ENGINEERING
VADGAON BK, OFF SINHGAD ROAD
PUNE 411041
Acknowledgement
I have great pleasure and sense of satisfaction in presenting this project report of my
project titled “PERFORMANCE EVALUATION OF RB SWITCHING AND NRB
SWITCHING IN AD HOC WIRELESS NETWORK”.
Being novice in the field of designing and structuring in this project, it could have been
extremely difficult for me to complete this project on my own. I am very fortunate to be
guided by people with vast and resourceful experience in their respective field of work.
I express my sincere gratitude to my guide Mrs. G.G.Chiddarwar for her timely
guidance, support and suggestions. I am also thankful for her sincere help and for making me
available all the facilities of the department.
I would like to thank Mrs. S.R. Hiray who helped me extensively in designing the project
and structuring the documents for the project. Without her efforts and constant monitoring the
documentation would not have been duly completed.
My sincere thanks to our principal Dr. A.S.Padalkar, My Head Of Department Prof.
P.R.Futane, the teaching and the non -teaching staff for the help extended by them for
making this project a success.
Mr. Vikas G.Bhowate
ii
Abstract
This project evaluates when route reservation-based (RB) communication can yield better
delay performance than non-reservation-based (NRB) communication in ad hoc wireless
networks. In addition to posing this fundamental question, the requirements (in terms of route
discovery, medium access control (MAC) protocol, and pipelining) for making RB switching
superior to NRB switching is also identified.
A novel analytical topology is developed and the network performance under both RB and
NRB schemes is evaluated. It is shown that if the above mentioned requirements are met,
then RB schemes can indeed yield better delay performance than NRB schemes.
Performance evaluation of RB and NRB schemes, are done using ns-2 simulator while
transmission of packets and retransmission of error packets. Results of network performance
are taken, when three routes are simultaneously active which indicates that delay and
throughput of RB switching scheme are lower than NRB switching scheme.
iii
List of Figures
Figure Title Page No.

3.2 Perspectives of RB and NRB 6
5.1 Overall System Use-Case Diagram 15
5.2.1 Maintain Wireless Network 16
5.2.2 Provide Switching Scheme 17
5.2.3 Analyze Switching Scheme 18
5.3.1 Sequence Diagram for Managing Wireless Network 19
5.3.2 Implement RB Switching Scheme 21
5.3.3 Implement NRB Switching Scheme 23
5.4.1 Manage Wireless Links 27
5.4.2 Provide NRB Switching Scheme 29
5.4.3 Provide RB Switching Scheme 31
5.4.4 Analyze RB and NRB Switching Scheme 33
5.5.1 Manage Wireless Link 35
5.5.4 Analysis of RB and NRB Switching Scheme 38
6.1 Class Diagram 39
6.2 Component Diagram 45
6.3 Deployment Diagram 46
6.4.1 Reservation Based Switching 47
6.4.2 Non-Reservation Based Switching 48
6.4.3 Delay Comparison for 3 active routes 49
6.4.4 Delay Comparison for 13 active routes 50
6.4.5 Delay Comparison for intervals 50
6.4.6 Delay Comparison for 10000 messages 51
6.4.7 Throughput 51
iv
List of Abbreviations
Term or Acronym Definition

GUI Graphical User Interface
RB Reservation Based
NRB Non Reservation Based
NOAH No Ad Hoc Routing
MAC Medium Access Control
v
List of Tables
Table Title Page No.
2.1 Proposed Work Analysis 3-4

3.3 Number of Simultaneously Active Roots 12
4.2 Goals 13
4.3 Schedule 14
5.3.1 Scenario Description 19-20
5.3.2 Scenario Description 22
5.3.4 Scenario Description 25-26
6.1 Templates 40-43
6.2 Component Diagram 43-45
6.4 Parameters 49
7.3 Test Case Specification 53-56
7.4 Test Procedure Specification 56-58
vi
Table of Contents
Certificate i
Acknowledgement ii
Abstract iii
List of Figures iv
List of Abbreviations v
List of Tables vi
1. Introduction 1
1.1 Background 1
1.2 Relevance 1
1.3 Organization of Report 2
2. Literature Survey and Feasibility Study 3
2.1 Introduction 3
2.1.1 Methodologies 4
2.2 Existing Methodologies 4
2.2.1 Performance Evaluation of Routing Protocols for Ad Hoc Wireless 4
Networks
2.2.2 Ad-Hoc on-Demand Distance Vector Routing 4
2.2.3 Dynamic Source Routing in Ad Hoc Wireless Networks 5
3. RB and NRB Scheme Specification 6
3.1 Problem Statement 6
3.2 Perspective of RB and NRB Scheme 6
3.3 Software Requirement Specification 7
3.3.1 Purpose 7
3.3.2 Scope 8
3.3.3 Overall Description 8
3.3.4 System Interfaces 9
3.3.5 Software Interfaces 9
3.3.6 Communication Interfaces 9
3.3.7 Analysis of RB and NRB 11
3.3.8 Static Numerical Requirements 12
3.3.9 Dynamic Numerical Requirements 12
vii
4. Plan of RB and NRB Schemes 13
4.1 Overview 13
4.2 Goals and Scope 13
4.3 Schedule and Milestones 14
5. Analysis of RB and NRB schemes 15
5.1 Use Case Diagrams 15
5.2 Use Case Template 16
5.2.1 Maintain Wireless Network 16
5.2.2 Provide Switching Scheme 17
5.3 Sequence Diagrams 19
5.3.1 Sequence Diagram for Managing Wireless Links 19
5.3.2 Sequence Diagram to Implement RB Switching Scheme 21
5.3.3 Sequence Diagram to Implement NRB Switching Scheme 23
5.3.4 Sequence Diagram to Analyze Switching Schemes 25
5.4 State Chart Diagram 27
5.4.4 Analyze NRB & RB Switching Scheme 33
5.5 Activity Diagrams 35
5.5.2 Activity Diagram for NRB Switching Scheme 36
5.5.3 Activity Diagram for RB Switching Scheme 37
5.5.4 Activity Diagram for Analysis of RB and NRB Schemes 38
6. Implementation and Design of RB and NRB Schemes 39
6.1 Class Diagram 39
6.2 Component Diagram 43
6.3 Deployment Diagram 46
6.4 Snapshots and Formulas 47
6.4.1 Reservation Based Switching 47
6.4.2 Non-Reservation Based Switching 48
6.4.3 Parameters of RB and NRB Scheme for Delay Comparison 49
viii
7. Testing of RB and NRB 52
7.1 Purpose 52
7.1.1 Unit Testing 52
7.1.2 Integration Test 52
7.1.3 System Test 52
7.2 Outline 53
7.2.1 Introduction 53
7.2.2 Test Items 53
7.2.3 Features To Be Tested 53
7.2.4 Features Not To Be Tested 53
7.2.5 Approach 53
7.2.6 Test Deliverables 54
7.2.7 Environmental Needs 54
7.3 Test Case Specification 54
7.4 Test Procedure Specification 56
7.5 Summary of Results 58
8. Conclusions and Future Work 59
8.1 conclusions 59
8.2 Future Work 59
9. References 60
ix
1. INTRODUCTION
1.1 BACKGROUND
A number of routing protocols for ad hoc wireless networks have been proposed over the past few
years [3]. The two principal switching techniques used in wired networks are circuit switching and packet
switching. One of the main differences between them is the way resources are shared. Circuit switching
provides exclusive access to the resources by means of reservation. In packet switching, on the other
hand, resources are shared on demand, without prior reservation. While it is obvious that packet switching
is suitable for a wired data network such as the Internet, it is not clear whether this is true in the case of ad
hoc wireless networks.
Most of these protocols can be categorized as variants of the NRB (Non Reservation Based) routing
protocol, where packets are relayed on a route with best effort [4]. A number of studies related to the
evaluation of NRB switching schemes have also been reported. Performance of a few routing protocols
for ad hoc wireless networks, in terms of throughput, end-to-end delay, and amount of overhead, are
investigated using computer simulations.
NRB switching in ad hoc wireless networks have been considered and delay bounds for a multihop
relay case with packet flooding have been derived. Many reservation-based routing protocols are also
there. These routing protocols are designed to guarantee quality of service (QOS) such as bandwidth and
delay [16]. A ticket-based probing algorithm is used for searching routes which satisfy bandwidth and
delay constraints [15].
A time division multiple accesses (TDMA)-based QOS routing algorithm is considered [16]. Variants
of the reservation protocol (RSVP), a well-known resource reservation protocol used in the internet, for
mobile wireless networks are proposed [18]. However, none of these resource reservation protocols has
considered the reservation of intermediate nodes on multihop routes.
1.2 RELEVANCE
1. The system shows that if right requirements are met, then RB switching schemes can provide better
delay performance than NRB switching schemes.
2. The system identifies the applications for which RB schemes are more appropriate than NRB
schemes and vice versa.
3. The system identifies the conditions which must be satisfied to make RB scheme superior to NRB
scheme. Hence, if these conditions are not satisfied, NRB switching will probably be preferable.
SCOE, Computer Engg, 2010

1
1.3 ORGANIZATION OF REPORT
This project report is organized as follows. The first chapter outlines the Introduction of the proposed
system with technical background and relevance to the other systems.
Chapter 2 outlines the major technologies used in literature survey. This chapter presents some of the
systems similar to proposed system.
Chapter 3 presents the RB and NRB scheme specification with problem statement, perspective, and
software requirement specification.
Chapter 4 details the plan of RB and NRB scheme which includes goals, scope, schedule and
milestone of the work.
Chapter 5 details the analysis of RB and NRB scheme which includes, Use – Case Diagram, Sequence
Diagram which reflects the overall sequence of operations carried out by the system, Activity Diagram,
and State Chart Diagram.
Chapter 6 discusses implementation and design of RB and NRB scheme which includes, Class
Diagram, Component Diagram and Deployment Diagram.
In Chapter 7, testing of the proposed work is given with test case specification and test procedure
specification.
Chapter 8 includes conclusion and future work.

2
2. LITERATURE SURVEY AND FEASIBILITY STUDY
2.1 INTRODUCTION
This document provides the purpose of the feasibility study, the background of the proposed project,
the methodology used for performing the study, and any reference materials used in conducting the
feasibility study for the project titled “Performance Evaluation of RB Switching and NRB Switching in
Ad-hoc Wireless Network”.
To check the feasibility of system two methodologies are used: Surveying and Brain Storming.
Literature survey by studying IEEE papers and other related reverence material is conducted. The
feasibility study is conducted to determine and document project‟s viability. The results of this study will
be used to make a decision whether or not to proceed with the project.
The purpose of this document is to analyze and compare the performance of RB and NRB switching
schemes in ad-hoc wireless networks. While the conventional wisdom in current wireless ad hoc
networking research favors NRB switching, this document will help to check the feasibility, whether,
when and under which conditions RB switching will be preferable.
Table 2.1 Proposed Work Analyses
Parameter Definition
Route Discovery Route Discovery is the mechanism by which a
source node S wishing to send a packet to a
destination node D obtains a Source Route to
D.
Non Reservation Based (NRB) Switching In an NRB scheme, an intermediate node can
Scheme simultaneously serve as relay for more than one
source. Hence, the resources (in terms of
relaying nodes) are shared in an on-demand
fashion.
Reservation Based (RB) Switching Scheme In an RB scheme, a source first reserves a

multihop route to its destination, i.e., it reserves
intermediate nodes before the actual
transmission begins. The reserved intermediate
nodes are required to relay only the message
generated by the specific source. This gives the
source an exclusive access to the path to the
destination.
Retransmission Model For network communications to be reliable,
retransmission of packets in error is needed.
Hence we require retransmitting of erroneous
packets.

3
Comparison Chart Performance chart for two different types of
switching schemes and this will prove that RB
scheme gives better delay performance than
NRB scheme.
2.1.1 Methodologies
Performance analysis
Most of the current systems do not analyze performance of RB switching scheme and they always
favor NRB scheme. But the fact is that RB scheme is more preferable for delay sensitive applications of
which the current systems are unaware.
Reservation of intermediate nodes on a multihop route
The current systems do not consider reservation of intermediate nodes on a multihop route and they
consider NRB scheme only as the conventional wisdom in current wireless ad hoc networking research
favors NRB switching.
Analytical models
In current systems, while a few analytical models exist for NRB switched ad hoc wireless networks,
similar models have not been reported for RB schemes.
2.2 EXISTING METHODOLOGIES
2.2.1 Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks

This system analyzes performance of a few routing protocols for ad hoc wireless networks, in terms of
throughput, end-to-end delay, and amount of overhead.
Merits
1. Analyzes performance of RB switching scheme.
2. Provides retransmission.
Demerits
1. Does not consider effects of interference.
2. Does not take into account reservation of intermediate nodes on a multihop route.
2.2.2 Ad-Hoc on-Demand Distance Vector Routing

This system proposes Ad-Hoc on-Demand Distance Vector Routing, a novel algorithm for the
operation of ad-hoc networks. It proposes type of NRB routing protocol.

4
Merits
1. Considers effects of interference.
Demerits
1. Does not analyze performance of RB switching scheme.
2. Does not consider reservation of intermediate nodes on a multihop route
2.2.3 Dynamic Source Routing in Ad Hoc Wireless Networks

This system for routing in ad hoc networks uses dynamic source routing. It also proposes a variant of
the NRB routing protocol, where packets are relayed on a route with best effort.
Merits
1. Analyzes performance of RB switching scheme
Demerits
1. Does not consider effects of interference.
2. Does not consider reservation of intermediate nodes on a multihop route
The Proposed System analyzes performance of NRB as well as RB scheme. It also considers effects of
interference, reservation of intermediate nodes on multihop route and retransmission. Hence, the proposed
system overcomes all the demerits of current systems. Thus, the proposed system is better than current
system. The following issues are addressed by the feasibility study:
1. Routing
2. Dynamic Topology
3. Power Management
4. Controlling Control Message Packets
5. Delay performance analysis of RB and NRB scheme.
While the conventional wisdom in current wireless ad hoc networking research favors NRB switching,
the proposed system determines whether when and under which conditions RB switching will be
preferable.
The entire system is feasible from the development point of view. Thus to conclude the above, this
report has examined the feasibility of the system “Performance Evaluation of RB Switching and NRB
Switching in Ad-hoc Wireless Network”. The feasibility study has addressed two fundamental question
„Should it be done?‟ and „Could it be done?‟ and has answered both of them satisfactorily.

5
3. RB AND NRB SCHEME SPECIFICATION
3.1 PROBLEM STATEMENT

The input to the system should be a file which must be transferred from source node to destination
node using two schemes namely RB and NRB switching. The system should analyze the network
performance in terms of throughput, goodput, and delay under the RB and NRB switching schemes. The
resources in RB & NRB schemes are relaying nodes. In RB scheme the relaying nodes are reserved while
in NRB scheme they are shared in on demand fashion. The system should investigate whether and when
route reservation-based (RB) communication can yield better delay performance than non-reservation-
based (NRB) communication in ad hoc wireless networks and to identify requirement issues such as route
discovery, MAC protocol, pipelining etc. for making RB switching scheme superior to NRB switching
scheme, as it works on Data Link Layer of OSI model.
3.2 PERSPECTIVE OF RB AND NRB SWITCHING SCHEMES
Source
Non-Reservation Reservation Based

Based switching switching
Find Delay
Comparison of Delay Performance

Figure 3.2 Perspectives of RB and NRB
The figure shows the architecture of the system being developed. The entire system is divided into
various sub-systems:
1. The Non-Reservation Based Block transfer a file from source using intermediate nodes which are
shared in an on-demand fashion in ad-hoc wireless network. After transmitting the file it calculates the
delay in transmitting the file.
2. The Reservation based Block transfer the file from source to destination through the corresponding
route path present in a table and calculates the delay.

6
3. The Chart Of Performance Block then prepares the chart of comparison between the delay calculated
by both switching scheme and it will show the performance chart and will prove reservation based system
has better performance than non reservation based switching.
3.3 SOFTWARE REQUIREMENT SPECIFICATION

This document is the Software Requirement Specification for „Performance Evaluation of RB
Switching and NRB Switching in Ad-hoc Wireless Network‟. This document details out the purpose of
the system being developed, its overall description and its specific requirements. This System
Requirements Specification document provides all of the essential requirements for „Performance
Evaluation of RB Switching and NRB Switching in Ad-hoc Wireless Network‟. The purpose of this
document is to collect, analyze and define high-level needs and features of the system. The system
focuses on the performances analyzed by
1. Reservation Based (RB) switching scheme.
2. Non-Reservation Based (NRB) switching scheme.
Thus goal of system is to design & implement system which shows the difference between the
working of two network switching schemes RB & NRB with aim of showing that the delay in NRB is
more than the delay in RB scheme.
3.3.1 Purpose
This document details the functionalities to be provided in „Performance Evaluation of RB Switching
and NRB Switching in Ad-hoc Wireless Network‟. It details the functionalities about
1. RB scheme.
2. NRB scheme.
In an RB scheme, a source first reserves a multihop route to its destination, i.e., it reserves
intermediate nodes before the actual transmission begins. The reserved intermediate nodes are required to
relay only the message generated by the specific source. This gives the source an exclusive access to the
path to the destination.
In an NRB scheme, an intermediate node can simultaneously serve as relay for more than one source.
Hence, the resources (in terms of relaying nodes) are shared in an on-demand fashion. This is typical for
most of the routing protocols for wireless ad hoc networks.
The details of how the system fulfils these needs are detailed in the use-case and supplementary
specifications.
The intended audiences for this SRS are Network Engineers/Analysts, Network Managers and System
Administrators. The proposed system will be mainly developed for the Network analysts/Engineers for

7
analyzing the network performance of wireless network in their organization, so it become easy to
understand, which scheme is suitable for their network.
3.3.2 Scope
The system is broadly divided into following parts:
Non reservation based switching
To transmit the file using NRB scheme we will follow the following steps:-
1. Give the route request to all the intermediate nodes and find the route path for corresponding
destination using multi-hops.
2. Transfer a file using this scheme from sender.
3. Receive the file from sender at the destination.
Reservation based switching
To transmit the same file using RB scheme system will follow the following steps:-
1. Decide the corresponding route path to destination.
2. Transfer the file from source to destination through the selected route path.
Comparison of RB and NRB scheme
This will show the comparison and performance tables for two different types of switching by
calculating the delay between these two schemes.
3.3.3 Overall Description

Performance Evaluation of RB Switching and NRB Switching in Ad-hoc Wireless Network is a
network analyzing tool. Its main objective is to calculate the delay performance of RB as well as NRB
scheme. It also provides a comparison between them, which will result in investigating system to be used.
This will be achieved by:
1. Find the route path for corresponding destination using multi-hops in NRB
2. Find the corresponding route path to destination by giving the route request to all the intermediate
nodes between source and destination.
3. Transferring the file using RB & NRB
4. Calculate the delay performances of both the system and compare the delay and prepare a delay table.
3.3.4 System Interfaces

Tcl script
TCL Script: In tcl script, specification of routing protocol, queuing model, scenario file, traffic file
etc.can be given by user.

8
Awk script
It is used for processing trace file generated after running tcl script.
User
User Interfaces defines the various interfaces available for the end-user to interact with the system.
Graphical user
Graphical User Interface is used to interact with the NRB& RB switching schemes. It will allow the
user to transfer the file from source to destination using these schemes and it calculates the delay between
both schemes.
Performance chart
The Performance of two switching schemes is shown in the graphical format to display user
comparison between them.
3.3.5 Software Interfaces

Network simulator 2.34
NS-2.34 is a tool that provides facility to simulate wired and wireless network. It has a facility to
write tcl script in which user can specify routing protocol, queuing model, scenario file, traffic file etc.
Linux platform
It best supports NS-2.34 hence it is recommended for this project.
3.3.6 Communication Interfaces

Mac protocol
A real ad hoc wireless network cannot function without a MAC protocol, and any MAC protocol
employed should yield a higher goodput.
Aodv protocol
This protocol is used as non reservation protocol and it is used to find the shortest path between source
and destination. Dijkstra Algorithm is used to find shortest path.
Dijkstra algorithm:
1. Initialize single-source
2. S ← { } // S will ultimately contains vertices of final shortest-path weights from s
3. Initialize priority queue Q i.e., Q ← V [G]
4. While priority queue Q is not empty do
5. u ← EXTRACT_MIN(Q) // Pull out new vertex
6.S→SU{u}
// Perform relaxation for each vertex v adjacent to u

9
7. For each vertex v in Adj[u] do
8. Relax (u, v, w)
Aodv algorithm:
1. Node S needs a route to D
2. Creates a Route Request (RREQ)
• Enters D‟s IP addr, seq#, S‟s IP addr, seq#, hopcount=0
3. Node S broadcasts RREQ to neighbors
4. Node A (intermediate node) receives RREQ
• Makes a reverse route entry for S
dest=S, nexthop=S, hopcount=1
• It has no routes to D, so it rebroadcasts RREQ
5. Node C (intermediate node) receives RREQ
• Makes a reverse route entry for S dest=S, nexthop=A, hopcount=2
• It has a route to D, and the seq# for route to D is >= D‟s seq# in RREQ
• C creates a Route Reply (RREP), enters D‟s IP addr, seq#, S‟s IP addr, hopcount to D=1
• Unicasts RREP to A
6. Node A receives RREP
• Makes a forward route entry to D dest=D, nexthop=C, hopcount=2
Unicasts RREP to S
7. Node S receives RREP
• Makes a forward route entry to D dest=D, nexthop =A, hopcount = 3
• Sends data packet on route to D
Noah protocol
The protocol is used as Reservation protocol and its variants are used in many wireless network.
Noah algorithm:
1. Initialize Source and Destination.
2. Define intermediate nodes between source and destination.
3. Configure the nodes.
4. Define the parameters for transmission.
5. Execute the program.
6. Stop.
The major function of the reservation based switching in ad-hoc wireless network is to transfer the
file using Reservation based and Non-Reservation based switching schemes and calculates the delay in
both schemes for transmitting the file from source to destination. It shows the delay performance of both

10
schemes and investigates whether and when route reservation-based (RB) communication can yield better
delay performance than non-reservation-based (NRB) communication in ad hoc wireless networks.
In RB switching scheme user need to reserve intermediate nodes between source and destination. For this
purpose, No Ad Hoc Routing Protocol (NOAH) a well-known reservation protocol for wireless networks
is used.
The system considers a simple retransmission scheme where a packet in error will be retransmitted up
to a maximum number of times. If a packet is still received erroneously after these retransmissions, then
system assume that the receiver will have to take that packet in its current status.
The system will be developed taking into consideration about changing operating environments. User
can install NS-2.34 in Linux as well as Windows OS platform. To install it in windows OS, system just
need to use Cygwin software.
3.3.7 Analysis of RB and NRB

Analysis of non reservation based switching scheme
In this, system transfers the file from source to destination through intermediate nodes. While
transmission system is going to find route path for corresponding destination and then calculate the delay.
Analysis of reservation based switching scheme
In this system is going to transfer the same file from source to destination through intermediate nodes,
before transmission system is going to reserve the nodes and find the corresponding route path for all the
nodes and store it into database, then transfer the file from source to destination through the
corresponding route path present in a table and calculate the delay.
Retransmission model
For network communications to be reliable, retransmission of packets in error is needed. Hence
systems require retransmitting of erroneous packets.
Comparison chart
System will show performance chart for two different types of switching schemes and this will prove
reservation based scheme gives better delay performance than non reservation based scheme.
3.3.8 Static Numerical Requirements

Area of network
Area of network indicates the total range of the wireless ad hoc network which will be used for
analysis purpose. The system considers area of network equal to 10 4 sq m.

11
Table 3.3 Number of Simultaneously Active roots
Network Size Maximum Number of Active Routes
25 nodes 4.278
36 nodes 5.268
49 nodes 6.249
Amount and type of information to be handled

The system needs to transfer a data file using RB and NRB scheme. The average message length to be
considered is 106 bits and packet length equal to 10 3 bits. System maintains routing table at each active
route in the ad hoc wireless network to be used. The data rate to be considered is 1 Mb/s.
3.3.9 Dynamic Numerical Requirements

In the case with NRB switching, when the arrival rate is near zero, the average message delay is close
to n seconds for n hop route. This is because the message transmission time on each link is 1 second. In
the case with RB switching, when the arrival rate is small, the average message delay is very close to 1
second, which is the message transmission time. This is because even though each route comprises n
hops, pipelining is used in this case. Hence, the total average message delay should be very close to 1
second.

12
4. PLAN OF RB AND NRB SCHEMES
4.1 OVERVIEW
Performance Evaluation of RB Switching and NRB Switching in Ad-hoc Wireless Network is a type
of research project. The subject is interesting in the way that it uses the switching techniques. As the
system is the research work the customer of the system can be the person or organization that requires the
information about two switching techniques.
4.2 GOALS AND SCOPE

Table 4.2 explains functional, technological and quality goals and scope of the project.
Table 4.2 Goals
Project Goal Priority Comment/Description/Reference
Functional Goals:
Maintain Wireless Network High System needs to maintain wireless network by
managing wireless link and providing QoS.
Provide Switching High System needs to transmit file using RB and NRB
Schemes.
switching scheme from source to destination.
Analyze Switching High The system will analyze and compare delay
Schemes. performances of RB & NRB switching schemes and
prepare chart of comparison.
Technological Goals:
Use appropriate High Selection of appropriate algorithms is important to
tools/algorithms calculate & analyze performances of RB & NRB
schemes.
Selection of switching High The system specifies scenarios for which RB switching
scheme scheme is better than NRB switching scheme.
Quality Goals:
Reliable data Transmission High It deals with the reliable transfer of file from source to
destination.
Reliable Route discovery High Reliable Route Discovery deals with discovering multi-
hop route for wireless transmission.
Correct Analysis of RB and High It deals with delay performance analysis of data
NRB schemes transmission by RB and NRB scheme.
Reliable Retransmission Medium It deals with retransmission of erroneous packets.
Constraints:
Consider intermediate Medium Intermediate nodes on a multihop route serve only one
nodes on multi-hop route source node at a time, simultaneously Active multihop
routes are disjoint.

13
4.3 SCHEDULE AND MILESTONES
Table 4.3 shows the schedule of the project modules.
Table 4.3 Schedule
Milestones Description Milestone Criteria Planned
Date
M0 Start Project 24/06/2010
PRS or SRS reviewed
Stakeholders identified
Implement Proposal
reviewed
M1 Start Planning 01/07/2010
Scope and concept
described
M2 Start Execution 15/07/2010
Requirements agreed,
project plan reviewed,
resources committed
M3 Confirm Execution 01/08/2010
Architecture review and
Ad-hoc Network simulation
-> Grid topology
M4 Start Simulation 18/08/2010
RB scheme tcl script
NRB scheme tcl script
AWK scripts for RB and
NRB
M5 Analysis 30/09/2010
Throughput
Goodput
Delay
M6 Release Product 10/10/2010

Product system test,
documentation review
M7 Close Project 21/11/2010

14
5. ANALYSIS OF RB AND NRB SCHEMES
5.1 USE CASE DIAGRAMS

Fig.5.1 shows the overall system use-case diagram where network administrator and network
analyst plays an important role to maintain wireless network, to provide switching scheme and also to
analyze switching schemes.
Fig. 5.1 Overall System Use-Case Diagram

15
5.2 USE CASE TEMPLATE
5.2.1 Maintain Wireless Network
This use case deals with the maintenance of wireless link and provides quality of service to user. The
wireless link will manage the device power and also chooses dynamic topology according to the type of
network and quality of service will be provided by controlling control message packets and
retransmission of erroneous packets.
Fig. 5.2.1 Maintain Wireless Network

16
5.2.2 Provide Switching Scheme
This use case deals with the implementing Reservation Based and Non-Reservation Based Switching
Scheme. In RB, it request for reservation of route to destination and transfers file, while in NRB, it
selects a multi-hop route to destination and then transfer file.
Fig.5.2.2 Provide Switching Scheme

17
5.2.3 Analyze Switching Scheme
The Analyze switching scheme analyzes Reservation Based and Non-Reservation Based Switching
Scheme and generate a report. It analyzes RB as well as NRB switching scheme by calculating delay for
each scheme and compare delay. It generates chart of performance for both schemes.
Fig.5.2.3 Analyze Switching Scheme

18
5.3 SEQUENCE DIAGRAM
5.3.1 Sequence Diagram for Managing Wireless Links

Fig.5.3.1 shows the sequence diagram for management of wireless links which is very important while
transmitting data. Administrator send request, for wireless network, power management and also checks
the topology. After finding the proper topology for wireless network, wireless link establishment is done.
Fig.5.3.1 Sequence Diagram for Managing Wireless Network

Scenario description
Table 5.3.1 Scenario Description
Informational Item Information
Use Case Manage Wireless Link.
Scenario Name Manage Wireless Link
Steps 1. Request for Wireless Network.
2. Request for Power Management.
3. Failure in Power Supply.
4. Send Response.
5. Request to Select Topology.
6. Check Network Topology.
7. Get Network Topology.
8. Topology Selected.
9. Wireless Link Established.

19
Class Name Purpose
Administrator User Type
Wireless Network GUI for Wireless Connection Establishment.
Interface
Power Manager Manage Power.
Topology Manager To Provide proper Topology.
Wireless Network db Database for Wireless Network
Message Type From Object To Object

Request for Wireless Asynchronous Administrator Wireless Network
Network. Interface
Request for Power Synchronous Wireless Network Power Manager
Management. Interface
Send Response. Synchronous Power Manager Wireless Network
Interface
Request to Select Synchronous Wireless Network Topology Manager
Topology. Interface
Get Network Topology. Self Topology Manager Wireless Network db
Topology Selected. Return Wireless Network db Topology Manager
Wireless Link Return Topology Manager Administrator
established.

20
5.3.2 Sequence Diagram to Implement RB Switching Scheme.
Fig.5.3.2 shows the sequence diagram to implement RB switching scheme. For file transfer analyst
make a request for the same. To transfer a file in RB switching first of all paths need to reserve. For that
the available nodes in the range of source are identified upto the destination from node list. After
reservation of intermediate nodes file transfer is done.
Fig. 5.3.2 Implement RB Switching Scheme

21
Table.5.3.2 Scenario Description
Use Case Implement RB Switching Scheme
Scenario Name Reservation Based File Transfer
Steps 1. Request for file transfer
2. Establish Connection.
3. Error in Connection.
4. Check Connection.
5. Request to Reserve path.
6. Check Node List.
7. Import Nodes from list.
8. Provide List.
9. Get Node List.
10. Provide File to Transmit.
11. Send File
12. File Transmitted.
Class Name Purpose

Analyst User Type
RB File Transfer GUI for File transmission.
Maintain Network Checking and Establishing network connections.
Route Reservation To Provide and Reserve Nodes for file transfer.
Manager
Node List db Database for free nodes.

Request for file transfer Asynchronous Analyst RB File Transfer
Establish Connection. Synchronous RB File Transfer Maintain Network
Request to Reserve path. Synchronous Maintain Network Route Reservation
Manager
Check Node List. Synchronous Route Reservation Node List db
Manager
Import Nodes from list. Self Node List db Node List db
Get Node List. Return Route Reservation Maintain Network
Manager
File Transmitted. Return RB File Transfer Analyst

22
5.3.3 Sequence Diagram to Implement NRB Switching Scheme
Fig.5.3.3 shows the sequence diagram to implement NRB switching scheme. For file transfer analyst
make a request for the same. To transfer a file in NRB switching there is no need to reserve a path
between source and destination. The intermediate nodes are selected dynamically.
Fig. 5.3.3 Implement NRB Switching Scheme

23
Use Case Implement NRB Switching Scheme.
Scenario Name Non-Reservation Based File Transfer
Steps 1. Request for file transfer
2. Establish Connection.
3. Error in Connection.
4. Check Connection.
5. Request to select route.
6. Nodes selected.
7. Provide File to Transmit.
8. Send File.
9. File Transmitted.
Class Name Purpose

Analyst User Type
NRB File Transfer GUI for File transmission.
Maintain Network Checking and Establishing network connections.
Route Selection To Select Nodes for file transfer.
Manager

Request for file transfer Asynchronous Analyst NRB File Transfer
Establish Connection. Return NRB File Transfer Maintain Network
Request to select route. Synchronous Maintain Network Route Selection
Manager
Select free Nodes Self Route Selection Route Selection
Manager Manager
File Transmitted. Return NRB File Transfer Analyst

24
5.3.4 Sequence Diagram to Analyze Switching Schemes.
Fig.5.3.4 shows the sequence diagram to analyze switching schemes. The analysis has been done on
the basis of delay performance of RB and NRB scheme while transmitting the data file.
Fig.5.3.4 Analyze Switching Scheme

Use Case Analyze Switching Scheme.
Scenario Name Delay Comparison
Steps 1. Request for Analyze Schemes.
2. Get RB and NRB Schemes.
3. Calculate Delay.

25
4. Compare Delay.
5. Get Comparison
6. Provide Comparison details.
7. Prepare Chart Of Comparison.
8. Show Comparison Chart.
Class Name Purpose

Analyst User Type
Scheme Comparison GUI for Scheme comparison
Scheme Manager Manage details of both schemes.
Delay Manager To Calculate and Compare Delay.
Delay db Database for Delay

Request for Analyze Asynchronous Analyst Scheme Comparison
Schemes.
Get RB and NRB Synchronous Scheme Comparison Scheme Manager
Schemes.
Calculate Delay. Synchronous Scheme Manager Delay Manager
Compare Delay. Synchronous Delay Manager Delay db
Get Comparison Self Delay db Delay db
Provide Comparison Return Delay db Delay Manager
details.
Prepare Chart Of Synchronous Delay Manager Scheme Comparison
Comparison.
Show Comparison Return Scheme Comparison Analyst
Chart.

26
5.4 STATE CHART DIAGRAMS
5.4.1 Manage Wireless Link

Fig. 5.4.1 shows the state chart diagram to manage wireless links. Wireless links can be managed by
managing the power of idle nodes .The diagram below also gives the idea about how the topology is
decided and how it is implemented.
Fig.5.4.1 Manage Wireless Links

27
Object Name States
Power Management of Enabled: Power management of idle nodes.
idle nodes object
Topology Enabled: Implementing wireless topology.
Implementation Object
Power Management of Enabled: Managing power of critical nodes.
critical nodes object
State Name Type Action Set

Power Management of Simple Keep idle nodes in standby or sleep mode.
idle nodes
Topology Simple Decide topology.
Implementation
Power Management of Simple Keep critical nodes in Power on state.
critical nodes
Transition Event Guard condition Transition Action
Start- Power Start System Wireless nodes present Power managed of idle
Management of idle nodes
nodes
Start- Topology Start System Wireless nodes present Topology decided
Implementation
Power Management of Idle nodes power Critical nodes in power
idle nodes- Power managed on.
Management of critical
nodes
Topology Topology Decided Topology implemented
Implementation-END

28
5.4.2 Provide NRB Switching Scheme
Fig. 5.4.2 shows the state chart for NRB switching scheme. The wireless network availability has been
checked first. Then route request packets are broadcasted in the network. The intermediate nodes receive
these packets .if node is destination then acknowledgement is forwarded back to source and data
transmission takes place. Otherwise nodes keep forwarding request packets until destination receive that
packet.
Fig. 5.4.2 Provide NRB Switching Scheme

29
Object Name States
Broadcasting Route Enabled: Identify source and destination.
request packet object
Discard and rebroadcast Enabled: Discard route request packet.
route request packet
object
File transmission object Enabled: File transmission.
Update Route record Enabled: Updating routing information.
object

Broadcasting Route Simple Prepare route request packet.
request packet
Discard and rebroadcast Simple Rebroadcast route request packet.
route request packet
File transmission Simple Transmit file from source to
destination.
Update Route record Simple Update routing information.

Start- Broadcasting Start System Wireless Network Identify source and
Route request packet established destination.
Broadcasting Route Route Discovery packet Route request packet
request packet- Discard broadcasted broadcasted.
and rebroadcast route
request packet
Broadcasting Route Is current node is Append the current node
request packet - Update destination to route address.
Route record
File transmission-END Exit File transmitted from
source to destination.

30
5.4.3 Provide RB Switching Scheme
Fig.5.4.3 shows the state chart for RB switching scheme. Diagram gives the flow of states by which
source and destination nodes identified. After identification the packets are transmitted through the
intermediate nodes which are previously reserved for source.
Fig. 5.4.3 Provide RB Switching Scheme

31
Object Name States
Dispatch packets object Enabled: Break the file into packets.
Packet processing Enabled: Process the packet.
object
File reassembly object Enabled: Packets reassembly.

Dispatch packets packet Simple Break file into packet.
Packet processing Simple Select next node.
Forward packets to next node.
File reassembly Simple Reassemble packets into file.

Start- Dispatch packets Network established Source and Destination Request for file
packet identified transmission.
Dispatch packets Packets dispatched Packets dispatched over
packet- File reassembly network.
File reassembly-END Exit File obtained.

32
5.4.4 Analyze NRB & RB Switching Scheme
Fig.5.4.4 shows the state diagram for analysis of RB and NRB schemes. The analysis is done on the
basis of delay performance while transmission of data file.
Fig. 5.4.4 Analyze RB and NRB Switching Scheme
Object Name States
File transfer delay Enabled: Calculate delay performance.
calculation object
RB & NRB delay Enabled: Compare delay performance.

33
performance
comparison object

File transfer delay Simple Prepare route request packet.
calculation
RB & NRB delay Simple Rebroadcast route request packet.
performance
comparison

Start-Delay Calculation - Send file accepted
Delay Calculation-RB Compare pressed Delay calculation Performance comparison
and NRB delay completed done.
performance
comparison
RB and NRB delay Comparison calculated - End
performance
comparison-END

34
5.5 ACTIVITY DIAGRAMS
5.5.1 Manage Wireless Link

Fig. 5.5.1 shows the activity diagram to manage wireless links.
Fig. 5.5.1 Manage Wireless Link

35
5.5.2 Activity Diagram for NRB Switching Scheme
Fig.5.5.2 shows the activity diagram for NRB switching scheme.
Fig. 5.5.2 Provide NRB Switching Scheme

36
5.5.3 Activity Diagram for RB Switching Scheme
Fig.5.5.3 shows the activity diagram for RB switching scheme.
Fig. 5.5.3 Provide RB Switching Scheme

37
5.5.4 Activity Diagram for Analysis of RB and NRB Schemes
Analysis of RB and NRB scheme has been done on two parameters, delay and throughput.
Fig.5.5.4.shows the activity diagram for the delay comparison of RB and NRB scheme.
Fig. 5.5.4 Analysis of RB and NRB Switching Scheme

38
6. IMPLEMENTATION AND DESIGN OF RB AND NRB SCHEMES
6.1 CLASS DIAGRAM
Numbers of classes are used for RB and NRB schemes.fig. 6.1 show the class diagram for every
module of the project.
Fig. 6.1 Class Diagram

39
Table. 6.1Templates
TEMPLATE #1
Class Name Scheme Analyst
Class Type Candidate Class
Characteristics Analyze RB and NRB schemes.
Superclass User
Subclass None
Variables scheme_name : string
Services 1. Calculate file transfer delay for RB scheme.
2.Calculate file transfer delay for NRB scheme.
3.Compare above two delays
Responsibilities Collaborators
1. calc_RBdelay():double 1.RB Scheme.
2. calc_NRBdelay():double 2.NRB Scheme
3. compare_delays(RBdelay,NRBdelay): 3.Report Generation
double 4.Delay Comparison db
TEMPLATE #2
Class Name Network Administrator
Class Type Abstract Class
Characteristics Manage wireless network
Superclass User
Subclass None
Variables None
Services 1.Manages wireless network.
1.manage_network() 1.Wireless network maintenance
TEMPLATE #3
Class Name RB Scheme
Characteristics Transfer file to destination using RB switching
scheme
Superclass None
Subclass None

40
Variables 1.filename:string
2.source_address:string
3.destination_address:string
4.request_packet:struct
Services 1.Reserve route from source to destination.
2.Transfer file using reserved route.
1. reserve_route(request_packet):string array 1.Route db
2. transfer_file(filename):boolean 2.Scheme Analyst.
3.Wireless Link Management.
4.QoS Provider.
TEMPLATE #4
Class Name NRB Scheme
Characteristics Transfer file to destination using NRB
switching scheme
Superclass None
Subclass None
2.source_address:string
3.destination_address:string
Services 1.Divides file into packets
2. Dispatch packets over network.
3. Find next hop.
4. Forward packet to next hop.
5. Reassemble packets at destination.
1. divide_file(filename):void 1. Wireless Link Management.
2. dispatch_packets(packets[]):void 2. QoS Provider.
3. find_next_hop():string 3. Scheme Analyst.
4. forward_packets(packets[]):void
5. reassemble_packets(packets[]):file
TEMPLATE #5

41
Class Name Wireless Network Maintenance
Characteristics Maintain network.
Superclass None
Subclass 1. Wireless Link Management.
2. QoS Provider.
Variables None
Services 1. Maintain wireless network.
1.maintain_network() 1.Network Administrator
TEMPLATE #6
Class Name Wireless Link Management
Characteristics Manages links between nodes
Superclass Wireless Network Maintenance
Subclass None
Variables None
Services 1. Manages device power.
2. Decide topology.
1.manage_power():Boolean 1. RB Scheme.
2.decide_topology() 2. NRB Scheme.
TEMPLATE #7
Class Name QoS Provider
Characteristics Provides Quality of Service.
Superclass Wireless Network Maintenance
Subclass None
Variables None
Services 1. Controls control message packets.
2. Retransmit erroneous packets.
1.control_cntrl_msgpackets() 1. RB Scheme.

42
2.retransmit_erroneous_packets() 2. NRB Scheme.
TEMPLATE #8
Class Name Report Generation.
Characteristics Generate Chart of Comparison of delay
performances.
Superclass None
Subclass None
2.RB_delay:double
3.NRB_delay:double
Services 1. Get delay details.
2. Generate comparison chart.
1.get_delay_details() 1. Scheme Analyst.
2.generate_comparison_chart(filename,RB_del 2. Delay Comparison db.
ay,NRB_delay,diff_delay)
6.2 COMPONENT DIAGRAM

Each subsection of this section will refer to or contain a detailed description of a system software
component. The discussion provided should cover the following software component attributes :
Table 6.2 Component Diagram
Component Name Reservation based (RB) switching.
Classification Module.
Definition This is reservation based switching, in which a
route is reserved before data transmission.
Responsibilities Provide an exclusive access to the route
reserved.
Constraints Simultaneously existing multihop routes must
be disjoint.
Compositions 1. NOAH protocol folder used for route
discovery.
2. rb.tcl: Tcl script for RB switching.

43
3. rbtraffic: Traffic file for RB switching.
4. scenario: Scenario file for RB switching.
Users/Interactions 1. User runs rb.tcl to produce trace file.
2. User uses NAM tool to see the simulation.
Resources 1. Requires interface to see the simulation.
Processing 1. Run the rb.tcl file.
Component Name Non-Reservation based (NRB) switching.
Definition This is Non reservation based switching. In this
next node in the route is selected dynamically.
There is no route reservation prior to data
transmission.
Responsibilities Provide multiple multihop routes from source
to destination as per traffic conditions.
Constraints Simultaneously existing multihop routes may
overlap and selected dynamically at each hop.
Compositions 1. AODV protocol folder used for route
discovery.
2. nrb.tcl: Tcl script for NRB switching.
3. nrbtraffic: Traffic file for NRB switching.
4. scenario: Scenario file for NRB switching.
Users/Interactions 1. User runs nrb.tcl to produce trace file.
Resources 1. Requires interface to see the simulation.
Processing 1. Run the nrb.tcl file.
Component Name Delay Calculation and Comparison.
Definition This is for calculating delay of the two
switching schemes and generating comparison
graph between them.
Responsibilities To calculate the delay of two switching
schemes and provide comparison graph.
Constraints Data transmission delay of RB and that of NRB
must be calculated.

44
Compositions 1. outrb.tr: Trace file for RB switching.
2. outnrb.tr: Trace file for NRB switching.
3. rb.awk: Awk script file for RB switching.
4. nrb.awk: Awk script file for NRB switching.
5. rb.xgr: Graph file for RB switching.
6. nrb.xgr: Graph file for NRB switching.
Users/Interactions 1. User runs rb.awk on outrb.tr to produce
rb.xgr.
2. User runs nrb.awk on outnrb.tr to produce
nrb.xgr.
3. User uses Xgraph to see the delay graph.
Resources 1. Requires interface to see the graph.
Processing 1. Run the rb.awk file.
2. Run the nrb.awk file.
3. Run the Xgraph.
File tracer
File tracer
Fig. 6.2 Component Diagram

45
6.3 DEPLOYMENT DIAGRAM
The deployment diagram consists of the three main components: RB (Reservation Based) switching,
NRB (Non Reservation Based) switching and Delay Calculation & Comparison. All these components
have been described in „Component Diagram Description‟ in detail.
Fig. 6.3 Deployment Diagram

46
6.4 SNAPSHOTS AND FORMULAS
6.4.1 Reservation Based Switching
Fig. 6.4.1 Reservation Based Switching
Path 1 0,10,20,30,40,50,60,70,80
Path 2 4 ,21,38,55,72
Path 3 12,22,32,42,52,62

47
6.4.2 Non-Reservation Based Switching
Fig. 6.4.2 Non-Reservation Based Switching
Path 1 0 - - - - - - - - - -80
Path 2 4 - - - - - - - - - - 72
Path 3 12- - - - - - - - - - -62

48
6.4.3 Parameters of RB and NRB Scheme for Delay Comparison
End-to-End delay =
(total end time of packets received at all active routes ) – (start time of packets of all active
routes )
Table 6.4 Parameters
Parameters Values
Data Rate 1 Mb/s
Average Message Length 106 bits
Packet length 103 bits

Area Of Network 500 x 599
Nodes 81
Simulation Time 1000s

Mac Layer 802.11
Traffic Model CBR
Fig. 6.4.3 Delay Comparison for 3 active routes

49
Fig. 6.4.4 Delay Comparison for 13 active routes
Fig. 6.4.5 Delay Comparison for different intervals

50
Fig. 6.4.6 Delay Comparison for 10000 messages.
Throughput = Received Packets* PacketSize *8 / End- to- End Delay*1000
Fig. 6.4.7.Throughput

51
7. TESTING OF RB AND NRB
7.1 PURPOSE
The purpose of this document is to prescribe the scope, approach, resources, and schedule of the
testing activities. To identify the items being tested the features to be tested, the testing tasks to be
performed.
7.1.1 Unit Testing

Individual components are tested independently to ensure their quality. The focus is to uncover errors
in design and implementation, including
-data structure in component
-program logic and program structure in a component
-component interface
-functions and operations of a component
7.1.2 Integration Test

A group of dependent components are tested together to ensure their quality of their integration unit.
The focus is to uncover errors in:
-Design and construction of software architecture
-Integrated functions or operations at sub-system level
-Interfaces and interaction and/or environment integration
7.1.3 System Test

The system software is tested as a whole. It verifies all elements mesh properly to make sure
that all system functions and performance are achieved in the target environment. The focus
areas are:
-System functions and performance
-System reliability and recoverability (recovery test)
-System behavior in the special conditions (stress and load test)
-System user operations (acceptance test/alpha test)
-Hardware and software integration collaboration
-Integration of external software and the system

52
7.2 OUTLINE
7.2.1 Introduction
System is a research for two switching schemes in ad hoc networks for comparing the performance of
both types of switching schemes system which targets to send data packets via both RB and NRB
schemes. The concept is to allow a wireless machine to send a data packet to a particular node using this
system depending on which mode of transmission is available. This project aims to use a mobile device,
internet connection and Wi-Fi LAN and file packets as resources. The system also compares and displays
the delay comparison of RB and NRB schemes
7.2.2 Test Items

a. Reservation scheme data Transmission: The data packet is send by reserving routes to
destination using intermediate nodes which are dedicated to only this data transmission.
b. Non-Reservation scheme data Transmission: The data packet is sent by multiple intermediate
nodes to destination using intermediate nodes which are not reserved and can send others as well as theirs
own packets.
c. Comparison Graph: The delay of both schemes are calculated and the comparison between them is
plotted on graph known as Delay graph
7.2.3 Features to Be Tested

This includes all the functional requirements of the system
1. Sending data packets by RB.
2. Sending data packets by NRB.
3. Comparison Graph.
7.2.4 Features Not To Be Tested

This includes all the non functional requirements of the system
1. Connectivity for mobile device.
7.2.5 Approach
Each of the features to be tested are considered and tested under all possible input conditions. The
outputs are noted and a test log is maintained. These logs are used in maintenance and deployment of the
system.

53
7.2.6 Test Deliverables
The test deliverables include the results of the tests carried out on following items
1. RB data packet transfer (no. of Packets).
2. NRB data packet transfer (no. of packets).
3. Delay Graph.
No separate test module is needed in testing the system.
7.2.7 Environmental Needs

This is a stand application with following hardware and software requirements
a. Hardware:
1. Wireless (mobile) Nodes.
2. Wireless LAN.
b. Software:
1. RedHat LINUX 5.0.
2. Ns-Allinone-2.34.
3. Exel/Xgraph tool.
7.3 TEST CASE SPECIFICATION
Table 7.3 Test Case Specification

TEST CASE SPECIFICATION IDENTIFIER PACKET SEND RB #1
Test items .tcl script for transmitting data packets via

RB scheme by providing source and
destination nodes in .tcl script.
Input specifications Inputs required are:
1. No. of data packets.
2.Data packet transfer rate
Output specifications Output expected is:
Using NAM tool it shows, Packets are
transmitted via intermediate nodes which
are reserved from source to destination.
Environmental needs This project assumes that nodes are placed
in Square-Grid topology.
Hardware 1.Wireless device

54
2. LAN connectivity.
Software 1.RedHat Linux 5.0 or higher
2.NS-allinone-2.34
3.NAM tool
TEST CASE SPECIFICATION IDENTIFIER PACKET SEND NRB #2
Test items .tcl script for transmitting data packets via

NRB scheme by providing source and
destination nodes in .tcl script
1. No. of data packets.
2.Data packet transfer rate
Output specifications Output expected is:Using NAM tool it
shows, there is no route reservation i.e
intermediate nodes can serve more than
one routes at the same time.
Hardware 1. Wireless device


2.NS-allinone-2.34
3.NAM tool
TEST CASE SPECIFICATION IDENTIFIER DELAY REPORT #3
Test items .xgr file that will display graph for RB and
NRB scheme and it shows the comparison
between them.
1. Trace file RB scheme (rb.tr).
2. Trace file for NRB scheme (nrb.tr).
Output specifications Output expected is: Using XGraph tool
which shows, the delay comparison graph
of RB and NRB schemes. RB is shown in

55
RED color and NRB graph is in GREEN
color.

Hardware 1.Wireless device


2.NS-allinone-2.34
3. XGraph tool.
7.4 TEST PROCEDURE SPECIFICATION
Table 7.4 Test Procedure Specification

TEST PROCEDURE SPECIFICATION TPS_RB#1
IDENTIFIER
Test Procedure Linux command prompt (To execute .tcl

script).
Start ~> ns rb.tcl
~>nam rb.nam
Proceed Press speed up and speed down buttons to
manage the speed of the slider. (rb.tcl)
Measure Click on Print Report button to get report.
Shut down To close just click on exit button.
Stop RB transmission halts when data transfer
finishes.
Wrap up To Restore Open Terminal and apply
commands.
Contingencies Check for .tr and .tcl files
Procedure results This Results in a nodes arrangement of 81
nodes and shows transfer of data by reserving
intermediate nodes.
Anomalous events At an anomalous events the transfer of packets

56
are not proper and delay may come out more.
Variances No variances
TEST PROCEDURE SPECIFICATION TPS_NRB#2
IDENTIFIER
Test Procedure Linux command prompt (To execute .tcl

script).
Start Command:-
~> ns NRB.tcl
~>nam NRB.nam
manage the speed of the slider. (nrb.tcl)
Measure Click on Print Report button to get report.
Restart Restart button is specified in the GUI of
NAM. Else you can use the same command
after closing it.
Stop NRB transmission halts when data transfer
finishes.
Wrap up
Contingencies Check for .tr and .tcl files
Procedure results This Results in a nodes arrangement of 81
nodes and shows transfer of data by reserving
intermediate nodes.
Anomalous events At an anomalous events the transfer of packets
are not proper and delay may come out more.
TEST PROCEDURE SPECIFICATION TPS_GRAPH#3
IDENTIFIER
Test Procedure 1. Linux command prompt (To execute .tcl

script).
2.Execute awk script for delay of RB and
NRB switching schemes

57
Start Command:-
~> ns nrb.tcl
~>nam nrb.nam
~>xgraph –t Delay –x
Sending_Time –
y Delay rb.xgr nrb.xgr –
geometry 800*400 &
manage the speed of the slider. (method of
graph)
Measure Click on Graph window to get zoomed
images. Opened in new window.
Restart Use the above command after closing it
Stop
Wrap up
Contingencies Check for .tr and .tcl and .xgr files
Procedure results This Result in outputting the graph of DELAY
time Vs Packet sent of RB and NRB schemes.
Anomalous events No anomalous events.
7.5 SUMMARY OF RESULTS
The summary of this testing document is to test above procedures and programs which will give
output as expected from the system and results of tests are correct and matching with the results specified
while analyzing the requirements of the project.

58
8. CONCLUSIONS AND FUTURE WORK
8.1 CONCLUSIONS
The two switching schemes which are shown in this work namely Reservation based (RB) and Non
Reservation based (NRB). The aim of this work is to compare the delay performance of RB with NRB
and prove that the RB provides better delay performance than NRB if right requirements are met.
It is proved that if the right requirements are provided (in terms of route discovery, protocol used, etc.)
the RB switching scheme can yield better delay performance than NRB switching scheme. The work
output shows the delay graph of RB and NRB switching scheme and compare those two graphs which
shows that the delay of RB is less than delay of NRB.
In this work, RB switching scheme is shown, in RB, considering the square grid topology. Data
packets have sent by reserving a route from source to destination and display of route is shown by
specifying links between them. And in NRB, considering the same topology data packets have sent from
source to destination by intermediate nodes which can be used by other nodes for data transfer.
It is important to understand that if one uses a different MAC protocol (such as 802.11b) and/or one
uses a separate control channel for route discovery, for instance, then the results obtained might be very
different for RB switching are not met, then NRB schemes will probably be preferable.
The result of analytical framework shows that RB schemes are appropriate for real time applications,
such as voice and video, whereas NRB schemes are more appropriate for delay-insensitive applications.
While RB schemes can provide better delay performance, NRB schemes support higher traffic loads than
RB schemes.NRB schemes support higher number of routes because there is no constraint for the routes
to be disjoint. Finally it is shown that RB schemes are more robust to node mobility which is not
considered in this work.
8.2 FUTURE WORK
 Support for mobility.

 Appling RB scheme in network where real time wireless data transfer is required.
 Consideration of impact of interference on RB and NRB.

59
REFERENCES
1 Sooskan panichpapiboon,Gianluigi Ferrari,Nawaporn wisitpongphan and ozan K. Tonguz
“Route Reservation in Ad Hoc Wireless Networks”,IEEE Transaction in Mobile Computing,vol
6,No 1,January 2007
2 D. Bertsekas and R. Gallager, Data Networks. Prentice Hall, 1992.
3 E.M. Royer and C.-K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile
Wireless Networks,” IEEE Personal Comm. Magazine, vol. 6, no. 2, pp. 46-55, Apr. 1999.
4 G. Ferrari and O.K. Tonguz, “Performance of Ad Hoc Wireless Networks with Aloha and PR-
CSMA MAC Protocols,” Proc. IEEE GLOBECOM, pp. 2824-2829, Dec. 2003.
5 C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. IEEE
Workshop Mobile Computing Systems and Applications, pp. 90-100, Feb. 1999.
6 D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,”
Mobile Computing, T. Imielinski and H. Korth, eds., pp. 153-181, 1996.
7 V. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile
Wireless Networks,” Proc. IEEE INFOCOM, pp. 1405-1413, Apr. 1997.
8 S.-J. Lee, M. Gerla, and C.-K. Toh, “A Simulation Study of Table-Driven and On-Demand
Routing Protocols for Mobile Ad Hoc Networks,” IEEE Network, vol. 13, no. 4, pp. 48-54, Jul.-
Aug. 1999.
9 S. Das, R. Castaneda, and J. Yan, “Simulation-Based Performance Evaluation of Routing
Protocols for Mobile Ad Hoc Networks,” ACM Mobile Networks and Applications, vol. 5, no.
3, pp. 179-189, Sept. 2000.
10 A. Boukerche, “Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks,”
ACM Mobile Networks and Applications, vol. 9, no. 4, pp. 333-342, Aug. 2004.
11 P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information
Theory, vol. 46, no. 2, pp. 388-404, Mar.2000.
12 N. Bansal and Z. Liu, “Capacity, Delay, and Mobility in Wireless Ad-Hoc Networks,” Proc.
IEEE INFOCOM, vol. 2, pp. 1553-1563, Apr. 2003.
13 E. Perevalov and R. Blum, “Delay-Limited Throughput of Ad Hoc Networks,” IEEE Trans.
Comm., vol. 52, no. 11, pp. 1957-1968, Nov. 2004.
14 M.J. Neely and E. Modiano, “Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks,”
Proc. Int‟l Conf. Broadband Networks (BROADNET), pp. 428-438, Oct. 2004.
15 S. Chen and K. Nahrstedt, “Distributed Quality-of-Service Routing in Ad Hoc Networks,” IEEE
J. Selected Areas in Comm., vol. 17, no. 8, pp. 1488-1505, Aug. 1999.

60
16 C.R. Lin and J. Liu, “QoS Routing in Ad Hoc Wireless Networks,” IEEE J. Selected Areas in
Comm., vol. 17, no. 8, pp. 1426-1438, Aug. 1999.
17 S. Lee, G.-S. Ahn, X. Zhang, and A.T. Campbell, “INSIGNIA: An IP-Based Quality of Service
Framework for Mobile Ad Hoc Networks,” J. Parallel and Distributed Computing, vol. 60, pp.
374-406, Apr. 2000.
18 L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala,“RSVP: A New Resource
Reservation Protocol,” IEEE Network,vol. 7, no. 5, pp. 8-18, Sept. 1993.
19 A. Talukdar, B. Badrinath, and A. Acharya, “MRSVP: A Resource Reservation Protocol for an
Integrated Services Network with Mobile Hosts,” ACM Wireless Networks, vol. 7, no. 1, pp. 5-
19, Jan. 2001.
20 C.-C. Tseng, G.-C. Lee, and R.-S. Liu, “HMRSVP: A Hierarchical Mobile RSVP Protocol,”
Proc. IEEE Int‟l Conf. Distributed Computing Systems Workshops (ICDCS), pp. 467-472, Apr.
2001.
21 S. Panichpapiboon, G. Ferrari, N. Wisitpongphan, and O.K.Tonguz, “Route Reservation in Ad
Hoc Networks: Is It a Good Idea?” Proc. IEEE Wireless Comm. and Networking Conf.
(WCNC), pp. 2045-2050, Mar. 2005.
22 S. Panichpapiboon, G. Ferrari, and O.K. Tonguz, “Sensor Networks with Random versus
Uniform Topology: MAC and Interference Considerations,” Proc. IEEE Vehicular Technology
Conf. (VTC), pp. 2111-2115, May 2004.
23 G. Ferrari, B. Baruffini, and O.K. Tonguz, “Spectral Efficiency- Connectivity Tradeoff in Ad
Hoc Wireless Networks,” Proc. Int‟l Symp. Information Theory and Its Applications (ISITA
‟04), pp. 451-456, Oct. 2004.
24 T.S. Rappaport, Wireless Communications Principles and Practice.Prentice Hall, 1996.
25 S. Panichpapiboon, G. Ferrari, and O.K. Tonguz, “Optimal Transmit Power in Wireless Sensor
Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 10, pp. 1432-1447, Oct. 2006.
26 A. Papoulis and S.U. Pillai, Probability, Random Variables and Stochastic Processes, fourth ed.
McGraw-Hill, 2002.
27 I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,”
IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
28 B. Schrick and M.J. Riezenman, “Wireless Broadband in a Box,” IEEE Spectrum, vol. 39, no. 6,
pp. 38-43, June 2002.
29 C.E. Perkins, Ad Hoc Networking. Addison-Wesley, 2001
30 S. Park and B. Van Voorst, “Anticipated Route Maintenance (ARM) in Location-Aided Mobile
Ad Hoc Networks,” Proc. IEEE GLOBECOM, pp. 2809-2813, Nov. 2001

61
31 G. Tunnicliffe, A. Murch, A. Sathyendran, and P. Smith, “Analysis of Traffic Distribution in
Cellular Networks,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 1984-1988, May 1998.
32 L. Kleinrock, Queuing Systems Vol. 1. John Wiley & Sons, 1975.
33 J. Medhi, Stochastic Models in Queuing Theory. Elsevier Science Publishers, 2003.
34 J. Kurose and K. Ross, Computer Networking: A Top-Down Approach, second ed. Addison-
Wesley, 2002
35 N. Abramson, “Multiple Access in Wireless Digital Networks,” Proc. IEEE, vol. 82, pp. 1360-
1370, Sept. 1994.
36 J. Kleinberg and E. Tardos, “Approximations for the Disjoint Paths Problem in High-Diameter
Planar Networks,” J. Computer and System Sciences, vol. 57, pp. 61-73, 1998.
37 R. Hofstad, G. Hooghiemstra, and D. Znamenski, Distances in Random Graphs with Finite
Mean and Infinite Variance Degrees, Feb.2003, preprint,.
38 L. Hu, “Distributed Code Assignments for CDMA Packet Radio Networks,” IEEE/ACM Trans.
Networking., vol. 1, no. 6, pp. 668-677, Dec. 1993.
39 J. Garcia-Luna-Aceves and J. Raju, “Distributed Assignment of Codes for Multihop Packet-
Radio Networks,” Proc. IEEE Military Comm. Conf. (MILCOM), pp. 450-454, Nov. 1997.
40 O.K. Tonguz and G. Ferrari, Ad Hoc Wireless Networks: A Communication-Theoretic
Perspective. Wiley and Sons, 2006.

62

Project Report

Transféré par

Informations du document

Description originale:

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Project Report

Transféré par

Droits d'auteur :

Formats disponibles

A PROJECT REPORT ON

“PERFORMANCE EVALUATION OF RB SWITCHING

SUBMITTED TO THE UNIVERSITY OF PUNE, PUNE

MASTER OF ENGINEERING (COMPUTER NETWORK)

Mr. Vikas G. Bhowate Exam No: 2197

DEPARTMENT OF COMPUTER ENGINEERING

Mr. Vikas G.Bhowate

Figure Title Page No.

Term or Acronym Definition

2.1 Proposed Work Analysis 3-4

SCOE, Computer Engg, 2010

SCOE, Computer Engg, 2010

Reservation Based (RB) Switching Scheme In an RB scheme, a source first reserves a

SCOE, Computer Engg, 2010

2.2.1 Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks

2.2.2 Ad-Hoc on-Demand Distance Vector Routing

SCOE, Computer Engg, 2010

2.2.3 Dynamic Source Routing in Ad Hoc Wireless Networks

SCOE, Computer Engg, 2010

3.1 PROBLEM STATEMENT

Non-Reservation Reservation Based

Comparison of Delay Performance

SCOE, Computer Engg, 2010

3.3 SOFTWARE REQUIREMENT SPECIFICATION

SCOE, Computer Engg, 2010

3.3.3 Overall Description

3.3.4 System Interfaces

SCOE, Computer Engg, 2010

3.3.5 Software Interfaces

3.3.6 Communication Interfaces

SCOE, Computer Engg, 2010

SCOE, Computer Engg, 2010

3.3.7 Analysis of RB and NRB

3.3.8 Static Numerical Requirements

SCOE, Computer Engg, 2010

Amount and type of information to be handled

3.3.9 Dynamic Numerical Requirements

SCOE, Computer Engg, 2010

4.2 GOALS AND SCOPE

SCOE, Computer Engg, 2010

M6 Release Product 10/10/2010

SCOE, Computer Engg, 2010

5.1 USE CASE DIAGRAMS

Fig. 5.1 Overall System Use-Case Diagram

SCOE, Computer Engg, 2010

Fig. 5.2.1 Maintain Wireless Network

SCOE, Computer Engg, 2010

Fig.5.2.2 Provide Switching Scheme

SCOE, Computer Engg, 2010

Fig.5.2.3 Analyze Switching Scheme

SCOE, Computer Engg, 2010

5.3.1 Sequence Diagram for Managing Wireless Links

Fig.5.3.1 Sequence Diagram for Managing Wireless Network

SCOE, Computer Engg, 2010

Message Type From Object To Object

SCOE, Computer Engg, 2010

Fig. 5.3.2 Implement RB Switching Scheme

SCOE, Computer Engg, 2010

Class Name Purpose

Message Type From Object To Object

SCOE, Computer Engg, 2010

Fig. 5.3.3 Implement NRB Switching Scheme

SCOE, Computer Engg, 2010

Throughput = Received Packets* PacketSize 8 / End- to- End Delay1000