{"id":"https://openalex.org/W2142186130","doi":"https://doi.org/10.1109/icc.2005.1494986","title":"A DAG-based approach to wireless scheduling","display_name":"A DAG-based approach to wireless scheduling","publication_year":2005,"publication_date":"2005-08-16","ids":{"openalex":"https://openalex.org/W2142186130","doi":"https://doi.org/10.1109/icc.2005.1494986","mag":"2142186130"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2005.1494986","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2005.1494986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2005. ICC 2005. 2005","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/A5018285870","display_name":"Jinhui Shen","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Jinhui Shen","raw_affiliation_strings":["Computing Science Department, University of Alberta, Edmonton, AB, Canada","Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada"],"affiliations":[{"raw_affiliation_string":"Computing Science Department, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087930118","display_name":"Ioanis Nikolaidis","orcid":"https://orcid.org/0000-0003-1469-5280"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"I. Nikolaidis","raw_affiliation_strings":["Computing Science Department, University of Alberta, Edmonton, AB, Canada","University of Alberta"],"affiliations":[{"raw_affiliation_string":"Computing Science Department, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"University of Alberta","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053810473","display_name":"Janelle Harms","orcid":"https://orcid.org/0000-0003-0769-5709"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J.J. Harms","raw_affiliation_strings":["Computing Science Department, University of Alberta, Edmonton, AB, Canada","University of Alberta"],"affiliations":[{"raw_affiliation_string":"Computing Science Department, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"University of Alberta","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018285870"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":1.0382,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81716483,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"3142","last_page":"3148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11158","display_name":"Wireless Networks and Protocols","score":0.9997000098228455,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9997000098228455,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9983999729156494,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9951000213623047,"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.8098073601722717},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6300300359725952},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6162443161010742},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6111485362052917},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.576164722442627},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4731384813785553},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.45737743377685547},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42019760608673096},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3209422826766968},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19872227311134338},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17311039566993713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1133405864238739}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8098073601722717},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6300300359725952},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6162443161010742},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6111485362052917},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.576164722442627},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4731384813785553},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.45737743377685547},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42019760608673096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3209422826766968},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19872227311134338},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17311039566993713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1133405864238739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2005.1494986","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2005.1494986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2005. ICC 2005. 2005","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1551825541","https://openalex.org/W1566333620","https://openalex.org/W1716999013","https://openalex.org/W1983350667","https://openalex.org/W1986530072","https://openalex.org/W2023808196","https://openalex.org/W2026111692","https://openalex.org/W2099057525","https://openalex.org/W2107421266","https://openalex.org/W2111257580","https://openalex.org/W2119362555","https://openalex.org/W2148099880","https://openalex.org/W2150032443","https://openalex.org/W2157837962","https://openalex.org/W2163956132","https://openalex.org/W4240536681","https://openalex.org/W6656610145","https://openalex.org/W6656839896","https://openalex.org/W6676221804","https://openalex.org/W6676811437","https://openalex.org/W6682170065"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2372211403","https://openalex.org/W3164774158"],"abstract_inverted_index":{"We":[0,42,119],"consider":[1],"the":[2,21,27,52,56,65,80,116,121],"problem":[3],"of":[4,23,46,55,68,78,123],"transmission":[5,12,37],"scheduling":[6,13,47],"in":[7,20,70,110],"wireless":[8],"networks.":[9],"A":[10,101],"good":[11],"scheme":[14],"should":[15,32],"not":[16,108],"only":[17],"be":[18],"conflict-free,":[19],"sense":[22],"resolving":[24],"collisions":[25],"and":[26,36,114,126,134],"hidden":[28],"terminal":[29],"problem,":[30],"but":[31],"also":[33],"provide":[34,127],"fairness":[35,133],"efficiency":[38,135],"to":[39],"each":[40],"node.":[41],"propose":[43],"a":[44,71,89,111],"class":[45],"schemes":[48,125],"that":[49,105,130],"rely":[50],"on":[51,88,98],"logical":[53,81],"ordering":[54,61],"schedule":[57,117],"update":[58],"operations.":[59],"The":[60],"is":[62,96],"imposed":[63],"by":[64],"precedence":[66],"relationship":[67],"vertices":[69],"directed":[72],"acyclic":[73],"graph":[74],"(DAG).":[75],"Two":[76],"examples":[77],"establishing":[79],"DAG":[82],"are":[83],"given:":[84],"(a)":[85],"one":[86,95],"relies":[87],"distributed":[90],"spanning":[91],"tree":[92],"construction;":[93],"(b)":[94],"based":[97],"location":[99],"information.":[100],"separate":[102],"mechanism":[103],"ensures":[104],"nodes":[106],"do":[107],"behave":[109],"greedy":[112],"fashion":[113],"monopolize":[115],"slots.":[118],"prove":[120],"correctness":[122],"DAG-based":[124],"simulation":[128],"results":[129],"demonstrate":[131],"their":[132],"attributes.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}