How to Make a Networking Research

Project?
The Art of Protocol Design
( The Art of Artcle Series )

Bindeshwar Singh Kushwaha

Pramod Kumar Mishra
Department of Computer Science
Institute of Science
Banaras Hindu University, Varansi, India
www.bindeshwar.in

Step - 1
Choose a network simulator.

Several open source and commercial simulators are available.

NS 2
NS 3

Open Source Simulators
OM N eT + +

JIST /SW AN

Glomosim
Commercial Simulators OM N EST
OP N ET

Step-2
Select two or more protocols or network algorithms of the same
functionality.

1
 Compare them based on the data which is produced
by the simulator.

T CP
U DP

Transport Layer Protocols

SCT P
RT P

DSDV
DSR

Ad Hoc Network Routing Protocols

AODV
OLSR

Hand Over Algorithms {

Different types of attacks on MANET routing protocol.

Many Peer-To-Peer Architecture algorithms.

Plot the results in the form of graphs, and the results can be reported as a
mini project.

Step-3
Consider only one protocol model or algorithm.
Learn simulator in depth and also how to make a model?
Perform simulation and gather huge amount of data.
Choose metrics which are related to your protocol or algorithm and
keep them for the future use.
Some common metrics are.

1 End To End Delay(Minimize It Your Goal)

End to End Delay is defined as time (T) taken by a packet to travel from the
application layer of source node to the application layer of destination node.

EED = Pr - Pg (1)

Pr Time at reception of packet

Pg Time at generation of packet

2
2 Normalized Routing Load(Minimize it- Your
Goal)
Normalized Routing Load(NRL) is defined as the ratio of control packets to
data packets, and it characterizes the protocol overhead to send data from a
source node to its respective destination.
Normalized Routing Load can be expressed as.
Pc
N RL = (2)
Pd
Where
Pc Number of Control Packets
Pr Number of Data Packets

3 Packet Delivery Ratio

(Maximize it-Your Goal) .
Packet delivery fraction is the ratio of packets received by destinations and sent
by sources across the network.
Pr
P DR = (3)
Ps
Where
Pr Total Number of Packets Received.
Ps Total Number of Packets Sent.

It can not be greater than 1.

4 Packet Loss
(Think Yourselves..............-Your Goal) .
P acketLoss = P r P s (4)
Where
Pr Total Number of Packets Received.
Ps Total Number of Packets Sent.

It can not be greater than 1.

5 Jitter (Minimize It)

Jitter is defined as the difference in delay between two successive packets related
to the same flow.
Jitter = Delay(P n) Delay(P n 1) (5)

3
Variation in delay (Jitter) is occurred when different delays are experienced by
packets related to the same flow.

6 Throughput(Maximize It)
The network throughput is referred to as the average number of bits received
by destination nodes in one second.
8 TB
T hroughput = (6)
T LBR T F BS
Where
TB Total Number of Bytes
TFBS Time at First Bit Sent
TLBR Time at Last Bit Received
Note- It can be more than links data rate.

7 Channel Utilization(Maximize It)

T hroughput
ChannelU tilization = (7)
LinkDataRate
To find more parameters.
Type in google bar network performance parameters for...(Write your protocol
name).

Step-4
This step is very critical.

Observe flow chart of your protocol and examine the algorithm(s)

and data structure(s) used by your protocol .

Again, find modified version of your protocol and compare with

yours.

After comparing them you will get some new ideas.

Use one of the concepts which are listed below and implement
your idea(s).

4

M any Concepts Are Aired F rom Real Lif e
Real Lif e Concepts In Computing And In Computer N etworks
So, F irst T ry It.

Greedy Example(s) OSP F, OLSR and Spanning P rotocols.
Dynamic P rogramming Example(s) RIP, DSDV, AODV, DSR, DY M O.




Genetic In Research Domain.

Algorithms
Approximation
In Research Domain.
Convex N etwork Resource U tilization.




Combinatorial Optimization Better Combination of N etwork Components.

Queue Example(s) QoS and Congestion Control P rotocols U se It.
Data Structures Hash T able Example(s) Distributed Hash T able(DT H)
Is U sed By P eer T o P eer N etwork P rotocols.

Back Of f Algorithm U ses It T o Avoid Collisions.
P robability Concepts DSR P rotocol U ses It T o P revent Broadcast Storm.
Security Algorithms U ses It T o F ind Out P robability Of Attacks.

Other types of algorithms.

Numerical Method
Artificial Intelligence

:: Important ::
To modify protocol read research papers, theses and master level research projects.
To see flow chart of algorithms see proposed algorithms chapters of theses.

Step-5
Compare modified algorithm with unmodified algorithm.

Report the result in the form of project.