Scribd
Upload
6 views

EE580 LabAssignment1 2023

Uploaded by

Kêšhãv Šîñgh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

EE580 LabAssignment1 2023

Uploaded by

Kêšhãv Šîñgh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

EE 580 Network Systems: Modelling & Analysis

Lab Assignment 1

Assigned: September 1, 2023 Due: September 7, 2023

Use C, Python, MATLAB any other language of your choice to perform the fol-
lowing computations/simulations. The plots must be legible with appropriately chosen
axes labels, ticks and legends. Typeset your answers, plots and explaination in a
LibreOffice or LATEX document, save as .pdf. Upload the pdf document and your
code in Moodle.

1. Simulate the linear averaging algorithm

x+
i := average(xi , {xj , for all neighbor nodesj}). (1)

Imagine a network with 5 nodes, set the initial state as (1, −1, 1, −1, 1). For
each of the graphs showb below, answer the following questions:

• Which value do the nodes converge to?


• Is it equal to the average of the initial values?

Answer the above questions using the analytical results established in class,
and then verify the same through computations. Comment on the relationship
between the connectivity of the network and the number of iterations required
to reach consensus?

2. Imagine that the xi in the above network is the position of the node. In which
case, acheiving consensus would mean that all the nodes move towards a com-
mon position. Each node can communicate with nodes within a particular
distance r from itself, i.e. neighbors of node i denoted as Ni can be expressed
as

Ni = {xj : kxi − xj k <= r, ∀j 6= i and r > 0}.

In every iteration, each node updates its position using equation (1).
Simulate the movement of 5 nodes that are uniformly distributed in a 1 unit
x 1 unit square in R2 adhereing to the conditions described above. Choose an
appropriate value for r. Plot the position of each node (within the square) in

1
every iteration. You may choose the most significant of these plots to put in
your report. Repeat this simulation to compare the time taken for the nodes to
converge to the common point for different values of r. Choose atleast 5 values
for r, and represent the comparison of convergence time graphically. Comment
on the comparison and make inferences.

You might also like