An Enhanced Algorithm of Improved Response Time of ITS-G5 Protocol
This research article proposes an algorithm for improving the ITS-G5 protocol, which addresses the issue of response time. The algorithm includes the integration of Dijkstra's algorithm to prioritize shorter paths for message transmission, resulting in reduced delays. The initial algorithm for...
Gespeichert in:
| Veröffentlicht in: | International journal of advanced computer science & applications 2023, Vol.14 (8) |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 8 |
| container_start_page | |
| container_title | International journal of advanced computer science & applications |
| container_volume | 14 |
| creator | Jellid, Kawtar Mazri, Tomader |
| description | This research article proposes an algorithm for improving the ITS-G5 protocol, which addresses the issue of response time. The algorithm includes the integration of Dijkstra's algorithm to prioritize shorter paths for message transmission, resulting in reduced delays. The initial algorithm for the ITS-G5 protocol is presented, followed by the modified algorithm that incorporates Dijkstra's algorithm. The modified algorithm utilizes a node-based approach and implements Dijkstra's algorithm to find the shortest path between two nodes. The algorithm is evaluated in a scenario involving 20 vehicles, where each vehicle has its own message. The results show improved communication efficiency and reduced response time compared to the original ITS-G5 protocol. |
| doi_str_mv | 10.14569/IJACSA.2023.0140821 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2869803775</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2869803775</sourcerecordid><originalsourceid>FETCH-LOGICAL-c274t-514b89b768bc2f7da8aa454f01f143a35fc856e14fdb8c5956d2cd45a8eea823</originalsourceid><addsrcrecordid>eNotkE9LAzEQxYMoWGq_gYcFz1vzb5LscS21VgqK3YO3kM0mtqW7qclW8Nu7tp3LG2Ye84YfQvcETwkHUTwuX8vZupxSTNkUE44VJVdoRAmIHEDi61OvcoLl5y2apLTDQ7GCCsVG6Knssnm3MZ11TVbuv0Lc9ps2Cz5btocYfobph0uH0CWXVdvWnTbVOl9A9h5DH2zY36Ebb_bJTS46RtXzvJq95Ku3xXJWrnJLJe9zILxWRS2Fqi31sjHKGA7cY-IJZ4aBtwqEI9w3tbJQgGiobTgY5ZxRlI3Rw_ns8Nb30aVe78IxdkOipkoUCjMpYXDxs8vGkFJ0Xh_itjXxVxOsT7z0mZf-56UvvNgfpENcZg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2869803775</pqid></control><display><type>article</type><title>An Enhanced Algorithm of Improved Response Time of ITS-G5 Protocol</title><source>EZB Electronic Journals Library</source><creator>Jellid, Kawtar ; Mazri, Tomader</creator><creatorcontrib>Jellid, Kawtar ; Mazri, Tomader</creatorcontrib><description>This research article proposes an algorithm for improving the ITS-G5 protocol, which addresses the issue of response time. The algorithm includes the integration of Dijkstra's algorithm to prioritize shorter paths for message transmission, resulting in reduced delays. The initial algorithm for the ITS-G5 protocol is presented, followed by the modified algorithm that incorporates Dijkstra's algorithm. The modified algorithm utilizes a node-based approach and implements Dijkstra's algorithm to find the shortest path between two nodes. The algorithm is evaluated in a scenario involving 20 vehicles, where each vehicle has its own message. The results show improved communication efficiency and reduced response time compared to the original ITS-G5 protocol.</description><identifier>ISSN: 2158-107X</identifier><identifier>EISSN: 2156-5570</identifier><identifier>DOI: 10.14569/IJACSA.2023.0140821</identifier><language>eng</language><publisher>West Yorkshire: Science and Information (SAI) Organization Limited</publisher><subject>Algorithms ; Automobiles ; Autonomous vehicles ; Collaboration ; Communication ; Computer science ; Dijkstra's algorithm ; Efficiency ; Energy consumption ; Infrastructure ; Messages ; Protocol ; Response time ; Response time (computers) ; Shortest-path problems ; Traffic control ; Traffic flow</subject><ispartof>International journal of advanced computer science & applications, 2023, Vol.14 (8)</ispartof><rights>2023. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids></links><search><creatorcontrib>Jellid, Kawtar</creatorcontrib><creatorcontrib>Mazri, Tomader</creatorcontrib><title>An Enhanced Algorithm of Improved Response Time of ITS-G5 Protocol</title><title>International journal of advanced computer science & applications</title><description>This research article proposes an algorithm for improving the ITS-G5 protocol, which addresses the issue of response time. The algorithm includes the integration of Dijkstra's algorithm to prioritize shorter paths for message transmission, resulting in reduced delays. The initial algorithm for the ITS-G5 protocol is presented, followed by the modified algorithm that incorporates Dijkstra's algorithm. The modified algorithm utilizes a node-based approach and implements Dijkstra's algorithm to find the shortest path between two nodes. The algorithm is evaluated in a scenario involving 20 vehicles, where each vehicle has its own message. The results show improved communication efficiency and reduced response time compared to the original ITS-G5 protocol.</description><subject>Algorithms</subject><subject>Automobiles</subject><subject>Autonomous vehicles</subject><subject>Collaboration</subject><subject>Communication</subject><subject>Computer science</subject><subject>Dijkstra's algorithm</subject><subject>Efficiency</subject><subject>Energy consumption</subject><subject>Infrastructure</subject><subject>Messages</subject><subject>Protocol</subject><subject>Response time</subject><subject>Response time (computers)</subject><subject>Shortest-path problems</subject><subject>Traffic control</subject><subject>Traffic flow</subject><issn>2158-107X</issn><issn>2156-5570</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNotkE9LAzEQxYMoWGq_gYcFz1vzb5LscS21VgqK3YO3kM0mtqW7qclW8Nu7tp3LG2Ye84YfQvcETwkHUTwuX8vZupxSTNkUE44VJVdoRAmIHEDi61OvcoLl5y2apLTDQ7GCCsVG6Knssnm3MZ11TVbuv0Lc9ps2Cz5btocYfobph0uH0CWXVdvWnTbVOl9A9h5DH2zY36Ebb_bJTS46RtXzvJq95Ku3xXJWrnJLJe9zILxWRS2Fqi31sjHKGA7cY-IJZ4aBtwqEI9w3tbJQgGiobTgY5ZxRlI3Rw_ns8Nb30aVe78IxdkOipkoUCjMpYXDxs8vGkFJ0Xh_itjXxVxOsT7z0mZf-56UvvNgfpENcZg</recordid><startdate>2023</startdate><enddate>2023</enddate><creator>Jellid, Kawtar</creator><creator>Mazri, Tomader</creator><general>Science and Information (SAI) Organization Limited</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7XB</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>2023</creationdate><title>An Enhanced Algorithm of Improved Response Time of ITS-G5 Protocol</title><author>Jellid, Kawtar ; Mazri, Tomader</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c274t-514b89b768bc2f7da8aa454f01f143a35fc856e14fdb8c5956d2cd45a8eea823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Automobiles</topic><topic>Autonomous vehicles</topic><topic>Collaboration</topic><topic>Communication</topic><topic>Computer science</topic><topic>Dijkstra's algorithm</topic><topic>Efficiency</topic><topic>Energy consumption</topic><topic>Infrastructure</topic><topic>Messages</topic><topic>Protocol</topic><topic>Response time</topic><topic>Response time (computers)</topic><topic>Shortest-path problems</topic><topic>Traffic control</topic><topic>Traffic flow</topic><toplevel>online_resources</toplevel><creatorcontrib>Jellid, Kawtar</creatorcontrib><creatorcontrib>Mazri, Tomader</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of advanced computer science & applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jellid, Kawtar</au><au>Mazri, Tomader</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Enhanced Algorithm of Improved Response Time of ITS-G5 Protocol</atitle><jtitle>International journal of advanced computer science & applications</jtitle><date>2023</date><risdate>2023</risdate><volume>14</volume><issue>8</issue><issn>2158-107X</issn><eissn>2156-5570</eissn><abstract>This research article proposes an algorithm for improving the ITS-G5 protocol, which addresses the issue of response time. The algorithm includes the integration of Dijkstra's algorithm to prioritize shorter paths for message transmission, resulting in reduced delays. The initial algorithm for the ITS-G5 protocol is presented, followed by the modified algorithm that incorporates Dijkstra's algorithm. The modified algorithm utilizes a node-based approach and implements Dijkstra's algorithm to find the shortest path between two nodes. The algorithm is evaluated in a scenario involving 20 vehicles, where each vehicle has its own message. The results show improved communication efficiency and reduced response time compared to the original ITS-G5 protocol.</abstract><cop>West Yorkshire</cop><pub>Science and Information (SAI) Organization Limited</pub><doi>10.14569/IJACSA.2023.0140821</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2158-107X |
| ispartof | International journal of advanced computer science & applications, 2023, Vol.14 (8) |
| issn | 2158-107X 2156-5570 |
| language | eng |
| recordid | cdi_proquest_journals_2869803775 |
| source | EZB Electronic Journals Library |
| subjects | Algorithms Automobiles Autonomous vehicles Collaboration Communication Computer science Dijkstra's algorithm Efficiency Energy consumption Infrastructure Messages Protocol Response time Response time (computers) Shortest-path problems Traffic control Traffic flow |
| title | An Enhanced Algorithm of Improved Response Time of ITS-G5 Protocol |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T17%3A33%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Enhanced%20Algorithm%20of%20Improved%20Response%20Time%20of%20ITS-G5%20Protocol&rft.jtitle=International%20journal%20of%20advanced%20computer%20science%20&%20applications&rft.au=Jellid,%20Kawtar&rft.date=2023&rft.volume=14&rft.issue=8&rft.issn=2158-107X&rft.eissn=2156-5570&rft_id=info:doi/10.14569/IJACSA.2023.0140821&rft_dat=%3Cproquest_cross%3E2869803775%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2869803775&rft_id=info:pmid/&rfr_iscdi=true |