Scalable Back-Bone-Assisted Hop Greedy Routing for VANET's City Environments (SBHG)
Vehicle Area Networks play very crucial role in variety of applications, such as Co-operative driving, Information sharing, other added services like Navigation, internet access etc. A lot more research is required in the optimal routing, sensing the vehicles, safely messages to be broadcasted etc....
Gespeichert in:
Veröffentlicht in: | International journal of computer applications 2014-01, Vol.96 (17), p.36-40 |
---|---|
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 | 40 |
---|---|
container_issue | 17 |
container_start_page | 36 |
container_title | International journal of computer applications |
container_volume | 96 |
creator | Thite, Rajani Bongale, A K |
description | Vehicle Area Networks play very crucial role in variety of applications, such as Co-operative driving, Information sharing, other added services like Navigation, internet access etc. A lot more research is required in the optimal routing, sensing the vehicles, safely messages to be broadcasted etc. To reach to the destination flooding like technologies are unreliable in sparse regions so shortest path algorithms has been used such algorithms can cause higher hop count. On-Demand routing protocols are used by mobile nodes in an ad hoc network. It offers quick adaptation to self-motivated link conditions, low processing and Network utilization, memory overhead, and which determines unicast routes to destinations within the ad hoc network. But path generated by these protocols may deviate far from the optimal because mobile nodes and no knowledge of current topology which causes higher hop counts. In this paper we proposed self-healing and optimizing routing techniques for VANETs which improves routing optimality by monitoring routing ways continuously and changes the path which is optimal and causes less hop count. |
doi_str_mv | 10.5120/16889-6912 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1559701872</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3360218181</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1322-3b7ca7f1d389299e28ee6e02abaf78e5b3956c16370c6fa394376d9617e0bf9b3</originalsourceid><addsrcrecordid>eNpdkEtLw0AUhQdRsNRu_AUDLqxCdB7JPJZtqK1QFGx1GyaTG0lNM3UmEfrvTa0L8W7OXXwcDh9Cl5TcJZSReyqU0pHQlJ2gAdEyiZRS8vTPf45GIWxIf1wzoeMBWq2sqU1eA54a-xFNXQPRJIQqtFDghdvhuQco9vjFdW3VvOPSefw2eZqtrwNOq3aPZ81X5V2zhaYNeLyaLuY3F-isNHWA0W8O0evDbJ0uouXz_DGdLCNLOWMRz6U1sqQFV5ppDUwBCCDM5KaUCpKc60RYKrgkVpSG65hLUWhBJZC81DkfovGxd-fdZwehzbZVsFDXpgHXhYwmiZaEKsl69OofunGdb_p1PRWzmMSEJz11e6SsdyF4KLOdr7bG7zNKsoPi7EdxdlDMvwGZDGom</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1542404035</pqid></control><display><type>article</type><title>Scalable Back-Bone-Assisted Hop Greedy Routing for VANET's City Environments (SBHG)</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Thite, Rajani ; Bongale, A K</creator><creatorcontrib>Thite, Rajani ; Bongale, A K</creatorcontrib><description>Vehicle Area Networks play very crucial role in variety of applications, such as Co-operative driving, Information sharing, other added services like Navigation, internet access etc. A lot more research is required in the optimal routing, sensing the vehicles, safely messages to be broadcasted etc. To reach to the destination flooding like technologies are unreliable in sparse regions so shortest path algorithms has been used such algorithms can cause higher hop count. On-Demand routing protocols are used by mobile nodes in an ad hoc network. It offers quick adaptation to self-motivated link conditions, low processing and Network utilization, memory overhead, and which determines unicast routes to destinations within the ad hoc network. But path generated by these protocols may deviate far from the optimal because mobile nodes and no knowledge of current topology which causes higher hop counts. In this paper we proposed self-healing and optimizing routing techniques for VANETs which improves routing optimality by monitoring routing ways continuously and changes the path which is optimal and causes less hop count.</description><identifier>ISSN: 0975-8887</identifier><identifier>EISSN: 0975-8887</identifier><identifier>DOI: 10.5120/16889-6912</identifier><language>eng</language><publisher>New York: Foundation of Computer Science</publisher><subject>Ad hoc networks ; Algorithms ; Computer networks ; Counting ; Networks ; Optimization ; Routing (telecommunications) ; Vehicles</subject><ispartof>International journal of computer applications, 2014-01, Vol.96 (17), p.36-40</ispartof><rights>Copyright Foundation of Computer Science 2014</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,27924,27925</link.rule.ids></links><search><creatorcontrib>Thite, Rajani</creatorcontrib><creatorcontrib>Bongale, A K</creatorcontrib><title>Scalable Back-Bone-Assisted Hop Greedy Routing for VANET's City Environments (SBHG)</title><title>International journal of computer applications</title><description>Vehicle Area Networks play very crucial role in variety of applications, such as Co-operative driving, Information sharing, other added services like Navigation, internet access etc. A lot more research is required in the optimal routing, sensing the vehicles, safely messages to be broadcasted etc. To reach to the destination flooding like technologies are unreliable in sparse regions so shortest path algorithms has been used such algorithms can cause higher hop count. On-Demand routing protocols are used by mobile nodes in an ad hoc network. It offers quick adaptation to self-motivated link conditions, low processing and Network utilization, memory overhead, and which determines unicast routes to destinations within the ad hoc network. But path generated by these protocols may deviate far from the optimal because mobile nodes and no knowledge of current topology which causes higher hop counts. In this paper we proposed self-healing and optimizing routing techniques for VANETs which improves routing optimality by monitoring routing ways continuously and changes the path which is optimal and causes less hop count.</description><subject>Ad hoc networks</subject><subject>Algorithms</subject><subject>Computer networks</subject><subject>Counting</subject><subject>Networks</subject><subject>Optimization</subject><subject>Routing (telecommunications)</subject><subject>Vehicles</subject><issn>0975-8887</issn><issn>0975-8887</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNpdkEtLw0AUhQdRsNRu_AUDLqxCdB7JPJZtqK1QFGx1GyaTG0lNM3UmEfrvTa0L8W7OXXwcDh9Cl5TcJZSReyqU0pHQlJ2gAdEyiZRS8vTPf45GIWxIf1wzoeMBWq2sqU1eA54a-xFNXQPRJIQqtFDghdvhuQco9vjFdW3VvOPSefw2eZqtrwNOq3aPZ81X5V2zhaYNeLyaLuY3F-isNHWA0W8O0evDbJ0uouXz_DGdLCNLOWMRz6U1sqQFV5ppDUwBCCDM5KaUCpKc60RYKrgkVpSG65hLUWhBJZC81DkfovGxd-fdZwehzbZVsFDXpgHXhYwmiZaEKsl69OofunGdb_p1PRWzmMSEJz11e6SsdyF4KLOdr7bG7zNKsoPi7EdxdlDMvwGZDGom</recordid><startdate>20140101</startdate><enddate>20140101</enddate><creator>Thite, Rajani</creator><creator>Bongale, A K</creator><general>Foundation of Computer Science</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140101</creationdate><title>Scalable Back-Bone-Assisted Hop Greedy Routing for VANET's City Environments (SBHG)</title><author>Thite, Rajani ; Bongale, A K</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1322-3b7ca7f1d389299e28ee6e02abaf78e5b3956c16370c6fa394376d9617e0bf9b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Ad hoc networks</topic><topic>Algorithms</topic><topic>Computer networks</topic><topic>Counting</topic><topic>Networks</topic><topic>Optimization</topic><topic>Routing (telecommunications)</topic><topic>Vehicles</topic><toplevel>online_resources</toplevel><creatorcontrib>Thite, Rajani</creatorcontrib><creatorcontrib>Bongale, A K</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Thite, Rajani</au><au>Bongale, A K</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scalable Back-Bone-Assisted Hop Greedy Routing for VANET's City Environments (SBHG)</atitle><jtitle>International journal of computer applications</jtitle><date>2014-01-01</date><risdate>2014</risdate><volume>96</volume><issue>17</issue><spage>36</spage><epage>40</epage><pages>36-40</pages><issn>0975-8887</issn><eissn>0975-8887</eissn><abstract>Vehicle Area Networks play very crucial role in variety of applications, such as Co-operative driving, Information sharing, other added services like Navigation, internet access etc. A lot more research is required in the optimal routing, sensing the vehicles, safely messages to be broadcasted etc. To reach to the destination flooding like technologies are unreliable in sparse regions so shortest path algorithms has been used such algorithms can cause higher hop count. On-Demand routing protocols are used by mobile nodes in an ad hoc network. It offers quick adaptation to self-motivated link conditions, low processing and Network utilization, memory overhead, and which determines unicast routes to destinations within the ad hoc network. But path generated by these protocols may deviate far from the optimal because mobile nodes and no knowledge of current topology which causes higher hop counts. In this paper we proposed self-healing and optimizing routing techniques for VANETs which improves routing optimality by monitoring routing ways continuously and changes the path which is optimal and causes less hop count.</abstract><cop>New York</cop><pub>Foundation of Computer Science</pub><doi>10.5120/16889-6912</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0975-8887 |
ispartof | International journal of computer applications, 2014-01, Vol.96 (17), p.36-40 |
issn | 0975-8887 0975-8887 |
language | eng |
recordid | cdi_proquest_miscellaneous_1559701872 |
source | EZB-FREE-00999 freely available EZB journals |
subjects | Ad hoc networks Algorithms Computer networks Counting Networks Optimization Routing (telecommunications) Vehicles |
title | Scalable Back-Bone-Assisted Hop Greedy Routing for VANET's City Environments (SBHG) |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T08%3A17%3A10IST&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=Scalable%20Back-Bone-Assisted%20Hop%20Greedy%20Routing%20for%20VANET's%20City%20Environments%20(SBHG)&rft.jtitle=International%20journal%20of%20computer%20applications&rft.au=Thite,%20Rajani&rft.date=2014-01-01&rft.volume=96&rft.issue=17&rft.spage=36&rft.epage=40&rft.pages=36-40&rft.issn=0975-8887&rft.eissn=0975-8887&rft_id=info:doi/10.5120/16889-6912&rft_dat=%3Cproquest_cross%3E3360218181%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=1542404035&rft_id=info:pmid/&rfr_iscdi=true |