Scheduling strategy for wireless channel under delay constraint

In this paper, the scheduling strategy of minimizing power under delay constraint is proposed in wireless channel. The problem is first formulated as an unconstrained Markov Decision Process (MDP) and solved by dynamic programming. But its final decision which is made over all processes instead of i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Dian zi yu xin xi xue bao = Journal of electronics & information technology 2008-04, Vol.30 (4), p.788-791
Hauptverfasser: Peng, Lie-Xin, Zhu, Guang-Xi, Cai, De-Jun
Format: Artikel
Sprache:chi
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 791
container_issue 4
container_start_page 788
container_title Dian zi yu xin xi xue bao = Journal of electronics & information technology
container_volume 30
creator Peng, Lie-Xin
Zhu, Guang-Xi
Cai, De-Jun
description In this paper, the scheduling strategy of minimizing power under delay constraint is proposed in wireless channel. The problem is first formulated as an unconstrained Markov Decision Process (MDP) and solved by dynamic programming. But its final decision which is made over all processes instead of individual one make it with high convexity and bad real time property. So a simple strategy which is based on the current channel state and queue length is given for its good real time property and simple arithmetic. And by this strategy the steady-state distribution of the queue exists, which makes the queue stable. Finally, the simulation results show the performance of the simple strategy is approximate to the optimal one.
doi_str_mv 10.3724/sp.j.1146.2006.01583
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_33479917</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>33479917</sourcerecordid><originalsourceid>FETCH-LOGICAL-p101t-453b43b08ea711a68c6036c7f05389dc799d02a02bd055ecc856b84d98d557743</originalsourceid><addsrcrecordid>eNotzLtOwzAUgGEPIFGVvgGDJ7aE4xxfJ4QqblIlBmCuHPukDTJOiROhvj0gOv3Lr4-xKwE1mkbelEP9UQshdd0A6BqEsnjGFgLAVco6fcFWpfQtNCi0AcAFu30Ne4pz6vOOl2n0E-2OvBtG_t2PlKgUHvY-Z0p8zpFGHin5Iw9D_pv7PF2y886nQqtTl-z94f5t_VRtXh6f13eb6iBATJVU2EpswZI3QnhtgwbUwXSg0LoYjHMRGg9NG0EpCsEq3VoZnY1KGSNxya7_3cM4fM1Upu1nXwKl5DMNc9kiyl9DGPwB6jRMrQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>33479917</pqid></control><display><type>article</type><title>Scheduling strategy for wireless channel under delay constraint</title><source>Alma/SFX Local Collection</source><creator>Peng, Lie-Xin ; Zhu, Guang-Xi ; Cai, De-Jun</creator><creatorcontrib>Peng, Lie-Xin ; Zhu, Guang-Xi ; Cai, De-Jun</creatorcontrib><description>In this paper, the scheduling strategy of minimizing power under delay constraint is proposed in wireless channel. The problem is first formulated as an unconstrained Markov Decision Process (MDP) and solved by dynamic programming. But its final decision which is made over all processes instead of individual one make it with high convexity and bad real time property. So a simple strategy which is based on the current channel state and queue length is given for its good real time property and simple arithmetic. And by this strategy the steady-state distribution of the queue exists, which makes the queue stable. Finally, the simulation results show the performance of the simple strategy is approximate to the optimal one.</description><identifier>ISSN: 1009-5896</identifier><identifier>DOI: 10.3724/sp.j.1146.2006.01583</identifier><language>chi</language><ispartof>Dian zi yu xin xi xue bao = Journal of electronics &amp; information technology, 2008-04, Vol.30 (4), p.788-791</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Peng, Lie-Xin</creatorcontrib><creatorcontrib>Zhu, Guang-Xi</creatorcontrib><creatorcontrib>Cai, De-Jun</creatorcontrib><title>Scheduling strategy for wireless channel under delay constraint</title><title>Dian zi yu xin xi xue bao = Journal of electronics &amp; information technology</title><description>In this paper, the scheduling strategy of minimizing power under delay constraint is proposed in wireless channel. The problem is first formulated as an unconstrained Markov Decision Process (MDP) and solved by dynamic programming. But its final decision which is made over all processes instead of individual one make it with high convexity and bad real time property. So a simple strategy which is based on the current channel state and queue length is given for its good real time property and simple arithmetic. And by this strategy the steady-state distribution of the queue exists, which makes the queue stable. Finally, the simulation results show the performance of the simple strategy is approximate to the optimal one.</description><issn>1009-5896</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNotzLtOwzAUgGEPIFGVvgGDJ7aE4xxfJ4QqblIlBmCuHPukDTJOiROhvj0gOv3Lr4-xKwE1mkbelEP9UQshdd0A6BqEsnjGFgLAVco6fcFWpfQtNCi0AcAFu30Ne4pz6vOOl2n0E-2OvBtG_t2PlKgUHvY-Z0p8zpFGHin5Iw9D_pv7PF2y886nQqtTl-z94f5t_VRtXh6f13eb6iBATJVU2EpswZI3QnhtgwbUwXSg0LoYjHMRGg9NG0EpCsEq3VoZnY1KGSNxya7_3cM4fM1Upu1nXwKl5DMNc9kiyl9DGPwB6jRMrQ</recordid><startdate>20080401</startdate><enddate>20080401</enddate><creator>Peng, Lie-Xin</creator><creator>Zhu, Guang-Xi</creator><creator>Cai, De-Jun</creator><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080401</creationdate><title>Scheduling strategy for wireless channel under delay constraint</title><author>Peng, Lie-Xin ; Zhu, Guang-Xi ; Cai, De-Jun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p101t-453b43b08ea711a68c6036c7f05389dc799d02a02bd055ecc856b84d98d557743</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>chi</language><creationdate>2008</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Peng, Lie-Xin</creatorcontrib><creatorcontrib>Zhu, Guang-Xi</creatorcontrib><creatorcontrib>Cai, De-Jun</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Dian zi yu xin xi xue bao = Journal of electronics &amp; information technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Peng, Lie-Xin</au><au>Zhu, Guang-Xi</au><au>Cai, De-Jun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scheduling strategy for wireless channel under delay constraint</atitle><jtitle>Dian zi yu xin xi xue bao = Journal of electronics &amp; information technology</jtitle><date>2008-04-01</date><risdate>2008</risdate><volume>30</volume><issue>4</issue><spage>788</spage><epage>791</epage><pages>788-791</pages><issn>1009-5896</issn><abstract>In this paper, the scheduling strategy of minimizing power under delay constraint is proposed in wireless channel. The problem is first formulated as an unconstrained Markov Decision Process (MDP) and solved by dynamic programming. But its final decision which is made over all processes instead of individual one make it with high convexity and bad real time property. So a simple strategy which is based on the current channel state and queue length is given for its good real time property and simple arithmetic. And by this strategy the steady-state distribution of the queue exists, which makes the queue stable. Finally, the simulation results show the performance of the simple strategy is approximate to the optimal one.</abstract><doi>10.3724/sp.j.1146.2006.01583</doi><tpages>4</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1009-5896
ispartof Dian zi yu xin xi xue bao = Journal of electronics & information technology, 2008-04, Vol.30 (4), p.788-791
issn 1009-5896
language chi
recordid cdi_proquest_miscellaneous_33479917
source Alma/SFX Local Collection
title Scheduling strategy for wireless channel under delay constraint
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T20%3A36%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Scheduling%20strategy%20for%20wireless%20channel%20under%20delay%20constraint&rft.jtitle=Dian%20zi%20yu%20xin%20xi%20xue%20bao%20=%20Journal%20of%20electronics%20&%20information%20technology&rft.au=Peng,%20Lie-Xin&rft.date=2008-04-01&rft.volume=30&rft.issue=4&rft.spage=788&rft.epage=791&rft.pages=788-791&rft.issn=1009-5896&rft_id=info:doi/10.3724/sp.j.1146.2006.01583&rft_dat=%3Cproquest%3E33479917%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=33479917&rft_id=info:pmid/&rfr_iscdi=true