Algorithms in Ad-hoc Networks (2V+1U, 4.0 LP)
|SWS||Type||Course Form||CP (Effort)||Presence-Time / Self-Study|
|-||K||Lecture with exercise classes (V/U)||4.0 CP||78 h|
|1||U||Exercise class (in small groups)||14 h|
|(2V+1U)||4.0 CP||42 h||78 h|
|CP, Effort||4.0 CP = 120 h|
|Position of the semester||1 Sem. irreg.|
|Level|| Master (General)|
|Language||[DE/EN] German or English as required|
|Area of study||[INF-VVS] Distributed and Networked Systems|
Possible Study achievement
- Verification of study performance: proof of successful participation in the exercise classes (ungraded)
- Details of the examination (type, duration, criteria) will be announced at the beginning of the course.
Survey of relevant classes of algorithms in ad-hoc networks. For each class, selected algorithms are presented in detail and assessed.
- time synchronization
- collision protected arbitration
- duty cycling
- quality-of-service routing
- I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci: Wireless Sensor Networks: a Survey , Computer Networks 38 (4), 2002
- R. Gotzhein, T. Kuhn: Black Burst Synchronization (BBS) – A Protocol for Deterministic Tick and Time Synchronization in Wireless Networks, Computer Networks 55 (2011), pp. 3015-3031
- W. Ye, J. Heidemann, D. Estrin: An Energy-Efficient MAC Protocol for Wireless Sensor Networks , Proceedings INFOCOM 2002, 2002, pp. 1567-1576
- A. D. Amis, R. Prakash, T. H. P. Vuong, D. T. Huynh: Max-Min D-Cluster Formation in Wireless Ad Hoc Networks, Proc. of INFOCOM 2000 (Vol. 1), Tel Aviv, Israel, pp. 32-41, 2000
More literature Will be announced in the lecture.