{"ddc":["040"],"file":[{"success":1,"file_name":"563-978-3-642-45346-5_16.pdf","file_id":"1278","relation":"main_file","content_type":"application/pdf","access_level":"closed","file_size":348191,"creator":"florida","date_created":"2018-03-15T10:25:15Z","date_updated":"2018-03-15T10:25:15Z"}],"page":"217-227","doi":"10.1007/978-3-642-45346-5_16","abstract":[{"lang":"eng","text":"Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc networks. Such backbones receive and transmit messages from/to every node in the network. Existing distributed algorithms only consider undirected graphs, which model symmetric networks with uniform transmission ranges. We are particularly interested in the well-established disk graphs, which model asymmetric networks with non-uniform transmission ranges. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. We introduce the first distributed algorithm for this problem in disk graphs. The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of O(Diam) where Diam is the diameter of the graph and k denotes the transmission ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission range, respectively. Moreover, we apply our algorithm on the subgraph of disk graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k) -approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k , is an optimal approximation for the problem, following Lenzen and Wattenhofer’s Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk graphs."}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"has_accepted_license":"1","date_created":"2017-10-17T12:42:42Z","file_date_updated":"2018-03-15T10:25:15Z","publication":"Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)","type":"conference","date_updated":"2022-01-06T07:02:13Z","series_title":"LNCS","author":[{"full_name":"Markarian, Christine","last_name":"Markarian","id":"37612","first_name":"Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Michael","last_name":"Schubert","full_name":"Schubert, Michael"}],"year":"2013","status":"public","citation":{"short":"C. Markarian, F. Meyer auf der Heide, M. Schubert, in: Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227.","chicago":"Markarian, Christine, Friedhelm Meyer auf der Heide, and Michael Schubert. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” In <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>, 217–27. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">https://doi.org/10.1007/978-3-642-45346-5_16</a>.","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_Schubert_2013, series={LNCS}, title={A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">10.1007/978-3-642-45346-5_16</a>}, booktitle={Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2013}, pages={217–227}, collection={LNCS} }","apa":"Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2013). A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks. In <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i> (pp. 217–227). <a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">https://doi.org/10.1007/978-3-642-45346-5_16</a>","mla":"Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>, 2013, pp. 217–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">10.1007/978-3-642-45346-5_16</a>.","ama":"Markarian C, Meyer auf der Heide F, Schubert M. A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks. In: <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>. LNCS. ; 2013:217-227. doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">10.1007/978-3-642-45346-5_16</a>","ieee":"C. Markarian, F. Meyer auf der Heide, and M. Schubert, “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks,” in <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>, 2013, pp. 217–227."},"user_id":"477","department":[{"_id":"63"}],"title":"A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks","_id":"563"}