Proseminar Algorithmen für Rechnernetze (Winter 2022/2023)

News

• 1. Treffen, 19.10.2022, 12 Uhr, SR 00-014, Geb. 078 
• 19.10.2022 ILIAS eingerichtet

Termine

• 19.10.2022 SR 00-014, Geb. 078: 12 Uhr Vorstellung der Themen, Themenvergabe per ILIAS
• KW 43: Wie funktioniert Wissenschaft
• KW 44: Plagiate, wissenschaftliches Fehlverhalten
• KW 45:  Literaturarbeit,  Wissenschaftliches Präsentieren
• KW 46-51, 2023, KW 2-KW 6:  Vorträge der Teilnehmer

Inhalte

Die Teilnehmer arbeiten in Zweiergruppen und stellen Forschung und Technologien im Bereich Rechnernetze aufgrund eigener Recherche oder vorgegebener Arbeiten vor.

Prüfungsleistungen/Studienleistung

1. Zusammenfassung von maximal 3 Seiten in LaTeX (1/4)
2. 30-minütige Präsentation mit Foliensatz (Deadline für Folien: Mittwoch vor dem Vortragstermin) (1/2)
3. 15-minütige erfolgreiche Fragerunde  (1/4)

Alle Präsentationen werden aufgezeichnet.

Themen

1. Callegari, C., Giordano, S., Pagano, M. and Pepe, T., 2013, October. A survey of congestion control mechanisms in Linux TCP. In International Conference on Distributed Computer and Communication Networks (pp. 28-42). Springer, Cham.
2. Adelantado, F., Vilajosana, X., Tuset-Peiro, P., Martinez, B., Melia-Segui, J. and Watteyne, T., 2017. Understanding the limits of LoRaWAN. IEEE Communications magazine, 55(9), pp.34-40.
3. Jain, S., Fall, K. and Patra, R., 2004, August. Routing in a delay tolerant network. In Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications (pp. 145-158).
4. Maihofer, C., 2004. A survey of geocast routing protocols. IEEE Communications Surveys & Tutorials pp.32-42.
5. Bar-Yehuda, R., Goldreich, O. and Itai, A., 1987, December. On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization. In Proceedings of the sixth annual ACM Symposium on Principles of distributed computing (pp. 98-108). Hinweis: Diese Arbeit beachten:  "Kowalski, D.R. and Pelc, A., 2004. Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing, 33(4), pp.870-891."
6. Clark, B.N., Colbourn, C.J. and Johnson, D.S., 1990. Unit disk graphs. Discrete mathematics, 86(1-3), pp.165-177.
7. Merkle, R.C., 1980, April. Protocols for Public Key Cryptosystems. In 1980 IEEE Symposium on Security and Privacy (pp. 122-122). IEEE Computer Society.
8. Chaum, D., 1983. Blind signatures for untraceable payments. In Advances in cryptology (pp. 199-203). Springer, Boston, MA.
9. Nakamoto, S., 2008. Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review, p.21260.
10. Urquhart, A., 2016. The inefficiency of Bitcoin. Economics Letters, 148, pp.80-82.
11. Vranken, H., 2017. Sustainability of bitcoin and blockchains. Current opinion in environmental sustainability, 28, pp.1-9.
12. Liszka, K.J. and Batcher, K.E., 1993, August. A generalized bitonic sorting network. In 1993 International Conference on Parallel Processing-ICPP'93 (Vol. 1, pp. 105-108). IEEE.
13. Jena, D. and Jena, S.K., 2009, January. A novel visual cryptography scheme. In 2009 International Conference on Advanced Computer Control (pp. 207-211). IEEE.
14. Yan, X., Wang, S. and Niu, X., 2014. Threshold construction from specific cases in visual cryptography without the pixel expansion. Signal Processing, 105, pp.389-398.
15. Haxhibeqiri, J., De Poorter, E., Moerman, I. and Hoebeke, J., 2018. A survey of LoRaWAN for IoT: From technology to application. Sensors, 18(11), p.3995.
16. Maymounkov, P. and Mazieres, D., 2002, March. Kademlia: A peer-to-peer information system based on the xor metric. In International Workshop on Peer-to-Peer Systems (pp. 53-65). Springer, Berlin, Heidelberg.
17. Schröder, S., Huber, M., Wind, D. and Rottermanner, C., 2016, July. When SIGNAL hits the fan: On the usability and security of state-of-the-art secure mobile messaging. In European Workshop on Usable Security. IEEE (pp. 1-7).

Themen

Registrieren Sie sich zur Veranstaltung online und ebenfalls im ILIAS-System (demnächst verfügbar).