Loading…

Optimal Packet Scheduling on an Energy Harvesting Broadcast Link

The minimization of transmission completion time for a given number of bits per user in an energy harvesting communication system, where energy harvesting instants are known in an offline manner is considered. An achievable rate region with structural properties satisfied by the 2-user AWGN Broadcas...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2011-09, Vol.29 (8), p.1721-1731
Main Authors: Antepli, M. A., Uysal-Biyikoglu, E., Erkal, H.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c463t-32c348c4998b8f6301ff844a726381b78adf2fec40d442243dc917499c61abad3
cites cdi_FETCH-LOGICAL-c463t-32c348c4998b8f6301ff844a726381b78adf2fec40d442243dc917499c61abad3
container_end_page 1731
container_issue 8
container_start_page 1721
container_title IEEE journal on selected areas in communications
container_volume 29
creator Antepli, M. A.
Uysal-Biyikoglu, E.
Erkal, H.
description The minimization of transmission completion time for a given number of bits per user in an energy harvesting communication system, where energy harvesting instants are known in an offline manner is considered. An achievable rate region with structural properties satisfied by the 2-user AWGN Broadcast Channel capacity region is assumed. It is shown that even though all data are available at the beginning, a non-negative amount of energy from each energy harvest is deferred for later use such that the transmit power starts at its lowest value and rises as time progresses. The optimal scheduler ends the transmission to both users at the same time. Exploiting the special structure in the problem, the iterative offline algorithm, FlowRight, from earlier literature, is adapted and proved to solve this problem. The solution has polynomial complexity in the number of harvests used, and is observed to converge quickly on numerical examples.
doi_str_mv 10.1109/JSAC.2011.110920
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_919929475</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5992840</ieee_id><sourcerecordid>919929475</sourcerecordid><originalsourceid>FETCH-LOGICAL-c463t-32c348c4998b8f6301ff844a726381b78adf2fec40d442243dc917499c61abad3</originalsourceid><addsrcrecordid>eNp9kD1PwzAQhi0EEqWwI7FELLCk-OMS2xulKl-qVKTCbLmOU9KmSbETpP57HIIYGJhOd3re092D0DnBI0KwvHlejCcjign5bik-QAOSJCLGGItDNMCcsVhwkh6jE-_XGBMAQQfodr5riq0uoxdtNraJFubdZm1ZVKuoriJdRdPKutU-etTu0_qmm9-5WmdG-yaaFdXmFB3luvT27KcO0dv99HXyGM_mD0-T8Sw2kLImZtQwEAakFEuRpwyTPBcAmtOUCbLkQmc5za0BnAFQCiwzkvCAm5Topc7YEF31e3eu_mjDKWpbeGPLUle2br2SREoqgSeBvP6XJClQRrlM0oBe_kHXdeuq8IcSAgTjkrIA4R4yrvbe2VztXFDm9opg1clWnXvVuVe9-xC56COFtfYXT8KFAjD7ApvNfTk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884837923</pqid></control><display><type>article</type><title>Optimal Packet Scheduling on an Energy Harvesting Broadcast Link</title><source>IEEE Xplore (Online service)</source><creator>Antepli, M. A. ; Uysal-Biyikoglu, E. ; Erkal, H.</creator><creatorcontrib>Antepli, M. A. ; Uysal-Biyikoglu, E. ; Erkal, H.</creatorcontrib><description>The minimization of transmission completion time for a given number of bits per user in an energy harvesting communication system, where energy harvesting instants are known in an offline manner is considered. An achievable rate region with structural properties satisfied by the 2-user AWGN Broadcast Channel capacity region is assumed. It is shown that even though all data are available at the beginning, a non-negative amount of energy from each energy harvest is deferred for later use such that the transmit power starts at its lowest value and rises as time progresses. The optimal scheduler ends the transmission to both users at the same time. Exploiting the special structure in the problem, the iterative offline algorithm, FlowRight, from earlier literature, is adapted and proved to solve this problem. The solution has polynomial complexity in the number of harvests used, and is observed to converge quickly on numerical examples.</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2011.110920</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; AWGN ; AWGN broadcast channel ; Broadcasting ; Communication systems ; Energy conservation ; Energy harvesting ; Energy transmission ; Energy use ; energy-efficient scheduling ; flowright ; Harvesting ; Optimal scheduling ; Optimization ; Optimized production technology ; Packet scheduling ; Receivers ; Resource management ; Schedules ; Scheduling ; Studies</subject><ispartof>IEEE journal on selected areas in communications, 2011-09, Vol.29 (8), p.1721-1731</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2011</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c463t-32c348c4998b8f6301ff844a726381b78adf2fec40d442243dc917499c61abad3</citedby><cites>FETCH-LOGICAL-c463t-32c348c4998b8f6301ff844a726381b78adf2fec40d442243dc917499c61abad3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5992840$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Antepli, M. A.</creatorcontrib><creatorcontrib>Uysal-Biyikoglu, E.</creatorcontrib><creatorcontrib>Erkal, H.</creatorcontrib><title>Optimal Packet Scheduling on an Energy Harvesting Broadcast Link</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>The minimization of transmission completion time for a given number of bits per user in an energy harvesting communication system, where energy harvesting instants are known in an offline manner is considered. An achievable rate region with structural properties satisfied by the 2-user AWGN Broadcast Channel capacity region is assumed. It is shown that even though all data are available at the beginning, a non-negative amount of energy from each energy harvest is deferred for later use such that the transmit power starts at its lowest value and rises as time progresses. The optimal scheduler ends the transmission to both users at the same time. Exploiting the special structure in the problem, the iterative offline algorithm, FlowRight, from earlier literature, is adapted and proved to solve this problem. The solution has polynomial complexity in the number of harvests used, and is observed to converge quickly on numerical examples.</description><subject>Algorithms</subject><subject>AWGN</subject><subject>AWGN broadcast channel</subject><subject>Broadcasting</subject><subject>Communication systems</subject><subject>Energy conservation</subject><subject>Energy harvesting</subject><subject>Energy transmission</subject><subject>Energy use</subject><subject>energy-efficient scheduling</subject><subject>flowright</subject><subject>Harvesting</subject><subject>Optimal scheduling</subject><subject>Optimization</subject><subject>Optimized production technology</subject><subject>Packet scheduling</subject><subject>Receivers</subject><subject>Resource management</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Studies</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9kD1PwzAQhi0EEqWwI7FELLCk-OMS2xulKl-qVKTCbLmOU9KmSbETpP57HIIYGJhOd3re092D0DnBI0KwvHlejCcjign5bik-QAOSJCLGGItDNMCcsVhwkh6jE-_XGBMAQQfodr5riq0uoxdtNraJFubdZm1ZVKuoriJdRdPKutU-etTu0_qmm9-5WmdG-yaaFdXmFB3luvT27KcO0dv99HXyGM_mD0-T8Sw2kLImZtQwEAakFEuRpwyTPBcAmtOUCbLkQmc5za0BnAFQCiwzkvCAm5Topc7YEF31e3eu_mjDKWpbeGPLUle2br2SREoqgSeBvP6XJClQRrlM0oBe_kHXdeuq8IcSAgTjkrIA4R4yrvbe2VztXFDm9opg1clWnXvVuVe9-xC56COFtfYXT8KFAjD7ApvNfTk</recordid><startdate>201109</startdate><enddate>201109</enddate><creator>Antepli, M. A.</creator><creator>Uysal-Biyikoglu, E.</creator><creator>Erkal, H.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>201109</creationdate><title>Optimal Packet Scheduling on an Energy Harvesting Broadcast Link</title><author>Antepli, M. A. ; Uysal-Biyikoglu, E. ; Erkal, H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c463t-32c348c4998b8f6301ff844a726381b78adf2fec40d442243dc917499c61abad3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>AWGN</topic><topic>AWGN broadcast channel</topic><topic>Broadcasting</topic><topic>Communication systems</topic><topic>Energy conservation</topic><topic>Energy harvesting</topic><topic>Energy transmission</topic><topic>Energy use</topic><topic>energy-efficient scheduling</topic><topic>flowright</topic><topic>Harvesting</topic><topic>Optimal scheduling</topic><topic>Optimization</topic><topic>Optimized production technology</topic><topic>Packet scheduling</topic><topic>Receivers</topic><topic>Resource management</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Antepli, M. A.</creatorcontrib><creatorcontrib>Uysal-Biyikoglu, E.</creatorcontrib><creatorcontrib>Erkal, H.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library Online</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Antepli, M. A.</au><au>Uysal-Biyikoglu, E.</au><au>Erkal, H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal Packet Scheduling on an Energy Harvesting Broadcast Link</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2011-09</date><risdate>2011</risdate><volume>29</volume><issue>8</issue><spage>1721</spage><epage>1731</epage><pages>1721-1731</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>The minimization of transmission completion time for a given number of bits per user in an energy harvesting communication system, where energy harvesting instants are known in an offline manner is considered. An achievable rate region with structural properties satisfied by the 2-user AWGN Broadcast Channel capacity region is assumed. It is shown that even though all data are available at the beginning, a non-negative amount of energy from each energy harvest is deferred for later use such that the transmit power starts at its lowest value and rises as time progresses. The optimal scheduler ends the transmission to both users at the same time. Exploiting the special structure in the problem, the iterative offline algorithm, FlowRight, from earlier literature, is adapted and proved to solve this problem. The solution has polynomial complexity in the number of harvests used, and is observed to converge quickly on numerical examples.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2011.110920</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0733-8716
ispartof IEEE journal on selected areas in communications, 2011-09, Vol.29 (8), p.1721-1731
issn 0733-8716
1558-0008
language eng
recordid cdi_proquest_miscellaneous_919929475
source IEEE Xplore (Online service)
subjects Algorithms
AWGN
AWGN broadcast channel
Broadcasting
Communication systems
Energy conservation
Energy harvesting
Energy transmission
Energy use
energy-efficient scheduling
flowright
Harvesting
Optimal scheduling
Optimization
Optimized production technology
Packet scheduling
Receivers
Resource management
Schedules
Scheduling
Studies
title Optimal Packet Scheduling on an Energy Harvesting Broadcast Link
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T05%3A39%3A15IST&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=Optimal%20Packet%20Scheduling%20on%20an%20Energy%20Harvesting%20Broadcast%20Link&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Antepli,%20M.%20A.&rft.date=2011-09&rft.volume=29&rft.issue=8&rft.spage=1721&rft.epage=1731&rft.pages=1721-1731&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2011.110920&rft_dat=%3Cproquest_cross%3E919929475%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c463t-32c348c4998b8f6301ff844a726381b78adf2fec40d442243dc917499c61abad3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=884837923&rft_id=info:pmid/&rft_ieee_id=5992840&rfr_iscdi=true