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...

Full description

Saved in:
Bibliographic Details
Published in2012 International Conference on Innovations in Information Technology pp. 200 - 204
Main Authors Markarian, C., Abu-Khzam, F. N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2012
Subjects
Ad hoc networks
Approximation algorithms
Approximation methods
Heuristic algorithms
Routing
Wireless communication
Wireless sensor networks
Online AccessGet full text
ISBN9781467311007
1467311006
DOI10.1109/INNOVATIONS.2012.6207732

Cover

More Information
Summary: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.
ISBN:9781467311007
1467311006
DOI:10.1109/INNOVATIONS.2012.6207732