{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:50:53Z","timestamp":1753887053895,"version":"3.41.2"},"reference-count":30,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"vor","delay-in-days":302,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61803206"],"award-info":[{"award-number":["61803206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010743","name":"Nanjing Forestry University","doi-asserted-by":"publisher","award":["CX2018004","nlzzyq201827"],"award-info":[{"award-number":["CX2018004","nlzzyq201827"]}],"id":[{"id":"10.13039\/100010743","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>Spacer bars in the smart reversible lanes make periodically broadcast of messages to share their local observed traffic information with each other. This aims to help other spacer bars acquire the global traffic information and make consistent movement when separating the flows. However, radio interference and vehicles in the traffic may degrade the qualities of wireless communication links and cause frequent message losses in the broadcast. Existing solutions tend to use data forwarding to enhance the message dissemination, which may cause imbalanced load in the spacer bars. For instance, the nodes close to the sink have to forward more messages, whereas the ones far away from the sink have fewer messages for forwarding. The unbalanced distribution of network load has a high risk of blocking the wireless communication links and yield inconsistent movement in the reversible lanes. In this paper, we propose a Cooperative Bargain (CoB) scheme where each spacer bar carries some received messages to help other spacer bars recover their lost messages. Since the spacer bars can only acquire the local information, we formulate a cooperative bargain game to negotiate how to allocate the task of message recovery with a balanced network load until a consensus is achieved. CoB is evaluated with the real\u2010world Wi\u2010Fi communication traces in Isti\/rural. Simulation results show that CoB can recover an average of 98.6% messages within 100 milliseconds in a 50\u2010node network. CoB does not require the global network information but it can still achieve a comparable performance to other broadcast schemes.<\/jats:p>","DOI":"10.1155\/2019\/2893732","type":"journal-article","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T23:30:56Z","timestamp":1572478256000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cooperative Bargain for the Autonomous Separation of Traffic Flows in Smart Reversible Lanes"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1063-6451","authenticated-orcid":false,"given":"Guangbing","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Haibo","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5750-3555","authenticated-orcid":false,"given":"Ning","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4241-1698","authenticated-orcid":false,"given":"Yong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jiamin","family":"Shi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0688-2270","authenticated-orcid":false,"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2019,10,30]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2018.07.004"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijtst.2017.05.006"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apergo.2017.11.013"},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-51204-4_26"},{"key":"e_1_2_11_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12209-015-2382-3"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.5772\/13367"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2017.2775249"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2018.2879723"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2018.2890685"},{"key":"e_1_2_11_10_2","doi-asserted-by":"publisher","DOI":"10.1080\/15472450.2017.1387546"},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2018.10.003"},{"key":"e_1_2_11_12_2","article-title":"Timed bargaining-based opportunistic routing model for dynamic vehicular ad hoc network","volume":"14","author":"Kim S.","year":"2016","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"e_1_2_11_13_2","doi-asserted-by":"crossref","unstructured":"PrasetyaN. W. SheuT.-L. BasukiA. andMuslimM. A. A pre-emptive traffic model with cluster-based TDMA for vehicular networks Proceedings of the 2016 24th International Conference on Software Telecommunications and Computer Networks (SoftCOM) September 2016 Split Croatia 1\u20135 https:\/\/doi.org\/10.1109\/softcom.2016.7772110 2-s2.0-85010424041.","DOI":"10.1109\/SOFTCOM.2016.7772110"},{"key":"e_1_2_11_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1824766.1824771"},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.06.001"},{"key":"e_1_2_11_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/s1005-8885(17)60200-0"},{"key":"e_1_2_11_17_2","doi-asserted-by":"publisher","DOI":"10.1080\/02564602.2017.1281173"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.5626\/jok.2015.42.6.791"},{"key":"e_1_2_11_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2015.06.005"},{"key":"e_1_2_11_20_2","doi-asserted-by":"crossref","unstructured":"XiaoG. ZhangH. HuangZ. andChenY. Decentralized cooperative piggybacking for reliable broadcast in the VANET Proceedings of the 2016 IEEE 83rd Vehicular Technology Conference May 2016 Nanjing China https:\/\/doi.org\/10.1109\/vtcspring.2016.7504184 2-s2.0-84979747398.","DOI":"10.1109\/VTCSpring.2016.7504184"},{"key":"e_1_2_11_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/jsen.2016.2527056"},{"key":"e_1_2_11_22_2","doi-asserted-by":"crossref","unstructured":"KaulS. YatesR. andGruteserM. On piggybacking in vehicular networks 1 Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2011) December 2011 Houston TX USA 1\u20135.","DOI":"10.1109\/GLOCOM.2011.6134181"},{"key":"e_1_2_11_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2016.2562627"},{"key":"e_1_2_11_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2015.2498284"},{"key":"e_1_2_11_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.vehcom.2017.03.001"},{"key":"e_1_2_11_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-014-2134-z"},{"key":"e_1_2_11_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/tst.2016.7536714"},{"key":"e_1_2_11_28_2","doi-asserted-by":"crossref","unstructured":"XiaoG. ZhangH. HuangZ. andChenY. Decentralised data piggybacking and link scheduling for reliable broadcast in VANETs Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access November 2017 Miami FL USA 33\u201340 https:\/\/doi.org\/10.1145\/3132062.3132078 2-s2.0-85047969974.","DOI":"10.1145\/3132062.3132078"},{"key":"e_1_2_11_29_2","doi-asserted-by":"crossref","unstructured":"BilstrupK. S. UhlemannE. andStromE. G. Scalability issues of the MAC methods STDMA and CSMA of IEEE 802.11p when used in VANETs Proceedings of the IEEE International Conference on Communications Workshops (ICC) May 2010 Cape Town South Africa 1\u20135 https:\/\/doi.org\/10.1109\/iccw.2010.5503941 2-s2.0-77954928450.","DOI":"10.1109\/ICCW.2010.5503941"},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2018.01.005"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/2893732.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/2893732.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2019\/2893732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:25:34Z","timestamp":1723029934000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2019\/2893732"}},"subtitle":[],"editor":[{"given":"Marin","family":"Lujak","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1155\/2019\/2893732"],"URL":"https:\/\/doi.org\/10.1155\/2019\/2893732","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"2019-04-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"2893732"}}