A Reliability Aware Flooding Algorithm (RAFA) in wireless multi-hop networks

Flooding is a mechanism that distributes packets to every node of the network. The flooding mechanism is frequently used in many operations in wireless multi-hop networks. Since flooding exploits hop-by-hop broadcasting that suffers from unreliable transmission and fading, it is hard to achieve the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Youndo Lee, Yoonbo Shim, Yanghee Choi, Taekyoung Kwon
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 1075
container_issue
container_start_page 1070
container_title
container_volume
creator Youndo Lee
Yoonbo Shim
Yanghee Choi
Taekyoung Kwon
description Flooding is a mechanism that distributes packets to every node of the network. The flooding mechanism is frequently used in many operations in wireless multi-hop networks. Since flooding exploits hop-by-hop broadcasting that suffers from unreliable transmission and fading, it is hard to achieve the reliability in flooding. As unreliable flooding may lead to a coverage hole, it will have a negative effect upon upper layer protocols. In this paper, we introduce a reliability aware flooding algorithm (RAFA), which estimates the expected reliability using two-hop topology knowledge. The estimated reliability is used for deciding whether or not to retransmit a packet. Using NS-2 [19] simulator, we show that RAFA achieves the higher reliability than RBP [1] by adjusting the number of retransmissions considering the network topology, regardless of the network topologies, the node density or the number of bottlenecks.
doi_str_mv 10.1109/ISCC.2008.4625719
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4625719</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4625719</ieee_id><sourcerecordid>4625719</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-463a65427a079cde1537f534191f46fc968784bea11ad1b8ed2d699711d877c53</originalsourceid><addsrcrecordid>eNpVkE1LwzAch-MbWOc-gHjJUQ-t-SdpXo6lWB0UhLn7SNt0i6btSCtl396Bu3j6HR54ePgh9AAkASD6ZfWZ5wklRCVc0FSCvkBLLRVwyjmVhMEliqjgNJZM6at_jPJrFEHKSAyMi1t0N45f5GRKqYxQmeG19c5UzrvpiLPZBIsLPwyN63c487shuGnf4ad1VmTP2PV4dsF6O464-_GTi_fDAfd2mofwPd6jm9b40S7Pu0Cb4nWTv8flx9sqz8rYaTLFXDAj0lOZIVLXjT2lyTZlHDS0XLS1FkoqXlkDYBqolG1oI7SWAI2Ssk7ZAj3-aZ21dnsIrjPhuD3_wn4BHmBQnA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Reliability Aware Flooding Algorithm (RAFA) in wireless multi-hop networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Youndo Lee ; Yoonbo Shim ; Yanghee Choi ; Taekyoung Kwon</creator><creatorcontrib>Youndo Lee ; Yoonbo Shim ; Yanghee Choi ; Taekyoung Kwon</creatorcontrib><description>Flooding is a mechanism that distributes packets to every node of the network. The flooding mechanism is frequently used in many operations in wireless multi-hop networks. Since flooding exploits hop-by-hop broadcasting that suffers from unreliable transmission and fading, it is hard to achieve the reliability in flooding. As unreliable flooding may lead to a coverage hole, it will have a negative effect upon upper layer protocols. In this paper, we introduce a reliability aware flooding algorithm (RAFA), which estimates the expected reliability using two-hop topology knowledge. The estimated reliability is used for deciding whether or not to retransmit a packet. Using NS-2 [19] simulator, we show that RAFA achieves the higher reliability than RBP [1] by adjusting the number of retransmissions considering the network topology, regardless of the network topologies, the node density or the number of bottlenecks.</description><identifier>ISSN: 1530-1346</identifier><identifier>ISBN: 9781424427024</identifier><identifier>ISBN: 1424427029</identifier><identifier>EISSN: 2642-7389</identifier><identifier>EISBN: 9781424427031</identifier><identifier>EISBN: 1424427037</identifier><identifier>DOI: 10.1109/ISCC.2008.4625719</identifier><language>eng</language><publisher>IEEE</publisher><subject>Artificial neural networks ; Erbium ; Floods ; Network topology ; Protocols ; Reliability ; Topology</subject><ispartof>2008 IEEE Symposium on Computers and Communications, 2008, p.1070-1075</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/4625719$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4625719$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Youndo Lee</creatorcontrib><creatorcontrib>Yoonbo Shim</creatorcontrib><creatorcontrib>Yanghee Choi</creatorcontrib><creatorcontrib>Taekyoung Kwon</creatorcontrib><title>A Reliability Aware Flooding Algorithm (RAFA) in wireless multi-hop networks</title><title>2008 IEEE Symposium on Computers and Communications</title><addtitle>ISCC</addtitle><description>Flooding is a mechanism that distributes packets to every node of the network. The flooding mechanism is frequently used in many operations in wireless multi-hop networks. Since flooding exploits hop-by-hop broadcasting that suffers from unreliable transmission and fading, it is hard to achieve the reliability in flooding. As unreliable flooding may lead to a coverage hole, it will have a negative effect upon upper layer protocols. In this paper, we introduce a reliability aware flooding algorithm (RAFA), which estimates the expected reliability using two-hop topology knowledge. The estimated reliability is used for deciding whether or not to retransmit a packet. Using NS-2 [19] simulator, we show that RAFA achieves the higher reliability than RBP [1] by adjusting the number of retransmissions considering the network topology, regardless of the network topologies, the node density or the number of bottlenecks.</description><subject>Artificial neural networks</subject><subject>Erbium</subject><subject>Floods</subject><subject>Network topology</subject><subject>Protocols</subject><subject>Reliability</subject><subject>Topology</subject><issn>1530-1346</issn><issn>2642-7389</issn><isbn>9781424427024</isbn><isbn>1424427029</isbn><isbn>9781424427031</isbn><isbn>1424427037</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkE1LwzAch-MbWOc-gHjJUQ-t-SdpXo6lWB0UhLn7SNt0i6btSCtl396Bu3j6HR54ePgh9AAkASD6ZfWZ5wklRCVc0FSCvkBLLRVwyjmVhMEliqjgNJZM6at_jPJrFEHKSAyMi1t0N45f5GRKqYxQmeG19c5UzrvpiLPZBIsLPwyN63c487shuGnf4ad1VmTP2PV4dsF6O464-_GTi_fDAfd2mofwPd6jm9b40S7Pu0Cb4nWTv8flx9sqz8rYaTLFXDAj0lOZIVLXjT2lyTZlHDS0XLS1FkoqXlkDYBqolG1oI7SWAI2Ssk7ZAj3-aZ21dnsIrjPhuD3_wn4BHmBQnA</recordid><startdate>200807</startdate><enddate>200807</enddate><creator>Youndo Lee</creator><creator>Yoonbo Shim</creator><creator>Yanghee Choi</creator><creator>Taekyoung Kwon</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200807</creationdate><title>A Reliability Aware Flooding Algorithm (RAFA) in wireless multi-hop networks</title><author>Youndo Lee ; Yoonbo Shim ; Yanghee Choi ; Taekyoung Kwon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-463a65427a079cde1537f534191f46fc968784bea11ad1b8ed2d699711d877c53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Artificial neural networks</topic><topic>Erbium</topic><topic>Floods</topic><topic>Network topology</topic><topic>Protocols</topic><topic>Reliability</topic><topic>Topology</topic><toplevel>online_resources</toplevel><creatorcontrib>Youndo Lee</creatorcontrib><creatorcontrib>Yoonbo Shim</creatorcontrib><creatorcontrib>Yanghee Choi</creatorcontrib><creatorcontrib>Taekyoung Kwon</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Youndo Lee</au><au>Yoonbo Shim</au><au>Yanghee Choi</au><au>Taekyoung Kwon</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Reliability Aware Flooding Algorithm (RAFA) in wireless multi-hop networks</atitle><btitle>2008 IEEE Symposium on Computers and Communications</btitle><stitle>ISCC</stitle><date>2008-07</date><risdate>2008</risdate><spage>1070</spage><epage>1075</epage><pages>1070-1075</pages><issn>1530-1346</issn><eissn>2642-7389</eissn><isbn>9781424427024</isbn><isbn>1424427029</isbn><eisbn>9781424427031</eisbn><eisbn>1424427037</eisbn><abstract>Flooding is a mechanism that distributes packets to every node of the network. The flooding mechanism is frequently used in many operations in wireless multi-hop networks. Since flooding exploits hop-by-hop broadcasting that suffers from unreliable transmission and fading, it is hard to achieve the reliability in flooding. As unreliable flooding may lead to a coverage hole, it will have a negative effect upon upper layer protocols. In this paper, we introduce a reliability aware flooding algorithm (RAFA), which estimates the expected reliability using two-hop topology knowledge. The estimated reliability is used for deciding whether or not to retransmit a packet. Using NS-2 [19] simulator, we show that RAFA achieves the higher reliability than RBP [1] by adjusting the number of retransmissions considering the network topology, regardless of the network topologies, the node density or the number of bottlenecks.</abstract><pub>IEEE</pub><doi>10.1109/ISCC.2008.4625719</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1530-1346
ispartof 2008 IEEE Symposium on Computers and Communications, 2008, p.1070-1075
issn 1530-1346
2642-7389
language eng
recordid cdi_ieee_primary_4625719
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Artificial neural networks
Erbium
Floods
Network topology
Protocols
Reliability
Topology
title A Reliability Aware Flooding Algorithm (RAFA) 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=2025-01-25T11%3A49%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=A%20Reliability%20Aware%20Flooding%20Algorithm%20(RAFA)%20in%20wireless%20multi-hop%20networks&rft.btitle=2008%20IEEE%20Symposium%20on%20Computers%20and%20Communications&rft.au=Youndo%20Lee&rft.date=2008-07&rft.spage=1070&rft.epage=1075&rft.pages=1070-1075&rft.issn=1530-1346&rft.eissn=2642-7389&rft.isbn=9781424427024&rft.isbn_list=1424427029&rft_id=info:doi/10.1109/ISCC.2008.4625719&rft_dat=%3Cieee_6IE%3E4625719%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424427031&rft.eisbn_list=1424427037&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4625719&rfr_iscdi=true