Interference-aware autonomous vehicle routing among CBSDs
A graph of devices is constructed, each network device serving an amount of bandwidth over the network, each vertex of the graph corresponding to a respective one of the network devices, each edge of the graph connecting network devices by interference weight, such that edges between connected netwo...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Asadi, Hamed Bahrami, Mohsen Yalavarty, Praveen Kumar Khajavi, Navid Tafaghodi Nekoui, Mohammad Ariannezhad, Amin |
description | A graph of devices is constructed, each network device serving an amount of bandwidth over the network, each vertex of the graph corresponding to a respective one of the network devices, each edge of the graph connecting network devices by interference weight, such that edges between connected network devices using different channels have an interference weight of zero, and edges between connected network devices using the same channel have an interference weight denoting an amount of interference between the connected network devices. A cell utilization of each of the network devices is determined according to an amount of traffic served by the respective network device compared to a total of the amounts of bandwidth for all network devices. A vehicle requesting bandwidth is assigned to the one of the network devices having a smallest product of cell utilization and maximum interference weight edge. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US11284272B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US11284272B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US11284272B23</originalsourceid><addsrcrecordid>eNrjZLD0zCtJLUpLLUrNS07VTSxPLEpVSCwtyc_Lz80vLVYoS83ITM5JVSjKLy3JzEtXSMzNB5LOTsEuxTwMrGmJOcWpvFCam0HRzTXE2UM3tSA_PrW4IDE5NS-1JD402NDQyMLEyNzIyciYGDUAX5Iu5A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Interference-aware autonomous vehicle routing among CBSDs</title><source>esp@cenet</source><creator>Asadi, Hamed ; Bahrami, Mohsen ; Yalavarty, Praveen Kumar ; Khajavi, Navid Tafaghodi ; Nekoui, Mohammad ; Ariannezhad, Amin</creator><creatorcontrib>Asadi, Hamed ; Bahrami, Mohsen ; Yalavarty, Praveen Kumar ; Khajavi, Navid Tafaghodi ; Nekoui, Mohammad ; Ariannezhad, Amin</creatorcontrib><description>A graph of devices is constructed, each network device serving an amount of bandwidth over the network, each vertex of the graph corresponding to a respective one of the network devices, each edge of the graph connecting network devices by interference weight, such that edges between connected network devices using different channels have an interference weight of zero, and edges between connected network devices using the same channel have an interference weight denoting an amount of interference between the connected network devices. A cell utilization of each of the network devices is determined according to an amount of traffic served by the respective network device compared to a total of the amounts of bandwidth for all network devices. A vehicle requesting bandwidth is assigned to the one of the network devices having a smallest product of cell utilization and maximum interference weight edge.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION ; WIRELESS COMMUNICATIONS NETWORKS</subject><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20220322&DB=EPODOC&CC=US&NR=11284272B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20220322&DB=EPODOC&CC=US&NR=11284272B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Asadi, Hamed</creatorcontrib><creatorcontrib>Bahrami, Mohsen</creatorcontrib><creatorcontrib>Yalavarty, Praveen Kumar</creatorcontrib><creatorcontrib>Khajavi, Navid Tafaghodi</creatorcontrib><creatorcontrib>Nekoui, Mohammad</creatorcontrib><creatorcontrib>Ariannezhad, Amin</creatorcontrib><title>Interference-aware autonomous vehicle routing among CBSDs</title><description>A graph of devices is constructed, each network device serving an amount of bandwidth over the network, each vertex of the graph corresponding to a respective one of the network devices, each edge of the graph connecting network devices by interference weight, such that edges between connected network devices using different channels have an interference weight of zero, and edges between connected network devices using the same channel have an interference weight denoting an amount of interference between the connected network devices. A cell utilization of each of the network devices is determined according to an amount of traffic served by the respective network device compared to a total of the amounts of bandwidth for all network devices. A vehicle requesting bandwidth is assigned to the one of the network devices having a smallest product of cell utilization and maximum interference weight edge.</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><subject>WIRELESS COMMUNICATIONS NETWORKS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLD0zCtJLUpLLUrNS07VTSxPLEpVSCwtyc_Lz80vLVYoS83ITM5JVSjKLy3JzEtXSMzNB5LOTsEuxTwMrGmJOcWpvFCam0HRzTXE2UM3tSA_PrW4IDE5NS-1JD402NDQyMLEyNzIyciYGDUAX5Iu5A</recordid><startdate>20220322</startdate><enddate>20220322</enddate><creator>Asadi, Hamed</creator><creator>Bahrami, Mohsen</creator><creator>Yalavarty, Praveen Kumar</creator><creator>Khajavi, Navid Tafaghodi</creator><creator>Nekoui, Mohammad</creator><creator>Ariannezhad, Amin</creator><scope>EVB</scope></search><sort><creationdate>20220322</creationdate><title>Interference-aware autonomous vehicle routing among CBSDs</title><author>Asadi, Hamed ; Bahrami, Mohsen ; Yalavarty, Praveen Kumar ; Khajavi, Navid Tafaghodi ; Nekoui, Mohammad ; Ariannezhad, Amin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US11284272B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2022</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><topic>WIRELESS COMMUNICATIONS NETWORKS</topic><toplevel>online_resources</toplevel><creatorcontrib>Asadi, Hamed</creatorcontrib><creatorcontrib>Bahrami, Mohsen</creatorcontrib><creatorcontrib>Yalavarty, Praveen Kumar</creatorcontrib><creatorcontrib>Khajavi, Navid Tafaghodi</creatorcontrib><creatorcontrib>Nekoui, Mohammad</creatorcontrib><creatorcontrib>Ariannezhad, Amin</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Asadi, Hamed</au><au>Bahrami, Mohsen</au><au>Yalavarty, Praveen Kumar</au><au>Khajavi, Navid Tafaghodi</au><au>Nekoui, Mohammad</au><au>Ariannezhad, Amin</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Interference-aware autonomous vehicle routing among CBSDs</title><date>2022-03-22</date><risdate>2022</risdate><abstract>A graph of devices is constructed, each network device serving an amount of bandwidth over the network, each vertex of the graph corresponding to a respective one of the network devices, each edge of the graph connecting network devices by interference weight, such that edges between connected network devices using different channels have an interference weight of zero, and edges between connected network devices using the same channel have an interference weight denoting an amount of interference between the connected network devices. A cell utilization of each of the network devices is determined according to an amount of traffic served by the respective network device compared to a total of the amounts of bandwidth for all network devices. A vehicle requesting bandwidth is assigned to the one of the network devices having a smallest product of cell utilization and maximum interference weight edge.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_US11284272B2 |
source | esp@cenet |
subjects | ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION WIRELESS COMMUNICATIONS NETWORKS |
title | Interference-aware autonomous vehicle routing among CBSDs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T06%3A56%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Asadi,%20Hamed&rft.date=2022-03-22&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS11284272B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |