Provably competitive adaptive routing
An ad hoc wireless network is an autonomous self-organizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermediary nodes. Routing in ad hoc networks is a challenging problem as a result of highly dynamic topology as well as bandwidth and energ...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 641 vol. 1 |
|---|---|
| container_issue | |
| container_start_page | 631 |
| container_title | |
| container_volume | 1 |
| creator | Awerbuch, B. Holmer, D. Rubens, H. Kleinberg, R. |
| description | An ad hoc wireless network is an autonomous self-organizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermediary nodes. Routing in ad hoc networks is a challenging problem as a result of highly dynamic topology as well as bandwidth and energy constraints. In addition, security is critical in these networks due to the accessibility of the shared wireless medium and the cooperative nature of ad hoc networks. However, none of the existing routing algorithms can withstand a dynamic proactive adversarial attack. The routing protocol presented in this work attempts to provide throughput-competitive route selection against an adaptive adversary. A proof of the convergence time of our algorithm is presented as well as preliminary simulation results. |
| doi_str_mv | 10.1109/INFCOM.2005.1497929 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1497929</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1497929</ieee_id><sourcerecordid>1497929</sourcerecordid><originalsourceid>FETCH-LOGICAL-i220t-9fa77cb8e0e009aed47a7fc0f460986e199fff09cde8ce098682a7591edc2c653</originalsourceid><addsrcrecordid>eNotj8tqwzAQRUUfUDfNF2STTZdyR7Ks0SyLadpAHl200F1Q5FFRSWpju4H8fV-BC_dwFweuEBMFuVJAd_PVrFovcw1Q5soQkqYzkWlrlCSH5lyMCR38pHBkHV6IDNAUUln7diWu-_4DABxqm4nb5645-O3uOA3NvuUhDenAU1_79g-65mtIn-834jL6Xc_jU4_E6-zhpXqSi_XjvLpfyKQ1DJKiRwxbx8AA5Lk26DEGiMYCOcuKKMYIFGp2gX8npz2WpLgOOtiyGInJvzcx86bt0t53x83pYfENalxDeg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Provably competitive adaptive routing</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Awerbuch, B. ; Holmer, D. ; Rubens, H. ; Kleinberg, R.</creator><creatorcontrib>Awerbuch, B. ; Holmer, D. ; Rubens, H. ; Kleinberg, R.</creatorcontrib><description>An ad hoc wireless network is an autonomous self-organizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermediary nodes. Routing in ad hoc networks is a challenging problem as a result of highly dynamic topology as well as bandwidth and energy constraints. In addition, security is critical in these networks due to the accessibility of the shared wireless medium and the cooperative nature of ad hoc networks. However, none of the existing routing algorithms can withstand a dynamic proactive adversarial attack. The routing protocol presented in this work attempts to provide throughput-competitive route selection against an adaptive adversary. A proof of the convergence time of our algorithm is presented as well as preliminary simulation results.</description><identifier>ISSN: 0743-166X</identifier><identifier>ISBN: 9780780389687</identifier><identifier>ISBN: 0780389689</identifier><identifier>EISSN: 2641-9874</identifier><identifier>DOI: 10.1109/INFCOM.2005.1497929</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ad hoc networks ; Algorithm design and analysis ; Communication system security ; Computer crime ; Computer science ; Organizing ; Routing protocols ; Telecommunication traffic ; Testing ; Wireless networks</subject><ispartof>Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005, Vol.1, p.631-641 vol. 1</ispartof><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://ieeexplore.ieee.org/document/1497929$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1497929$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Awerbuch, B.</creatorcontrib><creatorcontrib>Holmer, D.</creatorcontrib><creatorcontrib>Rubens, H.</creatorcontrib><creatorcontrib>Kleinberg, R.</creatorcontrib><title>Provably competitive adaptive routing</title><title>Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies</title><addtitle>INFCOM</addtitle><description>An ad hoc wireless network is an autonomous self-organizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermediary nodes. Routing in ad hoc networks is a challenging problem as a result of highly dynamic topology as well as bandwidth and energy constraints. In addition, security is critical in these networks due to the accessibility of the shared wireless medium and the cooperative nature of ad hoc networks. However, none of the existing routing algorithms can withstand a dynamic proactive adversarial attack. The routing protocol presented in this work attempts to provide throughput-competitive route selection against an adaptive adversary. A proof of the convergence time of our algorithm is presented as well as preliminary simulation results.</description><subject>Ad hoc networks</subject><subject>Algorithm design and analysis</subject><subject>Communication system security</subject><subject>Computer crime</subject><subject>Computer science</subject><subject>Organizing</subject><subject>Routing protocols</subject><subject>Telecommunication traffic</subject><subject>Testing</subject><subject>Wireless networks</subject><issn>0743-166X</issn><issn>2641-9874</issn><isbn>9780780389687</isbn><isbn>0780389689</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tqwzAQRUUfUDfNF2STTZdyR7Ks0SyLadpAHl200F1Q5FFRSWpju4H8fV-BC_dwFweuEBMFuVJAd_PVrFovcw1Q5soQkqYzkWlrlCSH5lyMCR38pHBkHV6IDNAUUln7diWu-_4DABxqm4nb5645-O3uOA3NvuUhDenAU1_79g-65mtIn-834jL6Xc_jU4_E6-zhpXqSi_XjvLpfyKQ1DJKiRwxbx8AA5Lk26DEGiMYCOcuKKMYIFGp2gX8npz2WpLgOOtiyGInJvzcx86bt0t53x83pYfENalxDeg</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Awerbuch, B.</creator><creator>Holmer, D.</creator><creator>Rubens, H.</creator><creator>Kleinberg, R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2005</creationdate><title>Provably competitive adaptive routing</title><author>Awerbuch, B. ; Holmer, D. ; Rubens, H. ; Kleinberg, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i220t-9fa77cb8e0e009aed47a7fc0f460986e199fff09cde8ce098682a7591edc2c653</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Ad hoc networks</topic><topic>Algorithm design and analysis</topic><topic>Communication system security</topic><topic>Computer crime</topic><topic>Computer science</topic><topic>Organizing</topic><topic>Routing protocols</topic><topic>Telecommunication traffic</topic><topic>Testing</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Awerbuch, B.</creatorcontrib><creatorcontrib>Holmer, D.</creatorcontrib><creatorcontrib>Rubens, H.</creatorcontrib><creatorcontrib>Kleinberg, R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Awerbuch, B.</au><au>Holmer, D.</au><au>Rubens, H.</au><au>Kleinberg, R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Provably competitive adaptive routing</atitle><btitle>Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies</btitle><stitle>INFCOM</stitle><date>2005</date><risdate>2005</risdate><volume>1</volume><spage>631</spage><epage>641 vol. 1</epage><pages>631-641 vol. 1</pages><issn>0743-166X</issn><eissn>2641-9874</eissn><isbn>9780780389687</isbn><isbn>0780389689</isbn><abstract>An ad hoc wireless network is an autonomous self-organizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermediary nodes. Routing in ad hoc networks is a challenging problem as a result of highly dynamic topology as well as bandwidth and energy constraints. In addition, security is critical in these networks due to the accessibility of the shared wireless medium and the cooperative nature of ad hoc networks. However, none of the existing routing algorithms can withstand a dynamic proactive adversarial attack. The routing protocol presented in this work attempts to provide throughput-competitive route selection against an adaptive adversary. A proof of the convergence time of our algorithm is presented as well as preliminary simulation results.</abstract><pub>IEEE</pub><doi>10.1109/INFCOM.2005.1497929</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0743-166X |
| ispartof | Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005, Vol.1, p.631-641 vol. 1 |
| issn | 0743-166X 2641-9874 |
| language | eng |
| recordid | cdi_ieee_primary_1497929 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Ad hoc networks Algorithm design and analysis Communication system security Computer crime Computer science Organizing Routing protocols Telecommunication traffic Testing Wireless networks |
| title | Provably competitive adaptive routing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T21%3A20%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Provably%20competitive%20adaptive%20routing&rft.btitle=Proceedings%20IEEE%2024th%20Annual%20Joint%20Conference%20of%20the%20IEEE%20Computer%20and%20Communications%20Societies&rft.au=Awerbuch,%20B.&rft.date=2005&rft.volume=1&rft.spage=631&rft.epage=641%20vol.%201&rft.pages=631-641%20vol.%201&rft.issn=0743-166X&rft.eissn=2641-9874&rft.isbn=9780780389687&rft.isbn_list=0780389689&rft_id=info:doi/10.1109/INFCOM.2005.1497929&rft_dat=%3Cieee_6IE%3E1497929%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1497929&rfr_iscdi=true |