hidden - assigned and confirmed by the Study Dept.
Date of registration:
28.08.2018
Date of assignment:
30.08.2018
Confirmed by Study dept. on:
03.12.2018
Date and time of defence:
07.07.2020 09:00
Date of electronic submission:
04.06.2020
Date of submission of printed version:
04.06.2020
Date of proceeded defence:
07.07.2020
Opponents:
Mgr. Filip Kliber
Guidelines
The aim of the thesis is to design a highly scalable decentralized network addressing and routing protocol for ad-hoc networks. The network addresses will be assigned and dynamically reassigned so that the nodes are kept in a loose tree-like hierarchy of addressable groups. The design will differ from other such protocols by being completely stateless (to aid reliability) and able to organize the network in a way that minimizes the sizes of the routing tables on all nodes (to improve efficiency). The resulting protocol will be implemented in a matching network simulator for being tested, benchmarked, and possibly compared with other protocols.
References
Caleffi, M., Ferraiuolo, G., & Paura, L. (2007, October). Augmented tree-based routing protocol for scalable ad hoc networks. In Mobile Adhoc and Sensor Systems, 2007. MASS 2007. IEEE International Conference on (pp. 1-6). IEEE.
Sun, Y., & Belding‐Royer, E. M. (2004). A study of dynamic addressing techniques in mobile ad hoc networks. Wireless Communications and Mobile Computing, 4(3), 315-329.
- assigned and confirmed by the Study Dept.