{"year":"2015","status":"public","author":[{"full_name":"Abu-Khzam, Faisal N. ","last_name":"Abu-Khzam","first_name":"Faisal N. "},{"first_name":"Christine","last_name":"Markarian","id":"37612","full_name":"Markarian, Christine"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Michael","last_name":"Schubert","full_name":"Schubert, Michael"}],"abstract":[{"lang":"eng","text":"We consider the problem of dominating set-based virtual backbone used for\r\nrouting in asymmetric wireless ad-hoc networks. These networks have non-uniform\r\ntransmission ranges and are modeled using the well-established disk graphs. The\r\ncorresponding graph theoretic problem seeks a strongly connected\r\ndominating-absorbent set of minimum cardinality in a digraph. A subset of nodes\r\nin a digraph is a strongly connected dominating-absorbent set if the subgraph\r\ninduced by these nodes is strongly connected and each node in the graph is\r\neither in the set or has both an in-neighbor and an out-neighbor in it.\r\nDistributed algorithms for this problem are of practical significance due to\r\nthe dynamic nature of ad-hoc networks. We present a first distributed\r\napproximation algorithm, with a constant approximation factor and O(Diam)\r\nrunning time, where Diam is the diameter of the graph. Moreover we present a\r\nsimple heuristic algorithm and conduct an extensive simulation study showing\r\nthat our heuristic outperforms previously known approaches for the problem."}],"_id":"16452","title":"Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks","department":[{"_id":"63"}],"date_created":"2020-04-07T12:22:48Z","user_id":"15415","external_id":{"arxiv":["1510.01866"]},"citation":{"bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2015, title={Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks}, journal={arXiv:1510.01866}, author={Abu-Khzam, Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2015} }","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, ArXiv:1510.01866 (2015).","chicago":"Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks.” <i>ArXiv:1510.01866</i>, 2015.","ama":"Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks. <i>arXiv:151001866</i>. 2015.","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks.” <i>ArXiv:1510.01866</i>, 2015.","ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks,” <i>arXiv:1510.01866</i>. 2015.","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2015). Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks. <i>ArXiv:1510.01866</i>."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","type":"preprint","publication":"arXiv:1510.01866"}