Module Handbook

  • Dynamischer Default-Fachbereich geändert auf INF

Module INF-41-53-M-6

Algorithms in Ad-hoc Networks (M, 4.0 LP)

Module Identification

Module Number Module Name CP (Effort)
INF-41-53-M-6 Algorithms in Ad-hoc Networks 4.0 CP (120 h)

Basedata

CP, Effort 4.0 CP = 120 h
Position of the semester 1 Sem. irreg.
Level [6] Master (General)
Language [DE/EN] German or English as required
Module Manager
Lecturers
Area of study [INF-VVS] Distributed and Networked Systems
Reference course of study [INF-88.79-SG] M.Sc. Computer Science
Livecycle-State [NORM] Active

Courses

Type/SWS Course Number Title Choice in
Module-Part
Presence-Time /
Self-Study
SL SL is
required for exa.
PL CP Sem.
2V+1U INF-41-53-K-6
Algorithms in Ad-hoc Networks
P 42 h 78 h
U-Schein
ja PL1 4.0 irreg.
  • About [INF-41-53-K-6]: Title: "Algorithms in Ad-hoc Networks"; Presence-Time: 42 h; Self-Study: 78 h
  • About [INF-41-53-K-6]: The study achievement "[U-Schein] proof of successful participation in the exercise classes (ungraded)" must be obtained.
    • It is a prerequisite for the examination for PL1.

Examination achievement PL1

  • Form of examination: oral examination (20-60 Min.)
  • Examination Frequency: Examination only within the course
  • Examination number: 64153 ("Algorithms in Ad-hoc Networks")

Evaluation of grades

The grade of the module examination is also the module grade.


Contents

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
  • clustering
  • duty cycling
  • quality-of-service routing
  • reservation

Competencies / intended learning achievements

Upon successful completion of the module, students will be able to
  • explain the tasks and algorithms in ad hoc networks on concrete problems
  • explain technical aspects of network-wide time synchronization
  • explain network clustering procedures,
  • derive solutions for improving energy efficiency,
  • explain routing procedures,
  • justify essential goals and challenges of resource management,

Literature

  • 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.

Requirements for attendance of the module (informal)

Modules:

Requirements for attendance of the module (formal)

None

References to Module / Module Number [INF-41-53-M-6]

Course of Study Section Choice/Obligation
[EIT-88.A20-SG#2021] M.Sc. European Master in Embedded Computing Systems (EMECS) [2021] [Free Elective Area] Elective Subjects [W] Elective Module
[EIT-88.?-SG#2021] M.Sc. Embedded Computing Systems (ESY) [2021] [Free Elective Area] Elective Subjects [W] Elective Module
[INF-88.79-SG] M.Sc. Computer Science [Specialisation] Specialization 1 [WP] Compulsory Elective
[INF-88.79-SG] M.Sc. Computer Science [Specialisation] Specialization 1 [WP] Compulsory Elective