{"id":"https://openalex.org/W2140753648","doi":"https://doi.org/10.1109/infcom.2011.5935310","title":"Delay constrained minimum energy broadcast in cooperative wireless networks","display_name":"Delay constrained minimum energy broadcast in cooperative wireless networks","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2140753648","doi":"https://doi.org/10.1109/infcom.2011.5935310","mag":"2140753648"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2011.5935310","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5935310","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 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/A5077521493","display_name":"Marjan Baghaie","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Marjan Baghaie","raw_affiliation_strings":["Department of Electrical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, USA","Department of Electrical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, 90089, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Department of Electrical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, 90089, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063784062","display_name":"Bhaskar Krishnamachari","orcid":"https://orcid.org/0000-0002-9994-9931"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhaskar Krishnamachari","raw_affiliation_strings":["Department of Electrical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, USA","Department of Electrical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, 90089, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Department of Electrical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, 90089, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077521493"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":4.3851,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.9461218,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"52","issue":null,"first_page":"864","last_page":"872"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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.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/T11158","display_name":"Wireless Networks and Protocols","score":0.9991999864578247,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7227227091789246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6970497369766235},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5969412326812744},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5591508746147156},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.4936469793319702},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.49030449986457825},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4578602910041809},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4539761543273926},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4482731819152832},{"id":"https://openalex.org/keywords/power-control","display_name":"Power control","score":0.43113037943840027},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.42600464820861816},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.42239853739738464},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4177629351615906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3593904972076416},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.29670780897140503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1947016417980194},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18426480889320374},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1743197739124298}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7227227091789246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6970497369766235},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5969412326812744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5591508746147156},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.4936469793319702},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.49030449986457825},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4578602910041809},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4539761543273926},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4482731819152832},{"id":"https://openalex.org/C56685638","wikidata":"https://www.wikidata.org/wiki/Q2300474","display_name":"Power control","level":3,"score":0.43113037943840027},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.42600464820861816},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.42239853739738464},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4177629351615906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3593904972076416},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.29670780897140503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1947016417980194},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18426480889320374},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1743197739124298},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2011.5935310","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5935310","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.224.4963","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.4963","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ceng.usc.edu/%7Ebkrishna/research/papers/BaghaieKrishnamachari_Infocom11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8999999761581421,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1975308494","https://openalex.org/W2003159902","https://openalex.org/W2009079787","https://openalex.org/W2009976792","https://openalex.org/W2014550373","https://openalex.org/W2020974757","https://openalex.org/W2022318042","https://openalex.org/W2083556259","https://openalex.org/W2124069658","https://openalex.org/W2136564093","https://openalex.org/W2146717991","https://openalex.org/W2149084482","https://openalex.org/W2155932347","https://openalex.org/W2158971341","https://openalex.org/W2161586373","https://openalex.org/W2611804663","https://openalex.org/W3152133380","https://openalex.org/W4249318479","https://openalex.org/W6682967426","https://openalex.org/W6793551195","https://openalex.org/W7011593532"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"We":[0,14,28,39,53,95,122],"formulate":[1],"the":[2,57,61,86,111,129,140],"problem":[3,19,44,66],"of":[4,142],"delay":[5,93,132],"constrained":[6],"energy-efficient":[7],"broadcast":[8,89,137],"in":[9,70,103,119,135],"cooperative":[10,136,144],"multihop":[11],"wireless":[12],"networks.":[13],"show":[15,54,97],"that":[16,55,77,99],"this":[17,37,41,100],"important":[18],"is":[20,59],"not":[21],"only":[22],"NP-complete,":[23],"but":[24],"also":[25],"o(log(n))":[26],"inapproximable.":[27],"derive":[29],"approximation":[30],"results":[31],"and":[32,50,64,81,133,138],"an":[33,106],"analytical":[34],"lower-bound":[35],"for":[36,90],"problem.":[38],"break":[40],"NP":[42],"hard":[43],"into":[45],"three":[46],"parts:":[47],"ordering,":[48],"scheduling":[49,63],"power":[51],"control.":[52],"when":[56],"ordering":[58,107],"given,":[60],"joint":[62],"power-control":[65],"can":[67],"be":[68],"solved":[69],"polynomial":[71],"time":[72],"by":[73],"a":[74,91,147],"novel":[75],"algorithm":[76,101,115,125,145],"combines":[78],"dynamic":[79],"programming":[80,83],"linear":[82],"to":[84,126],"yield":[85],"minimum":[87],"energy":[88],"given":[92],"constraint.":[94],"further":[96],"empirically":[98],"used":[102],"conjunction":[104],"with":[105,146],"derived":[108],"heuristically":[109],"using":[110],"Dijkstra's":[112],"shortest":[113],"path":[114],"yields":[116],"near-optimal":[117],"performance":[118,141],"typical":[120],"settings.":[121],"use":[123],"our":[124,143],"study":[127],"numerically":[128],"trade-off":[130],"between":[131],"power-efficiency":[134],"compare":[139],"smart":[148],"non-cooperative":[149],"algorithm.":[150]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}