{"id":"https://openalex.org/W2143596451","doi":"https://doi.org/10.1109/comsnets.2011.5716467","title":"DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks","display_name":"DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2143596451","doi":"https://doi.org/10.1109/comsnets.2011.5716467","mag":"2143596451"},"language":"en","primary_location":{"id":"doi:10.1109/comsnets.2011.5716467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2011.5716467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030775300","display_name":"Vijay Gabale","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"V Gabale","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Bombay, India","Dept. of Computer Science and Engineering, IIT Bombay, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering, IIT Bombay, India#TAB#","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025236189","display_name":"Ashish Chiplunkar","orcid":"https://orcid.org/0000-0002-6661-8124"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A Chiplunkar","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Bombay, India","Dept. of Computer Science and Engineering, IIT Bombay, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering, IIT Bombay, India#TAB#","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110181986","display_name":"Bhaskaran Raman","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B Raman","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Bombay, India","Dept. of Computer Science and Engineering, IIT Bombay, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering, IIT Bombay, India#TAB#","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101852252","display_name":"Partha Sharathi Dutta","orcid":"https://orcid.org/0000-0001-6067-1023"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"P Dutta","raw_affiliation_strings":["IBM Research, India","\u2022 IBM Research \u2014 India#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM Research, India","institution_ids":["https://openalex.org/I4210103279"]},{"raw_affiliation_string":"\u2022 IBM Research \u2014 India#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5030775300"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":1.7504,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86176107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10575","display_name":"Wireless Communication Networks Research","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8257792592048645},{"id":"https://openalex.org/keywords/time-division-multiple-access","display_name":"Time division multiple access","score":0.6199935674667358},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5885192155838013},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5415208339691162},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4904782474040985},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4638201594352722},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.45903870463371277},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4482708275318146},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.43571627140045166},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.41718408465385437},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.32994621992111206},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2050485908985138},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.16937899589538574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08646851778030396}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8257792592048645},{"id":"https://openalex.org/C117313154","wikidata":"https://www.wikidata.org/wiki/Q878344","display_name":"Time division multiple access","level":2,"score":0.6199935674667358},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5885192155838013},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5415208339691162},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4904782474040985},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4638201594352722},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.45903870463371277},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4482708275318146},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.43571627140045166},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.41718408465385437},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.32994621992111206},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2050485908985138},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.16937899589538574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08646851778030396},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/comsnets.2011.5716467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2011.5716467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W2000351350","https://openalex.org/W2001817075","https://openalex.org/W2006478220","https://openalex.org/W2023159562","https://openalex.org/W2046980951","https://openalex.org/W2063572899","https://openalex.org/W2070947143","https://openalex.org/W2085644262","https://openalex.org/W2091552096","https://openalex.org/W2093243918","https://openalex.org/W2104354412","https://openalex.org/W2115314281","https://openalex.org/W2138727598","https://openalex.org/W2144916624","https://openalex.org/W2145872403","https://openalex.org/W2165027678","https://openalex.org/W2168871260","https://openalex.org/W2549082795","https://openalex.org/W2964117860","https://openalex.org/W4240720231","https://openalex.org/W4242076186"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2393789493","https://openalex.org/W2367142822","https://openalex.org/W2383668729","https://openalex.org/W2377713709","https://openalex.org/W2060984508","https://openalex.org/W2167574351","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2397293317"],"abstract_inverted_index":{"In":[0,49],"this":[1,29,50,94],"work,":[2],"we":[3,52,187],"consider":[4],"the":[5,9,24,32,75,86,103,116,121,177],"goal":[6,30],"of":[7,12,23,93,106,118,141,179],"scheduling":[8,58,82,95,132],"maximum":[10],"number":[11,178],"voice":[13,41,67,142],"calls":[14,143],"in":[15,34,43,69],"a":[16],"TDMA-based":[17,70],"multi-radio,":[18],"multi-channel":[19],"mesh":[20,71],"network.":[21],"One":[22],"main":[25],"challenges":[26],"to":[27,146,152],"achieve":[28],"is":[31],"difficulty":[33],"providing":[35],"strict":[36],"(packet-level)":[37],"delay":[38],"guarantees":[39],"for":[40,182],"traffic":[42,68],"capacity":[44],"limited":[45],"multi-hop":[46],"wireless":[47],"networks.":[48,72],"context,":[51],"propose":[53],"DelayCheck,":[54],"an":[55,90,98,110],"online":[56],"centralized":[57],"and":[59,80,163,194],"call-admission-control":[60],"(CAC)":[61],"algorithm":[62],"which":[63,107],"effectively":[64],"schedules":[65],"constant-bit-rate":[66],"DelayCheck":[73,119,134,155,174,190],"solves":[74],"joint":[76],"routing,":[77],"channel":[78],"assignment":[79],"link":[81],"problem":[83,96],"while":[84],"satisfying":[85],"constraint.":[87],"We":[88,114,170],"formulate":[89],"offline":[91],"version":[92],"as":[97,125,127,144],"Integer":[99],"Linear":[100],"Program":[101],"(ILP),":[102],"LP":[104],"relaxation":[105],"gives":[108],"us":[109],"optimality":[111],"upper":[112,123,148],"bound.":[113,149],"compare":[115],"output":[117],"with":[120,128],"LP-based":[122,147],"bound":[124],"well":[126],"two":[129],"state-of-the-art":[130,153],"prior":[131],"algorithms.":[133],"performs":[135],"remarkably":[136],"well,":[137],"accepting":[138],"about":[139],"93%":[140],"compared":[145,151],"As":[150],"algorithms,":[154],"improves":[156],"scheduler":[157],"efficiency":[158],"by":[159,167],"more":[160],"than":[161],"34%":[162],"reduces":[164],"call":[165],"rejections":[166],"2":[168],"fold.":[169],"also":[171],"demonstrate":[172],"that":[173,189],"efficiently":[175],"exploits":[176],"channels":[180],"available":[181],"scheduling.":[183],"With":[184],"implementation":[185],"optimizations,":[186],"show":[188],"has":[191],"low":[192],"memory":[193],"CPU":[195],"requirements,":[196],"thus":[197],"making":[198],"it":[199],"practical.":[200]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}