|
Makerere University Research Repository >
Faculty of Computing and Information Technology >
Theses & Dissertations (CIT) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/562
|
| Title: | Distributed topology control for mobile Ad Hoc networks: exploring the P/NP boundary |
| Authors: | Opiyo, Nockline |
| Keywords: | Network topology
Mobile Ad Hoc Networks |
| Issue Date: | Oct-2005 |
| Abstract: | The design goal of topology control in mobile ad hoc networks (MANET) discussed
in this work is to construct a topology that guarantees network connectivity and
maintain network performance. This work proposes, decentralized distributed Minimum
Spanning Tree algorithm, a modification of Prim’s MST algorithm which is effective for topology control in MANET. The algorithm self-organizes the network topology. The process begins by each node constructing its own Minimum Spanning Tree (MST) topology, keeping on its tree only nodes that are one-hop away within its visible neighborhood. Followed by an optimization phase to ensure that the network has bi-directional links in order to maintain a strong network connectivity. The work also explored the Traveling Salesman Problem (TSP) boundary and proposed an approximation
algorithm which is a modification of Christofides heuristics. Then lastly we discuss the merits and the demerits of the proposed topology control scheme and outline some relevant issues for future research. |
| Description: | A Dissertation submitted to the School of Graduate Studies in partial fulfillment of the requirements for the award of the Degree of Master of Science in Computer Science of Makerere University. |
| URI: | http://hdl.handle.net/123456789/562 |
| Appears in Collections: | Theses & Dissertations (CIT)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| opiyo-nockline-cit-masters-report.pdf | Thesis report | 528Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
