{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T20:12:02Z","timestamp":1778616722730,"version":"3.51.4"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["262854\/F20"],"award-info":[{"award-number":["262854\/F20"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1016\/j.comnet.2024.111000","type":"journal-article","created":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T00:40:00Z","timestamp":1736037600000},"page":"111000","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["Opportunistic routing for mobile edge computing: A community detected and task priority aware approach"],"prefix":"10.1016","volume":"258","author":[{"given":"Jia","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingyi","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-1248-487X","authenticated-orcid":false,"given":"Peiyuan","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziru","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-0453-8222","authenticated-orcid":false,"given":"Fangfang","family":"Gou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Taherkordi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2024.111000_b1","doi-asserted-by":"crossref","first-page":"1839","DOI":"10.1007\/s12083-020-00954-x","article-title":"Content caching based on mobility prediction and joint user prefetch in mobile edge networks","volume":"13","author":"Yu","year":"2020","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"10.1016\/j.comnet.2024.111000_b2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.comnet.2017.10.005","article-title":"Effective information transmission based on socialization nodes in opportunistic networks","volume":"129","author":"Jia","year":"2017","journal-title":"Comput. Netw."},{"issue":"8","key":"10.1016\/j.comnet.2024.111000_b3","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.3390\/electronics13081569","article-title":"ML-enhanced live video streaming in offline mobile ad hoc networks: An applied approach","volume":"13","author":"Jes\u00fas-Azabal","year":"2024","journal-title":"Electronics"},{"key":"10.1016\/j.comnet.2024.111000_b4","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1007\/s12083-019-00833-0","article-title":"Community recombination and duplication node traverse algorithm in opportunistic social networks","volume":"13","author":"Wu","year":"2020","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"10.1016\/j.comnet.2024.111000_b5","series-title":"Knowledge-Based Intelligent Information and Engineering Systems: 11th International Conference, KES 2007, XVII Italian Workshop on Neural Networks, Vietri Sul Mare, Italy, September 12-14, 2007, Proceedings, Part III 11","first-page":"812","article-title":"Fitting opportunistic networks data with a pareto distribution","author":"Apolloni","year":"2007"},{"issue":"1","key":"10.1016\/j.comnet.2024.111000_b6","doi-asserted-by":"crossref","DOI":"10.1155\/2021\/8883501","article-title":"OPPNets and rural areas: an opportunistic solution for remote communications","volume":"2021","author":"Jes\u00fas-Azabal","year":"2021","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"10.1016\/j.comnet.2024.111000_b7","article-title":"FedAGL: A communication-efficient federated vehicular network","author":"Liu","year":"2024","journal-title":"IEEE Trans. Intell. Veh."},{"key":"10.1016\/j.comnet.2024.111000_b8","article-title":"Big data analytics on lung cancer diagnosis framework with deep learning","author":"Guan","year":"2023","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"10.1016\/j.comnet.2024.111000_b9","article-title":"FedAPT: Joint adaptive parameter freezing and resource allocation for communication-efficient federated vehicular networks","author":"Wu","year":"2024","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.comnet.2024.111000_b10","series-title":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","first-page":"1","article-title":"Optimizing non-orthogonal multiple access in random access networks","author":"Chen","year":"2020"},{"key":"10.1016\/j.comnet.2024.111000_b11","series-title":"2017 IEEE International Conference on Communications","first-page":"1","article-title":"Energy-throughput tradeoff in sustainable cloud-ran with energy harvesting","author":"Chen","year":"2017"},{"key":"10.1016\/j.comnet.2024.111000_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2023.110100","article-title":"FedSSC: Joint client selection and resource management for communication-efficient federated vehicular networks","volume":"237","author":"Liu","year":"2023","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2024.111000_b13","series-title":"Optimal Relay Node Placement to Improve Expected Life Time in Wireless Sensor Network Design","author":"Karunanayake","year":"2020"},{"key":"10.1016\/j.comnet.2024.111000_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2024.127308","article-title":"A self-adaptive ensemble for user interest drift learning","volume":"577","author":"Wang","year":"2024","journal-title":"Neurocomputing"},{"key":"10.1016\/j.comnet.2024.111000_b15","series-title":"2018 IEEE 87th Vehicular Technology Conference (VTC Spring)","first-page":"1","article-title":"A hybrid approach for efficient wireless information and power transfer in green C-RAN","author":"Li","year":"2018"},{"key":"10.1016\/j.comnet.2024.111000_b16","series-title":"2023 IEEE 10th International Conference on Cyber Security and Cloud Computing (CSCloud)\/2023 IEEE 9th International Conference on Edge Computing and Scalable Cloud (EdgeCom)","first-page":"330","article-title":"A prediction based resource reservation algorithm for service handover in edge computing","author":"Guan","year":"2023"},{"key":"10.1016\/j.comnet.2024.111000_b17","doi-asserted-by":"crossref","DOI":"10.1145\/3641286","article-title":"AMT-CDR: A deep adversarial multi-channel transfer network for cross-domain recommendation","author":"Lu","year":"2024","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"10.1016\/j.comnet.2024.111000_b18","article-title":"Deep reinforcement learning in nonstationary environments with unknown change points","author":"Liu","year":"2024","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.comnet.2024.111000_b19","series-title":"Epidemic routing for partially connected ad hoc networks","author":"Vahdat","year":"2000"},{"key":"10.1016\/j.comnet.2024.111000_b20","series-title":"2017 International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud)","first-page":"843","article-title":"A new modified spray and wait routing algorithm for heterogeneous delay tolerant network","author":"Sisodiya","year":"2017"},{"key":"10.1016\/j.comnet.2024.111000_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.adhoc.2024.103591","article-title":"Evaluating the quality of service of opportunistic mobile ad hoc network routing algorithms on real devices: A software-driven approach","volume":"163","author":"Jes\u00fas-Azabal","year":"2024","journal-title":"Ad Hoc Netw."},{"issue":"3","key":"10.1016\/j.comnet.2024.111000_b22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/961268.961272","article-title":"Probabilistic routing in intermittently connected networks","volume":"7","author":"Lindgren","year":"2003","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"10.1016\/j.comnet.2024.111000_b23","series-title":"Infocom","article-title":"MaxProp: Routing for vehicle-based disruption-tolerant networks.","volume":"Vol. 6","author":"Burgess","year":"2006"},{"key":"10.1016\/j.comnet.2024.111000_b24","article-title":"An improved PRoPHET-random forest based optimized multi-copy routing for opportunistic IoT networks","volume":"11","author":"Srinidhi","year":"2020","journal-title":"Internet Things"},{"issue":"3","key":"10.1016\/j.comnet.2024.111000_b25","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1109\/JSYST.2016.2630923","article-title":"A machine learning-based protocol for efficient routing in opportunistic networks","volume":"12","author":"Sharma","year":"2016","journal-title":"IEEE Syst. J."},{"key":"10.1016\/j.comnet.2024.111000_b26","series-title":"2017 IEEE 19th International Workshop on Multimedia Signal Processing","first-page":"1","article-title":"Reinforcement learning-based opportunistic routing for live video streaming over multi-hop wireless networks","author":"Tang","year":"2017"},{"issue":"13","key":"10.1016\/j.comnet.2024.111000_b27","doi-asserted-by":"crossref","first-page":"2084","DOI":"10.3390\/electronics11132084","article-title":"Improving delivery probability in mobile opportunistic networks with social-based routing","volume":"11","author":"Jes\u00fas-Azabal","year":"2022","journal-title":"Electronics"},{"key":"10.1016\/j.comnet.2024.111000_b28","doi-asserted-by":"crossref","first-page":"2977","DOI":"10.1007\/s11276-018-1691-6","article-title":"Information cache management and data transmission algorithm in opportunistic social networks","volume":"25","author":"Wu","year":"2019","journal-title":"Wirel. Netw."},{"key":"10.1016\/j.comnet.2024.111000_b29","series-title":"Communications, Signal Processing, and Systems: Proceedings of the 2017 International Conference on Communications, Signal Processing, and Systems","first-page":"2486","article-title":"Opportunistic routing algorithm based on estimator learning automata","author":"Han","year":"2019"},{"issue":"8","key":"10.1016\/j.comnet.2024.111000_b30","doi-asserted-by":"crossref","first-page":"338","DOI":"10.3390\/sym10080338","article-title":"FCNS: A fuzzy routing-forwarding algorithm exploiting comprehensive node similarity in opportunistic social networks","volume":"10","author":"Liu","year":"2018","journal-title":"Symmetry"},{"key":"10.1016\/j.comnet.2024.111000_b31","series-title":"2011 IEEE Wireless Communications and Networking Conference","first-page":"498","article-title":"Predict and spread: An efficient routing algorithm for opportunistic networking","author":"Niu","year":"2011"},{"issue":"09","key":"10.1016\/j.comnet.2024.111000_b32","doi-asserted-by":"crossref","DOI":"10.1142\/S0129183117501157","article-title":"Social-aware data dissemination in opportunistic mobile social networks","volume":"28","author":"Yang","year":"2017","journal-title":"Internat. J. Modern Phys. C"},{"key":"10.1016\/j.comnet.2024.111000_b33","first-page":"1","article-title":"A routing algorithm for the sparse opportunistic networks based on node intimacy","volume":"2021","author":"Xu","year":"2021","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"10.1016\/j.comnet.2024.111000_b34","series-title":"2017 16Th International Symposium on Parallel and Distributed Computing","first-page":"157","article-title":"Leader election in opportunistic networks","author":"Dragan","year":"2017"},{"issue":"5","key":"10.1016\/j.comnet.2024.111000_b35","doi-asserted-by":"crossref","first-page":"2353","DOI":"10.1007\/s11276-023-03294-9","article-title":"A self-sustainable opportunistic solution for emergency detection in ageing people living in rural areas","volume":"29","author":"Jesus-Azabal","year":"2023","journal-title":"Wirel. Netw."},{"key":"10.1016\/j.comnet.2024.111000_b36","doi-asserted-by":"crossref","first-page":"22144","DOI":"10.1109\/ACCESS.2019.2898895","article-title":"Effective data transmission strategy based on node socialization in opportunistic social networks","volume":"7","author":"Yan","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.comnet.2024.111000_b37","first-page":"332","article-title":"Real-time queues in heavy traffic with earliest-deadline-first queue discipline","author":"Doytchinov","year":"2001","journal-title":"Ann. Appl. Probab."}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128624008326?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128624008326?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T19:23:00Z","timestamp":1778613780000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128624008326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":37,"alternative-id":["S1389128624008326"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2024.111000","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Opportunistic routing for mobile edge computing: A community detected and task priority aware approach","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2024.111000","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111000"}}