{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:15Z","timestamp":1759638855691,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,1,5]]},"DOI":"10.1145\/3427796.3427806","type":"proceedings-article","created":{"date-parts":[[2020,12,25]],"date-time":"2020-12-25T22:25:45Z","timestamp":1608935145000},"page":"96-105","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model"],"prefix":"10.1145","author":[{"given":"Ashwin","family":"Ganesan","sequence":"first","affiliation":[{"name":"International School of Engineering (INSOFE), IN"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.830909"},{"volume-title":"Data Networks (2ed.)","author":"Bertsekas Dimitri","key":"e_1_3_2_1_2_1","unstructured":"Dimitri Bertsekas and Robert Gallager . 1992. Data Networks (2ed.) . Prentice-Hall, Inc. , Upper Saddle River, NJ, USA. Dimitri Bertsekas and Robert Gallager. 1992. Data Networks (2ed.). Prentice-Hall, Inc., Upper Saddle River, NJ, USA."},{"volume-title":"Modern Graph Theory","author":"Bollob\u00e1s B\u00e9la","key":"e_1_3_2_1_3_1","unstructured":"B\u00e9la Bollob\u00e1s . 1998. Modern Graph Theory . Springer-Verlag , New York . https:\/\/doi.org\/10.1007\/978-1-4612-0619-4 10.1007\/978-1-4612-0619-4 B\u00e9la Bollob\u00e1s. 1998. Modern Graph Theory. Springer-Verlag, New York. https:\/\/doi.org\/10.1007\/978-1-4612-0619-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90275-F"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"#cr-split#-e_1_3_2_1_7_1.1","doi-asserted-by":"crossref","unstructured":"Ashwin Ganesan. 2009. On Some Sufficient Conditions for Distributed Quality-of-Service Support in Wireless Networks. In Proceedings of the First International Conference on Networks & Communications and the Workshop on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(NetCom '09 and GraphHoc '09). IEEE Chennai Tamilnadu India 301-306. https:\/\/doi.org\/10.1109\/NetCoM.2009.17 10.1109\/NetCoM.2009.17","DOI":"10.1109\/NetCoM.2009.17"},{"key":"#cr-split#-e_1_3_2_1_7_1.2","doi-asserted-by":"crossref","unstructured":"Ashwin Ganesan. 2009. On Some Sufficient Conditions for Distributed Quality-of-Service Support in Wireless Networks. In Proceedings of the First International Conference on Networks & Communications and the Workshop on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(NetCom '09 and GraphHoc '09). IEEE Chennai Tamilnadu India 301-306. https:\/\/doi.org\/10.1109\/NetCoM.2009.17","DOI":"10.1109\/NetCoM.2009.17"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2010.02.001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-013-0680-z"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/WiSPNET48689.2020.9198485"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2959797"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"Graph Imperfection","volume":"83","author":"Gerke Stefanie","year":"2001","unstructured":"Stefanie Gerke and Colin McDiarmid . 2001 . Graph Imperfection . Journal of Combinatorial Theory, Series B 83 , 1 (Sept. 2001), 58\u201378. https:\/\/doi.org\/10.1006\/jctb.2001.2042 10.1006\/jctb.2001.2042 Stefanie Gerke and Colin McDiarmid. 2001. Graph Imperfection. Journal of Combinatorial Theory, Series B 83, 1 (Sept. 2001), 58\u201378. https:\/\/doi.org\/10.1006\/jctb.2001.2042","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094691"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"volume-title":"Geometric Algorithms and Combinatorial Optimization (2 ed.)","author":"Gr\u00f6tschel Martin","key":"e_1_3_2_1_16_1","unstructured":"Martin Gr\u00f6tschel , L\u00e1szl\u00f3 Lov\u00e1sz , and Alexander Schrijver . 1993. Geometric Algorithms and Combinatorial Optimization (2 ed.) . Springer-Verlag , Berlin Heidelberg . https:\/\/doi.org\/10.1007\/978-3-642-78240-4 10.1007\/978-3-642-78240-4 Martin Gr\u00f6tschel, L\u00e1szl\u00f3 Lov\u00e1sz, and Alexander Schrijver. 1993. Geometric Algorithms and Combinatorial Optimization (2 ed.). Springer-Verlag, Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-78240-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2006.01.003"},{"key":"e_1_3_2_1_18_1","unstructured":"Jaap Haartsen. 1998. BLUETOOTH\u2014The universal radio interface for ad hoc wireless connectivity. Ericsson Review3(1998) 110\u2013117.  Jaap Haartsen. 1998. BLUETOOTH\u2014The universal radio interface for ad hoc wireless connectivity. Ericsson Review3(1998) 110\u2013117."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the Conference on Information Sciences and Systems","author":"Hajek Bruce","year":"1984","unstructured":"Bruce Hajek . 1984 . Link schedules, flows, and the multichromatic index of graphs . In Proceedings of the Conference on Information Sciences and Systems . Princeton, NJ, USA, 498\u2013502. Bruce Hajek. 1984. Link schedules, flows, and the multichromatic index of graphs. In Proceedings of the Conference on Information Sciences and Systems. Princeton, NJ, USA, 498\u2013502."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.21215"},{"key":"e_1_3_2_1_21_1","volume-title":"Halld\u00f3rsson and Tigran Tonoyan","author":"M.","year":"2018","unstructured":"Magn\u00fas\u00a0 M. Halld\u00f3rsson and Tigran Tonoyan . 2018 . Effective Wireless Scheduling via Hypergraph Sketches . arXiv:1806.10964 [cs] (June 2018). http:\/\/arxiv.org\/abs\/1806.10964 arXiv: 1806.10964. Magn\u00fas\u00a0M. Halld\u00f3rsson and Tigran Tonoyan. 2018. Effective Wireless Scheduling via Hypergraph Sketches. arXiv:1806.10964 [cs] (June 2018). http:\/\/arxiv.org\/abs\/1806.10964 arXiv: 1806.10964."},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Computer Science","volume-title":"Halld\u00f3rsson and Roger Wattenhofer","author":"M.","year":"2019","unstructured":"Magn\u00fas\u00a0 M. Halld\u00f3rsson and Roger Wattenhofer . 2019 . Wireless Network Algorithmics. In Computing and Software Science, Lecture Notes in Computer Science (LNCS), Bernhard Steffen and Gerhard Woeginger (Eds.). Vol.\u00a010000. Springer International Publishing , Cham, 141\u2013160. http:\/\/link.springer.com\/10.1007\/978-3-319-91908-9_9 Magn\u00fas\u00a0M. Halld\u00f3rsson and Roger Wattenhofer. 2019. Wireless Network Algorithmics. In Computing and Software Science, Lecture Notes in Computer Science (LNCS), Bernhard Steffen and Gerhard Woeginger (Eds.). Vol.\u00a010000. Springer International Publishing, Cham, 141\u2013160. http:\/\/link.springer.com\/10.1007\/978-3-319-91908-9_9"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258790"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1096166.1096170"},{"key":"e_1_3_2_1_25_1","unstructured":"IEEE. 2016. IEEE Std 802.11-2016 IEEE Standard for Information technology\u2014Telecommunications and information exchange between systems\u2014Local and metropolitan area networks\u2014Specific requirements\u2014Part 11: Wireless LAN Medium Access Control.  IEEE. 2016. IEEE Std 802.11-2016 IEEE Standard for Information technology\u2014Telecommunications and information exchange between systems\u2014Local and metropolitan area networks\u2014Specific requirements\u2014Part 11: Wireless LAN Medium Access Control."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.938993"},{"key":"e_1_3_2_1_27_1","volume-title":"On the Complexity of Scheduling in Wireless Networks. EURASIP Journal on Wireless Communications and Networking","author":"Joo Changhee","year":"2010","unstructured":"Changhee Joo , Gaurav Sharma , Ness\u00a0 B. Shroff , and Ravi\u00a0 R. Mazumdar . 2010. On the Complexity of Scheduling in Wireless Networks. EURASIP Journal on Wireless Communications and Networking 2010 , Article number 418934 (Dec. 2010). https:\/\/doi.org\/10.1155\/2010\/418934 10.1155\/2010 Changhee Joo, Gaurav Sharma, Ness\u00a0B. Shroff, and Ravi\u00a0R. Mazumdar. 2010. On the Complexity of Scheduling in Wireless Networks. EURASIP Journal on Wireless Communications and Networking 2010, Article number 418934 (Dec. 2010). https:\/\/doi.org\/10.1155\/2010\/418934"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.938991"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.852873"},{"key":"e_1_3_2_1_30_1","volume-title":"Computer Networking: A Top-Down Approach","author":"Kurose F.","year":"2012","unstructured":"James\u00a0 F. Kurose and Keith\u00a0 W. Ross . 2012 . Computer Networking: A Top-Down Approach ( 6 th ed.). Pearson . James\u00a0F. Kurose and Keith\u00a0W. Ross. 2012. Computer Networking: A Top-Down Approach (6th ed.). Pearson.","edition":"6"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2017.8292404"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2176520"},{"key":"e_1_3_2_1_33_1","volume-title":"Approximating weighted induced matchings. Discrete Applied Mathematics 243 (July","author":"Lin Min\u00a0Chih","year":"2018","unstructured":"Min\u00a0Chih Lin , Juli\u00e1n Mestre , and Saveliy Vasiliev . 2018. Approximating weighted induced matchings. Discrete Applied Mathematics 243 (July 2018 ), 304\u2013310. https:\/\/doi.org\/10.1016\/j.dam.2018.01.009 10.1016\/j.dam.2018.01.009 Min\u00a0Chih Lin, Juli\u00e1n Mestre, and Saveliy Vasiliev. 2018. Approximating weighted induced matchings. Discrete Applied Mathematics 243 (July 2018), 304\u2013310. https:\/\/doi.org\/10.1016\/j.dam.2018.01.009"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000857"},{"volume-title":"Matching Theory","author":"Lov\u00e1sz L\u00e1szl\u00f3","key":"e_1_3_2_1_35_1","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz and Michael\u00a0 D. Plummer . 1986. Matching Theory . Elsevier . L\u00e1szl\u00f3 Lov\u00e1sz and Michael\u00a0D. Plummer. 1986. Matching Theory. Elsevier."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.272452"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/25.669084"},{"volume-title":"Fractional Graph Theory: A Rational Approach to the Theory of Graphs","author":"Scheinerman R.","key":"e_1_3_2_1_39_1","unstructured":"Edward\u00a0 R. Scheinerman and Daniel\u00a0 H. Ullman . 2013. Fractional Graph Theory: A Rational Approach to the Theory of Graphs . Dover Publications , Minola, N.Y. Edward\u00a0R. Scheinerman and Daniel\u00a0H. Ullman. 2013. Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Dover Publications, Minola, N.Y."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1949281148"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1161089.1161116"},{"key":"e_1_3_2_1_42_1","volume-title":"Maximum Weighted Matching with Interference Constraints. In Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW\u201906)","author":"Sharma Gaurav","year":"2006","unstructured":"Gaurav Sharma , Ness\u00a0 B. Shroff , and Ravi\u00a0 R. Mazumdar . 2006 . Maximum Weighted Matching with Interference Constraints. In Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW\u201906) . IEEE, Pisa, Italy, 70\u201374. https:\/\/doi.org\/10.1109\/PERCOMW. 2006.79 10.1109\/PERCOMW.2006.79 Gaurav Sharma, Ness\u00a0B. Shroff, and Ravi\u00a0R. Mazumdar. 2006. Maximum Weighted Matching with Interference Constraints. In Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW\u201906). IEEE, Pisa, Italy, 70\u201374. https:\/\/doi.org\/10.1109\/PERCOMW.2006.79"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90077-1"},{"key":"e_1_3_2_1_44_1","volume-title":"Proceedings the 25th IEEE International Conference on Computer Communications(INFOCOM \u201906)","author":"Wu Xinzhou","year":"2006","unstructured":"Xinzhou Wu and R. Srikant . 2006. Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks . In Proceedings the 25th IEEE International Conference on Computer Communications(INFOCOM \u201906) . Barcelona, Spain, 1\u201312. https:\/\/doi.org\/10.1109\/INFOCOM. 2006 .176 10.1109\/INFOCOM.2006.176 Xinzhou Wu and R. Srikant. 2006. Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. In Proceedings the 25th IEEE International Conference on Computer Communications(INFOCOM \u201906). Barcelona, Spain, 1\u201312. https:\/\/doi.org\/10.1109\/INFOCOM.2006.176"}],"event":{"name":"ICDCN '21: International Conference on Distributed Computing and Networking 2021","acronym":"ICDCN '21","location":"Nara Japan"},"container-title":["Proceedings of the 22nd International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427796.3427806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427796.3427806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:31Z","timestamp":1750197751000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427796.3427806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,5]]},"references-count":43,"alternative-id":["10.1145\/3427796.3427806","10.1145\/3427796"],"URL":"https:\/\/doi.org\/10.1145\/3427796.3427806","relation":{},"subject":[],"published":{"date-parts":[[2021,1,5]]},"assertion":[{"value":"2021-01-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}