How to Make a Computer Network Project.
Step – 1
• Choose a network simulator.
Several open source and commercial simulators are available.
Open Source Simulators
NS − 2
NS − 3
OM N eT + +
JIST /SWAN
Commercial Simulators
Glomosim
OMNEST
OPNET
Step – 2
• Select two or more protocols or network algorithms of the same functionality.
- Compare them based on the data which is produced
by the simulator.
Transport Layer Protocols
T CP
U DP
SCT P
RT P
Ad Hoc Network Routing Protocols
DSDV
DSR
AODV
OLSR
Different types of attacks on MANET routing protocol.
Many Peer-To-Peer Architecture algorithms.
Further, 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.
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.
NRL = Pc|Pd
Where
Pc is Number of Control Packets
Pd is Number of Data Packets
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.
PDR = Pr|Ps
Where
Pr Total Number of Packets Received.
Ps Total Number of Packets Sent.
Packet Loss
(Think Yourselves…………..-Your Goal).
Packet Loss = Ps-Pr
Where
Pr Total Number of Packets Received.
Ps Total Number of Packets Sent.
Jitter (Minimize It)
Jitter is defined as the difference in delay between two successive packets related
to the same flow.
Jitter = Delay(Pn) − Delay(P n−1)
Variation in delay (Jitter) occurs when different delays are experienced by
packets related to the same flow.
Throughput(Maximize It)
The network throughput is referred to as the average number of bits received
by destination nodes in one second.
Throughput = (8 ∗ TB)| T LBR − T F BS
(6)
Where
TB Total Number of Bytes
TFBS Time at First Bit Sent
TLBR Time at Last Bit Received
Note- It can not be more than the link’s data rate.
Channel Utilization(Maximize It)
Channel Utilization = Throughput | 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 the flowchart of your protocol and examine the algorithm(s)
and data structure(s) used by your protocol.
• Again, find the 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).
1-Real Life Concepts
Many concepts are hired from real life in computing and in computer networks. So, first try it.
2-Algorithms Design Methodologies
Greedy Example(s) OSPF, OLSR and Spanning Protocols.
Dynamic Programming Example(s) RIP, DSDV, AODV, DSR, DYMO.
Genetic Algorithms Protocol Optimization
Operations Research Network Resource Utilization
3- Modifying Data Structures
Queue Example(s) QoS and Congestion Control protocols use it.
Hash Table Example(s) Distributed Hash T able(DT H) Is used by Peer −T o −Peer network protocols.
4- Probability Concepts
Back − Off algorithm uses to avoid collisions.
DSR routing protocol uses it to prevent broadcast storm.
Security algorithms use it to find out the probability of attacks.
Step – 5
• Compare modified algorithm with unmodified algorithm.
• Report the result in the form of project.