{"id":"https://openalex.org/W2166945650","doi":"https://doi.org/10.1109/infcom.2004.1354580","title":"Optimal transmission scheduling with base station antenna array in cellular networks","display_name":"Optimal transmission scheduling with base station antenna array in cellular networks","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2166945650","doi":"https://doi.org/10.1109/infcom.2004.1354580","mag":"2166945650"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2004.1354580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2004.1354580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2004","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/A5104356823","display_name":"Tianmin Ren","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tianmin Ren","raw_affiliation_strings":["Department of Electrical & Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039201084","display_name":"Richard J. La","orcid":"https://orcid.org/0000-0002-4836-8475"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R.J. La","raw_affiliation_strings":["Department of Electrical & Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014892027","display_name":"Leandros Tassiulas","orcid":"https://orcid.org/0000-0003-0932-774X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L. Tassiulas","raw_affiliation_strings":["Department of Electrical & Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3563,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8257454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"1684","last_page":"1693"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9998000264167786,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7689421772956848},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.7235172390937805},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6610919833183289},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6428347826004028},{"id":"https://openalex.org/keywords/base-station","display_name":"Base station","score":0.6072874665260315},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5916545987129211},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5400167107582092},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.4514545202255249},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4401383697986603},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.42395567893981934},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37302365899086},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3581022620201111},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1015048623085022}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7689421772956848},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.7235172390937805},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6610919833183289},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6428347826004028},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.6072874665260315},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5916545987129211},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5400167107582092},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.4514545202255249},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4401383697986603},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.42395567893981934},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37302365899086},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3581022620201111},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1015048623085022},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/infcom.2004.1354580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2004.1354580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.2597","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieee-infocom.org/2004/Papers/35_4.PDF","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.410","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.umd.edu/~hyongla/PAPERS/infocom04_antenna_array.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1925950976","https://openalex.org/W2098729728","https://openalex.org/W2105177639","https://openalex.org/W2108710283","https://openalex.org/W2119116717","https://openalex.org/W2121233130","https://openalex.org/W2121520527","https://openalex.org/W2128005148","https://openalex.org/W2134833225","https://openalex.org/W2156822514","https://openalex.org/W2165106609","https://openalex.org/W2562525151"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W4386580182","https://openalex.org/W3184267879","https://openalex.org/W2372008037","https://openalex.org/W2106332846","https://openalex.org/W1545991362","https://openalex.org/W2397293317","https://openalex.org/W2363433593","https://openalex.org/W2359186131"],"abstract_inverted_index":{"We":[0,63,102,140],"study":[1,49],"the":[2,33,50,60,78,82,86,91,97,100,110,113,132,156,164,182,185,194],"downlink":[3],"scheduling":[4,70,92,106,121,126,144],"problem":[5],"in":[6,131],"a":[7,73,174],"cellular":[8],"wireless":[9,177],"network.":[10],"The":[11,88,150,191],"base":[12,204],"stations":[13],"are":[14,35,154],"equipped":[15],"with":[16,169],"antenna":[17],"arrays":[18],"and":[19,54,81,202],"can":[20],"transmit":[21],"to":[22,48,95],"more":[23],"than":[24],"one":[25],"mobile":[26],"user":[27,66],"at":[28],"any":[29,120],"time":[30],"instant,":[31],"provided":[32],"users":[34,135],"spatially":[36],"separable.":[37],"In":[38],"previous":[39],"work,":[40],"an":[41,104],"infinite":[42],"traffic":[43,67],"demand":[44],"model":[45],"is":[46,94,117,128],"used":[47],"physical":[51],"layer":[52],"beamforming":[53],"power":[55],"control":[56],"algorithms":[57,145,153,167,187],"that":[58,108,146],"maximize":[59],"system":[61,114],"throughput.":[62],"consider":[64],"finite":[65],"demands.":[68],"A":[69],"policy":[71,107,127],"makes":[72],"decision":[74],"based":[75],"on":[76],"both":[77],"queue":[79,200],"lengths":[80],"spatial":[83],"separability":[84],"of":[85,90,99,112,134,159,184,196,199],"users.":[87],"objective":[89],"algorithm":[93],"maintain":[96],"stability":[98,111],"system.":[101],"derive":[103],"optimal":[105,125],"maintains":[109],"if":[115],"it":[116,138],"stable":[118],"under":[119],"policy.":[122],"However,":[123],"this":[124],"exponentially":[129],"complex":[130],"number":[133],"which":[136],"renders":[137],"impractical.":[139],"propose":[141],"four":[142],"heuristic":[143],"have":[147],"polynomial":[148],"complexity.":[149],"first":[151],"two":[152,166],"for":[155],"special":[157],"case":[158],"single":[160],"cell":[161,171],"systems,":[162],"while":[163],"other":[165],"deal":[168],"multiple":[170],"systems.":[172],"Using":[173],"realistic":[175],"multipath":[176],"channel":[178],"model,":[179],"we":[180],"evaluate":[181],"performance":[183],"proposed":[186],"through":[188],"computer":[189],"simulations.":[190],"results":[192],"demonstrate":[193],"benefits":[195],"joint":[197],"consideration":[198],"length":[201],"dynamic":[203],"station":[205],"assignment.":[206]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}