Lesson 1:Mobile Ad Hoc Networks
6:44 mins
Lesson 2:Graph Theory Basics
8:15 mins
Lesson 3:Breadth First Search
7:20 mins
Lesson 4:Manet Route Discovery
7:22 mins
Section 2:Unicast Minimum Weight Single Path Routing
Lesson 5:Minimum Hop Routing Protocols
9:24 mins
Lesson 6:Dijkstra Algorithm for Minimum Weight Path Routing
15:38 mins
Lesson 7:Bellman-Ford Algorithm for Minimum Weight Path Routing
18:07 mins
Lesson 8:Floyd's All Pairs Minimum Weight Paths Algorithm
13:26 mins
Section 3:Unicast Multi-Path Routing
Lesson 9:Multi-Path Routing Protocols
6:35 mins
Lesson 10:Graph Theoretic Algorithms for Multi-Path Routing
8:01 mins
Section 4:Unicast Stable Path Routing
Lesson 11:Max-Min Bottleneck Path Protocol and Algorithm
15:07 mins
Lesson 12:Min-Max Bottleneck Path Protocal and Algorithm
12:17 mins
Lesson 13:All Pairs Max-Min and Min-Max Bottleneck Path Algorithms
9:44 mins
Section 5:Multicast Routing
Lesson 14:Shortest Path Tree and Steiner Tree
10:37 mins
Lesson 15:Heuristic to Approximate a Minimum Edge Steiner Tree
7:40 mins
Section 6:Broadcast Communication
Lesson 16:Heuristic For Degree-Based Minimum Connected Dominating Sets
9:01 mins
Lesson 17:Heuristic For Node Weight-Based Minimum Connected Dominating Sets
7:05 mins
Lesson 18:Heuristic For Link Weight-Based Minimum Connected Dominating Sets
14:32 mins