In this work we implemented two protocols that are optimal with respect to the metrics that they optimize: one protocol minimizes the number of hops to reach the destination while the other one maximizes the transmission rate. Then, we compared them through end-to-end delay. Then in the second part we implemented two algorithms to maximize the number of covered users. One solves an optimization problem while the other one computes the density map using convolution.
Routing protocols in dynamic networks
Perini, Mattia
2020/2021
Abstract
In this work we implemented two protocols that are optimal with respect to the metrics that they optimize: one protocol minimizes the number of hops to reach the destination while the other one maximizes the transmission rate. Then, we compared them through end-to-end delay. Then in the second part we implemented two algorithms to maximize the number of covered users. One solves an optimization problem while the other one computes the density map using convolution.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Mattia_Perini.pdf
Open Access dal 21/12/2022
Dimensione
2.48 MB
Formato
Adobe PDF
|
2.48 MB | Adobe PDF | Visualizza/Apri |
The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/20.500.12608/28828