{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:35:53Z","timestamp":1747190153883,"version":"3.40.5"},"reference-count":30,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,12,24]],"date-time":"2019-12-24T00:00:00Z","timestamp":1577145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2019,12,24]]},"abstract":"<jats:p>In vehicular ad hoc networks (VANETs), vehicle-to-vehicle (V2V) communication occurs opportunistically due to frequent node mobility and intermittent contact time. In this scenario, the performance evaluation of forwarding protocols by the use of the existing resources in the network is an open challenge, given the different strategies that the routing protocols adopt for choosing the next hop. Through the data analysis of three real taxis\u2019 mobility traces and varying the radio signal range from 50 meters to 1.000 meters, we could contribute to the analysis of the existence of single-radio transmission opportunities and their quantification and classification considering either serial or parallel. Additionally, the inventory analysis of communication resources is done by evaluating the data transmission rate and the beacon overhead impact and by the proposal of a new metric (TOppM<jats:sub><jats:italic>i<\/jats:italic><\/jats:sub>) for the performance evaluation of forwarding protocols. We discuss the impact on forwarding protocols by the appropriate use of this metric, and we show that this metric can be used either for performance evaluation of forwarding protocols or to improve the quality over the consumption of resources in vehicular ad hoc networks. Our metric can obtain the maximum theoretical resource usage independent of the scenario. Either for Rome or San Francisco or Shanghai, as the radio\u2019s signal range increases, the maximum theoretical amount of resources also increases. We could also show that, for the three scenarios, the beacon overhead has an insignificant impact over the total theoretical data inventory available. Furthermore, we classify the vehicles according to the contact time between them.<\/jats:p>","DOI":"10.1155\/2019\/1708437","type":"journal-article","created":{"date-parts":[[2019,12,24]],"date-time":"2019-12-24T18:30:34Z","timestamp":1577212234000},"page":"1-20","source":"Crossref","is-referenced-by-count":1,"title":["Transmission Opportunities: A New Approach to Improve Quality in V2V Networks"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1343-170X","authenticated-orcid":true,"given":"Carlos Rafael","family":"Guerber","sequence":"first","affiliation":[{"name":"Program of Electrical Engineering and Industrial Informatics\u2013CPGEI, Federal Technological University of Parana-UTFPR, Curitiba 80230-901, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2629-6343","authenticated-orcid":true,"given":"Eduardo Luis","family":"Gomes","sequence":"additional","affiliation":[{"name":"Program of Electrical Engineering and Industrial Informatics\u2013CPGEI, Federal Technological University of Parana-UTFPR, Curitiba 80230-901, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1604-0915","authenticated-orcid":true,"given":"Mauro S\u00e9rgio","family":"Pereira Fonseca","sequence":"additional","affiliation":[{"name":"Program of Electrical Engineering and Industrial Informatics\u2013CPGEI, Federal Technological University of Parana-UTFPR, Curitiba 80230-901, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0182-7128","authenticated-orcid":true,"given":"Anelise","family":"Munaretto","sequence":"additional","affiliation":[{"name":"Program of Electrical Engineering and Industrial Informatics\u2013CPGEI, Federal Technological University of Parana-UTFPR, Curitiba 80230-901, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6994-8076","authenticated-orcid":true,"given":"Thiago Henrique","family":"Silva","sequence":"additional","affiliation":[{"name":"Program of Electrical Engineering and Industrial Informatics\u2013CPGEI, Federal Technological University of Parana-UTFPR, Curitiba 80230-901, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/mic.2006.91"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2016.02.017"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/access.2016.2603219"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/tii.2014.2299233"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-010-9400-5"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2013.02.036"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/mcom.2010.5458377"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2009.12.009"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2010.06.006"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/745303"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.14257\/astl.2013.42.04"},{"key":"14","first-page":"1072","volume":"18","year":"2012","journal-title":"Journal of Universal Computer Science"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/access.2017.2692240"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2014.03.019"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/tmc.2010.246"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/taes.2018.2826201"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-017-1502-5"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/s10776-016-0315-2"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/tla.2016.7483493"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/access.2017.2733380"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/jsyst.2018.2806996"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2898776"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/tmc.2017.2690636"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.2307\/2309088"},{"volume":"2","year":"2001","key":"34"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2014.07.037"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-012-0600-8"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.10.012"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2019\/1708437.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2019\/1708437.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2019\/1708437.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,24]],"date-time":"2019-12-24T18:30:38Z","timestamp":1577212238000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/wcmc\/2019\/1708437\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,24]]},"references-count":30,"alternative-id":["1708437","1708437"],"URL":"https:\/\/doi.org\/10.1155\/2019\/1708437","relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2019,12,24]]}}}