| 1. Intro, |
| 2. Graphs, |
|
| 3. Computational Model |
(Hw1: Cpt 3. Ex 5) |
| 4. SpanningTree Algorithms |
|
| 5. Minimum Spanning Tree Algorithms Dist MST, Galager, Spira |
| |
| 6. Time |
| 7. Mutex |
(Hw2: Implement Asynchronous BFS with IPC module ) |
| 8. Dominating Sets |
|
| 9. MIS |
(Hw3: Coloring Based MIS ) |
| 10. NS-3 |
| Erdem Aybek
|
Semi-Asynchronous and Distributed Weighted ConnectedDominating Set Algorithms for Wireless Sensor Networks
|
|
Erdi Kaya-
Mustafa Tosun
|
Efficient Distributed Low-Cost Backbone Formation
for Wireless Networks
|
|
Türkü Kaya-
Kübra Atasever
|
An Energy-Efficient Distributed Cut
Vertex Detection Algorithm for
Wireless Sensor Networks, Orhan Dagdeviren, Vahid Khalilpour Akram
|
|
Lahcen Elfatimi-
Aziz Göktepe
|
Patterns from nature: Distributed greedy colouring with simple
messages and minimal graph knowledge,Lei Xu Peter Jeavons
|
|
Harisu-
Hüseyin Elfatimi
|
Distributed Mutual Exclusion Algorithms
for Intersection Traffic Control, Weigang Wu, Member, Jiebin Zhang, Aoxue Luo, and Jiannong Cao
|
| Leyla Kapi
|
Fast Deterministic Distributed Maximal
Independent Set Computation on
Growth-Bounded Graphs, Fabian Kuhn, Thomas Moscibroda, Tim Nieberg2, and Roger Wattenhofer
|