ANALYSIS OF THREE LOCALIZED ALGORITHMS FOR CONSTRUCTING DOMINATING SETS IN NETWORKS
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
Kent State University / OhioLINK
2015
|
| Subjects: | |
| Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=kent1428075889 |
| id |
ndltd-OhioLink-oai-etd.ohiolink.edu-kent1428075889 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-OhioLink-oai-etd.ohiolink.edu-kent14280758892021-08-03T06:29:47Z ANALYSIS OF THREE LOCALIZED ALGORITHMS FOR CONSTRUCTING DOMINATING SETS IN NETWORKS Mohammed Ali, Kovan A. Computer Science Dominating Set Localized Algorithms A dominating set is a set where every vertex is in the set or adjacent to at least one vertex in the set. Dominating sets have enormous number of applications. A connected dominating set that is widely used in wireless ad-hoc networks is one of many applications of dominating set. Due to the significant usage of this field many kinds of algorithms have been proposed to compute a dominating set. These algorithms are divided into two types: centralized and decentralized algorithms. The decentralized algorithms are also divided into two types: distributed and localized. Modern day graphs are large in size, which causes centralized algorithms to become an undesirable choice. Also, all the non-localized distributed algorithms are slow to compute a dominating set in these big graphs. Therefore, all the attention has shifted toward localized algorithms were vertices can communicate with a constant rounds of neighbors.In this thesis, we compare three localized algorithms, namely, Maximal Independent Set (MIS, for short) algorithm, One-hop greedy algorithm, and Two-hop greedy algorithm. We use five different artificial graph models and four real world graphs. For each graph, we compared three different metrics, which are dominating set size, number of iterations, and number of dominators for each dominatee. As we expected, the Two-hop greedy algorithm has a better dominating set size and more iterations than the other two algorithms. In some cases, the MIS algorithm would take more iterations than the One-hop algorithm such as in Power Law, Small World, PPI, and DutchElite graphs. The MIS algorithm, applied to unit disk graphs, does not produce any dominatee that has more than five dominators, which is a well-known fact. 2015-04-06 English text Kent State University / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=kent1428075889 http://rave.ohiolink.edu/etdc/view?acc_num=kent1428075889 unrestricted This thesis or dissertation is protected by copyright: some rights reserved. It is licensed for use under a Creative Commons license. Specific terms and permissions are available from this document's record in the OhioLINK ETD Center. |
| collection |
NDLTD |
| language |
English |
| sources |
NDLTD |
| topic |
Computer Science Dominating Set Localized Algorithms |
| spellingShingle |
Computer Science Dominating Set Localized Algorithms Mohammed Ali, Kovan A. ANALYSIS OF THREE LOCALIZED ALGORITHMS FOR CONSTRUCTING DOMINATING SETS IN NETWORKS |
| author |
Mohammed Ali, Kovan A. |
| author_facet |
Mohammed Ali, Kovan A. |
| author_sort |
Mohammed Ali, Kovan A. |
| title |
ANALYSIS OF THREE LOCALIZED ALGORITHMS FOR CONSTRUCTING DOMINATING SETS IN NETWORKS |
| title_short |
ANALYSIS OF THREE LOCALIZED ALGORITHMS FOR CONSTRUCTING DOMINATING SETS IN NETWORKS |
| title_full |
ANALYSIS OF THREE LOCALIZED ALGORITHMS FOR CONSTRUCTING DOMINATING SETS IN NETWORKS |
| title_fullStr |
ANALYSIS OF THREE LOCALIZED ALGORITHMS FOR CONSTRUCTING DOMINATING SETS IN NETWORKS |
| title_full_unstemmed |
ANALYSIS OF THREE LOCALIZED ALGORITHMS FOR CONSTRUCTING DOMINATING SETS IN NETWORKS |
| title_sort |
analysis of three localized algorithms for constructing dominating sets in networks |
| publisher |
Kent State University / OhioLINK |
| publishDate |
2015 |
| url |
http://rave.ohiolink.edu/etdc/view?acc_num=kent1428075889 |
| work_keys_str_mv |
AT mohammedalikovana analysisofthreelocalizedalgorithmsforconstructingdominatingsetsinnetworks |
| _version_ |
1719437854810046464 |