{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:44:39Z","timestamp":1771659879512,"version":"3.50.1"},"reference-count":29,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T00:00:00Z","timestamp":1552348800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005791","name":"Sirindhorn International Institute of Technology, Thammasat University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005791","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer Networks and Communications"],"published-print":{"date-parts":[[2019,3,12]]},"abstract":"<jats:p>Safety message verification plays an important role in securing vehicular ad hoc networks (VANETs). As safety messages are broadcasted several times per second in a highly dense network, message arrival rate can easily exceed the verification rate of safety messages at a vehicle. As a result, an algorithm is needed for selecting and prioritizing relevant messages from received messages to increase the awareness of vehicles in the vicinity. This paper presents the history-based relative-time zone (HRTZ) priority scheme for selecting and verifying relevant received safety messages. HRTZ is an enhanced version of our previously proposed relative-time zone (RTZ) priority scheme. HRTZ achieves higher awareness of nearby vehicles and works in different road configurations. To increase awareness of neighboring vehicles, the average velocity of neighboring vehicles in the range of communication is used to determine the range of the danger zone and other zones. The messages are ranked based on the zone of transmitting vehicles, road configuration (with\/without a barrier) and transmitting vehicle location and direction, and relative time between transmitting and receiving vehicles. Only the most up-to-date message from each vehicle is kept in the receiver\u2019s buffer. As a result, each neighboring vehicle has only the most recent safety message in the buffer at any time. The simulation results show that HRTZ achieves a higher rate of verified messages with low delay for nearby vehicles and achieves higher awareness for vehicles in the vicinity, when compared to RTZ and other existing schemes.<\/jats:p>","DOI":"10.1155\/2019\/8568912","type":"journal-article","created":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T19:30:32Z","timestamp":1552419032000},"page":"1-14","source":"Crossref","is-referenced-by-count":4,"title":["Safety Message Verification Using History-Based Relative-Time Zone Priority Scheme"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9573-0342","authenticated-orcid":true,"given":"Sam","family":"Banani","sequence":"first","affiliation":[{"name":"School of Information, Computer, and Communication Technology, Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6841-0335","authenticated-orcid":true,"given":"Somsak","family":"Kittipiyakul","sequence":"additional","affiliation":[{"name":"School of Information, Computer, and Communication Technology, Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Surapa","family":"Thiemjarus","sequence":"additional","affiliation":[{"name":"National Electronics and Computer Technology Center, Pathum Thani, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Gordon","sequence":"additional","affiliation":[{"name":"School of Engineering and Technology CQUniversity, Cairns, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","year":"2015"},{"key":"2","year":"2015"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.trf.2012.09.004"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/s1369-8478(00)00015-2"},{"key":"5","volume-title":"IEEE guide for wireless access in vehicular environments (WAVE)-architecture","year":"2014"},{"key":"6","year":"2011"},{"key":"7","year":"2014"},{"key":"8","year":"2005"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2013.2238566"},{"key":"13","volume":"1","year":"2017","journal-title":"Space-Based and Situated Computing"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.3390\/s18041195"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-011-9589-y"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/wc-m.2006.250352"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2008.928581"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/t-wc.2008.080280"},{"key":"23","year":"2005","journal-title":"IEEE Std 802.11e"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/1246172"},{"key":"31","year":"2010","journal-title":"IEEE Std 802.11p"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2011.41"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.12.010"},{"key":"42","volume-title":"Perfect binary tree","year":"2008"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1109\/comst.2008.4564481"},{"key":"46","volume-title":"Car to car communication consortium manifesto: overview overview of the C2C-CC system, car to car communication consortium","year":"2007"},{"key":"47","year":"2009"},{"key":"48","volume-title":"Coopreative systems for road safety, safespot integrated project-IST-4-026963-IP deliverable","year":"2010"},{"key":"49","year":"2010"},{"key":"56","doi-asserted-by":"publisher","DOI":"10.1109\/jsac.2007.071002"},{"key":"59","doi-asserted-by":"publisher","DOI":"10.1016\/j.vehcom.2014.12.001"}],"container-title":["Journal of Computer Networks and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2019\/8568912.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2019\/8568912.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2019\/8568912.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T19:30:34Z","timestamp":1552419034000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/jcnc\/2019\/8568912\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,12]]},"references-count":29,"alternative-id":["8568912","8568912"],"URL":"https:\/\/doi.org\/10.1155\/2019\/8568912","relation":{},"ISSN":["2090-7141","2090-715X"],"issn-type":[{"value":"2090-7141","type":"print"},{"value":"2090-715X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,12]]}}}