Scribd
Upload
53 views11 pages

Data Structures EC-200: Wireless Network

The document summarizes a program that represents a wireless network using a graph data structure. It generates the network by distributing nodes randomly and connecting nodes within a range of 1 unit. It finds the shortest path between nodes using Dijkstra's algorithm. The program meets the requirements of representing the wireless network with a unit disk graph, finding shortest paths, and performing depth-first and breadth-first searches. Limitations are within the scope of these tasks. The knowledge gained from designing and implementing algorithms to model the problem was valuable.

Uploaded by

Shoaib Talib
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
53 views11 pages

Data Structures EC-200: Wireless Network

The document summarizes a program that represents a wireless network using a graph data structure. It generates the network by distributing nodes randomly and connecting nodes within a range of 1 unit. It finds the shortest path between nodes using Dijkstra's algorithm. The program meets the requirements of representing the wireless network with a unit disk graph, finding shortest paths, and performing depth-first and breadth-first searches. Limitations are within the scope of these tasks. The knowledge gained from designing and implementing algorithms to model the problem was valuable.

Uploaded by

Shoaib Talib
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Trait Obtaine Maximum

d Marks Marks
R1 Functionality 30
30 %
R2 Specification & Efficient 60
Data Structure
DATA STRUCTURES
implementation
60 %
R3 EC-200
Documentation
10 %
10

R4
Wireless Network
In Time Submission 1
R5 Plagiarism 1
Course R6 Viva 1 Instructor:
Lecturer Anum Abdul Salam

Lab Engineer: Lab Engineer Ayesha Umbreen

Group Members: Muhammad Shoaib Talib, Abdul Wali

Degree/ Syndicate: Degree 40, Syndicate A

Total Marks = Obtained Marks ¿


Table of Contents
1. Introduction..............................................................................................................................3
2. Description...............................................................................................................................3
2.1. Methodology.....................................................................................................................3
2.2. Results Enter output of your program when executed......................................................7
2.3. Limitations........................................................................................................................8
3. Conclusion................................................................................................................................9
4. References...............................................................................Error! Bookmark not defined.
1. Introduction
This Program represents the Wireless Network implemented in the C++ Language. The
Program represents Wireless Network via the Graph representations. Since the Graph is
used to represent the relationship or the Raw data about the given problem. Thus, this
Project is design by using the Graph Theory. In the Wireless Network, Several Nodes
that are acting as transmitter, Receiver or as a booster that have different connectivity
ranges depending upon the Nodes within the range of the other are connected via the
Signal. The Unit Disk Graph Theory [ CITATION Uni20 \l 1033 ] can represent the
Scenario best.
As UDG have been used to model the Wireless Network providing that the points are
connected to each other via the edges providing the distance within the range of 1 unit.
Therefore, considering the Unit Disk Graph (UDG) in the representation of the Wireless
Network is Crucial. This Project represents the Scenario of the Wireless Network
generated by the Unit disk graph.
There are Several Applications, it represents the Wireless Network generated on the
basis of UDG. In the Wireless Network communication the transmission and receiving
time of the information is crucial as time is the vital, therefore one of the core concept in
the generating the Wireless Network is finding the shortest path to send the message form
the source to the destination router or called as nodes in the network. Considering this
fact, the Problem of Finding the Shortest Path via the Dijkstra’s Algorithm is solved
and hence increased the application of the Network, therefore the Program designed or
the representation of the given problem can be applicable where the Shortest Path is
considered. “Shortest Path is often used in Social Network Analysis where usually
people with the strongest bond tend to communicate through the shortest path.”

1.1. Methodology
As mentioned in the Section 1, the Wireless Network can be represented via the Graph or
more Specifically UDG. Including the representation for the Graph in this project was
crucial therefore the given problem solved well using the Adjacency List representation
of the Garph,therefore further modification in the Graph Class was required ,such that
distributing the Vertices randomly(which represents the nodes in the
Network),Connecting the nodes that are withing range of 1unit through the edges. A part
from the basic representation of the Graph in C++, certain modification was required, i.e.
finding out the
Shortest Path or more Specifically shortest distance between the source and the
destination channel. Therefore, certain algorithms had designed for the project, the flow
chart diagram is included in the Report in the Section 2
Flow Chart “Shortest Path”
Figure 2.1: Flow Chart Shortest Path

Flow Chart “Generating the Network”


Figure 2.2: Flow Chart Generating Network
Figure 2.3: Classes Relationship

1.2. Results

Source Destination Shortest Path Cost


Point#12 Point#7 12->34->7 2.56
Point#20 Point#32 20->11->25->32 3.43
Point#8 Point#35 8->35 0.453
Point#49 Point#38 49->12->38 2.343
Point#92 Point#32 Error(92
Unconnected
Vertx)
1.3. Limitations

This Project has been designed to meet the three requirements


1): Representation of the Wireless Network by using the UDG Graph
2): Finding out the shortest path
3): Performing the traversal via DFS and BFS
Therefore, the scale of the limitation of this Project is within the application range of these
three things.
Apart from the limitation of the application, numbers of the problems occurred during the
implementation of this project, the major problem was of generating the randomly vertices on the
graph ,we encountered the generation of same random numbers every time as program runs, but
after searching through online resources, this problem was solved by author [ CITATION
Shi17 \l 1033 ] .The reference is include in the Section 4.Another major problem arose while
implementing the Shortest path algorithm but by using the STL Stack this issue was resolved by
[ CITATION Gee19 \l 1033 ] the reference is given at the end of the Report.

2. Conclusion
Analyzing the problem in the first sight can be imagined as the toughest task, but
breaking down the problem in to the small pieces and then solving it can make the given
task easy therefore after analyzing ,Designing ,connecting and linking the different parts
of the program, certain new ideas and design “how the different problems can be
represented ,or how it can be solved “.While designing the problem ,as mentioned in the
Section 2 that algorithms are designed for this problem, so the knowledge of how
algorithm can be used to represent the Scenario, how the things will be going on?, what is
required to accomplish the task?... is introduces after implementation. Apart from the
above discussion, many resources helped a lot in this Project. The references are given in
the Section 4.
The Design of the projects revolves upon the four pillars
1): Defining the basic structure of the Nodes
2): Making the Links of these Nodes
3): Presenting all the functionality which is essential in the Graph representation
4): Inserting the edges and vertices to meet up to the requirement of the situation

3. References
(2019, November 23). Retrieved from GeeksforGreek: https://www.geeksforgeeks.org/printing-
paths-dijkstras-shortest-path-algorithm/
Pradhun, S. (2017, March 20). rand() and srand() in C/C++. Retrieved from GeeksforGeeks:
https://www.geeksforgeeks.org/rand-and-srand-in-ccpp/
Unit disk graph. ( 2020, April 1). Retrieved from Wikipedia:
https://en.wikipedia.org/wiki/Unit_disk_graph

You might also like