{"id":"https://openalex.org/W2496312058","doi":"https://doi.org/10.1109/smartcomp.2016.7501711","title":"Optimal Skewed Allocation on Multiple Channels for Broadcast in Smart Cities","display_name":"Optimal Skewed Allocation on Multiple Channels for Broadcast in Smart Cities","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2496312058","doi":"https://doi.org/10.1109/smartcomp.2016.7501711","mag":"2496312058"},"language":"en","primary_location":{"id":"doi:10.1109/smartcomp.2016.7501711","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smartcomp.2016.7501711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Smart Computing (SMARTCOMP)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2318/1730128","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085966380","display_name":"Giorgio Audrito","orcid":"https://orcid.org/0000-0002-2319-0375"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giorgio Audrito","raw_affiliation_strings":["Department of Computer Science, University of Pisa, Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009426659","display_name":"Daniele Diodati","orcid":"https://orcid.org/0000-0002-3396-0265"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Daniele Diodati","raw_affiliation_strings":["Department of Computer Science and Mathematics, University of Perugia, Perugia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, University of Perugia, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066308534","display_name":"Cristina M. Pinotti","orcid":"https://orcid.org/0000-0002-8674-868X"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Cristina M. Pinotti","raw_affiliation_strings":["Department of Computer Science and Mathematics, University of Perugia, Perugia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, University of Perugia, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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.9994999766349792,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.754078209400177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.679620087146759},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5514947175979614},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5155305862426758},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5152859687805176},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4760836660861969},{"id":"https://openalex.org/keywords/backhaul","display_name":"Backhaul (telecommunications)","score":0.41743266582489014},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.4138734042644501},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3790021240711212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23521506786346436},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13773664832115173},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.11876314878463745},{"id":"https://openalex.org/keywords/base-station","display_name":"Base station","score":0.08701959252357483}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.754078209400177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.679620087146759},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5514947175979614},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5155305862426758},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5152859687805176},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4760836660861969},{"id":"https://openalex.org/C103760667","wikidata":"https://www.wikidata.org/wiki/Q798444","display_name":"Backhaul (telecommunications)","level":3,"score":0.41743266582489014},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.4138734042644501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3790021240711212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23521506786346436},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13773664832115173},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.11876314878463745},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.08701959252357483},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/smartcomp.2016.7501711","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smartcomp.2016.7501711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Smart Computing (SMARTCOMP)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.unito.it:2318/1730128","is_oa":true,"landing_page_url":"http://hdl.handle.net/2318/1730128","pdf_url":null,"source":{"id":"https://openalex.org/S4306400637","display_name":"Institutional Research Information System University of Turin (University of Turin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I55143463","host_organization_name":"University of Turin","host_organization_lineage":["https://openalex.org/I55143463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:iris.unito.it:2318/1730128","is_oa":true,"landing_page_url":"http://hdl.handle.net/2318/1730128","pdf_url":null,"source":{"id":"https://openalex.org/S4306400637","display_name":"Institutional Research Information System University of Turin (University of Turin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I55143463","host_organization_name":"University of Turin","host_organization_lineage":["https://openalex.org/I55143463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1967920323","https://openalex.org/W2024353273","https://openalex.org/W2055257826","https://openalex.org/W2071843117","https://openalex.org/W2079656678","https://openalex.org/W2093233025","https://openalex.org/W2094177754","https://openalex.org/W2105016507","https://openalex.org/W2112053513","https://openalex.org/W2133355118","https://openalex.org/W2134952300","https://openalex.org/W2139745589","https://openalex.org/W2308669486","https://openalex.org/W2593228764","https://openalex.org/W2622763161","https://openalex.org/W3136742361","https://openalex.org/W6641979912"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2157978810","https://openalex.org/W2597809628","https://openalex.org/W3046370962"],"abstract_inverted_index":{"We":[0,35,108,141,170],"consider":[1],"the":[2,15,38,45,63,77,83,97,111,116,126,158,163,173,179,183],"problem":[3,23,48,86,127,185],"of":[4,65,100,128,175,182],"allocating":[5],"N":[6,103,120],"uniform":[7,46,84,98],"data":[8,104,121],"to":[9,53,61,102,125],"K":[10,106,123],"transmission":[11],"channels":[12],"so":[13],"as":[14],"average":[16],"Expected":[17],"Delay":[18],"(AED)":[19],"is":[20,73,93],"minimized.":[21],"This":[22],"arises":[24],"in":[25,31,89,135,154,186],"designing":[26],"efficient":[27],"data-diffusion":[28],"broadcast":[29],"algorithms":[30,177],"a":[32,70,130,136],"smart":[33],"environment.":[34],"show":[36,148],"that":[37,87],"basic":[39],"dynamic":[40],"rogramming":[41],"algorithm":[42,60,72,81,161],"for":[43,82,96,193],"solving":[44],"pallocation":[47],"can":[49],"be":[50],"speedup":[51],"up":[52,101],"O(NK)":[54],"time":[55],"by":[56,149],"applying":[57],"an":[58],"optimal":[59,95],"find":[62],"row-minima":[64],"totally":[66],"monotone":[67],"matrices.":[68],"Such":[69],"new":[71,188],"always":[74],"faster":[75,167],"than":[76,168],"best":[78],"previously":[79],"known":[80],"allocation":[85,99,113,184],"runs":[88],"O(NKlogN).":[90],"Moreover,":[91],"it":[92],"computationally":[94],"and":[105,122,146,162],"channels.":[107],"then":[109,171],"reduce":[110],"largest":[112],"problem,":[114],"i.e.,":[115],"subproblem":[117],"with":[118],"exactly":[119],"channels,":[124],"finding":[129],"minimum":[131],"weight":[132],"K-link":[133,159],"path":[134,160],"particular":[137],"directed":[138],"acyclic":[139],"graph.":[140],"also":[142],"present":[143],"two":[144],"heuristics":[145,164],"we":[147],"extended":[150],"simulations":[151],"their":[152],"effectiveness":[153],"practical":[155],"scenarios.":[156],"Both":[157],"are":[165,191],"much":[166],"O(NK).":[169],"compare":[172],"behaviours":[174],"our":[176],"on":[178],"online":[180],"version":[181],"which":[187],"single":[189],"items":[190],"inserted":[192],"broadcast.":[194]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}