{"id":"https://openalex.org/W2909897413","doi":"https://doi.org/10.1109/access.2019.2892989","title":"On the Capacity of a Two-Hop Half-Duplex Relay Channel With a Markovian Constrained Relay","display_name":"On the Capacity of a Two-Hop Half-Duplex Relay Channel With a Markovian Constrained Relay","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2909897413","doi":"https://doi.org/10.1109/access.2019.2892989","mag":"2909897413"},"language":"en","primary_location":{"id":"doi:10.1109/access.2019.2892989","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2019.2892989","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08611327.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08611327.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089052376","display_name":"Linyun Huang","orcid":"https://orcid.org/0000-0002-7970-489X"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Linyun Huang","raw_affiliation_strings":["Monash University, Clayton, VIC, Australia"],"raw_orcid":"https://orcid.org/0000-0002-7970-489X","affiliations":[{"raw_affiliation_string":"Monash University, Clayton, VIC, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008214098","display_name":"Yi Hong","orcid":"https://orcid.org/0000-0002-1284-891X"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Yi Hong","raw_affiliation_strings":["Monash University, Clayton, VIC, Australia"],"raw_orcid":"https://orcid.org/0000-0002-1284-891X","affiliations":[{"raw_affiliation_string":"Monash University, Clayton, VIC, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":{"value":2075,"currency":"USD","value_usd":2075},"apc_paid":{"value":2075,"currency":"USD","value_usd":2075},"fwci":0.4813,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7000401,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"7","issue":null,"first_page":"15683","last_page":"15695"},"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9983999729156494,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9959999918937683,"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/relay","display_name":"Relay","score":0.9344900846481323},{"id":"https://openalex.org/keywords/relay-channel","display_name":"Relay channel","score":0.8896112442016602},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6388654112815857},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.580441951751709},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5433869957923889},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5087350010871887},{"id":"https://openalex.org/keywords/channel-state-information","display_name":"Channel state information","score":0.5085936784744263},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.48097550868988037},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.47866758704185486},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.45968812704086304},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.42956772446632385},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.404996395111084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32233303785324097},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3176100254058838},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.3004865348339081},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.28818589448928833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18641135096549988},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09502115845680237},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08233252167701721}],"concepts":[{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.9344900846481323},{"id":"https://openalex.org/C46257984","wikidata":"https://www.wikidata.org/wiki/Q7310895","display_name":"Relay channel","level":4,"score":0.8896112442016602},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6388654112815857},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.580441951751709},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5433869957923889},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5087350010871887},{"id":"https://openalex.org/C148063708","wikidata":"https://www.wikidata.org/wiki/Q5072511","display_name":"Channel state information","level":3,"score":0.5085936784744263},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.48097550868988037},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.47866758704185486},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.45968812704086304},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.42956772446632385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.404996395111084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32233303785324097},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3176100254058838},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.3004865348339081},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.28818589448928833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18641135096549988},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09502115845680237},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08233252167701721},{"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/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/access.2019.2892989","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2019.2892989","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08611327.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:monash.edu:openaire/31cfffb1-7702-4d31-b52c-6d1b02c3d1b4","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/31cfffb1-7702-4d31-b52c-6d1b02c3d1b4","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Huang, L & Hong, Y 2019, 'On the capacity of a two-hop half-duplex relay channel with a markovian constrained relay', IEEE Access, vol. 7, no. 1, 8611327, pp. 15683-15695. https://doi.org/10.1109/ACCESS.2019.2892989","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:20682eb552b64006a34238f415d3883f","is_oa":true,"landing_page_url":"https://doaj.org/article/20682eb552b64006a34238f415d3883f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 7, Pp 15683-15695 (2019)","raw_type":"article"},{"id":"pmh:oai:monash.edu:publications/31cfffb1-7702-4d31-b52c-6d1b02c3d1b4","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85061799593&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"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":"Huang , L & Hong , Y 2019 , ' On the capacity of a two-hop half-duplex relay channel with a markovian constrained relay ' , IEEE Access , vol. 7 , no. 1 , 8611327 , pp. 15683-15695 . https://doi.org/10.1109/ACCESS.2019.2892989","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2019.2892989","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2019.2892989","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08611327.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3368441476","display_name":"New Generation of Secure Wireless Communications for Constrained Devices","funder_award_id":"DP160100528","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G3617482846","display_name":null,"funder_award_id":"ARC DP160100528","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2909897413.pdf","grobid_xml":"https://content.openalex.org/works/W2909897413.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W92564041","https://openalex.org/W114541479","https://openalex.org/W1594420730","https://openalex.org/W1800456906","https://openalex.org/W1886640579","https://openalex.org/W1971536606","https://openalex.org/W1989008275","https://openalex.org/W1995875735","https://openalex.org/W2002912642","https://openalex.org/W2009712582","https://openalex.org/W2045407304","https://openalex.org/W2068852020","https://openalex.org/W2070432296","https://openalex.org/W2098567664","https://openalex.org/W2121330965","https://openalex.org/W2128347805","https://openalex.org/W2131133028","https://openalex.org/W2138782205","https://openalex.org/W2148578757","https://openalex.org/W2153163364","https://openalex.org/W2153392150","https://openalex.org/W2159965721","https://openalex.org/W2163619651","https://openalex.org/W2165808853","https://openalex.org/W2167447263","https://openalex.org/W2168754888","https://openalex.org/W2478708596","https://openalex.org/W2784615099","https://openalex.org/W3101059620","https://openalex.org/W6683354128","https://openalex.org/W7006268740","https://openalex.org/W7038066802"],"related_works":["https://openalex.org/W1965566556","https://openalex.org/W2595297530","https://openalex.org/W2152137554","https://openalex.org/W2110879650","https://openalex.org/W2119435011","https://openalex.org/W2787091472","https://openalex.org/W2167424239","https://openalex.org/W2014909685","https://openalex.org/W2561450065","https://openalex.org/W2061460951"],"abstract_inverted_index":{"Consider":[0],"a":[1,8,61],"two-hop":[2],"half-duplex":[3],"relay":[4,53,62],"channel":[5,15,54],"(source-relay-destination)":[6],"with":[7],"Markovian-constrained":[9],"relay.":[10],"The":[11,97],"capacity":[12,46],"of":[13],"such":[14],"is":[16,34],"shown":[17],"to":[18,21,44,55],"be":[19],"equal":[20],"the":[22,28,31,36,45,52,66,79,109,113],"well-known":[23],"cut-set":[24],"upper":[25],"bound.":[26],"For":[27,65],"case":[29,67],"where":[30,68],"relay-to-destination":[32,72],"link":[33],"noise-free,":[35],"optimal":[37],"state":[38],"transition":[39],"probabilities":[40],"that":[41,91],"give":[42],"rise":[43],"are":[47,74,87,95,105],"determined.":[48],"This":[49],"result":[50],"links":[51,73],"Shannon's":[56],"entropy":[57],"maximization":[58],"by":[59,112],"introducing":[60],"adjacency":[63],"matrix.":[64],"both":[69],"source-to-relay":[70],"and":[71,101],"noisy,":[75],"lower":[76],"bounds":[77,94],"on":[78],"achievable":[80],"information":[81,103],"rates":[82,104],"for":[83],"various":[84],"constrained":[85],"sequences":[86],"computed.":[88],"We":[89],"conjecture":[90],"our":[92],"numerical":[93],"tight.":[96],"numerically":[98],"computed":[99],"capacities":[100],"optimized":[102],"significantly":[106],"higher":[107],"than":[108],"rate":[110],"achieved":[111],"traditional":[114],"predetermined":[115],"time-sharing":[116],"scheme.":[117]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}