Throughput analysis in wireless networks with multiple users and multiple channels
We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incurred due to link adaptation. The contributions of this paper are twofold. Firstly, several high performance algorithms (offline an...
Gespeichert in:
| Veröffentlicht in: | Acta informatica 2006-10, Vol.43 (3), p.147-164 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 164 |
|---|---|
| container_issue | 3 |
| container_start_page | 147 |
| container_title | Acta informatica |
| container_volume | 43 |
| creator | ARORA, Amrinder FANCHUN JIN SAHIN, Gokhan MAHMOUD, Hosam CHOI, Hyeong-Ah |
| description | We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incurred due to link adaptation. The contributions of this paper are twofold. Firstly, several high performance algorithms (offline and online) are developed for efficient performance in multiple user and multiple channel environment under the practicable lookahead prediction of one time slot. Secondly, the presented algorithms and heuristics are shown to be competitive by deterministic and probabilistic analyses. Our results show that a modest consumption of resources for channel prediction and link adaptation may result in a significant throughput improvement. [PUBLICATION ABSTRACT] |
| doi_str_mv | 10.1007/s00236-006-0012-1 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1677993560</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1677993560</sourcerecordid><originalsourceid>FETCH-LOGICAL-c378t-3f6ef8a2d00d59bcbb07b54a7b9f67d5af7c987fd6625f45d33ff56ed0911ee43</originalsourceid><addsrcrecordid>eNpdkF9LwzAUxYMoOKcfwLciCL5Ub5omaR5l-A8GgsznkKaJ7czamdsy9u1tmTDw4XK5h985cA8h1xTuKYB8QICMiRRgGpql9ITMaM6yFHjGT8kMRjXlCtg5uUBcj6fMGJ2Rj1Udu-Gr3g59YloT9thg0rTJrokuOMSkdf2ui984Kn2dbIbQN9vgkgFdxNFRHSVbm7Z1AS_JmTcB3dXfnpPP56fV4jVdvr-8LR6XqWWy6FPmhfOFySqAiqvSliXIkudGlsoLWXHjpVWF9JUQGfc5rxjzngtXgaLUuZzNyd0hdxu7n8FhrzcNWheCaV03oKZCSqUYFzCiN__QdTfE8V3UmeRQMMkmiB4gGzvE6LzexmZj4l5T0FPJ-lCyHkvWU8majp7bv2CD1gQfTWsbPBoLyhVTgv0CvnZ9cQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>275083730</pqid></control><display><type>article</type><title>Throughput analysis in wireless networks with multiple users and multiple channels</title><source>SpringerLink Journals - AutoHoldings</source><creator>ARORA, Amrinder ; FANCHUN JIN ; SAHIN, Gokhan ; MAHMOUD, Hosam ; CHOI, Hyeong-Ah</creator><creatorcontrib>ARORA, Amrinder ; FANCHUN JIN ; SAHIN, Gokhan ; MAHMOUD, Hosam ; CHOI, Hyeong-Ah</creatorcontrib><description>We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incurred due to link adaptation. The contributions of this paper are twofold. Firstly, several high performance algorithms (offline and online) are developed for efficient performance in multiple user and multiple channel environment under the practicable lookahead prediction of one time slot. Secondly, the presented algorithms and heuristics are shown to be competitive by deterministic and probabilistic analyses. Our results show that a modest consumption of resources for channel prediction and link adaptation may result in a significant throughput improvement. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 0001-5903</identifier><identifier>EISSN: 1432-0525</identifier><identifier>DOI: 10.1007/s00236-006-0012-1</identifier><identifier>CODEN: AINFA2</identifier><language>eng</language><publisher>Berlin: Springer</publisher><subject>Adaptation ; Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Channels ; Computer science; control theory; systems ; Consumption ; Data transmission ; Exact sciences and technology ; Heuristic ; Information, signal and communications theory ; Links ; Mathematical methods ; Mathematical programming ; Online ; Operational research and scientific management ; Operational research. Management science ; Probabilistic analysis ; Routing ; Scheduling ; Studies ; Systems stability ; Telecommunications and information theory ; Theoretical computing ; Wireless networks</subject><ispartof>Acta informatica, 2006-10, Vol.43 (3), p.147-164</ispartof><rights>2006 INIST-CNRS</rights><rights>Springer-Verlag 2006</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c378t-3f6ef8a2d00d59bcbb07b54a7b9f67d5af7c987fd6625f45d33ff56ed0911ee43</citedby><cites>FETCH-LOGICAL-c378t-3f6ef8a2d00d59bcbb07b54a7b9f67d5af7c987fd6625f45d33ff56ed0911ee43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18159396$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>ARORA, Amrinder</creatorcontrib><creatorcontrib>FANCHUN JIN</creatorcontrib><creatorcontrib>SAHIN, Gokhan</creatorcontrib><creatorcontrib>MAHMOUD, Hosam</creatorcontrib><creatorcontrib>CHOI, Hyeong-Ah</creatorcontrib><title>Throughput analysis in wireless networks with multiple users and multiple channels</title><title>Acta informatica</title><description>We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incurred due to link adaptation. The contributions of this paper are twofold. Firstly, several high performance algorithms (offline and online) are developed for efficient performance in multiple user and multiple channel environment under the practicable lookahead prediction of one time slot. Secondly, the presented algorithms and heuristics are shown to be competitive by deterministic and probabilistic analyses. Our results show that a modest consumption of resources for channel prediction and link adaptation may result in a significant throughput improvement. [PUBLICATION ABSTRACT]</description><subject>Adaptation</subject><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Channels</subject><subject>Computer science; control theory; systems</subject><subject>Consumption</subject><subject>Data transmission</subject><subject>Exact sciences and technology</subject><subject>Heuristic</subject><subject>Information, signal and communications theory</subject><subject>Links</subject><subject>Mathematical methods</subject><subject>Mathematical programming</subject><subject>Online</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Probabilistic analysis</subject><subject>Routing</subject><subject>Scheduling</subject><subject>Studies</subject><subject>Systems stability</subject><subject>Telecommunications and information theory</subject><subject>Theoretical computing</subject><subject>Wireless networks</subject><issn>0001-5903</issn><issn>1432-0525</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpdkF9LwzAUxYMoOKcfwLciCL5Ub5omaR5l-A8GgsznkKaJ7czamdsy9u1tmTDw4XK5h985cA8h1xTuKYB8QICMiRRgGpql9ITMaM6yFHjGT8kMRjXlCtg5uUBcj6fMGJ2Rj1Udu-Gr3g59YloT9thg0rTJrokuOMSkdf2ui984Kn2dbIbQN9vgkgFdxNFRHSVbm7Z1AS_JmTcB3dXfnpPP56fV4jVdvr-8LR6XqWWy6FPmhfOFySqAiqvSliXIkudGlsoLWXHjpVWF9JUQGfc5rxjzngtXgaLUuZzNyd0hdxu7n8FhrzcNWheCaV03oKZCSqUYFzCiN__QdTfE8V3UmeRQMMkmiB4gGzvE6LzexmZj4l5T0FPJ-lCyHkvWU8majp7bv2CD1gQfTWsbPBoLyhVTgv0CvnZ9cQ</recordid><startdate>20061001</startdate><enddate>20061001</enddate><creator>ARORA, Amrinder</creator><creator>FANCHUN JIN</creator><creator>SAHIN, Gokhan</creator><creator>MAHMOUD, Hosam</creator><creator>CHOI, Hyeong-Ah</creator><general>Springer</general><general>Springer Nature B.V</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L.0</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20061001</creationdate><title>Throughput analysis in wireless networks with multiple users and multiple channels</title><author>ARORA, Amrinder ; FANCHUN JIN ; SAHIN, Gokhan ; MAHMOUD, Hosam ; CHOI, Hyeong-Ah</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c378t-3f6ef8a2d00d59bcbb07b54a7b9f67d5af7c987fd6625f45d33ff56ed0911ee43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Adaptation</topic><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Channels</topic><topic>Computer science; control theory; systems</topic><topic>Consumption</topic><topic>Data transmission</topic><topic>Exact sciences and technology</topic><topic>Heuristic</topic><topic>Information, signal and communications theory</topic><topic>Links</topic><topic>Mathematical methods</topic><topic>Mathematical programming</topic><topic>Online</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Probabilistic analysis</topic><topic>Routing</topic><topic>Scheduling</topic><topic>Studies</topic><topic>Systems stability</topic><topic>Telecommunications and information theory</topic><topic>Theoretical computing</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>ARORA, Amrinder</creatorcontrib><creatorcontrib>FANCHUN JIN</creatorcontrib><creatorcontrib>SAHIN, Gokhan</creatorcontrib><creatorcontrib>MAHMOUD, Hosam</creatorcontrib><creatorcontrib>CHOI, Hyeong-Ah</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Acta informatica</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ARORA, Amrinder</au><au>FANCHUN JIN</au><au>SAHIN, Gokhan</au><au>MAHMOUD, Hosam</au><au>CHOI, Hyeong-Ah</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Throughput analysis in wireless networks with multiple users and multiple channels</atitle><jtitle>Acta informatica</jtitle><date>2006-10-01</date><risdate>2006</risdate><volume>43</volume><issue>3</issue><spage>147</spage><epage>164</epage><pages>147-164</pages><issn>0001-5903</issn><eissn>1432-0525</eissn><coden>AINFA2</coden><abstract>We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incurred due to link adaptation. The contributions of this paper are twofold. Firstly, several high performance algorithms (offline and online) are developed for efficient performance in multiple user and multiple channel environment under the practicable lookahead prediction of one time slot. Secondly, the presented algorithms and heuristics are shown to be competitive by deterministic and probabilistic analyses. Our results show that a modest consumption of resources for channel prediction and link adaptation may result in a significant throughput improvement. [PUBLICATION ABSTRACT]</abstract><cop>Berlin</cop><pub>Springer</pub><doi>10.1007/s00236-006-0012-1</doi><tpages>18</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0001-5903 |
| ispartof | Acta informatica, 2006-10, Vol.43 (3), p.147-164 |
| issn | 0001-5903 1432-0525 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1677993560 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Adaptation Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Channels Computer science control theory systems Consumption Data transmission Exact sciences and technology Heuristic Information, signal and communications theory Links Mathematical methods Mathematical programming Online Operational research and scientific management Operational research. Management science Probabilistic analysis Routing Scheduling Studies Systems stability Telecommunications and information theory Theoretical computing Wireless networks |
| title | Throughput analysis in wireless networks with multiple users and multiple 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-17T12%3A15%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Throughput%20analysis%20in%20wireless%20networks%20with%20multiple%20users%20and%20multiple%20channels&rft.jtitle=Acta%20informatica&rft.au=ARORA,%20Amrinder&rft.date=2006-10-01&rft.volume=43&rft.issue=3&rft.spage=147&rft.epage=164&rft.pages=147-164&rft.issn=0001-5903&rft.eissn=1432-0525&rft.coden=AINFA2&rft_id=info:doi/10.1007/s00236-006-0012-1&rft_dat=%3Cproquest_cross%3E1677993560%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=275083730&rft_id=info:pmid/&rfr_iscdi=true |