A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks
Virtual backbones of asymmetric wireless networks are special sub-nets through which routing can be performed. Such backbone must be as small as possible, and must be able to receive and transmit messages from/to each and every node in the network. The corresponding graph theoretic problem takes a d...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | conferenceObject |
| منشور في: |
2017
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/5383 http://dx.doi.org/10.1109/INNOVATIONS.2012.6207732 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/6207732/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513465865994240 |
|---|---|
| author | Abu-Khzam, Faisal N. |
| author2 | Markarian, Christine |
| author2_role | author |
| author_facet | Abu-Khzam, Faisal N. Markarian, Christine |
| author_role | author |
| dc.creator.none.fl_str_mv | Abu-Khzam, Faisal N. Markarian, Christine |
| dc.date.none.fl_str_mv | 2017-03-17T14:19:09Z 2017-03-17T14:19:09Z 2017-03-17 |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10725/5383 http://dx.doi.org/10.1109/INNOVATIONS.2012.6207732 Markarian, C., & Abu-Khzam, F. N. (2012, March). A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks. In Innovations in Information Technology (IIT), 2012 International Conference on (pp. 200-204). IEEE. http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/6207732/ |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | IEEE |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.title.none.fl_str_mv | A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks |
| dc.type.none.fl_str_mv | Conference Paper / Proceeding info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/conferenceObject |
| description | Virtual backbones of asymmetric wireless networks are special sub-nets through which routing can be performed. Such backbone must be as small as possible, and must be able to receive and transmit messages from/to each and every node in the network. The corresponding graph theoretic problem takes a directed graph as input and seeks a strongly connected dominating-absorbent set of smallest possible cardinality. We introduce a hybrid heuristic for this problem, in which we combine low-degree vertex elimination and high-degree vertex selection. This simple and efficient method yields very promising experimental results, outperforming known heuristic algorithms. |
| eu_rights_str_mv | openAccess |
| format | conferenceObject |
| id | LAURepo_b4cb78240f55506e367ed39ef28b2dbe |
| identifier_str_mv | Markarian, C., & Abu-Khzam, F. N. (2012, March). A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks. In Innovations in Information Technology (IIT), 2012 International Conference on (pp. 200-204). IEEE. |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/5383 |
| publishDate | 2017 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networksAbu-Khzam, Faisal N.Markarian, ChristineVirtual backbones of asymmetric wireless networks are special sub-nets through which routing can be performed. Such backbone must be as small as possible, and must be able to receive and transmit messages from/to each and every node in the network. The corresponding graph theoretic problem takes a directed graph as input and seeks a strongly connected dominating-absorbent set of smallest possible cardinality. We introduce a hybrid heuristic for this problem, in which we combine low-degree vertex elimination and high-degree vertex selection. This simple and efficient method yields very promising experimental results, outperforming known heuristic algorithms.N/AIEEE2017-03-17T14:19:09Z2017-03-17T14:19:09Z2017-03-17Conference Paper / Proceedinginfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjecthttp://hdl.handle.net/10725/5383http://dx.doi.org/10.1109/INNOVATIONS.2012.6207732Markarian, C., & Abu-Khzam, F. N. (2012, March). A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks. In Innovations in Information Technology (IIT), 2012 International Conference on (pp. 200-204). IEEE.http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.phphttp://ieeexplore.ieee.org/abstract/document/6207732/eninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/53832021-03-19T10:03:19Z |
| spellingShingle | A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks Abu-Khzam, Faisal N. |
| status_str | publishedVersion |
| title | A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks |
| title_full | A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks |
| title_fullStr | A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks |
| title_full_unstemmed | A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks |
| title_short | A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks |
| title_sort | A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks |
| url | http://hdl.handle.net/10725/5383 http://dx.doi.org/10.1109/INNOVATIONS.2012.6207732 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/6207732/ |