RELADO : RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks
Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take adv...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Bruno, Raffaele [verfasserIn] Conti, Marco [author] Nurchis, Maddalena [author] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2012 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
Online-Ressource |
|---|
| Reproduktion: |
IGI Global InfoSci Journals Archive 2000 - 2012 |
|---|---|
| Übergeordnetes Werk: |
In: International journal of adaptive, resilient and autonomic systems - Hershey, Pa : IGI Global, 2010, 3(2012), 3, Seite 54-71 |
| Übergeordnetes Werk: |
volume:3 ; year:2012 ; number:3 ; pages:54-71 |
| Links: |
|---|
| DOI / URN: |
10.4018/jaras.2012070104 |
|---|
| Katalog-ID: |
NLEJ244447918 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ244447918 | ||
| 003 | DE-627 | ||
| 005 | 20240202180055.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 150605s2012 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.4018/jaras.2012070104 |2 doi | |
| 035 | |a (DE-627)NLEJ244447918 | ||
| 035 | |a (VZGNL)10.4018/jaras.2012070104 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Bruno, Raffaele |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a RELADO |b RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks |
| 264 | 1 | |c 2012 | |
| 300 | |a Online-Ressource | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols | ||
| 533 | |f IGI Global InfoSci Journals Archive 2000 - 2012 | ||
| 650 | 4 | |a Opportunistic Routing | |
| 650 | 4 | |a Performance Evaluation | |
| 650 | 4 | |a Reliability | |
| 650 | 4 | |a Shortest-Path Routing | |
| 650 | 4 | |a Wireless Mesh Networks | |
| 700 | 1 | |a Conti, Marco |e author |4 aut | |
| 700 | 1 | |a Nurchis, Maddalena |e author |4 aut | |
| 773 | 0 | 8 | |i In |t International journal of adaptive, resilient and autonomic systems |d Hershey, Pa : IGI Global, 2010 |g 3(2012), 3, Seite 54-71 |h Online-Ressource |w (DE-627)NLEJ244418640 |w (DE-600)2695784-X |x 1947-9239 |7 nnns |
| 773 | 1 | 8 | |g volume:3 |g year:2012 |g number:3 |g pages:54-71 |
| 856 | 4 | 0 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104 |m X:IGIG |x Verlag |z Deutschlandweit zugänglich |
| 856 | 4 | 2 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104&buylink=true |q text/html |y Abstract |z Deutschlandweit zugänglich |
| 912 | |a ZDB-1-GIS | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 3 |j 2012 |e 3 |h 54-71 | ||
| author_variant |
r b rb m c mc m n mn |
|---|---|
| matchkey_str |
article:19479239:2012----::e |
| hierarchy_sort_str |
2012 |
| publishDate |
2012 |
| allfields |
10.4018/jaras.2012070104 doi (DE-627)NLEJ244447918 (VZGNL)10.4018/jaras.2012070104 DE-627 ger DE-627 rakwb eng Bruno, Raffaele verfasserin aut RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks 2012 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols IGI Global InfoSci Journals Archive 2000 - 2012 Opportunistic Routing Performance Evaluation Reliability Shortest-Path Routing Wireless Mesh Networks Conti, Marco author aut Nurchis, Maddalena author aut In International journal of adaptive, resilient and autonomic systems Hershey, Pa : IGI Global, 2010 3(2012), 3, Seite 54-71 Online-Ressource (DE-627)NLEJ244418640 (DE-600)2695784-X 1947-9239 nnns volume:3 year:2012 number:3 pages:54-71 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 3 2012 3 54-71 |
| spelling |
10.4018/jaras.2012070104 doi (DE-627)NLEJ244447918 (VZGNL)10.4018/jaras.2012070104 DE-627 ger DE-627 rakwb eng Bruno, Raffaele verfasserin aut RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks 2012 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols IGI Global InfoSci Journals Archive 2000 - 2012 Opportunistic Routing Performance Evaluation Reliability Shortest-Path Routing Wireless Mesh Networks Conti, Marco author aut Nurchis, Maddalena author aut In International journal of adaptive, resilient and autonomic systems Hershey, Pa : IGI Global, 2010 3(2012), 3, Seite 54-71 Online-Ressource (DE-627)NLEJ244418640 (DE-600)2695784-X 1947-9239 nnns volume:3 year:2012 number:3 pages:54-71 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 3 2012 3 54-71 |
| allfields_unstemmed |
10.4018/jaras.2012070104 doi (DE-627)NLEJ244447918 (VZGNL)10.4018/jaras.2012070104 DE-627 ger DE-627 rakwb eng Bruno, Raffaele verfasserin aut RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks 2012 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols IGI Global InfoSci Journals Archive 2000 - 2012 Opportunistic Routing Performance Evaluation Reliability Shortest-Path Routing Wireless Mesh Networks Conti, Marco author aut Nurchis, Maddalena author aut In International journal of adaptive, resilient and autonomic systems Hershey, Pa : IGI Global, 2010 3(2012), 3, Seite 54-71 Online-Ressource (DE-627)NLEJ244418640 (DE-600)2695784-X 1947-9239 nnns volume:3 year:2012 number:3 pages:54-71 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 3 2012 3 54-71 |
| allfieldsGer |
10.4018/jaras.2012070104 doi (DE-627)NLEJ244447918 (VZGNL)10.4018/jaras.2012070104 DE-627 ger DE-627 rakwb eng Bruno, Raffaele verfasserin aut RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks 2012 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols IGI Global InfoSci Journals Archive 2000 - 2012 Opportunistic Routing Performance Evaluation Reliability Shortest-Path Routing Wireless Mesh Networks Conti, Marco author aut Nurchis, Maddalena author aut In International journal of adaptive, resilient and autonomic systems Hershey, Pa : IGI Global, 2010 3(2012), 3, Seite 54-71 Online-Ressource (DE-627)NLEJ244418640 (DE-600)2695784-X 1947-9239 nnns volume:3 year:2012 number:3 pages:54-71 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 3 2012 3 54-71 |
| allfieldsSound |
10.4018/jaras.2012070104 doi (DE-627)NLEJ244447918 (VZGNL)10.4018/jaras.2012070104 DE-627 ger DE-627 rakwb eng Bruno, Raffaele verfasserin aut RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks 2012 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols IGI Global InfoSci Journals Archive 2000 - 2012 Opportunistic Routing Performance Evaluation Reliability Shortest-Path Routing Wireless Mesh Networks Conti, Marco author aut Nurchis, Maddalena author aut In International journal of adaptive, resilient and autonomic systems Hershey, Pa : IGI Global, 2010 3(2012), 3, Seite 54-71 Online-Ressource (DE-627)NLEJ244418640 (DE-600)2695784-X 1947-9239 nnns volume:3 year:2012 number:3 pages:54-71 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 3 2012 3 54-71 |
| language |
English |
| source |
In International journal of adaptive, resilient and autonomic systems 3(2012), 3, Seite 54-71 volume:3 year:2012 number:3 pages:54-71 |
| sourceStr |
In International journal of adaptive, resilient and autonomic systems 3(2012), 3, Seite 54-71 volume:3 year:2012 number:3 pages:54-71 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Opportunistic Routing Performance Evaluation Reliability Shortest-Path Routing Wireless Mesh Networks |
| isfreeaccess_bool |
false |
| container_title |
International journal of adaptive, resilient and autonomic systems |
| authorswithroles_txt_mv |
Bruno, Raffaele @@aut@@ Conti, Marco @@aut@@ Nurchis, Maddalena @@aut@@ |
| publishDateDaySort_date |
2012-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ244418640 |
| id |
NLEJ244447918 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ244447918</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240202180055.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150605s2012 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/jaras.2012070104</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ244447918</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/jaras.2012070104</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bruno, Raffaele</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">RELADO</subfield><subfield code="b">RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">IGI Global InfoSci Journals Archive 2000 - 2012</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Opportunistic Routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Performance Evaluation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reliability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Shortest-Path Routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wireless Mesh Networks</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Conti, Marco</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nurchis, Maddalena</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">International journal of adaptive, resilient and autonomic systems</subfield><subfield code="d">Hershey, Pa : IGI Global, 2010</subfield><subfield code="g">3(2012), 3, Seite 54-71</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ244418640</subfield><subfield code="w">(DE-600)2695784-X</subfield><subfield code="x">1947-9239</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:3</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:54-71</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104&buylink=true</subfield><subfield code="q">text/html</subfield><subfield code="y">Abstract</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">3</subfield><subfield code="j">2012</subfield><subfield code="e">3</subfield><subfield code="h">54-71</subfield></datafield></record></collection>
|
| series2 |
IGI Global InfoSci Journals Archive 2000 - 2012 |
| author |
Bruno, Raffaele |
| spellingShingle |
Bruno, Raffaele misc Opportunistic Routing misc Performance Evaluation misc Reliability misc Shortest-Path Routing misc Wireless Mesh Networks RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks |
| authorStr |
Bruno, Raffaele |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ244418640 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1947-9239 |
| topic_title |
RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks Opportunistic Routing Performance Evaluation Reliability Shortest-Path Routing Wireless Mesh Networks |
| topic |
misc Opportunistic Routing misc Performance Evaluation misc Reliability misc Shortest-Path Routing misc Wireless Mesh Networks |
| topic_unstemmed |
misc Opportunistic Routing misc Performance Evaluation misc Reliability misc Shortest-Path Routing misc Wireless Mesh Networks |
| topic_browse |
misc Opportunistic Routing misc Performance Evaluation misc Reliability misc Shortest-Path Routing misc Wireless Mesh Networks |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| hierarchy_parent_title |
International journal of adaptive, resilient and autonomic systems |
| hierarchy_parent_id |
NLEJ244418640 |
| hierarchy_top_title |
International journal of adaptive, resilient and autonomic systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ244418640 (DE-600)2695784-X |
| title |
RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks |
| ctrlnum |
(DE-627)NLEJ244447918 (VZGNL)10.4018/jaras.2012070104 |
| title_full |
RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks |
| author_sort |
Bruno, Raffaele |
| journal |
International journal of adaptive, resilient and autonomic systems |
| journalStr |
International journal of adaptive, resilient and autonomic systems |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2012 |
| contenttype_str_mv |
zzz |
| container_start_page |
54 |
| author_browse |
Bruno, Raffaele Conti, Marco Nurchis, Maddalena |
| container_volume |
3 |
| physical |
Online-Ressource |
| format_se |
Elektronische Aufsätze |
| author-letter |
Bruno, Raffaele |
| title_sub |
RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks |
| doi_str_mv |
10.4018/jaras.2012070104 |
| author2-role |
author |
| title_sort |
reladoreliable and adaptive opportunistic routing protocol for wireless mesh networks |
| title_auth |
RELADO RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks |
| abstract |
Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols |
| abstractGer |
Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols |
| abstract_unstemmed |
Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols |
| collection_details |
ZDB-1-GIS GBV_NL_ARTICLE |
| container_issue |
3 |
| title_short |
RELADO |
| url |
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104&buylink=true |
| remote_bool |
true |
| author2 |
Conti, Marco Nurchis, Maddalena |
| author2Str |
Conti, Marco Nurchis, Maddalena |
| ppnlink |
NLEJ244418640 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.4018/jaras.2012070104 |
| up_date |
2024-07-06T07:55:54.585Z |
| _version_ |
1803815542678618112 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ244447918</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240202180055.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150605s2012 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/jaras.2012070104</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ244447918</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/jaras.2012070104</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bruno, Raffaele</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">RELADO</subfield><subfield code="b">RELiable and ADaptive Opportunistic Routing Protocol for Wireless Mesh Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Opportunistic routing is considered as one of the most promising techniques to effectively limit performance degradation in wireless mesh networks caused by unpredictable channel variations and high loss rates. This paradigm defers the selection of the next hop after the packet reception to take advantage of any opportunity provided by broadcast transmissions. Most of the existing opportunistic approaches base the forwarder selection on end-to-end principles. However, in multi-hop wireless environments the cost of a path is not uniformly distributed over space, nor constant over time, hence even two equal-cost paths might present significantly different link quality distributions one from the other. This encourages the use of localized context to implement a more accurate selection of the possible forwarders after each packet transmission. Hence, in this paper the authors propose RELADO, an adaptive opportunistic routing protocol able to efficiently combine end-to-end with local information to ensure transmission resilience across the network. With this flexibility, RELADO is able to reduce packet loss by ensuring the best trade-off between throughput maximization and packet progress. An extensive set of ns2 simulations confirms the potentiality of RELADO to improve network performance when compared to both legacy unicast and opportunistic routing protocols</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">IGI Global InfoSci Journals Archive 2000 - 2012</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Opportunistic Routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Performance Evaluation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reliability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Shortest-Path Routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wireless Mesh Networks</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Conti, Marco</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nurchis, Maddalena</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">International journal of adaptive, resilient and autonomic systems</subfield><subfield code="d">Hershey, Pa : IGI Global, 2010</subfield><subfield code="g">3(2012), 3, Seite 54-71</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ244418640</subfield><subfield code="w">(DE-600)2695784-X</subfield><subfield code="x">1947-9239</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:3</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:54-71</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaras.2012070104&buylink=true</subfield><subfield code="q">text/html</subfield><subfield code="y">Abstract</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">3</subfield><subfield code="j">2012</subfield><subfield code="e">3</subfield><subfield code="h">54-71</subfield></datafield></record></collection>
|
| score |
7.4011307 |