{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T15:42:24Z","timestamp":1770046944818,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:00:00Z","timestamp":1741219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:00:00Z","timestamp":1741219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Netw Syst Manage"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10922-025-09918-z","type":"journal-article","created":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T19:09:46Z","timestamp":1741288186000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Maximum Utility Task Offloading for Delay-Sensitive IoT Applications in Cloud and Edge Computing"],"prefix":"10.1007","volume":"33","author":[{"given":"Subhas Kumar","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"Vijay Monic","family":"Vittamsetti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,6]]},"reference":[{"issue":"4","key":"9918_CR1","doi-asserted-by":"publisher","first-page":"2347","DOI":"10.1109\/COMST.2015.2444095","volume":"17","author":"A Al-Fuqaha","year":"2015","unstructured":"Al-Fuqaha, A., Guizani, M., Mohammadi, M., Aledhari, M., Ayyash, M.: Internet of things: a survey on enabling technologies, protocols, and applications. IEEE Commun. Surv. Tutor. 17(4), 2347\u20132376 (2015). https:\/\/doi.org\/10.1109\/COMST.2015.2444095","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"1","key":"9918_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/JIOT.2014.2306328","volume":"1","author":"A Zanella","year":"2014","unstructured":"Zanella, A., Bui, N., Castellani, A., Vangelista, L., Zorzi, M.: Internet of things for smart cities. IEEE Internet Things J. 1(1), 22\u201332 (2014). https:\/\/doi.org\/10.1109\/JIOT.2014.2306328","journal-title":"IEEE Internet Things J."},{"key":"9918_CR3","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1109\/ACCESS.2015.2437951","volume":"3","author":"SMR Islam","year":"2015","unstructured":"Islam, S.M.R., Kwak, D., Kabir, M.H., Hossain, M., Kwak, K.-S.: The internet of things for health care: a comprehensive survey. IEEE Access 3, 678\u2013708 (2015). https:\/\/doi.org\/10.1109\/ACCESS.2015.2437951","journal-title":"IEEE Access"},{"issue":"4","key":"9918_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/JIOT.2014.2327587","volume":"1","author":"N Lu","year":"2014","unstructured":"Lu, N., Cheng, N., Zhang, N., Shen, X., Mark, J.W.: Connected vehicles: solutions and challenges. IEEE Internet Things J. 1(4), 289\u2013299 (2014). https:\/\/doi.org\/10.1109\/JIOT.2014.2327587","journal-title":"IEEE Internet Things J."},{"issue":"4","key":"9918_CR5","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/TII.2014.2300753","volume":"10","author":"LD Xu","year":"2014","unstructured":"Xu, L.D., He, W., Li, S.: Internet of things in industries: a survey. IEEE Trans. Ind. Inf. 10(4), 2233\u20132243 (2014). https:\/\/doi.org\/10.1109\/TII.2014.2300753","journal-title":"IEEE Trans. Ind. Inf."},{"key":"9918_CR6","doi-asserted-by":"publisher","first-page":"186080","DOI":"10.1109\/ACCESS.2020.3029649","volume":"8","author":"B Wang","year":"2020","unstructured":"Wang, B., Wang, C., Huang, W., Song, Y., Qin, X.: A survey and taxonomy on task offloading for edge-cloud computing. IEEE Access 8, 186080\u2013186101 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3029649","journal-title":"IEEE Access"},{"key":"9918_CR7","doi-asserted-by":"publisher","first-page":"6900","DOI":"10.1109\/ACCESS.2017.2778504","volume":"6","author":"W Yu","year":"2018","unstructured":"Yu, W., Liang, F., He, X., Hatcher, W.G., Lu, C., Lin, J., Yang, X.: A survey on the edge computing for the internet of things. IEEE Access 6, 6900\u20136919 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2017.2778504","journal-title":"IEEE Access"},{"key":"9918_CR8","doi-asserted-by":"publisher","first-page":"47980","DOI":"10.1109\/ACCESS.2018.2866491","volume":"6","author":"RK Naha","year":"2018","unstructured":"Naha, R.K., Garg, S., Georgakopoulos, D., Jayaraman, P.P., Gao, L., Xiang, Y., Ranjan, R.: Fog computing: survey of trends, architectures, requirements, and research directions. IEEE Access 6, 47980\u201348009 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2866491","journal-title":"IEEE Access"},{"key":"9918_CR9","doi-asserted-by":"publisher","first-page":"50994","DOI":"10.1109\/ACCESS.2023.3277826","volume":"11","author":"M Hosseinzadeh","year":"2023","unstructured":"Hosseinzadeh, M., Azhir, E., Lansky, J., Mildeova, S., Ahmed, O.H., Malik, M.H., Khan, F.: Task scheduling mechanisms for fog computing: a systematic survey. IEEE Access 11, 50994\u201351017 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3277826","journal-title":"IEEE Access"},{"issue":"6","key":"9918_CR10","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1109\/JIOT.2016.2584538","volume":"3","author":"M Chiang","year":"2016","unstructured":"Chiang, M., Zhang, T.: Fog and iot: an overview of research opportunities. IEEE Internet Things J. 3(6), 854\u2013864 (2016). https:\/\/doi.org\/10.1109\/JIOT.2016.2584538","journal-title":"IEEE Internet Things J."},{"key":"9918_CR11","doi-asserted-by":"publisher","first-page":"131543","DOI":"10.1109\/ACCESS.2019.2938660","volume":"7","author":"C Jiang","year":"2019","unstructured":"Jiang, C., Cheng, X., Gao, H., Zhou, X., Wan, J.: Toward computation offloading in edge computing: a survey. IEEE Access 7, 131543\u2013131558 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2938660","journal-title":"IEEE Access"},{"key":"9918_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2024.110791","volume":"254","author":"S Dong","year":"2024","unstructured":"Dong, S., Tang, J., Abbas, K., Hou, R., Kamruzzaman, J., Rutkowski, L., Buyya, R.: Task offloading strategies for mobile edge computing: a survey. Comput. Netw. 254, 110791 (2024). https:\/\/doi.org\/10.1016\/j.comnet.2024.110791","journal-title":"Comput. Netw."},{"issue":"4","key":"9918_CR13","doi-asserted-by":"publisher","first-page":"2714","DOI":"10.1109\/COMST.2018.2841996","volume":"20","author":"J Liu","year":"2018","unstructured":"Liu, J., Shi, Y., Fadlullah, Z.M., Kato, N.: Space-air-ground integrated network: a survey. IEEE Commun. Surv. Tutor. 20(4), 2714\u20132741 (2018). https:\/\/doi.org\/10.1109\/COMST.2018.2841996","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"5","key":"9918_CR14","doi-asserted-by":"publisher","first-page":"3360","DOI":"10.1007\/s12083-021-01158-7","volume":"14","author":"X Mi","year":"2021","unstructured":"Mi, X., Yang, C., Song, Y., Ouyang, Y.: A distributed matching game for exploring resource allocation in satellite networks. Peer-to-Peer Netw. Appl. 14(5), 3360\u20133371 (2021). https:\/\/doi.org\/10.1007\/s12083-021-01158-7","journal-title":"Peer-to-Peer Netw. Appl."},{"issue":"19","key":"9918_CR15","doi-asserted-by":"publisher","first-page":"31862","DOI":"10.1109\/JIOT.2024.3421529","volume":"11","author":"J Du","year":"2024","unstructured":"Du, J., Wang, J., Sun, A., Qu, J., Zhang, J., Wu, C., Niyato, D.: Joint optimization in blockchain- and mec-enabled space-air-ground integrated networks. IEEE Internet Things J. 11(19), 31862\u201331877 (2024). https:\/\/doi.org\/10.1109\/JIOT.2024.3421529","journal-title":"IEEE Internet Things J."},{"issue":"1","key":"9918_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.tcs.2007.08.004","volume":"389","author":"D Michail","year":"2007","unstructured":"Michail, D.: Reducing rank-maximal to maximum weight matching. Theoret. Comput. Sci. 389(1), 125\u2013132 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.08.004","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"9918_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962). https:\/\/doi.org\/10.1080\/00029890.1962.11989827","journal-title":"Am. Math. Mon."},{"key":"9918_CR18","doi-asserted-by":"publisher","first-page":"118353","DOI":"10.1109\/ACCESS.2022.3219427","volume":"10","author":"H Tran-Dang","year":"2022","unstructured":"Tran-Dang, H., Kim, D.-S.: A survey on matching theory for distributed computation offloading in iot-fog-cloud systems: perspectives and open issues. IEEE Access 10, 118353\u2013118369 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3219427","journal-title":"IEEE Access"},{"key":"9918_CR19","doi-asserted-by":"publisher","unstructured":"Huang, S.-E., Su, H.-H.: $$(1-\\varepsilon )$$-approximate maximum weighted matching in $${poly}(\\log {n}, 1\/\\varepsilon )$$ time in the distributed and parallel settings. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing. PODC \u201923, pp. 44\u201354. Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3583668.3594570","DOI":"10.1145\/3583668.3594570"},{"key":"9918_CR20","doi-asserted-by":"publisher","DOI":"10.1145\/2786753","author":"Z Lotker","year":"2015","unstructured":"Lotker, Z., Patt-Shamir, B., Pettie, S.: Improved distributed approximate matching. J. ACM (2015). https:\/\/doi.org\/10.1145\/2786753","journal-title":"J. ACM"},{"issue":"4","key":"9918_CR21","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1109\/TVT.2019.2894851","volume":"68","author":"Z Zhou","year":"2019","unstructured":"Zhou, Z., Liu, P., Feng, J., Zhang, Y., Mumtaz, S., Rodriguez, J.: Computation resource allocation and task assignment optimization in vehicular fog computing: a contract-matching approach. IEEE Trans. Veh. Technol. 68(4), 3113\u20133125 (2019). https:\/\/doi.org\/10.1109\/TVT.2019.2894851","journal-title":"IEEE Trans. Veh. Technol."},{"key":"9918_CR22","doi-asserted-by":"publisher","unstructured":"Liao, H., Zhou, Z., Zhao, X., Ai, B., Mumtaz, S.: Task offloading for vehicular fog computing under information uncertainty: a matching-learning approach. In: 2019 15th International Wireless Communications and Mobile Computing Conference, pp. 2001\u20132006 (2019). https:\/\/doi.org\/10.1109\/IWCMC.2019.8766579","DOI":"10.1109\/IWCMC.2019.8766579"},{"key":"9918_CR23","doi-asserted-by":"publisher","unstructured":"Joshi, N., Srivastava, S.: Task allocation in three tier fog iot architecture for patient monitoring system using stackelberg game and matching algorithm. In: 2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS), pp. 1\u20136 (2019). https:\/\/doi.org\/10.1109\/ANTS47819.2019.9117909","DOI":"10.1109\/ANTS47819.2019.9117909"},{"key":"9918_CR24","doi-asserted-by":"publisher","first-page":"27628","DOI":"10.1109\/ACCESS.2019.2896000","volume":"7","author":"P Liu","year":"2019","unstructured":"Liu, P., Li, J., Sun, Z.: Matching-based task offloading for vehicular edge computing. IEEE Access 7, 27628\u201327640 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2896000","journal-title":"IEEE Access"},{"key":"9918_CR25","doi-asserted-by":"publisher","unstructured":"Li, J., Liang, W., Xu, W., Xu, Z., Zhao, J.: Maximizing the quality of user experience of using services in edge computing for delay-sensitive iot applications. In: Proceedings of the 23rd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems. MSWiM \u201920, pp. 113\u2013121. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3416010.3423234","DOI":"10.1145\/3416010.3423234"},{"key":"9918_CR26","doi-asserted-by":"publisher","DOI":"10.3390\/s22186906","author":"UM Malik","year":"2022","unstructured":"Malik, U.M., Javed, M.A., Frnda, J., Rozhon, J., Khan, W.U.: Efficient matching-based parallel task offloading in iot networks. Sensors (2022). https:\/\/doi.org\/10.3390\/s22186906","journal-title":"Sensors"},{"key":"9918_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2021.102639","volume":"123","author":"S Tian","year":"2021","unstructured":"Tian, S., Deng, X., Chen, P., Pei, T., Oh, S., Xue, W.: A dynamic task offloading algorithm based on greedy matching in vehicle network. Ad Hoc Netw. 123, 102639 (2021). https:\/\/doi.org\/10.1016\/j.adhoc.2021.102639","journal-title":"Ad Hoc Netw."},{"key":"9918_CR28","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2025.3527704","author":"S Li","year":"2025","unstructured":"Li, S., Li, W., Liu, H., Sun, W.: Tiered pricing-based task offloading strategy in collaborative edge-cloud computing: a matching game approach. IEEE Internet Things J. (2025). https:\/\/doi.org\/10.1109\/JIOT.2025.3527704","journal-title":"IEEE Internet Things J."},{"key":"9918_CR29","doi-asserted-by":"publisher","DOI":"10.1145\/3695882","author":"C Li","year":"2025","unstructured":"Li, C., Yu, L., Zeng, S., Zhang, Y., Jiang, K., Wan, S.: Stackelberg game-based task offloading for joint service caching and resource allocation optimization in uav-assisted vec. ACM Trans. Internet Things (2025). https:\/\/doi.org\/10.1145\/3695882","journal-title":"ACM Trans. Internet Things"},{"issue":"6","key":"9918_CR30","doi-asserted-by":"publisher","first-page":"5089","DOI":"10.1109\/JIOT.2018.2871251","volume":"5","author":"F Chiti","year":"2018","unstructured":"Chiti, F., Fantacci, R., Picano, B.: A matching theory framework for tasks offloading in fog computing for iot systems. IEEE Internet Things J. 5(6), 5089\u20135096 (2018). https:\/\/doi.org\/10.1109\/JIOT.2018.2871251","journal-title":"IEEE Internet Things J."},{"key":"9918_CR31","doi-asserted-by":"publisher","first-page":"111579","DOI":"10.1109\/ACCESS.2022.3215555","volume":"10","author":"UM Malik","year":"2022","unstructured":"Malik, U.M., Javed, M.A., Frnda, J., Nedoma, J.: Smreto: stable matching for reliable and efficient task offloading in fog-enabled iot networks. IEEE Access 10, 111579\u2013111590 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3215555","journal-title":"IEEE Access"},{"key":"9918_CR32","doi-asserted-by":"publisher","first-page":"7609","DOI":"10.1109\/ACCESS.2024.3350556","volume":"12","author":"A Bandyopadhyay","year":"2024","unstructured":"Bandyopadhyay, A., Mishra, V., Swain, S., Chatterjee, K., Dey, S., Mallik, S., Al-Rasheed, A., Abbas, M., Soufiene, B.O.: Edgematch: a smart approach for scheduling iot-edge tasks with multiple criteria using game theory. IEEE Access 12, 7609\u20137623 (2024). https:\/\/doi.org\/10.1109\/ACCESS.2024.3350556","journal-title":"IEEE Access"},{"key":"9918_CR33","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Path, trees, and flowers. Canadian J. Math. 17, 449\u2013467 (1965). https:\/\/doi.org\/10.4153\/CJM-1965-045-4","journal-title":"Canadian J. Math."},{"key":"9918_CR34","doi-asserted-by":"publisher","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: SODA \u201990: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434\u2013443. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1990). https:\/\/doi.org\/10.5555\/320176.320229","DOI":"10.5555\/320176.320229"},{"key":"9918_CR35","doi-asserted-by":"publisher","unstructured":"Micali, S., Vazirani, V.V.: An $${O}(\\sqrt{|{V}|} |{E}|)$$ algorithm for finding maximum matching in general graphs. In: 21st Annual Symposium on Foundations of Computer Science (sfcs 1980), pp. 17\u201327 (1980). https:\/\/doi.org\/10.1109\/SFCS.1980.12","DOI":"10.1109\/SFCS.1980.12"},{"issue":"4","key":"9918_CR36","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0196-6774(89)90005-9","volume":"10","author":"MO Rabin","year":"1989","unstructured":"Rabin, M.O., Vazirani, V.V.: Maximum matchings in general graphs through randomization. J. Alg. 10(4), 557\u2013567 (1989). https:\/\/doi.org\/10.1016\/0196-6774(89)90005-9","journal-title":"J. Alg."},{"key":"9918_CR37","doi-asserted-by":"publisher","unstructured":"Fischer, M., Mitrovi\u0107, S., Uitto, J.: Deterministic $$(1-\\varepsilon )$$-approximate maximum matching with $${poly}(1\/\\varepsilon )$$ passes in the semi-streaming model and beyond. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. STOC 2022, pp. 248\u2013260. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3519935.3520039","DOI":"10.1145\/3519935.3520039"},{"key":"9918_CR38","doi-asserted-by":"publisher","unstructured":"Ahmadi, M., Kuhn, F., Oshman, R.: Distributed Approximate Maximum Matching in the CONGEST Model. In: Schmid, U., Widder, J. (eds.) 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 121, pp. 6\u20131617. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2018.6","DOI":"10.4230\/LIPIcs.DISC.2018.6"},{"key":"9918_CR39","doi-asserted-by":"publisher","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London, UK (2008). https:\/\/doi.org\/10.1007\/978-1-84628-970-5 . https:\/\/doi.org\/10.1145\/2786753","DOI":"10.1007\/978-1-84628-970-5 10.1145\/2786753"},{"key":"9918_CR40","doi-asserted-by":"publisher","unstructured":"Peleg, D.: Distributed Computing: a Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000). https:\/\/doi.org\/10.1137\/1.9780898719772","DOI":"10.1137\/1.9780898719772"},{"key":"9918_CR41","doi-asserted-by":"publisher","unstructured":"Tse, D., Viswanath, P.: Fundamentals of Wireless Communication. Cambridge University Press, NY, United States (2005). https:\/\/doi.org\/10.1017\/CBO9780511807213","DOI":"10.1017\/CBO9780511807213"},{"issue":"3\u20134","key":"9918_CR42","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-018-0344-4","volume":"33","author":"M Fischer","year":"2020","unstructured":"Fischer, M.: Improved deterministic distributed matching via rounding. Distrib. Comput. 33(3\u20134), 279\u2013291 (2020). https:\/\/doi.org\/10.1007\/s00446-018-0344-4","journal-title":"Distrib. Comput."},{"key":"9918_CR43","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Linear programming without the matrix. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing. STOC \u201993, pp. 121\u2013129. Association for Computing Machinery, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/167088.167127","DOI":"10.1145\/167088.167127"},{"issue":"2","key":"9918_CR44","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.1994.1036","volume":"17","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U., Young, N.: A primal-dual parallel approximation technique applied to weighted set and vertex covers. J. Alg. 17(2), 280\u2013289 (1994). https:\/\/doi.org\/10.1006\/jagm.1994.1036","journal-title":"J. Alg."},{"key":"9918_CR45","doi-asserted-by":"publisher","unstructured":"\u00c5strand, M., Suomela, J.: Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In: Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA \u201910, pp. 294\u2013302. Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1810479.1810533","DOI":"10.1145\/1810479.1810533"},{"issue":"1","key":"9918_CR46","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.icte.2017.03.004","volume":"3","author":"RS Sinha","year":"2017","unstructured":"Sinha, R.S., Wei, Y., Hwang, S.-H.: A survey on lpwa technology: Lora and nb-iot. ICT Express 3(1), 14\u201321 (2017). https:\/\/doi.org\/10.1016\/j.icte.2017.03.004","journal-title":"ICT Express"},{"issue":"4","key":"9918_CR47","doi-asserted-by":"publisher","first-page":"2544","DOI":"10.1109\/COMST.2017.2728013","volume":"19","author":"M Elsaadany","year":"2017","unstructured":"Elsaadany, M., Ali, A., Hamouda, W.: Cellular lte-a technologies for the future internet-of-things: physical layer features and challenges. IEEE Commun. Surv. Tutor. 19(4), 2544\u20132572 (2017). https:\/\/doi.org\/10.1109\/COMST.2017.2728013","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"9918_CR48","doi-asserted-by":"publisher","first-page":"16739","DOI":"10.1109\/ACCESS.2018.2881533","volume":"7","author":"S Popli","year":"2019","unstructured":"Popli, S., Jha, R.K., Jain, S.: A survey on energy efficient narrowband internet of things (nbiot): architecture, application and challenges. IEEE Access 7, 16739\u201316776 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2018.2881533","journal-title":"IEEE Access"},{"issue":"5","key":"9918_CR49","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/MWC.2016.7721743","volume":"23","author":"M Centenaro","year":"2016","unstructured":"Centenaro, M., Vangelista, L., Zanella, A., Zorzi, M.: Long-range communications in unlicensed bands: the rising stars in the iot and smart city scenarios. IEEE Wirel. Commun. 23(5), 60\u201367 (2016). https:\/\/doi.org\/10.1109\/MWC.2016.7721743","journal-title":"IEEE Wirel. Commun."},{"issue":"9","key":"9918_CR50","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MCOM.2017.1600613","volume":"55","author":"F Adelantado","year":"2017","unstructured":"Adelantado, F., Vilajosana, X., Tuset-Peiro, P., Martinez, B., Melia-Segui, J., Watteyne, T.: Understanding the limits of lorawan. IEEE Commun. Mag. 55(9), 34\u201340 (2017). https:\/\/doi.org\/10.1109\/MCOM.2017.1600613","journal-title":"IEEE Commun. Mag."},{"key":"9918_CR51","doi-asserted-by":"publisher","DOI":"10.3389\/fcosc.2022.879934","author":"JR Burger","year":"2022","unstructured":"Burger, J.R., Okie, J.G., Hatton, I.A., Weinberger, V.P., Shrestha, M., Liedtke, K.J., Be, T., Cruz, A.R., Feng, X., Hinojo-Hinojo, C., Kibria, A.S.M.G., Ernst, K.C., Enquist, B.J.: Global city densities: re-examining urban scaling theory. Front. Conserv. Sci. (2022). https:\/\/doi.org\/10.3389\/fcosc.2022.879934","journal-title":"Front. Conserv. Sci."},{"key":"9918_CR52","doi-asserted-by":"publisher","first-page":"152911","DOI":"10.1109\/ACCESS.2019.2941741","volume":"7","author":"M Mukherjee","year":"2019","unstructured":"Mukherjee, M., Kumar, S., Zhang, Q., Matam, R., Mavromoustakis, C.X., Lv, Y., Mastorakis, G.: Task data offloading and resource allocation in fog computing with multi-task delay guarantee. IEEE Access 7, 152911\u2013152918 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2941741","journal-title":"IEEE Access"},{"issue":"2","key":"9918_CR53","doi-asserted-by":"publisher","first-page":"244","DOI":"10.23919\/JCN.2023.000008","volume":"25","author":"H Tran-Dang","year":"2023","unstructured":"Tran-Dang, H., Kim, D.-S.: Dynamic collaborative task offloading for delay minimization in the heterogeneous fog computing systems. J. Commun. Netw. 25(2), 244\u2013252 (2023). https:\/\/doi.org\/10.23919\/JCN.2023.000008","journal-title":"J. Commun. Netw."},{"issue":"2","key":"9918_CR54","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1214\/aoap\/1177005436","volume":"3","author":"M Dyer","year":"1993","unstructured":"Dyer, M., Frieze, A., Pittel, B.: The average performance of the greedy matching algorithm. Ann. Appl. Probab. 3(2), 526\u2013552 (1993). https:\/\/doi.org\/10.1214\/aoap\/1177005436","journal-title":"Ann. Appl. Probab."}],"container-title":["Journal of Network and Systems Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-025-09918-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10922-025-09918-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-025-09918-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T11:49:10Z","timestamp":1744976950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10922-025-09918-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,6]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["9918"],"URL":"https:\/\/doi.org\/10.1007\/s10922-025-09918-z","relation":{},"ISSN":["1064-7570","1573-7705"],"issn-type":[{"value":"1064-7570","type":"print"},{"value":"1573-7705","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,6]]},"assertion":[{"value":"25 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"43"}}