Mobile node Communication link Figure 1: Wireless Network Network Deployment:

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Follow this and make a python code? You need to simulate a network just like real-time network (Figure 1), where each node (device) is connected to its neighbors based on its transmission range.
Mobile node
Communication link
Figure 1: Wireless Network
Network Deployment:
1. Create 50 nodes randomly in a square region of
100x100 m? deployment region.
Hint: (You can create two arrays of dimensions 1x50
representing xcoordinates and ycoordinates of the
nodes with values less than 100.)
2. Calculate the distance matrix, containing distance
among the nodes.
3. For each node, create a neighbor list containing the
identity of neighbors that lies within the transmission
range (TR) of that node.
4. Create connection matrix, saving the information
about the connections within the network.
Route Establishment (Figure 2):
1. Establish the shortest distance route from source (S)
to destination (D).
2. The identity of source and destination will be provided
by the user.
Quality of the route:
1. Find the quality of the route based on the following
formula.
Quality = 1/number of hops
2. Plot the quality results for variable number of nodes.
i.e., 50, 60, 70.
Transcribed Image Text:Mobile node Communication link Figure 1: Wireless Network Network Deployment: 1. Create 50 nodes randomly in a square region of 100x100 m? deployment region. Hint: (You can create two arrays of dimensions 1x50 representing xcoordinates and ycoordinates of the nodes with values less than 100.) 2. Calculate the distance matrix, containing distance among the nodes. 3. For each node, create a neighbor list containing the identity of neighbors that lies within the transmission range (TR) of that node. 4. Create connection matrix, saving the information about the connections within the network. Route Establishment (Figure 2): 1. Establish the shortest distance route from source (S) to destination (D). 2. The identity of source and destination will be provided by the user. Quality of the route: 1. Find the quality of the route based on the following formula. Quality = 1/number of hops 2. Plot the quality results for variable number of nodes. i.e., 50, 60, 70.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY