{"id":"https://openalex.org/W1967920323","doi":"https://doi.org/10.1109/infcom.2012.6195838","title":"Efficient data retrieval scheduling for multi-channel wireless data broadcast","display_name":"Efficient data retrieval scheduling for multi-channel wireless data broadcast","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W1967920323","doi":"https://doi.org/10.1109/infcom.2012.6195838","mag":"1967920323"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2012.6195838","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","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/A5006477968","display_name":"Zaixin Lu","orcid":"https://orcid.org/0000-0001-8773-1284"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zaixin Lu","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","Department of Computer Science , University of Texas at Dallas, Richardson, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science , University of Texas at Dallas, Richardson, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101644794","display_name":"Shi Yan","orcid":"https://orcid.org/0000-0002-5953-1979"},"institutions":[{"id":"https://openalex.org/I1745920","display_name":"University of Wisconsin\u2013Platteville","ror":"https://ror.org/02xpkhc07","country_code":"US","type":"education","lineage":["https://openalex.org/I1745920"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yan Shi","raw_affiliation_strings":["CSSE Department, University of Wisconsin, Platteville, Platteville, WI, USA","CSSE Department, University of Wisconsin - Platteville, USA"],"affiliations":[{"raw_affiliation_string":"CSSE Department, University of Wisconsin, Platteville, Platteville, WI, USA","institution_ids":["https://openalex.org/I1745920"]},{"raw_affiliation_string":"CSSE Department, University of Wisconsin - Platteville, USA","institution_ids":["https://openalex.org/I1745920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070037321","display_name":"Weili Wu","orcid":"https://orcid.org/0000-0001-8747-6340"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weili Wu","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","Department of Computer Science , University of Texas at Dallas, Richardson, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science , University of Texas at Dallas, Richardson, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100702189","display_name":"Bin Fu","orcid":"https://orcid.org/0000-0001-7192-2983"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bin Fu","raw_affiliation_strings":["Department of Computer Science, University of Texas, Pan-American, Edinburg, TX, USA","Department of Computer science, University of Texas-Pan American, Edinburg, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Pan-American, Edinburg, TX, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer science, University of Texas-Pan American, Edinburg, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006477968"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":6.7373,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.96957888,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"891","last_page":"899"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9962999820709229,"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/T10237","display_name":"Cryptography and Data Security","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8063427805900574},{"id":"https://openalex.org/keywords/upload","display_name":"Upload","score":0.6626732349395752},{"id":"https://openalex.org/keywords/data-retrieval","display_name":"Data retrieval","score":0.6008676290512085},{"id":"https://openalex.org/keywords/dissemination","display_name":"Dissemination","score":0.5947643518447876},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5416713953018188},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5394511818885803},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.523788332939148},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5195906162261963},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4904472529888153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26017996668815613},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2285001277923584},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.18813058733940125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11237514019012451}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8063427805900574},{"id":"https://openalex.org/C71901391","wikidata":"https://www.wikidata.org/wiki/Q7126699","display_name":"Upload","level":2,"score":0.6626732349395752},{"id":"https://openalex.org/C551230270","wikidata":"https://www.wikidata.org/wiki/Q4368942","display_name":"Data retrieval","level":2,"score":0.6008676290512085},{"id":"https://openalex.org/C101780184","wikidata":"https://www.wikidata.org/wiki/Q840576","display_name":"Dissemination","level":2,"score":0.5947643518447876},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5416713953018188},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5394511818885803},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.523788332939148},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5195906162261963},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4904472529888153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26017996668815613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2285001277923584},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.18813058733940125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11237514019012451},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2012.6195838","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.9200000166893005}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1489361400","https://openalex.org/W1527756241","https://openalex.org/W1574901103","https://openalex.org/W1856901454","https://openalex.org/W1964396297","https://openalex.org/W1966658342","https://openalex.org/W2018952425","https://openalex.org/W2030464256","https://openalex.org/W2033657301","https://openalex.org/W2065653207","https://openalex.org/W2072878830","https://openalex.org/W2075598223","https://openalex.org/W2085384005","https://openalex.org/W2101263634","https://openalex.org/W2104669433","https://openalex.org/W2109464511","https://openalex.org/W2122296645","https://openalex.org/W2129497881","https://openalex.org/W2130603914","https://openalex.org/W2134952300","https://openalex.org/W2138858363","https://openalex.org/W2139745589","https://openalex.org/W2143996311","https://openalex.org/W2150327340","https://openalex.org/W2157529519","https://openalex.org/W2164680805","https://openalex.org/W2168689656","https://openalex.org/W3139082172","https://openalex.org/W6629125396","https://openalex.org/W6675927217","https://openalex.org/W6684831943"],"related_works":["https://openalex.org/W1034070228","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2163115662","https://openalex.org/W189401716","https://openalex.org/W2898570308","https://openalex.org/W2019216770","https://openalex.org/W2574250816","https://openalex.org/W2544904580"],"abstract_inverted_index":{"Wireless":[0],"data":[1,9,27,38,68,90],"broadcast":[2],"is":[3,112,129,142,151,165],"an":[4],"efficient":[5],"technique":[6],"of":[7,15,46,61,66,89],"disseminating":[8],"simultaneously":[10],"to":[11,131,153,157,167],"a":[12,30,71,87,107,135,162],"large":[13],"number":[14,65],"mobile":[16],"clients.":[17],"In":[18,32],"many":[19],"information":[20],"services,":[21],"the":[22,37,43,51,59,63,76,93,98,122,148],"users":[23],"may":[24],"query":[25],"multiple":[26],"items":[28,69,91],"at":[29,85],"time.":[31],"this":[33],"paper,":[34],"we":[35],"study":[36],"retrieval":[39],"scheduling":[40],"problem":[41,57,82,150],"from":[42],"client's":[44],"point":[45],"view.":[47],"We":[48,144],"formally":[49],"define":[50],"Largest":[52],"Number":[53],"Data":[54,79],"Retrieval":[55,80],"(LNDR)":[56],"with":[58,92,138],"objective":[60],"downloading":[62,86],"largest":[64],"requested":[67],"in":[70],"given":[72],"time":[73,99,124],"duration,":[74],"and":[75,134,161],"Minimum":[77],"Cost":[78],"(MCDR)":[81],"which":[83,116],"aims":[84],"set":[88],"minimum":[94],"energy":[95],"consumption.":[96],"When":[97],"needed":[100],"for":[101,114],"channel":[102],"switching":[103,123],"can":[104],"be":[105,126,132,154],"ignored,":[106],"Maximum":[108],"Matching":[109],"optimal":[110],"algorithm":[111,137],"exhibited":[113],"LNDR":[115,128],"requires":[117],"only":[118],"polynomial":[119],"time;":[120],"when":[121],"cannot":[125],"neglected,":[127],"proven":[130],"NP-hard":[133,152],"greedy":[136],"constant":[139],"approximation":[140],"ratio":[141],"developed.":[143],"also":[145],"prove":[146],"that":[147],"MCDR":[149,169],"approximated":[155],"within":[156],"any":[158],"nontrivial":[159],"factor":[160],"parameterized":[163],"heuristic":[164],"devised":[166],"solve":[168],"non-optimally.":[170]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}