{"id":"https://openalex.org/W2576155195","doi":"https://doi.org/10.1109/isit.2017.8006572","title":"Efficiently finding simple schedules in Gaussian half-duplex relay line networks","display_name":"Efficiently finding simple schedules in Gaussian half-duplex relay line networks","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2576155195","doi":"https://doi.org/10.1109/isit.2017.8006572","mag":"2576155195"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006572","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1701.04426","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yahya H. Ezzeldin","orcid":null},"institutions":[{"id":"https://openalex.org/I2799798094","display_name":"UCLA Health","ror":"https://ror.org/01d88se56","country_code":"US","type":"funder","lineage":["https://openalex.org/I2799798094"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yahya H. Ezzeldin","raw_affiliation_strings":["UCLA, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"UCLA, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I2799798094"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Martina Cardone","orcid":null},"institutions":[{"id":"https://openalex.org/I2799798094","display_name":"UCLA Health","ror":"https://ror.org/01d88se56","country_code":"US","type":"funder","lineage":["https://openalex.org/I2799798094"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martina Cardone","raw_affiliation_strings":["UCLA, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"UCLA, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I2799798094"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Christina Fragouli","orcid":null},"institutions":[{"id":"https://openalex.org/I2799798094","display_name":"UCLA Health","ror":"https://ror.org/01d88se56","country_code":"US","type":"funder","lineage":["https://openalex.org/I2799798094"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christina Fragouli","raw_affiliation_strings":["UCLA, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"UCLA, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I2799798094"]}]},{"author_position":"last","author":{"id":null,"display_name":"Daniela Tuninetti","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniela Tuninetti","raw_affiliation_strings":["University of Illinois at Chicago, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I39422238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2799798094"],"apc_list":null,"apc_paid":null,"fwci":2.1895,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.88973013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"471","last_page":"475"},"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9993000030517578,"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9987000226974487,"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/gaussian","display_name":"Gaussian","score":0.6710000038146973},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.5613999962806702},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5455999970436096},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5443000197410583},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4805999994277954},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.45820000767707825},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.43059998750686646},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.3790999948978424},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.35929998755455017}],"concepts":[{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.6710000038146973},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.5613999962806702},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5455999970436096},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5443000197410583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5307999849319458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5134000182151794},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4805999994277954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.460099995136261},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.45820000767707825},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.43059998750686646},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3790999948978424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3709999918937683},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.35929998755455017},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3041999936103821},{"id":"https://openalex.org/C7218915","wikidata":"https://www.wikidata.org/wiki/Q1054475","display_name":"Gaussian function","level":3,"score":0.3037000000476837},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.2736999988555908},{"id":"https://openalex.org/C55974624","wikidata":"https://www.wikidata.org/wiki/Q1188504","display_name":"Exponential family","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C166550679","wikidata":"https://www.wikidata.org/wiki/Q263400","display_name":"Gaussian network model","level":3,"score":0.25369998812675476}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2017.8006572","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1701.04426","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.04426","pdf_url":"https://arxiv.org/pdf/1701.04426","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1701.04426","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.04426","pdf_url":"https://arxiv.org/pdf/1701.04426","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1918082527","https://openalex.org/W1974090170","https://openalex.org/W2021182061","https://openalex.org/W2078414674","https://openalex.org/W2086310021","https://openalex.org/W2109962983","https://openalex.org/W2132100261","https://openalex.org/W2314364293","https://openalex.org/W2576155195","https://openalex.org/W6683354128"],"related_works":[],"abstract_inverted_index":{"The":[0,102],"problem":[1],"of":[2,18,35,105,140],"operating":[3],"a":[4,45,63,76,85,94,121,133],"Gaussian":[5,36,142],"Half-Duplex":[6],"(HD)":[7],"relay":[8],"network":[9,20,113,144],"optimally":[10],"is":[11,56,88,108,124],"challenging":[12],"due":[13],"to":[14,24,62,72,92,109,131],"the":[15,33,99,106,128,137,141],"exponential":[16],"number":[17],"listen/transmit":[19],"states":[21,114],"that":[22,55,97,127,145],"need":[23],"be":[25,147],"considered.":[26],"Recent":[27],"results":[28],"have":[29],"shown":[30,126],"that,":[31],"for":[32,58,136],"class":[34],"HD":[37,116],"networks":[38],"with":[39,49],"N":[40],"relays,":[41],"there":[42],"always":[43],"exists":[44],"simple":[46,77,95],"schedule,":[47],"i.e.,":[48],"at":[50],"most":[51],"N+1":[52],"active":[53],"states,":[54],"sufficient":[57],"approximate":[59,100,138],"(i.e.,":[60],"up":[61],"constant":[64],"gap)":[65],"capacity":[66,139],"characterization.":[67],"This":[68],"paper":[69],"investigates":[70],"how":[71],"efficiently":[73],"find":[74],"such":[75],"schedule":[78,96],"over":[79],"line":[80,143],"networks.":[81],"Towards":[82],"this":[83],"end,":[84],"polynomial-time":[86],"algorithm":[87,107,129],"designed":[89],"and":[90,117,150],"proved":[91],"output":[93],"achieves":[98],"capacity.":[101],"key":[103],"ingredient":[104],"leverage":[110],"similarities":[111],"between":[112],"in":[115,120,151],"edge":[118],"coloring":[119],"graph.":[122],"It":[123],"also":[125],"allows":[130],"derive":[132],"closed-form":[134],"expression":[135],"can":[146],"evaluated":[148],"distributively":[149],"linear":[152],"time.":[153]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2017-01-26T00:00:00"}