Skip to main content

Posts

Featured Post

5G Network Simulation in NS3 using mmWave | NS3 Tutorial 2024

5G Network Simulation in NS3 Using mmWave This post shows the installation of ns3mmwave in Ubuntu 24.04 and simulates 5G networks in ns3. Installation of #5g networks in ns3 namely mmWave for #ns3 #TSP #pradeepkumar #pradeepkumarts Prerequisites: 1. Ubuntu OS (I used Ubuntu 24.04) 2. mmWave software from github To know the complete process, follow the video given below Open a new Terminal and try these commands $ sudo apt update $ sudo apt install g++ python3 cmake ninja-build git gir1.2-goocanvas-2.0 python3-gi python3-gi-cairo python3-pygraphviz gir1.2-gtk-3.0 ipython3 tcpdump wireshark libsqlite3-dev qtbase5-dev qtchooser qt5-qmake qtbase5-dev-tools openmpi-bin openmpi-common openmpi-doc libopenmpi-dev doxygen graphviz imagemagick python3-sphinx dia imagemagick texlive dvipng latexmk texlive-extra-utils texlive-latex-extra texlive-font-utils libeigen3-dev gsl-bin libgsl-dev libgslcblas0 libxml2 libxml2-dev libgtk-3-dev lxc-utils lxc-templates vtun uml-utilities ebtables bridg...
Recent posts

Comparison of Distance-Vector Routing (RIP) and Link-State Routing | NS3 Project 11

Comparison of Distance-Vector Routing (RIP) and Link-State Routing 1. Aim To simulate and compare the behavior of a Distance-Vector routing protocol (RIP) and a Link-State routing protocol (OLSR) on a 6-node point-to-point network in ns-3.44, visualize packet flow using NetAnim, introduce a mid-simulation link failure to observe convergence behavior, and record throughput data for graph-based analysis. 2. Theory 2.1 Distance-Vector Routing — RIP Routing Information Protocol (RIP) is a classical distance-vector protocol. Every router periodically broadcasts its entire routing table to its immediate neighbors. Routes are selected based on hop count, with a maximum metric of 15 hops; a value of 16 is considered infinite (unreachable). Each node builds its routing table using the Bellman-Ford algorithm by iteratively updating paths based on the cost information received from neighbors. When a link fails, the affected node must propagate the change hop-by-hop through the network, ...