An efficient time slot allocation algorithm in wireless networks
Wireless communication networks provide convenience, however, also challenges to multimedia services due to typically limited bandwidth and various Quality of Service (QoS) requirements. For a wireless communication network service provider/administrator, it is then essential to develop an effective...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 328 |
---|---|
container_issue | |
container_start_page | 322 |
container_title | |
container_volume | |
creator | Lin, Frank Yeong-Sung Cheng-Ta Lee Li-Yi Lin |
description | Wireless communication networks provide convenience, however, also challenges to multimedia services due to typically limited bandwidth and various Quality of Service (QoS) requirements. For a wireless communication network service provider/administrator, it is then essential to develop an effective resource allocation policy so as to fully satisfy possibly different QoS requirements by different classes of traffic; while in the meantime, for example, the overall long-term system revenue rate can be maximized. In this paper, we consider the problem of time slot allocation for multiple classes of traffic in wireless networks under throughput and delay constraints. To solve the problem, we propose an algorithm that is a novel combination of the Markovian decision process (MDP) and Lagrangean relaxation (LR). Another primal heuristic based on the policy enhancement algorithm is also developed for comparison purposes. Our experiment results show that the proposed approach can find a near optimal time slot allocation policy to maximize long-term system revenue under QoS requirements. |
doi_str_mv | 10.1109/WCINS.2010.5542311 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5542311</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5542311</ieee_id><sourcerecordid>5542311</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1341-e407826869623b3f0c2ca59364155297b62a391f366214f09981d8ca8b3004913</originalsourceid><addsrcrecordid>eNo9j89KAzEYxCMiqLUvoJe8wNZ8-dfkZlm0FooeVDyWbPyi0d2sJIHi27tgcS4zv8swQ8glsAUAs9ev7ebhacHZxEpJLgCOyDlILqUy0prjf1AMTsm8lE82SSqulT4jN6tEMYToI6ZKaxyQln6s1PX96F2NY5ri-5hj_RhoTHQfM_ZYCk1Y92P-KhfkJLi-4PzgM_Jyd_vc3jfbx_WmXW2bCEJCg5ItDddGW81FJwLz3DtlhZagFLfLTnMnLAShNQcZmLUG3ox3phPTWAtiRq7-eiMi7r5zHFz-2R0ei18JiUhE</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An efficient time slot allocation algorithm in wireless networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Lin, Frank Yeong-Sung ; Cheng-Ta Lee ; Li-Yi Lin</creator><creatorcontrib>Lin, Frank Yeong-Sung ; Cheng-Ta Lee ; Li-Yi Lin</creatorcontrib><description>Wireless communication networks provide convenience, however, also challenges to multimedia services due to typically limited bandwidth and various Quality of Service (QoS) requirements. For a wireless communication network service provider/administrator, it is then essential to develop an effective resource allocation policy so as to fully satisfy possibly different QoS requirements by different classes of traffic; while in the meantime, for example, the overall long-term system revenue rate can be maximized. In this paper, we consider the problem of time slot allocation for multiple classes of traffic in wireless networks under throughput and delay constraints. To solve the problem, we propose an algorithm that is a novel combination of the Markovian decision process (MDP) and Lagrangean relaxation (LR). Another primal heuristic based on the policy enhancement algorithm is also developed for comparison purposes. Our experiment results show that the proposed approach can find a near optimal time slot allocation policy to maximize long-term system revenue under QoS requirements.</description><identifier>ISBN: 1424458501</identifier><identifier>ISBN: 9781424458509</identifier><identifier>EISBN: 1424458498</identifier><identifier>EISBN: 1424458528</identifier><identifier>EISBN: 9781424458493</identifier><identifier>EISBN: 9781424458523</identifier><identifier>DOI: 10.1109/WCINS.2010.5542311</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Base stations ; Delay estimation ; Electronic mail ; Information management ; Lagrangean relaxation ; Markovian decision process ; optimization ; Quality of service ; Resource management ; Telecommunication traffic ; Throughput ; time slot allocation ; Wireless networks</subject><ispartof>2010 IEEE International Conference on Wireless Communications, Networking and Information Security, 2010, p.322-328</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5542311$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5542311$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lin, Frank Yeong-Sung</creatorcontrib><creatorcontrib>Cheng-Ta Lee</creatorcontrib><creatorcontrib>Li-Yi Lin</creatorcontrib><title>An efficient time slot allocation algorithm in wireless networks</title><title>2010 IEEE International Conference on Wireless Communications, Networking and Information Security</title><addtitle>WCINS</addtitle><description>Wireless communication networks provide convenience, however, also challenges to multimedia services due to typically limited bandwidth and various Quality of Service (QoS) requirements. For a wireless communication network service provider/administrator, it is then essential to develop an effective resource allocation policy so as to fully satisfy possibly different QoS requirements by different classes of traffic; while in the meantime, for example, the overall long-term system revenue rate can be maximized. In this paper, we consider the problem of time slot allocation for multiple classes of traffic in wireless networks under throughput and delay constraints. To solve the problem, we propose an algorithm that is a novel combination of the Markovian decision process (MDP) and Lagrangean relaxation (LR). Another primal heuristic based on the policy enhancement algorithm is also developed for comparison purposes. Our experiment results show that the proposed approach can find a near optimal time slot allocation policy to maximize long-term system revenue under QoS requirements.</description><subject>Bandwidth</subject><subject>Base stations</subject><subject>Delay estimation</subject><subject>Electronic mail</subject><subject>Information management</subject><subject>Lagrangean relaxation</subject><subject>Markovian decision process</subject><subject>optimization</subject><subject>Quality of service</subject><subject>Resource management</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><subject>time slot allocation</subject><subject>Wireless networks</subject><isbn>1424458501</isbn><isbn>9781424458509</isbn><isbn>1424458498</isbn><isbn>1424458528</isbn><isbn>9781424458493</isbn><isbn>9781424458523</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9j89KAzEYxCMiqLUvoJe8wNZ8-dfkZlm0FooeVDyWbPyi0d2sJIHi27tgcS4zv8swQ8glsAUAs9ev7ebhacHZxEpJLgCOyDlILqUy0prjf1AMTsm8lE82SSqulT4jN6tEMYToI6ZKaxyQln6s1PX96F2NY5ri-5hj_RhoTHQfM_ZYCk1Y92P-KhfkJLi-4PzgM_Jyd_vc3jfbx_WmXW2bCEJCg5ItDddGW81FJwLz3DtlhZagFLfLTnMnLAShNQcZmLUG3ox3phPTWAtiRq7-eiMi7r5zHFz-2R0ei18JiUhE</recordid><startdate>201006</startdate><enddate>201006</enddate><creator>Lin, Frank Yeong-Sung</creator><creator>Cheng-Ta Lee</creator><creator>Li-Yi Lin</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201006</creationdate><title>An efficient time slot allocation algorithm in wireless networks</title><author>Lin, Frank Yeong-Sung ; Cheng-Ta Lee ; Li-Yi Lin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1341-e407826869623b3f0c2ca59364155297b62a391f366214f09981d8ca8b3004913</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Bandwidth</topic><topic>Base stations</topic><topic>Delay estimation</topic><topic>Electronic mail</topic><topic>Information management</topic><topic>Lagrangean relaxation</topic><topic>Markovian decision process</topic><topic>optimization</topic><topic>Quality of service</topic><topic>Resource management</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><topic>time slot allocation</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Lin, Frank Yeong-Sung</creatorcontrib><creatorcontrib>Cheng-Ta Lee</creatorcontrib><creatorcontrib>Li-Yi Lin</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEL</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lin, Frank Yeong-Sung</au><au>Cheng-Ta Lee</au><au>Li-Yi Lin</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An efficient time slot allocation algorithm in wireless networks</atitle><btitle>2010 IEEE International Conference on Wireless Communications, Networking and Information Security</btitle><stitle>WCINS</stitle><date>2010-06</date><risdate>2010</risdate><spage>322</spage><epage>328</epage><pages>322-328</pages><isbn>1424458501</isbn><isbn>9781424458509</isbn><eisbn>1424458498</eisbn><eisbn>1424458528</eisbn><eisbn>9781424458493</eisbn><eisbn>9781424458523</eisbn><abstract>Wireless communication networks provide convenience, however, also challenges to multimedia services due to typically limited bandwidth and various Quality of Service (QoS) requirements. For a wireless communication network service provider/administrator, it is then essential to develop an effective resource allocation policy so as to fully satisfy possibly different QoS requirements by different classes of traffic; while in the meantime, for example, the overall long-term system revenue rate can be maximized. In this paper, we consider the problem of time slot allocation for multiple classes of traffic in wireless networks under throughput and delay constraints. To solve the problem, we propose an algorithm that is a novel combination of the Markovian decision process (MDP) and Lagrangean relaxation (LR). Another primal heuristic based on the policy enhancement algorithm is also developed for comparison purposes. Our experiment results show that the proposed approach can find a near optimal time slot allocation policy to maximize long-term system revenue under QoS requirements.</abstract><pub>IEEE</pub><doi>10.1109/WCINS.2010.5542311</doi><tpages>7</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 1424458501 |
ispartof | 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, 2010, p.322-328 |
issn | |
language | eng |
recordid | cdi_ieee_primary_5542311 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Bandwidth Base stations Delay estimation Electronic mail Information management Lagrangean relaxation Markovian decision process optimization Quality of service Resource management Telecommunication traffic Throughput time slot allocation Wireless networks |
title | An efficient time slot allocation algorithm in wireless networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T15%3A19%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20efficient%20time%20slot%20allocation%20algorithm%20in%20wireless%20networks&rft.btitle=2010%20IEEE%20International%20Conference%20on%20Wireless%20Communications,%20Networking%20and%20Information%20Security&rft.au=Lin,%20Frank%20Yeong-Sung&rft.date=2010-06&rft.spage=322&rft.epage=328&rft.pages=322-328&rft.isbn=1424458501&rft.isbn_list=9781424458509&rft_id=info:doi/10.1109/WCINS.2010.5542311&rft_dat=%3Cieee_6IE%3E5542311%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424458498&rft.eisbn_list=1424458528&rft.eisbn_list=9781424458493&rft.eisbn_list=9781424458523&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5542311&rfr_iscdi=true |