A General Optimization Framework for Stochastic Routing in Wireless Multi-hop Networks
We introduce a novel approach to routing based on the so called pairwise packet delivery ratio matrix whose entries represent the probability that a given user decodes the packet transmitted by any other user. We show that this leads naturally to a model in which routing algorithms are described by...
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 | 1371 |
|---|---|
| container_issue | |
| container_start_page | 1367 |
| container_title | |
| container_volume | |
| creator | Ribeiro, A. Zhi Quan Luo Sidiropoulos, N.D. Giannakis, G.B. |
| description | We introduce a novel approach to routing based on the so called pairwise packet delivery ratio matrix whose entries represent the probability that a given user decodes the packet transmitted by any other user. We show that this leads naturally to a model in which routing algorithms are described by the evolution of a Markov chain enabling the definition of deliverability criteria in terms of absorbing states. We further introduce optimal routing protocols by selecting the routing matrix from a convex polygon containing all feasible routing matrices. The criteria of optimality include minimization of the packet error probability for a given delay bound and the minimization of the average packet delay. These metrics are correspondingly meaningful in the context of real time transmissions - e.g., voice and/or video - and delay insensitive data - e.g., file transfers. |
| doi_str_mv | 10.1109/ACSSC.2006.354980 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4176790</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4176790</ieee_id><sourcerecordid>4176790</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-22b5f6008bc3fad48bf0bb47bd9e3f82a7c71b0b19dc3f910236fac0c4f0fa473</originalsourceid><addsrcrecordid>eNpVj8lOwzAYhM0mEZU-AOLiF0j5vSS2j1VEC1KhEmE5VnZiU0OaVLYrVJ6eIrhwGo3mm5EGoUsCE0JAXU-ruq4mFKCcsIIrCUdorIQknHIOQhbqGGW0EGVOGbCTfxmnpygjUMi8ZIqdo3GM7wBAxMEqmqGXKZ7b3gbd4eU2-Y3_0skPPZ4FvbGfQ_jAbgi4TkOz1jH5Bj8Ou-T7N-x7_OqD7WyM-H7XJZ-vhy1-sOmnFC_QmdNdtOM_HaHn2c1TdZsvlvO7arrIPRFFyik1hSsBpGmY0y2XxoExXJhWWeYk1aIRxIAhqj0AigBlpdMNNNyB01ywEbr63fXW2tU2-I0O-xU_3BMK2DdbTFfr</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A General Optimization Framework for Stochastic Routing in Wireless Multi-hop Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ribeiro, A. ; Zhi Quan Luo ; Sidiropoulos, N.D. ; Giannakis, G.B.</creator><creatorcontrib>Ribeiro, A. ; Zhi Quan Luo ; Sidiropoulos, N.D. ; Giannakis, G.B.</creatorcontrib><description>We introduce a novel approach to routing based on the so called pairwise packet delivery ratio matrix whose entries represent the probability that a given user decodes the packet transmitted by any other user. We show that this leads naturally to a model in which routing algorithms are described by the evolution of a Markov chain enabling the definition of deliverability criteria in terms of absorbing states. We further introduce optimal routing protocols by selecting the routing matrix from a convex polygon containing all feasible routing matrices. The criteria of optimality include minimization of the packet error probability for a given delay bound and the minimization of the average packet delay. These metrics are correspondingly meaningful in the context of real time transmissions - e.g., voice and/or video - and delay insensitive data - e.g., file transfers.</description><identifier>ISSN: 1058-6393</identifier><identifier>ISBN: 9781424407842</identifier><identifier>ISBN: 1424407842</identifier><identifier>EISSN: 2576-2303</identifier><identifier>EISBN: 9781424407859</identifier><identifier>EISBN: 1424407850</identifier><identifier>DOI: 10.1109/ACSSC.2006.354980</identifier><language>eng</language><publisher>IEEE</publisher><subject>Collaborative work ; Context ; Decoding ; Delay ; Government ; Markov chains ; Optimization ; Peer to peer computing ; Routing ; Routing protocols ; Spread spectrum communication ; Stochastic processes ; Wireless networks</subject><ispartof>2006 Fortieth Asilomar Conference on Signals, Systems and Computers, 2006, p.1367-1371</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4176790$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4176790$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ribeiro, A.</creatorcontrib><creatorcontrib>Zhi Quan Luo</creatorcontrib><creatorcontrib>Sidiropoulos, N.D.</creatorcontrib><creatorcontrib>Giannakis, G.B.</creatorcontrib><title>A General Optimization Framework for Stochastic Routing in Wireless Multi-hop Networks</title><title>2006 Fortieth Asilomar Conference on Signals, Systems and Computers</title><addtitle>ACSSC</addtitle><description>We introduce a novel approach to routing based on the so called pairwise packet delivery ratio matrix whose entries represent the probability that a given user decodes the packet transmitted by any other user. We show that this leads naturally to a model in which routing algorithms are described by the evolution of a Markov chain enabling the definition of deliverability criteria in terms of absorbing states. We further introduce optimal routing protocols by selecting the routing matrix from a convex polygon containing all feasible routing matrices. The criteria of optimality include minimization of the packet error probability for a given delay bound and the minimization of the average packet delay. These metrics are correspondingly meaningful in the context of real time transmissions - e.g., voice and/or video - and delay insensitive data - e.g., file transfers.</description><subject>Collaborative work</subject><subject>Context</subject><subject>Decoding</subject><subject>Delay</subject><subject>Government</subject><subject>Markov chains</subject><subject>Optimization</subject><subject>Peer to peer computing</subject><subject>Routing</subject><subject>Routing protocols</subject><subject>Spread spectrum communication</subject><subject>Stochastic processes</subject><subject>Wireless networks</subject><issn>1058-6393</issn><issn>2576-2303</issn><isbn>9781424407842</isbn><isbn>1424407842</isbn><isbn>9781424407859</isbn><isbn>1424407850</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVj8lOwzAYhM0mEZU-AOLiF0j5vSS2j1VEC1KhEmE5VnZiU0OaVLYrVJ6eIrhwGo3mm5EGoUsCE0JAXU-ruq4mFKCcsIIrCUdorIQknHIOQhbqGGW0EGVOGbCTfxmnpygjUMi8ZIqdo3GM7wBAxMEqmqGXKZ7b3gbd4eU2-Y3_0skPPZ4FvbGfQ_jAbgi4TkOz1jH5Bj8Ou-T7N-x7_OqD7WyM-H7XJZ-vhy1-sOmnFC_QmdNdtOM_HaHn2c1TdZsvlvO7arrIPRFFyik1hSsBpGmY0y2XxoExXJhWWeYk1aIRxIAhqj0AigBlpdMNNNyB01ywEbr63fXW2tU2-I0O-xU_3BMK2DdbTFfr</recordid><startdate>200610</startdate><enddate>200610</enddate><creator>Ribeiro, A.</creator><creator>Zhi Quan Luo</creator><creator>Sidiropoulos, N.D.</creator><creator>Giannakis, G.B.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200610</creationdate><title>A General Optimization Framework for Stochastic Routing in Wireless Multi-hop Networks</title><author>Ribeiro, A. ; Zhi Quan Luo ; Sidiropoulos, N.D. ; Giannakis, G.B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-22b5f6008bc3fad48bf0bb47bd9e3f82a7c71b0b19dc3f910236fac0c4f0fa473</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Collaborative work</topic><topic>Context</topic><topic>Decoding</topic><topic>Delay</topic><topic>Government</topic><topic>Markov chains</topic><topic>Optimization</topic><topic>Peer to peer computing</topic><topic>Routing</topic><topic>Routing protocols</topic><topic>Spread spectrum communication</topic><topic>Stochastic processes</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Ribeiro, A.</creatorcontrib><creatorcontrib>Zhi Quan Luo</creatorcontrib><creatorcontrib>Sidiropoulos, N.D.</creatorcontrib><creatorcontrib>Giannakis, G.B.</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>Ribeiro, A.</au><au>Zhi Quan Luo</au><au>Sidiropoulos, N.D.</au><au>Giannakis, G.B.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A General Optimization Framework for Stochastic Routing in Wireless Multi-hop Networks</atitle><btitle>2006 Fortieth Asilomar Conference on Signals, Systems and Computers</btitle><stitle>ACSSC</stitle><date>2006-10</date><risdate>2006</risdate><spage>1367</spage><epage>1371</epage><pages>1367-1371</pages><issn>1058-6393</issn><eissn>2576-2303</eissn><isbn>9781424407842</isbn><isbn>1424407842</isbn><eisbn>9781424407859</eisbn><eisbn>1424407850</eisbn><abstract>We introduce a novel approach to routing based on the so called pairwise packet delivery ratio matrix whose entries represent the probability that a given user decodes the packet transmitted by any other user. We show that this leads naturally to a model in which routing algorithms are described by the evolution of a Markov chain enabling the definition of deliverability criteria in terms of absorbing states. We further introduce optimal routing protocols by selecting the routing matrix from a convex polygon containing all feasible routing matrices. The criteria of optimality include minimization of the packet error probability for a given delay bound and the minimization of the average packet delay. These metrics are correspondingly meaningful in the context of real time transmissions - e.g., voice and/or video - and delay insensitive data - e.g., file transfers.</abstract><pub>IEEE</pub><doi>10.1109/ACSSC.2006.354980</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1058-6393 |
| ispartof | 2006 Fortieth Asilomar Conference on Signals, Systems and Computers, 2006, p.1367-1371 |
| issn | 1058-6393 2576-2303 |
| language | eng |
| recordid | cdi_ieee_primary_4176790 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Collaborative work Context Decoding Delay Government Markov chains Optimization Peer to peer computing Routing Routing protocols Spread spectrum communication Stochastic processes Wireless networks |
| title | A General Optimization Framework for Stochastic Routing in Wireless Multi-hop Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T17%3A51%3A55IST&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=A%20General%20Optimization%20Framework%20for%20Stochastic%20Routing%20in%20Wireless%20Multi-hop%20Networks&rft.btitle=2006%20Fortieth%20Asilomar%20Conference%20on%20Signals,%20Systems%20and%20Computers&rft.au=Ribeiro,%20A.&rft.date=2006-10&rft.spage=1367&rft.epage=1371&rft.pages=1367-1371&rft.issn=1058-6393&rft.eissn=2576-2303&rft.isbn=9781424407842&rft.isbn_list=1424407842&rft_id=info:doi/10.1109/ACSSC.2006.354980&rft_dat=%3Cieee_6IE%3E4176790%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424407859&rft.eisbn_list=1424407850&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4176790&rfr_iscdi=true |