Leveraging Parallel Communications for Minimizing Energy Consumption on Smartphones

Recent energy measurements on smartphones have shown that parallel communications (e.g., data transfer and voice call) require less energy than their stand-alone execution. Guided by these results, we investigate the possibility of scheduling communications in pairs for minimizing the energy consump...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems 2015-10, Vol.26 (10), p.2778-2790
Hauptverfasser: Conti, Mauro, Crispo, Bruno, Diodati, Daniele, Nurminen, Jukka K., Pinotti, Cristina M., Teemaa, Taavi
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 2790
container_issue 10
container_start_page 2778
container_title IEEE transactions on parallel and distributed systems
container_volume 26
creator Conti, Mauro
Crispo, Bruno
Diodati, Daniele
Nurminen, Jukka K.
Pinotti, Cristina M.
Teemaa, Taavi
description Recent energy measurements on smartphones have shown that parallel communications (e.g., data transfer and voice call) require less energy than their stand-alone execution. Guided by these results, we investigate the possibility of scheduling communications in pairs for minimizing the energy consumption. We define two energy optimization problems to postpone delay-tolerant services and perform them in parallel with real-time services in order to save energy. The first problem, called single delay-tolerant assignment (SDA), allows at most one delay-tolerant service to be paired with each real-time service, whereas the second problem, called multiple delay-tolerant assignment (MDA), allows multiple delay-tolerant services to be paired (in different times) with the same real-time service. For the SDA problem, we propose an optimal algorithm. For the MDA problem, which is computationally intractable, we give an approximation algorithm. We evaluate the benefits of the energy-efficient pairing strategy via simulations on synthetic traces. The MDA algorithm can save up to the 60 percent of the energy consumption using 4G network assuming an intensive smartphone usage, while the SDA algorithm saves up to the 20 percent.
doi_str_mv 10.1109/TPDS.2014.2360693
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1729166104</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6912987</ieee_id><sourcerecordid>3855191681</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-b9af80241bf5b5354b34d17163a1a564c6cf0e1529be92bfad5028def121bd6a3</originalsourceid><addsrcrecordid>eNo9kFtLwzAUgIMoOKc_QHwp-NyZkzRZ8yhzXmDiYPM5pG0yM9q0Jq0wf70pG8KBcx6-c_sQugU8A8DiYbt-2swIhmxGKMdc0DM0AcbylEBOz2ONM5YKAuISXYWwx5FkOJugzUr_aK921u2StfKqrnWdLNqmGZwtVW9bFxLT-uTdOtvY3xFbOu13hwi5MDTdiCQxNo3yfffVOh2u0YVRddA3pzxFn8_L7eI1XX28vC0eV2lJBO3TQiiTY5JBYVjBKMsKmlUwB04VKMazkpcGa2BEFFqQwqiKYZJX2gCBouKKTtH9cW7n2-9Bh17u28G7uFLCnAjgPH4dKThSpW9D8NrIztt47EEClqM7ObqTozt5chd77o49Vmv9z3MBRORz-geevmu9</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1729166104</pqid></control><display><type>article</type><title>Leveraging Parallel Communications for Minimizing Energy Consumption on Smartphones</title><source>IEEE Electronic Library (IEL)</source><creator>Conti, Mauro ; Crispo, Bruno ; Diodati, Daniele ; Nurminen, Jukka K. ; Pinotti, Cristina M. ; Teemaa, Taavi</creator><creatorcontrib>Conti, Mauro ; Crispo, Bruno ; Diodati, Daniele ; Nurminen, Jukka K. ; Pinotti, Cristina M. ; Teemaa, Taavi</creatorcontrib><description>Recent energy measurements on smartphones have shown that parallel communications (e.g., data transfer and voice call) require less energy than their stand-alone execution. Guided by these results, we investigate the possibility of scheduling communications in pairs for minimizing the energy consumption. We define two energy optimization problems to postpone delay-tolerant services and perform them in parallel with real-time services in order to save energy. The first problem, called single delay-tolerant assignment (SDA), allows at most one delay-tolerant service to be paired with each real-time service, whereas the second problem, called multiple delay-tolerant assignment (MDA), allows multiple delay-tolerant services to be paired (in different times) with the same real-time service. For the SDA problem, we propose an optimal algorithm. For the MDA problem, which is computationally intractable, we give an approximation algorithm. We evaluate the benefits of the energy-efficient pairing strategy via simulations on synthetic traces. The MDA algorithm can save up to the 60 percent of the energy consumption using 4G network assuming an intensive smartphone usage, while the SDA algorithm saves up to the 20 percent.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/TPDS.2014.2360693</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Approximation algorithms ; Delay-Tolerant Services ; Energy consumption ; Energy Saving ; Generalized Assignment Problem ; IEEE 802.11 Standards ; Internet ; Maximum Weighted Matching ; Measurements ; Parallel Communications ; Polynomials ; Real-time systems ; Smart phones ; Smartphones</subject><ispartof>IEEE transactions on parallel and distributed systems, 2015-10, Vol.26 (10), p.2778-2790</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-b9af80241bf5b5354b34d17163a1a564c6cf0e1529be92bfad5028def121bd6a3</citedby><cites>FETCH-LOGICAL-c293t-b9af80241bf5b5354b34d17163a1a564c6cf0e1529be92bfad5028def121bd6a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6912987$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6912987$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Conti, Mauro</creatorcontrib><creatorcontrib>Crispo, Bruno</creatorcontrib><creatorcontrib>Diodati, Daniele</creatorcontrib><creatorcontrib>Nurminen, Jukka K.</creatorcontrib><creatorcontrib>Pinotti, Cristina M.</creatorcontrib><creatorcontrib>Teemaa, Taavi</creatorcontrib><title>Leveraging Parallel Communications for Minimizing Energy Consumption on Smartphones</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>Recent energy measurements on smartphones have shown that parallel communications (e.g., data transfer and voice call) require less energy than their stand-alone execution. Guided by these results, we investigate the possibility of scheduling communications in pairs for minimizing the energy consumption. We define two energy optimization problems to postpone delay-tolerant services and perform them in parallel with real-time services in order to save energy. The first problem, called single delay-tolerant assignment (SDA), allows at most one delay-tolerant service to be paired with each real-time service, whereas the second problem, called multiple delay-tolerant assignment (MDA), allows multiple delay-tolerant services to be paired (in different times) with the same real-time service. For the SDA problem, we propose an optimal algorithm. For the MDA problem, which is computationally intractable, we give an approximation algorithm. We evaluate the benefits of the energy-efficient pairing strategy via simulations on synthetic traces. The MDA algorithm can save up to the 60 percent of the energy consumption using 4G network assuming an intensive smartphone usage, while the SDA algorithm saves up to the 20 percent.</description><subject>Algorithms</subject><subject>Approximation algorithms</subject><subject>Delay-Tolerant Services</subject><subject>Energy consumption</subject><subject>Energy Saving</subject><subject>Generalized Assignment Problem</subject><subject>IEEE 802.11 Standards</subject><subject>Internet</subject><subject>Maximum Weighted Matching</subject><subject>Measurements</subject><subject>Parallel Communications</subject><subject>Polynomials</subject><subject>Real-time systems</subject><subject>Smart phones</subject><subject>Smartphones</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kFtLwzAUgIMoOKc_QHwp-NyZkzRZ8yhzXmDiYPM5pG0yM9q0Jq0wf70pG8KBcx6-c_sQugU8A8DiYbt-2swIhmxGKMdc0DM0AcbylEBOz2ONM5YKAuISXYWwx5FkOJugzUr_aK921u2StfKqrnWdLNqmGZwtVW9bFxLT-uTdOtvY3xFbOu13hwi5MDTdiCQxNo3yfffVOh2u0YVRddA3pzxFn8_L7eI1XX28vC0eV2lJBO3TQiiTY5JBYVjBKMsKmlUwB04VKMazkpcGa2BEFFqQwqiKYZJX2gCBouKKTtH9cW7n2-9Bh17u28G7uFLCnAjgPH4dKThSpW9D8NrIztt47EEClqM7ObqTozt5chd77o49Vmv9z3MBRORz-geevmu9</recordid><startdate>20151001</startdate><enddate>20151001</enddate><creator>Conti, Mauro</creator><creator>Crispo, Bruno</creator><creator>Diodati, Daniele</creator><creator>Nurminen, Jukka K.</creator><creator>Pinotti, Cristina M.</creator><creator>Teemaa, Taavi</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>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>20151001</creationdate><title>Leveraging Parallel Communications for Minimizing Energy Consumption on Smartphones</title><author>Conti, Mauro ; Crispo, Bruno ; Diodati, Daniele ; Nurminen, Jukka K. ; Pinotti, Cristina M. ; Teemaa, Taavi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-b9af80241bf5b5354b34d17163a1a564c6cf0e1529be92bfad5028def121bd6a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Approximation algorithms</topic><topic>Delay-Tolerant Services</topic><topic>Energy consumption</topic><topic>Energy Saving</topic><topic>Generalized Assignment Problem</topic><topic>IEEE 802.11 Standards</topic><topic>Internet</topic><topic>Maximum Weighted Matching</topic><topic>Measurements</topic><topic>Parallel Communications</topic><topic>Polynomials</topic><topic>Real-time systems</topic><topic>Smart phones</topic><topic>Smartphones</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Conti, Mauro</creatorcontrib><creatorcontrib>Crispo, Bruno</creatorcontrib><creatorcontrib>Diodati, Daniele</creatorcontrib><creatorcontrib>Nurminen, Jukka K.</creatorcontrib><creatorcontrib>Pinotti, Cristina M.</creatorcontrib><creatorcontrib>Teemaa, Taavi</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) Online</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><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>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Conti, Mauro</au><au>Crispo, Bruno</au><au>Diodati, Daniele</au><au>Nurminen, Jukka K.</au><au>Pinotti, Cristina M.</au><au>Teemaa, Taavi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Leveraging Parallel Communications for Minimizing Energy Consumption on Smartphones</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>2015-10-01</date><risdate>2015</risdate><volume>26</volume><issue>10</issue><spage>2778</spage><epage>2790</epage><pages>2778-2790</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>Recent energy measurements on smartphones have shown that parallel communications (e.g., data transfer and voice call) require less energy than their stand-alone execution. Guided by these results, we investigate the possibility of scheduling communications in pairs for minimizing the energy consumption. We define two energy optimization problems to postpone delay-tolerant services and perform them in parallel with real-time services in order to save energy. The first problem, called single delay-tolerant assignment (SDA), allows at most one delay-tolerant service to be paired with each real-time service, whereas the second problem, called multiple delay-tolerant assignment (MDA), allows multiple delay-tolerant services to be paired (in different times) with the same real-time service. For the SDA problem, we propose an optimal algorithm. For the MDA problem, which is computationally intractable, we give an approximation algorithm. We evaluate the benefits of the energy-efficient pairing strategy via simulations on synthetic traces. The MDA algorithm can save up to the 60 percent of the energy consumption using 4G network assuming an intensive smartphone usage, while the SDA algorithm saves up to the 20 percent.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TPDS.2014.2360693</doi><tpages>13</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1045-9219
ispartof IEEE transactions on parallel and distributed systems, 2015-10, Vol.26 (10), p.2778-2790
issn 1045-9219
1558-2183
language eng
recordid cdi_proquest_journals_1729166104
source IEEE Electronic Library (IEL)
subjects Algorithms
Approximation algorithms
Delay-Tolerant Services
Energy consumption
Energy Saving
Generalized Assignment Problem
IEEE 802.11 Standards
Internet
Maximum Weighted Matching
Measurements
Parallel Communications
Polynomials
Real-time systems
Smart phones
Smartphones
title Leveraging Parallel Communications for Minimizing Energy Consumption on Smartphones
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T20%3A05%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Leveraging%20Parallel%20Communications%20for%20Minimizing%20Energy%20Consumption%20on%20Smartphones&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Conti,%20Mauro&rft.date=2015-10-01&rft.volume=26&rft.issue=10&rft.spage=2778&rft.epage=2790&rft.pages=2778-2790&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/TPDS.2014.2360693&rft_dat=%3Cproquest_RIE%3E3855191681%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1729166104&rft_id=info:pmid/&rft_ieee_id=6912987&rfr_iscdi=true