{"id":"https://openalex.org/W2155456956","doi":"https://doi.org/10.1109/glocom.2010.5683439","title":"Efficient Link Scheduling for MIMO Ad Hoc Networks in Time-Varying Channels","display_name":"Efficient Link Scheduling for MIMO Ad Hoc Networks in Time-Varying Channels","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2155456956","doi":"https://doi.org/10.1109/glocom.2010.5683439","mag":"2155456956"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2010.5683439","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","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/A5035362556","display_name":"Yan Shi","orcid":"https://orcid.org/0000-0001-8424-5862"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yan Shi","raw_affiliation_strings":["Electrical and Computer Engineering, Brigham Young University, Provo, UT, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065453607","display_name":"Michael A. Jensen","orcid":"https://orcid.org/0000-0003-3250-7052"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael A. Jensen","raw_affiliation_strings":["Electrical and Computer Engineering, Brigham Young University, Provo, UT, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035362556"],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17134377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":1.0,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7488571405410767},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6031084656715393},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.5918241143226624},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5471148490905762},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.5391623377799988},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5264321565628052},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5191535353660583},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4632915258407593},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44119471311569214},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.39493703842163086},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.346964955329895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3262001872062683},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32122480869293213},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18952780961990356},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.1485215127468109},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.0936148464679718},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.0920805037021637}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7488571405410767},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6031084656715393},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.5918241143226624},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5471148490905762},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.5391623377799988},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5264321565628052},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5191535353660583},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4632915258407593},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44119471311569214},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.39493703842163086},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.346964955329895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3262001872062683},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32122480869293213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18952780961990356},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.1485215127468109},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0936148464679718},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0920805037021637}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2010.5683439","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2118010741","https://openalex.org/W2132881059","https://openalex.org/W2133990480","https://openalex.org/W2135932447","https://openalex.org/W2145872061","https://openalex.org/W2149710847","https://openalex.org/W2165943096","https://openalex.org/W2491309546","https://openalex.org/W4229995554"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4386580182","https://openalex.org/W2225350526","https://openalex.org/W1545991362","https://openalex.org/W2397293317","https://openalex.org/W4386128920","https://openalex.org/W4386764057","https://openalex.org/W2372008037","https://openalex.org/W2377713709","https://openalex.org/W2365679959"],"abstract_inverted_index":{"In":[0],"an":[1],"ad":[2],"hoc":[3],"network,":[4],"efficiently":[5],"scheduling":[6,17,35,48,77],"the":[7,22,26,56,60,68,91],"optimal":[8,16,92],"multi-user":[9],"multiple-input":[10],"multiple-output":[11],"links":[12],"is":[13,79],"challenging.":[14],"Specifically,":[15],"requires":[18,36],"full":[19],"understanding":[20],"of":[21,25,59,90],"subspace":[23],"structure":[24],"channel":[27,64,69],"matrices,":[28],"but":[29],"exploiting":[30],"this":[31,76],"detailed":[32],"information":[33],"during":[34],"significant":[37],"computational":[38],"and":[39,67],"algorithmic":[40],"complexity.":[41],"This":[42],"paper":[43],"demonstrates":[44],"efficient":[45],"yet":[46],"effective":[47],"based":[49],"on":[50],"link":[51,93],"signal-to-noise":[52],"ratio":[53,58],"coupled":[54],"with":[55],"average":[57,83],"maximum":[61],"to":[62,81],"minimum":[63],"singular":[65],"values":[66],"Doppler":[70],"frequency.":[71],"Computational":[72],"results":[73],"show":[74],"that":[75,87],"technique":[78],"able":[80],"achieve":[82],"network":[84],"sum":[85],"rates":[86],"approach":[88],"those":[89],"topology.":[94]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}