Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the communication parameters like transmit power and data-rate...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Sreekumar, Sreejith, Dey, Bikash K, Pillai, Sibi Raj B
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Sreekumar, Sreejith
Dey, Bikash K
Pillai, Sibi Raj B
description Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the communication parameters like transmit power and data-rate are jointly chosen for every fading vector realization. On the other hand, in fast-fading links with distributed CSIT, the lack of full CSI is compensated by performing ergodic averaging over sufficiently many channel realizations. Notice that the distributed CSI may necessitate decentralized power-control for optimal data-transfer. Apart from these two models, the case of slow-fading links and distributed CSIT, though relevant to many systems, has received much less attention. In this paper, a block-fading AWGN MAC with full CSI at the receiver and distributed CSI at the transmitters is considered. The links undergo independent fading, but otherwise have arbitrary fading distributions. The channel statistics and respective long-term average transmit powers are known to all parties. We first consider the case where each encoder has knowledge only of its own link quality, and not of others. For this model, we compute the adaptive capacity region, i.e. the collection of average rate-tuples under block-wise coding/decoding such that the rate-tuple for every fading realization is inside the instantaneous MAC capacity region. The key step in our solution is an optimal rate allocation function for any given set of distributed power control laws at the transmitters. This also allows us to characterize the optimal power control for a wide class of fading models. Further extensions are also proposed to account for more general CSI availability at the transmitters.
doi_str_mv 10.48550/arxiv.1409.4489
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1409_4489</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1409_4489</sourcerecordid><originalsourceid>FETCH-LOGICAL-a659-12a8a35820f55435e5031a62c1c01afc4a9f519c7dca89bdbd44e397ce5fb35f3</originalsourceid><addsrcrecordid>eNotz71OwzAUhmEvDKiwMyHfQIId-7T2WAUKSK2oUPfoxD9gyTiR7fJz91Bg-pZXn_QQcsVZKxUAu8H8Gd5bLplupVT6nOxvQ6k5jMfqLH3G6uja4lyxhilRTJbupw-XaT-lmqdIQ6IbtCG90N0x1jDHn94YVwrtXzElF8sFOfMYi7v83wU5bO4O_UOzfbp_7NfbBpegG96hQgGqYx5ACnDABMdlZ7hhHL2RqD1wbVbWoNKjHa2UTuiVceBHAV4syPXf7a9omHN4w_w1nGTDSSa-AZWySTw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels</title><source>arXiv.org</source><creator>Sreekumar, Sreejith ; Dey, Bikash K ; Pillai, Sibi Raj B</creator><creatorcontrib>Sreekumar, Sreejith ; Dey, Bikash K ; Pillai, Sibi Raj B</creatorcontrib><description>Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the communication parameters like transmit power and data-rate are jointly chosen for every fading vector realization. On the other hand, in fast-fading links with distributed CSIT, the lack of full CSI is compensated by performing ergodic averaging over sufficiently many channel realizations. Notice that the distributed CSI may necessitate decentralized power-control for optimal data-transfer. Apart from these two models, the case of slow-fading links and distributed CSIT, though relevant to many systems, has received much less attention. In this paper, a block-fading AWGN MAC with full CSI at the receiver and distributed CSI at the transmitters is considered. The links undergo independent fading, but otherwise have arbitrary fading distributions. The channel statistics and respective long-term average transmit powers are known to all parties. We first consider the case where each encoder has knowledge only of its own link quality, and not of others. For this model, we compute the adaptive capacity region, i.e. the collection of average rate-tuples under block-wise coding/decoding such that the rate-tuple for every fading realization is inside the instantaneous MAC capacity region. The key step in our solution is an optimal rate allocation function for any given set of distributed power control laws at the transmitters. This also allows us to characterize the optimal power control for a wide class of fading models. Further extensions are also proposed to account for more general CSI availability at the transmitters.</description><identifier>DOI: 10.48550/arxiv.1409.4489</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2014-09</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1409.4489$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1409.4489$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Sreekumar, Sreejith</creatorcontrib><creatorcontrib>Dey, Bikash K</creatorcontrib><creatorcontrib>Pillai, Sibi Raj B</creatorcontrib><title>Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels</title><description>Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the communication parameters like transmit power and data-rate are jointly chosen for every fading vector realization. On the other hand, in fast-fading links with distributed CSIT, the lack of full CSI is compensated by performing ergodic averaging over sufficiently many channel realizations. Notice that the distributed CSI may necessitate decentralized power-control for optimal data-transfer. Apart from these two models, the case of slow-fading links and distributed CSIT, though relevant to many systems, has received much less attention. In this paper, a block-fading AWGN MAC with full CSI at the receiver and distributed CSI at the transmitters is considered. The links undergo independent fading, but otherwise have arbitrary fading distributions. The channel statistics and respective long-term average transmit powers are known to all parties. We first consider the case where each encoder has knowledge only of its own link quality, and not of others. For this model, we compute the adaptive capacity region, i.e. the collection of average rate-tuples under block-wise coding/decoding such that the rate-tuple for every fading realization is inside the instantaneous MAC capacity region. The key step in our solution is an optimal rate allocation function for any given set of distributed power control laws at the transmitters. This also allows us to characterize the optimal power control for a wide class of fading models. Further extensions are also proposed to account for more general CSI availability at the transmitters.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAUhmEvDKiwMyHfQIId-7T2WAUKSK2oUPfoxD9gyTiR7fJz91Bg-pZXn_QQcsVZKxUAu8H8Gd5bLplupVT6nOxvQ6k5jMfqLH3G6uja4lyxhilRTJbupw-XaT-lmqdIQ6IbtCG90N0x1jDHn94YVwrtXzElF8sFOfMYi7v83wU5bO4O_UOzfbp_7NfbBpegG96hQgGqYx5ACnDABMdlZ7hhHL2RqD1wbVbWoNKjHa2UTuiVceBHAV4syPXf7a9omHN4w_w1nGTDSSa-AZWySTw</recordid><startdate>20140915</startdate><enddate>20140915</enddate><creator>Sreekumar, Sreejith</creator><creator>Dey, Bikash K</creator><creator>Pillai, Sibi Raj B</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20140915</creationdate><title>Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels</title><author>Sreekumar, Sreejith ; Dey, Bikash K ; Pillai, Sibi Raj B</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a659-12a8a35820f55435e5031a62c1c01afc4a9f519c7dca89bdbd44e397ce5fb35f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Sreekumar, Sreejith</creatorcontrib><creatorcontrib>Dey, Bikash K</creatorcontrib><creatorcontrib>Pillai, Sibi Raj B</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sreekumar, Sreejith</au><au>Dey, Bikash K</au><au>Pillai, Sibi Raj B</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels</atitle><date>2014-09-15</date><risdate>2014</risdate><abstract>Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the communication parameters like transmit power and data-rate are jointly chosen for every fading vector realization. On the other hand, in fast-fading links with distributed CSIT, the lack of full CSI is compensated by performing ergodic averaging over sufficiently many channel realizations. Notice that the distributed CSI may necessitate decentralized power-control for optimal data-transfer. Apart from these two models, the case of slow-fading links and distributed CSIT, though relevant to many systems, has received much less attention. In this paper, a block-fading AWGN MAC with full CSI at the receiver and distributed CSI at the transmitters is considered. The links undergo independent fading, but otherwise have arbitrary fading distributions. The channel statistics and respective long-term average transmit powers are known to all parties. We first consider the case where each encoder has knowledge only of its own link quality, and not of others. For this model, we compute the adaptive capacity region, i.e. the collection of average rate-tuples under block-wise coding/decoding such that the rate-tuple for every fading realization is inside the instantaneous MAC capacity region. The key step in our solution is an optimal rate allocation function for any given set of distributed power control laws at the transmitters. This also allows us to characterize the optimal power control for a wide class of fading models. Further extensions are also proposed to account for more general CSI availability at the transmitters.</abstract><doi>10.48550/arxiv.1409.4489</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1409.4489
ispartof
issn
language eng
recordid cdi_arxiv_primary_1409_4489
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
title Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T17%3A57%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Distributed%20Rate%20Adaptation%20and%20Power%20Control%20in%20Fading%20Multiple%20Access%20Channels&rft.au=Sreekumar,%20Sreejith&rft.date=2014-09-15&rft_id=info:doi/10.48550/arxiv.1409.4489&rft_dat=%3Carxiv_GOX%3E1409_4489%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true