{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T20:55:02Z","timestamp":1775940902601,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T00:00:00Z","timestamp":1660003200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T00:00:00Z","timestamp":1660003200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004705","name":"King Mongkut\u2019s University of Technology Thonburi","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004705","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Road traffic information can be utilized in many applications of intelligent transport systems. It can be collected from vehicles and sent over a vehicular ad hoc network (VANET) to roadside units (RSUs) acting as sink nodes. Due to rapid mobility and limited channel capacity in a VANET where vehicles must compete to access the RSUs to report their data, clustering is used to create a group of vehicles to facilitate data transfer to the RSUs. Unlike previous works that focus on cluster lifetime or throughput, we formulate a coalitional graph game for multi-hop clustering (CGG-MC) model to create a multi-hop cluster with the largest possible coverage area for a given transmission delay time constraint to economize on the number of RSUs installed. Vehicles cooperatively form a proper coalition with relation directed graphs among vehicles in a multi-hop cluster to collect, aggregate, and forward data to RSUs instead of individually competing to connect directly to RSUs. Vehicles decide to join or leave the coalition based on their individual utility, which is a weighted function of the coverage area, number of members in the cluster, relative velocities, distance to sink nodes, and transmission delay toward the sink nodes. The distributed-solution approach based on probabilistic greedy merging of coalitions is used to derive the grand coalition, and the probability of grand coalition formation is analyzed by using a discrete-time Markov chain. Our results show that the proposed solution approach yields a <jats:inline-formula><jats:alternatives><jats:tex-math>$$95\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>95<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> confidence interval of the average utility between 61 and <jats:inline-formula><jats:alternatives><jats:tex-math>$$68\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>68<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> relative to the maximum utility in the centralized-solutions. Additionally, our CGG-MC model outperforms the non-cooperation model by approximately <jats:inline-formula><jats:alternatives><jats:tex-math>$$166\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>166<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in terms of enlarging the coverage network area under a transmission delay time constraint.<\/jats:p>","DOI":"10.1186\/s13638-022-02149-9","type":"journal-article","created":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T10:02:52Z","timestamp":1660039372000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Coalitional graph game for area maximization of multi-hop clustering in vehicular ad hoc networks"],"prefix":"10.1186","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9544-2503","authenticated-orcid":false,"given":"Siwapon","family":"Charoenchai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peerapon","family":"Siripongwutikorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,9]]},"reference":[{"issue":"1","key":"2149_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/s13638-015-0513-0","volume":"2016","author":"S Wongdeethai","year":"2016","unstructured":"S. Wongdeethai, P. Siripongwutikorn, Collecting road traffic information using vehicular ad hoc networks. EURASIP J. Wirel. Commun. Netw. 2016(1), 9 (2016). https:\/\/doi.org\/10.1186\/s13638-015-0513-0","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"1","key":"2149_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1186\/s13638-021-01971-x","volume":"2021","author":"C Vitale","year":"2021","unstructured":"C. Vitale, N. Piperigkos, C. Laoudias, G. Ellinas, J. Casademont, J. Escrig, A. Kloukiniotis, A.S. Lalos, K. Moustakas, R. Diaz Rodriguez, D. Ba\u00f1os, G. Roqueta Crusats, P. Kapsalas, K.-P. Hofmann, P.S. Khodashenas, Caramel: results on a secure architecture for connected and autonomous vehicles detecting GPS spoofing attacks. EURASIP J. Wirel. Commun. Netw. 2021(1), 115 (2021). https:\/\/doi.org\/10.1186\/s13638-021-01971-x","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"1","key":"2149_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1186\/s13638-021-01958-8","volume":"2021","author":"C Wang","year":"2021","unstructured":"C. Wang, X. Cheng, J. Li, Y. He, K. Xiao, A survey: applications of blockchain in the internet of vehicles. EURASIP J. Wirel. Commun. Netw. 2021(1), 77 (2021). https:\/\/doi.org\/10.1186\/s13638-021-01958-8","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"12","key":"2149_CR4","doi-asserted-by":"publisher","first-page":"2811","DOI":"10.1109\/TMC.2018.2883312","volume":"18","author":"C Chen","year":"2019","unstructured":"C. Chen, J. Hu, T. Qiu, M. Atiquzzaman, Z. Ren, CVCG: cooperative V2V-aided transmission scheme based on coalitional game for popular content distribution in vehicular ad-hoc networks. IEEE Trans. Mob. Comput. 18(12), 2811\u20132828 (2019). https:\/\/doi.org\/10.1109\/TMC.2018.2883312","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"1","key":"2149_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1186\/s13638-018-1315-y","volume":"2019","author":"B Ahmed","year":"2019","unstructured":"B. Ahmed, A.W. Malik, T. Hafeez, N. Ahmed, Services and simulation frameworks for vehicular cloud computing: a contemporary survey. EURASIP J. Wirel. Commun. Netw. 2019(1), 4 (2019). https:\/\/doi.org\/10.1186\/s13638-018-1315-y","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"7","key":"2149_CR6","doi-asserted-by":"publisher","first-page":"5307","DOI":"10.1007\/s11276-020-02392-2","volume":"26","author":"A Katiyar","year":"2020","unstructured":"A. Katiyar, D. Singh, R.S. Yadav, State-of-the-art approach to clustering protocols in VANET: a survey. Wirel. Netw. 26(7), 5307\u20135336 (2020). https:\/\/doi.org\/10.1007\/s11276-020-02392-2","journal-title":"Wirel. Netw."},{"issue":"1","key":"2149_CR7","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/COMST.2016.2611524","volume":"19","author":"C Cooper","year":"2017","unstructured":"C. Cooper, D. Franklin, M. Ros, F. Safaei, M. Abolhasan, A comparative survey of VANET clustering techniques. IEEE Commun. Surv. Tutor. 19(1), 657\u2013681 (2017). https:\/\/doi.org\/10.1109\/COMST.2016.2611524","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"1","key":"2149_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1186\/s13638-021-01925-3","volume":"2021","author":"S Shukry","year":"2021","unstructured":"S. Shukry, Stable routing and energy-conserved data transmission over wireless sensor networks. EURASIP J. Wirel. Commun. Netw. 2021(1), 36 (2021). https:\/\/doi.org\/10.1186\/s13638-021-01925-3","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"1","key":"2149_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1186\/s13638-021-01911-9","volume":"2021","author":"MA Alharbi","year":"2021","unstructured":"M.A. Alharbi, M. Kolberg, M. Zeeshan, Towards improved clustering and routing protocol for wireless sensor networks. EURASIP J. Wirel. Commun. Netw. 2021(1), 46 (2021). https:\/\/doi.org\/10.1186\/s13638-021-01911-9","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"6","key":"2149_CR10","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1016\/j.adhoc.2013.03.004","volume":"11","author":"Y Li","year":"2013","unstructured":"Y. Li, I.-R. Chen, Dynamic agent-based hierarchical multicast for wireless mesh networks. Ad Hoc Netw. 11(6), 1683\u20131698 (2013). https:\/\/doi.org\/10.1016\/j.adhoc.2013.03.004","journal-title":"Ad Hoc Netw."},{"issue":"1","key":"2149_CR11","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/TITS.2004.842407","volume":"6","author":"L Wischhof","year":"2005","unstructured":"L. Wischhof, A. Ebner, H. Rohling, Information dissemination in self-organizing intervehicle networks. IEEE Trans. Intell. Transp. Syst. 6(1), 90\u2013101 (2005). https:\/\/doi.org\/10.1109\/TITS.2004.842407","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"2149_CR12","doi-asserted-by":"publisher","unstructured":"F. Cuckov, M. Song, Geocast-driven structureless information dissemination scheme for vehicular ad hoc networks, in 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage (2010), pp. 325\u2013332. https:\/\/doi.org\/10.1109\/NAS.2010.51","DOI":"10.1109\/NAS.2010.51"},{"key":"2149_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.vehcom.2018.01.009","volume":"12","author":"S Latif","year":"2018","unstructured":"S. Latif, S. Mahfooz, B. Jan, N. Ahmad, Y. Cao, M. Asif, A comparative study of scenario-driven multi-hop broadcast protocols for VANETs. Veh. Commun. 12, 88\u2013109 (2018). https:\/\/doi.org\/10.1016\/j.vehcom.2018.01.009","journal-title":"Veh. Commun."},{"key":"2149_CR14","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11561354_5","volume-title":"Ad-Hoc, Mobile, and Wireless Networks","author":"P Fan","year":"2005","unstructured":"P. Fan, J.G. Haran, J. Dillenburg, P.C. Nelson, Cluster-based framework in vehicular ad-hoc networks, in Ad-Hoc, Mobile, and Wireless Networks. ed. by V.R. Syrotiuk, E. Ch\u00e1vez (Springer, Berlin, Heidelberg, 2005), pp. 32\u201342"},{"issue":"3","key":"2149_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01200845","volume":"1","author":"M Gerla","year":"1995","unstructured":"M. Gerla, J. Tzu-Chieh Tsai, Multicluster, mobile, multimedia radio network. Wirel. Netw. 1(3), 255\u2013265 (1995). https:\/\/doi.org\/10.1007\/BF01200845","journal-title":"Wirel. Netw."},{"key":"2149_CR16","doi-asserted-by":"publisher","unstructured":"P. Basu, N. Khan, T.D.C. Little, A mobility based metric for clustering in mobile ad hoc networks, in Proceedings 21st International Conference on Distributed Computing Systems Workshops (2001), pp. 413\u2013418. https:\/\/doi.org\/10.1109\/CDCS.2001.918738","DOI":"10.1109\/CDCS.2001.918738"},{"key":"2149_CR17","doi-asserted-by":"publisher","unstructured":"E. Souza, I. Nikolaidis, P. Gburzynski, A new aggregate local mobility (ALM) clustering algorithm for VANETS, in 2010 IEEE International Conference on Communications (2010), pp. 1\u20135. https:\/\/doi.org\/10.1109\/ICC.2010.5501789","DOI":"10.1109\/ICC.2010.5501789"},{"issue":"1","key":"2149_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1186\/1687-1499-2012-15","volume":"2012","author":"ZY Rawashdeh","year":"2012","unstructured":"Z.Y. Rawashdeh, S.M. Mahmud, A novel algorithm to form stable clusters in vehicular ad hoc networks on highways. EURASIP J. Wirel. Commun. Netw. 2012(1), 15 (2012). https:\/\/doi.org\/10.1186\/1687-1499-2012-15","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"2149_CR19","doi-asserted-by":"publisher","unstructured":"C. Shea, B. Hassanabadi, S. Valaee, Mobility-based clustering in VANETs using affinity propagation, in GLOBECOM 2009\u20142009 IEEE Global Telecommunications Conference (2009), pp. 1\u20136. https:\/\/doi.org\/10.1109\/GLOCOM.2009.5425236","DOI":"10.1109\/GLOCOM.2009.5425236"},{"issue":"1","key":"2149_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jnca.2010.07.016","volume":"34","author":"A Daeinabi","year":"2011","unstructured":"A. Daeinabi, A.G. Pour Rahbar, A. Khademzadeh, VWCA: An efficient clustering algorithm in vehicular ad hoc networks. J. Netw. Comput. Appl. 34(1), 207\u2013222 (2011). https:\/\/doi.org\/10.1016\/j.jnca.2010.07.016","journal-title":"J. Netw. Comput. Appl."},{"key":"2149_CR21","doi-asserted-by":"publisher","first-page":"14624","DOI":"10.1109\/ACCESS.2022.3147498","volume":"10","author":"MM Hamdi","year":"2022","unstructured":"M.M. Hamdi, L. Audah, S.A. Rashid, Data dissemination in VANETs using clustering and probabilistic forwarding based on adaptive jumping multi-objective firefly optimization. IEEE Access 10, 14624\u201314642 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3147498","journal-title":"IEEE Access"},{"issue":"4","key":"2149_CR22","doi-asserted-by":"publisher","first-page":"2621","DOI":"10.1109\/TVT.2015.2421277","volume":"65","author":"S Ucar","year":"2016","unstructured":"S. Ucar, S.C. Ergen, O. Ozkasap, Multihop-cluster-based IEEE 802.11p and LTE hybrid architecture for VANET safety message dissemination. IEEE Trans. Veh. Technol. 65(4), 2621\u20132636 (2016). https:\/\/doi.org\/10.1109\/TVT.2015.2421277","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"1","key":"2149_CR23","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1186\/s13638-015-0327-0","volume":"2015","author":"Y Chen","year":"2015","unstructured":"Y. Chen, M. Fang, S. Shi, W. Guo, X. Zheng, Distributed multi-hop clustering algorithm for VANETs based on neighborhood follow. EURASIP J. Wirel. Commun. Netw. 2015(1), 98 (2015). https:\/\/doi.org\/10.1186\/s13638-015-0327-0","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"1","key":"2149_CR24","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s11276-021-02822-9","volume":"28","author":"A Katiyar","year":"2022","unstructured":"A. Katiyar, D. Singh, R.S. Yadav, Advanced multi-hop clustering (AMC) in vehicular ad-hoc network. Wirel. Netw. 28(1), 45\u201368 (2022). https:\/\/doi.org\/10.1007\/s11276-021-02822-9","journal-title":"Wirel. Netw."},{"key":"2149_CR25","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1049\/iet-its:20070052","volume":"3","author":"RT Goonewardene","year":"2009","unstructured":"R.T. Goonewardene, F.H. Ali, E. Stipidis, Robust mobility adaptive clustering scheme with support for geographic routing for vehicular ad hoc networks. IET Intell. Transp. Syst. 3, 148\u201315810 (2009)","journal-title":"IET Intell. Transp. Syst."},{"key":"2149_CR26","doi-asserted-by":"publisher","unstructured":"L. Bononi, M. di Felice, A cross layered mac and clustering scheme for efficient broadcast in vanets, in 2007 IEEE International Conference on Mobile Adhoc and Sensor Systems (2007), pp. 1\u20138. https:\/\/doi.org\/10.1109\/MOBHOC.2007.4428735","DOI":"10.1109\/MOBHOC.2007.4428735"},{"key":"2149_CR27","doi-asserted-by":"publisher","unstructured":"R.A. Santos, R.M. Edwards, A. Edwards, Cluster-based location routing algorithm for inter-vehicle communication, in IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall, vol. 2 (2004), pp. 914\u20139182. https:\/\/doi.org\/10.1109\/VETECF.2004.1400154","DOI":"10.1109\/VETECF.2004.1400154"},{"key":"2149_CR28","doi-asserted-by":"publisher","unstructured":"S. Basagni, Distributed clustering for ad hoc networks, in Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN\u201999) (1999), pp. 310\u2013315. https:\/\/doi.org\/10.1109\/ISPAN.1999.778957","DOI":"10.1109\/ISPAN.1999.778957"},{"key":"2149_CR29","doi-asserted-by":"publisher","DOI":"10.3390\/s16020245","author":"Y Chen","year":"2016","unstructured":"Y. Chen, S. Weng, W. Guo, N. Xiong, A game theory algorithm for intra-cluster data aggregation in a vehicular ad hoc network. Sensors (2016). https:\/\/doi.org\/10.3390\/s16020245","journal-title":"Sensors"},{"issue":"5","key":"2149_CR30","doi-asserted-by":"publisher","first-page":"4501","DOI":"10.1109\/TVT.2018.2790391","volume":"67","author":"AA Khan","year":"2018","unstructured":"A.A. Khan, M. Abolhasan, W. Ni, An evolutionary game theoretic approach for stable and optimized clustering in VANETs. IEEE Trans. Veh. Technol. 67(5), 4501\u20134513 (2018). https:\/\/doi.org\/10.1109\/TVT.2018.2790391","journal-title":"IEEE Trans. Veh. Technol."},{"key":"2149_CR31","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1017\/CBO9780511895043","volume-title":"Game Theory in Wireless and Communication Networks: Theory, Models, and Applications","author":"Z Han","year":"2011","unstructured":"Z. Han, D. Niyato, W. Saad, T. Ba\u015far, A. Hj\u00f8rungnes, Game Theory in Wireless and Communication Networks: Theory, Models, and Applications (Cambridge University Press, Cambridge, 2011), p. 188. https:\/\/doi.org\/10.1017\/CBO9780511895043"},{"issue":"5","key":"2149_CR32","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/MSP.2009.000000","volume":"26","author":"W Saad","year":"2009","unstructured":"W. Saad, Z. Han, M. Debbah, A. Hjorungnes, T. Basar, Coalitional game theory for communication networks. IEEE Signal Process. Mag. 26(5), 77\u201397 (2009). https:\/\/doi.org\/10.1109\/MSP.2009.000000","journal-title":"IEEE Signal Process. Mag."},{"issue":"5","key":"2149_CR33","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1109\/TMC.2012.46","volume":"12","author":"K Akkarajitsakul","year":"2013","unstructured":"K. Akkarajitsakul, E. Hossain, D. Niyato, Cooperative packet delivery in hybrid wireless mobile networks: a coalitional game approach. IEEE Trans. Mob. Comput. 12(5), 840\u2013854 (2013). https:\/\/doi.org\/10.1109\/TMC.2012.46","journal-title":"IEEE Trans. Mob. Comput."},{"key":"2149_CR34","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3069463","author":"P Hang","year":"2021","unstructured":"P. Hang, C. Lv, C. Huang, Y. Xing, Z. Hu, Cooperative decision making of connected automated vehicles at multi-lane merging zone: a coalitional game approach. IEEE Trans. Intell. Transp. Syst. (2021). https:\/\/doi.org\/10.1109\/TITS.2021.3069463","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"3","key":"2149_CR35","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1287\/moor.2.3.225","volume":"2","author":"R Myerson","year":"1977","unstructured":"R. Myerson, Graphs and cooperation in games. Math. Oper. Res. 2(3), 225\u2013229 (1977)","journal-title":"Math. Oper. Res."},{"key":"2149_CR36","doi-asserted-by":"publisher","unstructured":"L. Zhai, H. Ji, X. Li, Y. Tang, Coalition graph game for joint relay selection and resource allocation in cooperative cognitive radio networks, in 2012 IEEE Global Communications Conference (GLOBECOM) (2012), pp. 1818\u20131823. https:\/\/doi.org\/10.1109\/GLOCOM.2012.6503379","DOI":"10.1109\/GLOCOM.2012.6503379"},{"issue":"8","key":"2149_CR37","doi-asserted-by":"publisher","first-page":"4010","DOI":"10.1109\/TVT.2013.2245353","volume":"62","author":"T Wang","year":"2013","unstructured":"T. Wang, L. Song, Z. Han, Coalitional graph games for popular content distribution in cognitive radio VANETs. IEEE Trans. Veh. Technol. 62(8), 4010\u20134019 (2013). https:\/\/doi.org\/10.1109\/TVT.2013.2245353","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"2","key":"2149_CR38","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P Gupta","year":"2000","unstructured":"P. Gupta, P.R. Kumar, The capacity of wireless networks. IEEE Trans. Inf. Theory 46(2), 388\u2013404 (2000). https:\/\/doi.org\/10.1109\/18.825799","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2149_CR39","doi-asserted-by":"publisher","DOI":"10.3390\/electronics8030340","author":"W Liu","year":"2019","unstructured":"W. Liu, X. He, Z. Huang, Y. Ji, Transmission capacity characterization in VANETs with enhanced distributed channel access. Electronics (2019). https:\/\/doi.org\/10.3390\/electronics8030340","journal-title":"Electronics"},{"issue":"3","key":"2149_CR40","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0167-2681(02)00015-X","volume":"49","author":"T Arnold","year":"2002","unstructured":"T. Arnold, U. Schwalbe, Dynamic coalition formation and the core. J. Econ. Behav. Organ. 49(3), 363\u2013380 (2002)","journal-title":"J. Econ. Behav. Organ."},{"key":"2149_CR41","volume-title":"Finite Markov Chains","author":"JG Kemeny","year":"1983","unstructured":"J.G. Kemeny, J.L. Snell, Finite Markov Chains (Springer, New York, 1983)"},{"key":"2149_CR42","volume-title":"Operations Research: An Introduction","author":"HA Taha","year":"2006","unstructured":"H.A. Taha, Operations Research: An Introduction, 8th edn. (Prentice-Hall Inc, Upper Saddle River, 2006)","edition":"8"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02149-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-022-02149-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02149-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T10:10:25Z","timestamp":1660039825000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-022-02149-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,9]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["2149"],"URL":"https:\/\/doi.org\/10.1186\/s13638-022-02149-9","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,9]]},"assertion":[{"value":"17 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"67"}}