Evolutionazing the internet surfing experience by

optical fiber in a rural area

Presented To: Dr. Sadia Noreen
Department Of Mathematics, UOG

Abstract: Results: Initial Stage Of Problem: Conclusions:

This project aims to design an efficient fiber optic network to →𝒌=𝟎
provide high-speed internet access to 25 rural villages 𝐶𝑘 = ∅ Our project used the Prim’s algorithm to design an
surrounding Daska, Pakistan. By utilizing the Prim’s algorithm, 𝐶𝑘 = 1,2,3, … , 25 optimal network for high-speed internet in Daska city.
we identify the optimal network topology that minimizes the With Daska node as the hub, our design:
total cost of fiber optic cable deployment. Our solution ensures • Minimizes costs.
reliable and fast internet connectivity, bridging the digital divide →𝒌=𝟏
• Ensures reliable connectivity.
and promoting socio-economic development in these 𝐶1 = {1}
• Boosts internet speeds.
underserved communities. 𝐶1 = 2,3, … , 25 • Promotes digital inclusivity.
Introduction: Our project showcases the power of graph theory in
In today's digital age, fast and reliable internet connectivity is →𝒌=𝟐 solving real-world problems, and its outcomes can
essential for economic growth, education, and communication. 𝐶2 = 1,2 benefit other cities and regions.
However, many areas in Daska city face slow internet speeds, 𝐶2 = 3, … , 25 {𝟏, 𝟐} → 𝟏𝟎
hindering the community's progress and perpetuating the
digital divide. To address this critical issue, we propose a →𝒌=𝟑 Future recommendations:
network optimization solution using graph theory, specifically 𝐶3 = 1,2,3
a minimum spanning tree (MST) concept. • Expand to other areas: Use this model to improve
Our goal is to design an MST-based network that connects 25 𝐶3 = 4, … , 25 𝟐, 𝟑 → 𝟐 internet connectivity in other cities and towns.
nodes with high-speed internet via fiber optics cable, • Improve existing networks: Combine this model with
improving internet speeds, reducing costs, and promoting existing internet infrastructure to make it even better.
digital inclusivity. By leveraging the efficiency of MST, we can →𝒌 = 𝟒 • Stay up-to-date with new technologies: Adapt the
create a scalable, reliable, and cost-effective network that 𝐶4 ={1,2,3,6} model to work with new and future internet
bridges the digital divide and supports the city's economic 𝐶4 ={4,5,7,…,25} {2,6} →8 technologies, like 5G and 6G.
growth and development. • Use clean energy: Power the internet network with
Methodology: →𝒌 = 𝟓 renewable energy sources like solar or wind power.

𝐶5 ={1,2,3,5,6} Resulting Span Tree with Length 153:

Presented By:
a) Node identification
b) Graph construction 𝐶5 ={4,7,…,25} {6,5} →7
c) MST algorithm application (Prim’s Algorithm)
d) MST construction Ahmed Arif Muhammad Awais
Similarly,
e) Fiber optics cable installation (23011709-006) (23011709-027)
It goes upto 25 iterations Neha Yaseen Muhammad Mahtisham
Prim’s Algorithm: (23011709-017) (23011709-031)
It falls under a class of algorithms called greedy algorithms
→𝒌 = 𝟐𝟒 Aroosha Iftikhar Areeba Rani
that find the local optimum in the hopes of finding a global 𝐶24 = {1,2,3,5,…,25} (23011709-018) (23011709-034)
optimum. 𝐶24 = {4} {18,25} →12 Amna Maryam
The steps for implementing Prim's algorithm are as follows: (23011709-024)
i. Initialize the minimum spanning tree with a vertex chosen
at random.
→ 𝒌 = 𝟐𝟓 References:
ii. Find all the edges that connect the tree to new vertices, 𝐶25 = {1,2,…,25}
• https://graphonline.ru/en
find the minimum and add it to the tree. 𝐶25 =∅ {3,4} →17 • https://csacademy.com/app/graph_editor/
iii. Keep repeating step 2 until we get a
minimum spanning tree. • https://www.usf.org.pk/programs/optic-fiber-program
• https://www.wateen.com/
• https://earth.google.com/web