{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:39Z","timestamp":1750220859229,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T00:00:00Z","timestamp":1597190400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"RAWFIE"},{"name":"European Union\u2019s Horizon 2020 Framework Programme for Research and Innovation","award":["645220"],"award-info":[{"award-number":["645220"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2020,8,31]]},"abstract":"<jats:p>The Mobile IoT domain has been significantly expanded with the proliferation of drones and unmanned robotic devices. In this new landscape, the communication between the resource-constrained device and the fixed infrastructure is similarly expanded to include new messages of varying importance, control, and monitoring. To efficiently and effectively control the exchange of such messages subject to the stochastic nature of the underlying wireless network, we design a time-optimized, dynamic, and distributed decision-making mechanism based on the principles of the Optimal Stopping and Change Detection theories. The findings from our experimentation platform are promising and solidly supportive to a vast spectrum of real-time and latency-sensitive applications with quality-of-service requirements in mobile IoT environments.<\/jats:p>","DOI":"10.1145\/3369389","type":"journal-article","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T16:27:38Z","timestamp":1597249658000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["To Transmit or Not to Transmit"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7717-3300","authenticated-orcid":false,"given":"K.","family":"Panagidi","sequence":"first","affiliation":[{"name":"Department of Informatics 8 Telecommunications, University of Athens, Panepistimioupolis, Ilissia, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Anagnostopoulos","sequence":"additional","affiliation":[{"name":"School of Computing Science, University of Glasgow, Clasgow, Scotland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Chalvatzaras","sequence":"additional","affiliation":[{"name":"Department of Informatics 8 Telecommunications, University of Athens, Panepistimioupolis, Ilissia, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Hadjiefthymiades","sequence":"additional","affiliation":[{"name":"Department of Informatics 8 Telecommunications, University of Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,12]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"IEEE Global Communications Conference","author":"Alghamdi Ibrahim Ahmed I.","year":"2019","unstructured":"Ibrahim Ahmed I. Alghamdi , Christos Anagnostopoulos , and Dimitrios P. Pezaros . 2019. On the optimality of task offloading in mobile edge computing environments . In IEEE Global Communications Conference 2019 . Hawaii. Ibrahim Ahmed I. Alghamdi, Christos Anagnostopoulos, and Dimitrios P. Pezaros. 2019. On the optimality of task offloading in mobile edge computing environments. In IEEE Global Communications Conference 2019. Hawaii."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"C. Anagnostopoulos and S. Hadjefthymiades. 2011. Delay-tolerant delivery quality information in ad hoc networks. J. Parallel Distrib. Comput. 71(7) (2011) 974--987.  C. Anagnostopoulos and S. Hadjefthymiades. 2011. Delay-tolerant delivery quality information in ad hoc networks. J. Parallel Distrib. Comput. 71(7) (2011) 974--987.","DOI":"10.1016\/j.jpdc.2010.11.007"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"C. Anagnostopoulos and S. Hadjefthymiades. 2012. Optimal quality-aware scheduling of data consumption in mobile ad hoc networks. J. Parallel Distrib. Comput. 72(10) (Oct. 2012) 1269--1279.  C. Anagnostopoulos and S. Hadjefthymiades. 2012. Optimal quality-aware scheduling of data consumption in mobile ad hoc networks. J. Parallel Distrib. Comput. 72(10) (Oct. 2012) 1269--1279.","DOI":"10.1016\/j.jpdc.2012.05.011"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629330"},{"key":"e_1_2_1_5_1","unstructured":"ArduPilot Open Source Autopilot. Retrieved June 29 2019 from http:\/\/ardupilot.org\/.  ArduPilot Open Source Autopilot. Retrieved June 29 2019 from http:\/\/ardupilot.org\/."},{"key":"e_1_2_1_6_1","volume-title":"A new secretary problem with rank-based selection and cardinal payoffs. J. Math. Psychol. 50 (02","author":"Bearden Neil","year":"2006","unstructured":"Neil Bearden . 2006. A new secretary problem with rank-based selection and cardinal payoffs. J. Math. Psychol. 50 (02 2006 ), 58--59. DOI:https:\/\/doi.org\/10.1016\/j.jmp.2005.11.003 10.1016\/j.jmp.2005.11.003 Neil Bearden. 2006. A new secretary problem with rank-based selection and cardinal payoffs. J. Math. Psychol. 50 (02 2006), 58--59. DOI:https:\/\/doi.org\/10.1016\/j.jmp.2005.11.003"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2016.09.022"},{"key":"#cr-split#-e_1_2_1_8_1.1","doi-asserted-by":"crossref","unstructured":"Carlos Borrego Iglesias Joan Borrell and S. Robles. 2019. Efficient broadcast in opportunistic networks using optimal stopping theory. Ad Hoc Networks 88 (05 2019). DOI:https:\/\/doi.org\/10.1016\/j.adhoc.2019.01.001 10.1016\/j.adhoc.2019.01.001","DOI":"10.1016\/j.adhoc.2019.01.001"},{"key":"#cr-split#-e_1_2_1_8_1.2","doi-asserted-by":"crossref","unstructured":"Carlos Borrego Iglesias Joan Borrell and S. Robles. 2019. Efficient broadcast in opportunistic networks using optimal stopping theory. Ad Hoc Networks 88 (05 2019). DOI:https:\/\/doi.org\/10.1016\/j.adhoc.2019.01.001","DOI":"10.1016\/j.adhoc.2019.01.001"},{"key":"#cr-split#-e_1_2_1_9_1.1","doi-asserted-by":"crossref","unstructured":"Carlos Borrego Iglesias Joan Borrell and S. Robles. 2019. Hey influencer! Message delivery to social central nodes in social opportunistic networks. Comput. Commun. 137 (02 2019). DOI:https:\/\/doi.org\/10.1016\/j.comcom.2019.02.003 10.1016\/j.comcom.2019.02.003","DOI":"10.1016\/j.comcom.2019.02.003"},{"key":"#cr-split#-e_1_2_1_9_1.2","doi-asserted-by":"crossref","unstructured":"Carlos Borrego Iglesias Joan Borrell and S. Robles. 2019. Hey influencer! Message delivery to social central nodes in social opportunistic networks. Comput. Commun. 137 (02 2019). DOI:https:\/\/doi.org\/10.1016\/j.comcom.2019.02.003","DOI":"10.1016\/j.comcom.2019.02.003"},{"key":"e_1_2_1_10_1","volume-title":"Explore and wait: A composite routing-delivery scheme for relative profile-casting in opportunistic networks. Comput. Networks 123 (05","author":"Iglesias Carlos Borrego","year":"2017","unstructured":"Carlos Borrego Iglesias , Adri\u00e1n S\u00e1nchez-Carmona , Zhiyuan Li , and S Robles . 2017. Explore and wait: A composite routing-delivery scheme for relative profile-casting in opportunistic networks. Comput. Networks 123 (05 2017 ). DOI:https:\/\/doi.org\/10.1016\/j.comnet.2017.05.007 10.1016\/j.comnet.2017.05.007 Carlos Borrego Iglesias, Adri\u00e1n S\u00e1nchez-Carmona, Zhiyuan Li, and S Robles. 2017. Explore and wait: A composite routing-delivery scheme for relative profile-casting in opportunistic networks. Comput. Networks 123 (05 2017). DOI:https:\/\/doi.org\/10.1016\/j.comnet.2017.05.007"},{"key":"e_1_2_1_11_1","unstructured":"Y. Cao and Z. Sun. 2003. Position based routing algorithms for ad hoc networks: A taxonomy. Ad Hoc Wireless Networking Kluwer (2003).  Y. Cao and Z. Sun. 2003. Position based routing algorithms for ad hoc networks: A taxonomy. Ad Hoc Wireless Networking Kluwer (2003)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2799933"},{"key":"e_1_2_1_13_1","unstructured":"Thomas S. Ferguson. Accessed May 2015. Optimal Stopping and Applications. Mathematics Department UCLA. https:\/\/www.math.ucla.edu\/\u223ctom\/Stopping\/Contents.html.  Thomas S. Ferguson. Accessed May 2015. Optimal Stopping and Applications. Mathematics Department UCLA. https:\/\/www.math.ucla.edu\/\u223ctom\/Stopping\/Contents.html."},{"volume-title":"Accoustics Speech and Signal Processing (ICASSP)","author":"Fu F.","key":"e_1_2_1_14_1","unstructured":"F. Fu and M. van der Schaar . 2010. Dependant optimal stopping framework for wireless multimedia transmission . In Accoustics Speech and Signal Processing (ICASSP) . IEEE , 1--6. F. Fu and M. van der Schaar. 2010. Dependant optimal stopping framework for wireless multimedia transmission. In Accoustics Speech and Signal Processing (ICASSP). IEEE, 1--6."},{"volume-title":"OCEANS 2010 IEEE-Sydney.","author":"Pang Hao-Min Lin Ai-Chun","key":"e_1_2_1_15_1","unstructured":"Ai-Chun Pang Hao-Min Lin , Yu Ge and J. S. Pathmasuntharam . 2010. Performance study on delay tolerant networks in maritime communication environments . In OCEANS 2010 IEEE-Sydney. Ai-Chun Pang Hao-Min Lin, Yu Ge and J. S. Pathmasuntharam. 2010. Performance study on delay tolerant networks in maritime communication environments. In OCEANS 2010 IEEE-Sydney."},{"volume-title":"2009 IEEE International Symposium on Information Theory, IEEE.","author":"Unnikrishnan V. V.","key":"e_1_2_1_16_1","unstructured":"V. V. Veeravalli J. Unnikrishnan and S. Meyn . 2009. Least favorable distributions for robust quickest change detection . In 2009 IEEE International Symposium on Information Theory, IEEE. V. V. Veeravalli J. Unnikrishnan and S. Meyn. 2009. Least favorable distributions for robust quickest change detection. In 2009 IEEE International Symposium on Information Theory, IEEE."},{"volume-title":"Building the Future Internet through FIRE","author":"Kolomvatsos Kostas","key":"e_1_2_1_17_1","unstructured":"Kostas Kolomvatsos , Michael Tsiroukis , and Stathes Hadjiefthymiades . 2017. An experiment description language for supporting mobile IoT applications . In Building the Future Internet through FIRE , Martin Serrano, Niklaos Isaris, Hans Schaffers, John Domingue, Michael Boniface, and Thanasis Korakis (Eds.). River Publishers, Gistrup , Denmark , 461--460. http:\/\/eprints.gla.ac.uk\/163502\/. Kostas Kolomvatsos, Michael Tsiroukis, and Stathes Hadjiefthymiades. 2017. An experiment description language for supporting mobile IoT applications. In Building the Future Internet through FIRE, Martin Serrano, Niklaos Isaris, Hans Schaffers, John Domingue, Michael Boniface, and Thanasis Korakis (Eds.). River Publishers, Gistrup, Denmark, 461--460. http:\/\/eprints.gla.ac.uk\/163502\/."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.237"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2009.2025767"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350164"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/41.1-2.100"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693055"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"K. Panagidi C. Anagnostopoulos and S. Hadjiefthymiades. 2017. Optimal grouping-of-pictures in IoT video streams. Computer Communications\u2014In press (2017).  K. Panagidi C. Anagnostopoulos and S. Hadjiefthymiades. 2017. Optimal grouping-of-pictures in IoT video streams. Computer Communications\u2014In press (2017).","DOI":"10.1016\/j.comcom.2017.11.012"},{"volume-title":"2018 14th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob). 185--191","author":"Panagidi K.","key":"e_1_2_1_25_1","unstructured":"K. Panagidi , I. Galanis , C. Anagnostopoulos , and S. Hadjiefthymiades . 2018. Time-optimized contextual information flow on unmanned vehicles . In 2018 14th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob). 185--191 . K. Panagidi, I. Galanis, C. Anagnostopoulos, and S. Hadjiefthymiades. 2018. Time-optimized contextual information flow on unmanned vehicles. In 2018 14th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob). 185--191."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2012.042512.00053"},{"key":"e_1_2_1_27_1","unstructured":"Rviz ROS Software. Retrieved June 29 2019 from http:\/\/wiki.ros.org\/rviz.  Rviz ROS Software. Retrieved June 29 2019 from http:\/\/wiki.ros.org\/rviz."},{"key":"e_1_2_1_28_1","unstructured":"Robot Operating System. Retrieved June 29 2019 from https:\/\/www.ros.org\/.  Robot Operating System. Retrieved June 29 2019 from https:\/\/www.ros.org\/."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.56"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369389","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3369389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:30Z","timestamp":1750202610000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369389"}},"subtitle":["Controlling Communications in the Mobile IoT Domain"],"short-title":[],"issued":{"date-parts":[[2020,8,12]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,8,31]]}},"alternative-id":["10.1145\/3369389"],"URL":"https:\/\/doi.org\/10.1145\/3369389","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"type":"print","value":"1533-5399"},{"type":"electronic","value":"1557-6051"}],"subject":[],"published":{"date-parts":[[2020,8,12]]},"assertion":[{"value":"2019-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}