King Fahd University of Petroleum and Minerals

College of Computer Sciences and Engineering

Computer Engineering Department

Syllabus of Mobile Ad hoc Networks (COE 549)

 

Instructor: Dr. Tarek Sheltami

Office: 22-327

Email: tarek@kfupm.edu.sa

Office hours: Check my weekly schedule or by appointment

Tel: 4678

Text Book: No text book for this class yet. Course notes are published research papers.

Catalog Description

Introduction to the most recent advanced Mobile Ad hoc Networks (MANETs) routing protocols. The course will cover all the issues that are related to design protocols such as scheduling, capacity, medium access, QoS, topology control, and mobility tracking. In addition, modeling techniques as well as delay models will be covered using Linear Programming.

Computer Usage

Project work will require computer usage. Students might use special packages that are available in the department to carry out their project simulations or to process their experimental data. The course will require using NS-2 to do the course project.

Evaluation Methods

1.      Attendance and participation in class discussions.

2.      Assignments

3.      Quizzes

4.      Midterm exam.

5.      Final exam.

6.      Project and Oral presentation.

 

Grading Policy:

%

Attendance and participation in class

5%

More than 5 absences = DN

Mid-terms

15%

TBA

Assignments

10%

4 Programming Assignments

Quizzes

10%

6 quizzes

Project

30%

5%Pres+25%Re+QoW

Final Exam

30%

Scheduled by registrar

 

 

Tentative Course Schedule

Week

Topic

1

   Introduction to Wireless Ad hoc Networks

2

   Network Deployment

       Structured versus randomized deployment

       Network topology

       Connectivity in geometric random graphs

       Connectivity using power control

3

   Introduction to NS-2

   Introduction to AI

4

   Localization Protocols

       Localization approaches

       Coarse-grained node localization using minimal information

       Fine-grained node localization using detailed information

       Network-wide localization

       Theoretical analysis of localization techniques

5

   Time synchronization Protocols

       Traditional approaches

       Coarse grained clock synchronization

       Fine-grained clock synchronization

6

   Medium-access and sleep scheduling

       Traditional MAC protocols

       Energy efficiency in MAC protocols

       Asynchronous sleep techniques

       Sleep-scheduled techniques

       Contention-free protocols

7

   Other Medium-access control protocols

   Omni Antennas Vs Directional Antennas

8

   Capacity of Networks with Mobile Nodes

       Convex Hull

       Basic rate matrix

       Successive Interference Cancellation

       Multi-user in Mobile Network

9

   Mobility Models

   Mid-term Exam

10

   Topology Control

       Static Networks

       Dynamic Networks

       Coverage metrics

11

   Power Control

       Basic power control mechanisms

       Power control with dual channel

       Power control with busy tone channel

       Distributed Algorithms

       Adaptive power control

       Estimating the minimum power for transmission

       Co-operative routing vs direct transmission

12

   Transmission Scheduling

       Administrated scheduling in Tandem and General Networks

       Distributed scheduling in Tandem and General Networks

       Five Phase Scheduling Reservation Protocol

       Coloring scheme

13

   Energy-efficient and robust routing

       Metric-based approaches

       Routing with diversity

       Multi-path routing

14

   Energy-efficient and robust routing

       Lifetime-maximizing energy-aware routing techniques

       Geographic routing

15

   Oral Presentation

 

Course Learning Outcomes Table

Course Learning

Outcomes

 

Assessment

Methods and

Metrics

 

ABET 2000

Criteria

1. Ability to apply knowledge of mathematics, probability, and statistics to model and analyze ad hoc networking protocols.

      Project

      Exams

A(H)

2. Ability to identify, formulate, and solve network engineering problems.

      Exams

      Project

I(H)

3. Knowledge of contemporary issues in computer networks..

      Project

J(L)