{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:51:34Z","timestamp":1756896694589,"version":"3.41.0"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,12,19]],"date-time":"2017-12-19T00:00:00Z","timestamp":1513641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2017,12,31]]},"abstract":"<jats:p>\n            In opportunistic networks, putting devices in energy-saving mode is crucial to preserve their battery, and hence to increase the lifetime of the network and foster user participation. A popular strategy for energy saving is duty cycling. However, when in energy-saving mode, users cannot communicate with each other. The side effects of duty cycling are twofold. On the one hand, duty cycling may reduce the number of usable contacts for delivering messages, increasing\n            <jats:italic>intercontact<\/jats:italic>\n            times, and delays. On the other hand, duty cycling may break long contacts into smaller contacts, thus also reducing the capacity of the opportunistic network. Despite the potential serious effects, the role played by duty cycling in opportunistic networks has been often neglected in the literature. In order to fill this gap, in this article, we propose a general model for deriving the pairwise contact and intercontact times measured when a duty cycling policy is superimposed on the original encounter process determined only by node mobility. The model we propose is general, i.e., not bound to a specific distribution of contact and intercontact times, and very accurate, as we show exploiting two traces of real human mobility for validation. Using this model, we derive several interesting results about the properties of measured contact and intercontact times with duty cycling: their distribution, how their coefficient of variation changes depending on the duty cycle value, and how the duty cycling affects the capacity and delay of an opportunistic network. The applicability of these results is broad, ranging from performance models for opportunistic networks that factor in the duty cycling effect, to the optimisation of the duty cycle to meet a certain target performance.\n          <\/jats:p>","DOI":"10.1145\/3149007","type":"journal-article","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T14:54:00Z","timestamp":1513781640000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["What You Lose When You Snooze"],"prefix":"10.1145","volume":"2","author":[{"given":"Elisabetta","family":"Biondi","sequence":"first","affiliation":[{"name":"IIT-CNR, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiara","family":"Boldrini","sequence":"additional","affiliation":[{"name":"IIT-CNR, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Passarella","sequence":"additional","affiliation":[{"name":"IIT-CNR, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Conti","sequence":"additional","affiliation":[{"name":"IIT-CNR, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,12,19]]},"reference":[{"unstructured":"Wi-Fi Alliance. 2016. Wi-Fi Peer-to-Peer Services Technical Specification Package v1.2. Retrieved from http:\/\/www.wi-fi.org\/file\/wi-fi-peer-to-peer-services-technical-specification-package-v12  Wi-Fi Alliance. 2016. Wi-Fi Peer-to-Peer Services Technical Specification Package v1.2. Retrieved from http:\/\/www.wi-fi.org\/file\/wi-fi-peer-to-peer-services-technical-specification-package-v12","key":"e_1_2_2_1_1"},{"unstructured":"Farid Benbadis and Jeremie Leguay. 2009. CRAWDAD dataset upmc\/rollernet (v. 2009-02-02). Retrieved from http:\/\/crawdad.org\/upmc\/rollernet\/20090202.  Farid Benbadis and Jeremie Leguay. 2009. CRAWDAD dataset upmc\/rollernet (v. 2009-02-02). Retrieved from http:\/\/crawdad.org\/upmc\/rollernet\/20090202.","key":"e_1_2_2_2_1"},{"key":"e_1_2_2_3_1","volume-title":"Teugels","author":"Bingham Nicholas H.","year":"1989","unstructured":"Nicholas H. Bingham , Charles M. Goldie , and Jef L . Teugels . 1989 . Regular Variation. Vol. 27 . Cambridge University Press . Nicholas H. Bingham, Charles M. Goldie, and Jef L. Teugels. 1989. Regular Variation. Vol. 27. Cambridge University Press."},{"doi-asserted-by":"publisher","key":"e_1_2_2_4_1","DOI":"10.1145\/2641798.2641822"},{"doi-asserted-by":"crossref","unstructured":"Elisabetta Biondi Chiara Boldrini Andrea Passarella and Marco Conti. 2014. Optimal duty cycling in mobile opportunistic networks with end-to-end delay guarantees. In European Wireless. 1--6.  Elisabetta Biondi Chiara Boldrini Andrea Passarella and Marco Conti. 2014. Optimal duty cycling in mobile opportunistic networks with end-to-end delay guarantees. In European Wireless. 1--6.","key":"e_1_2_2_5_1","DOI":"10.1145\/2641798.2641822"},{"doi-asserted-by":"publisher","key":"e_1_2_2_7_1","DOI":"10.1016\/j.comcom.2014.03.028"},{"doi-asserted-by":"publisher","key":"e_1_2_2_8_1","DOI":"10.1109\/TMC.2014.2316506"},{"doi-asserted-by":"publisher","key":"e_1_2_2_9_1","DOI":"10.1109\/TMC.2015.2471299"},{"doi-asserted-by":"publisher","key":"e_1_2_2_10_1","DOI":"10.1109\/TMC.2007.1060"},{"volume-title":"Adaptive exponential beacon period protocol for power saving in delay tolerant networks","author":"Choi Bong Jun","unstructured":"Bong Jun Choi and Xuemin Shen . 2009. Adaptive exponential beacon period protocol for power saving in delay tolerant networks . In IEEE ICC\u2019 09. 1--6. Bong Jun Choi and Xuemin Shen. 2009. Adaptive exponential beacon period protocol for power saving in delay tolerant networks. In IEEE ICC\u201909. 1--6.","key":"e_1_2_2_11_1"},{"doi-asserted-by":"publisher","key":"e_1_2_2_12_1","DOI":"10.1137\/070710111"},{"doi-asserted-by":"publisher","key":"e_1_2_2_13_1","DOI":"10.1016\/j.comcom.2015.09.007"},{"volume-title":"Renewal Theory","author":"Cox David","unstructured":"David Cox . 1962. Renewal Theory . Vol. 1 . Methuen , London . David Cox. 1962. Renewal Theory. Vol. 1. Methuen, London.","key":"e_1_2_2_14_1"},{"doi-asserted-by":"publisher","key":"e_1_2_2_15_1","DOI":"10.1109\/JSAC.2007.070110"},{"doi-asserted-by":"publisher","key":"e_1_2_2_16_1","DOI":"10.1109\/TMC.2012.117"},{"key":"e_1_2_2_17_1","volume-title":"Wakeup scheduling for energy-efficient communication in opportunistic mobile networks","author":"Gao Wei","year":"2058","unstructured":"Wei Gao and Qinghua Li. 2013. Wakeup scheduling for energy-efficient communication in opportunistic mobile networks . In IEEE INFOCOM\u2019 13. 2058 --2066. Wei Gao and Qinghua Li. 2013. Wakeup scheduling for energy-efficient communication in opportunistic mobile networks. In IEEE INFOCOM\u201913. 2058--2066."},{"key":"e_1_2_2_18_1","volume-title":"Zegura","author":"Jun Hyewon","year":"2005","unstructured":"Hyewon Jun , Mostafa H. Ammar , and Ellen W . Zegura . 2005 . Power management in delay tolerant networks: A framework and knowledge-based mechanisms.. In IEEE SECON\u2019 05. 418--429. Hyewon Jun, Mostafa H. Ammar, and Ellen W. Zegura. 2005. Power management in delay tolerant networks: A framework and knowledge-based mechanisms.. In IEEE SECON\u201905. 418--429."},{"doi-asserted-by":"publisher","key":"e_1_2_2_19_1","DOI":"10.1109\/TMC.2015.2478470"},{"key":"e_1_2_2_20_1","volume-title":"CRAWDAD dataset unimi\/pmtr (v. 2008-12-01). Downloaded","author":"Meroni Paolo","year":"2008","unstructured":"Paolo Meroni , Sabrina Gaito , Elena Pagani , and Gian Paolo Rossi . 2008. CRAWDAD dataset unimi\/pmtr (v. 2008-12-01). Downloaded December 2008 from http:\/\/crawdad.org\/unimi\/pmtr\/20081201. Paolo Meroni, Sabrina Gaito, Elena Pagani, and Gian Paolo Rossi. 2008. CRAWDAD dataset unimi\/pmtr (v. 2008-12-01). Downloaded December 2008 from http:\/\/crawdad.org\/unimi\/pmtr\/20081201."},{"doi-asserted-by":"crossref","unstructured":"A. Picu T. Spyropoulos and T. Hossmann. 2012. An analysis of the information spreading delay in heterogeneous mobility DTNs. In IEEE WoWMoM\u201912. IEEE 1--10.  A. Picu T. Spyropoulos and T. Hossmann. 2012. An analysis of the information spreading delay in heterogeneous mobility DTNs. In IEEE WoWMoM\u201912. IEEE 1--10.","key":"e_1_2_2_21_1","DOI":"10.1109\/WoWMoM.2012.6263682"},{"doi-asserted-by":"publisher","key":"e_1_2_2_22_1","DOI":"10.1109\/TVT.2011.2131693"},{"doi-asserted-by":"publisher","key":"e_1_2_2_23_1","DOI":"10.1080\/03610920500476325"},{"key":"e_1_2_2_24_1","volume-title":"Vania Conan, Andrea Passarella, Raffaele Bruno, and Marco Conti.","author":"Rebecchi Filippo","year":"2015","unstructured":"Filippo Rebecchi , Marcelo Dias de Amorim , Vania Conan, Andrea Passarella, Raffaele Bruno, and Marco Conti. 2015 . Data offloading techniques in cellular networks: A survey. IEEE Communications Surveys 8 Tutorials 17, 2 (2015), 580--603. Filippo Rebecchi, Marcelo Dias de Amorim, Vania Conan, Andrea Passarella, Raffaele Bruno, and Marco Conti. 2015. Data offloading techniques in cellular networks: A survey. IEEE Communications Surveys 8 Tutorials 17, 2 (2015), 580--603."},{"doi-asserted-by":"crossref","unstructured":"H. C. Tijms and J. Wiley. 2003. A First Course in Stochastic Models. Vol. 2. Wiley Online Library.  H. C. Tijms and J. Wiley. 2003. A First Course in Stochastic Models. Vol. 2. Wiley Online Library.","key":"e_1_2_2_25_1","DOI":"10.1002\/047001363X"},{"doi-asserted-by":"publisher","key":"e_1_2_2_26_1","DOI":"10.1109\/TMC.2010.247"},{"doi-asserted-by":"publisher","key":"e_1_2_2_27_1","DOI":"10.1145\/2030652.2030664"},{"doi-asserted-by":"publisher","key":"e_1_2_2_28_1","DOI":"10.1145\/2581555.2581560"},{"doi-asserted-by":"publisher","key":"e_1_2_2_29_1","DOI":"10.1109\/TNET.2008.2008990"},{"doi-asserted-by":"publisher","key":"e_1_2_2_30_1","DOI":"10.1145\/1287853.1287882"},{"doi-asserted-by":"publisher","key":"e_1_2_2_31_1","DOI":"10.1145\/2645672.2645679"},{"doi-asserted-by":"publisher","key":"e_1_2_2_32_1","DOI":"10.1145\/2505494.2505504"},{"doi-asserted-by":"publisher","key":"e_1_2_2_33_1","DOI":"10.1109\/TVT.2013.2267236"},{"doi-asserted-by":"publisher","key":"e_1_2_2_34_1","DOI":"10.1109\/TVT.2015.2432120"},{"volume-title":"Energy saving and network connectivity tradeoff in opportunistic mobile networks","author":"Zhou Huan","unstructured":"Huan Zhou , Hongyang Zhao , and Jiming Chen . 2012. Energy saving and network connectivity tradeoff in opportunistic mobile networks . In IEEE GLOBECOM\u201912. IEEE , 524--529. Huan Zhou, Hongyang Zhao, and Jiming Chen. 2012. Energy saving and network connectivity tradeoff in opportunistic mobile networks. In IEEE GLOBECOM\u201912. IEEE, 524--529.","key":"e_1_2_2_35_1"},{"doi-asserted-by":"publisher","key":"e_1_2_2_36_1","DOI":"10.1109\/TVT.2014.2312934"},{"volume-title":"Energy-efficient contact probing in opportunistic mobile networks","author":"Zhou Huan","unstructured":"Huan Zhou , Huanyang Zheng , Jie Wu , and Jiming Chen . 2013. Energy-efficient contact probing in opportunistic mobile networks . In IEEE ICCCN\u2019 13. Huan Zhou, Huanyang Zheng, Jie Wu, and Jiming Chen. 2013. Energy-efficient contact probing in opportunistic mobile networks. In IEEE ICCCN\u201913.","key":"e_1_2_2_37_1"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3149007","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3149007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:37:02Z","timestamp":1750282622000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3149007"}},"subtitle":["How Duty Cycling Impacts on the Contact Process in Opportunistic Networks"],"short-title":[],"issued":{"date-parts":[[2017,12,19]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12,31]]}},"alternative-id":["10.1145\/3149007"],"URL":"https:\/\/doi.org\/10.1145\/3149007","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"type":"print","value":"2376-3639"},{"type":"electronic","value":"2376-3647"}],"subject":[],"published":{"date-parts":[[2017,12,19]]},"assertion":[{"value":"2016-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-12-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}