A Localization Routing Discovery Mechanism for Mobile Ad Hoc Networks
In mobile ad hoc networks, most reactive routing protocols often broadcast a route request by flooding for route discovery, and use only a time-to-live (TTL) field, the value of which is simply decreased by one at each node, to limit the broadcast radius. When the TTL reaches zero, the request packe...
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 | 4 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Fengfu Zou Xinming Zhang Enbo Wang Wenbo Zhu |
| description | In mobile ad hoc networks, most reactive routing protocols often broadcast a route request by flooding for route discovery, and use only a time-to-live (TTL) field, the value of which is simply decreased by one at each node, to limit the broadcast radius. When the TTL reaches zero, the request packet is discarded before finding target. Such blind flooding will cause considerable routing overheads and result in serious redundancy, contention and collision which are known as broadcast storm problem. In this paper, we propose a novel Estimate-Hops Route Discovery (EHRD) scheme, which uses cached route history to adjust the TTL value automatically localizing the flood to a limited region of the network, and implement it in Dynamic Source Routing (DSR) protocol. Simulation results show that DSR with this mechanism can offer better efficiency than basic flooding approach. |
| doi_str_mv | 10.1109/WiCom.2008.587 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4678495</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4678495</ieee_id><sourcerecordid>4678495</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-1563a763d69329136c0c1cb5d115b1001af8e011e01eca1fb3b078ac335090d73</originalsourceid><addsrcrecordid>eNo1jE1Lw0AURUe0YFu7deNm_kDie5nvZaitFVoFKeiuTCYTHW0zkolK_fVW1AuXw12cS8g5Qo4I5vIhTOMuLwB0LrQ6IiPkBecFgn48JhOj9P9W6oQMC5SYGcnlgIx-HAMgFTslk5Re4BAumNZqSGYlXUZnt-HL9iG29D6-96F9olchufjhuz1defds25B2tIkdXcUqbD0ta7qIjt76_jN2r-mMDBq7TX7yxzFZz2fr6SJb3l3fTMtlFgz0GQrJrJKsloYVBpl04NBVokYUFQKgbbQHxEO9s9hUrAKlrWNMgIFasTG5-L0N3vvNWxd2tttvuFSaG8G-ARdpTo8</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Localization Routing Discovery Mechanism for Mobile Ad Hoc Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Fengfu Zou ; Xinming Zhang ; Enbo Wang ; Wenbo Zhu</creator><creatorcontrib>Fengfu Zou ; Xinming Zhang ; Enbo Wang ; Wenbo Zhu</creatorcontrib><description>In mobile ad hoc networks, most reactive routing protocols often broadcast a route request by flooding for route discovery, and use only a time-to-live (TTL) field, the value of which is simply decreased by one at each node, to limit the broadcast radius. When the TTL reaches zero, the request packet is discarded before finding target. Such blind flooding will cause considerable routing overheads and result in serious redundancy, contention and collision which are known as broadcast storm problem. In this paper, we propose a novel Estimate-Hops Route Discovery (EHRD) scheme, which uses cached route history to adjust the TTL value automatically localizing the flood to a limited region of the network, and implement it in Dynamic Source Routing (DSR) protocol. Simulation results show that DSR with this mechanism can offer better efficiency than basic flooding approach.</description><identifier>ISSN: 2161-9646</identifier><identifier>ISBN: 9781424421077</identifier><identifier>ISBN: 1424421071</identifier><identifier>EISBN: 142442108X</identifier><identifier>EISBN: 9781424421084</identifier><identifier>DOI: 10.1109/WiCom.2008.587</identifier><identifier>LCCN: 2008900673</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analytical models ; Broadcasting ; Computer science ; Floods ; History ; Mobile ad hoc networks ; Routing protocols ; Scheduling ; Storms</subject><ispartof>2008 4th International Conference on Wireless Communications, Networking and Mobile Computing, 2008, p.1-4</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/4678495$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2053,27907,54902</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4678495$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Fengfu Zou</creatorcontrib><creatorcontrib>Xinming Zhang</creatorcontrib><creatorcontrib>Enbo Wang</creatorcontrib><creatorcontrib>Wenbo Zhu</creatorcontrib><title>A Localization Routing Discovery Mechanism for Mobile Ad Hoc Networks</title><title>2008 4th International Conference on Wireless Communications, Networking and Mobile Computing</title><addtitle>WiCom</addtitle><description>In mobile ad hoc networks, most reactive routing protocols often broadcast a route request by flooding for route discovery, and use only a time-to-live (TTL) field, the value of which is simply decreased by one at each node, to limit the broadcast radius. When the TTL reaches zero, the request packet is discarded before finding target. Such blind flooding will cause considerable routing overheads and result in serious redundancy, contention and collision which are known as broadcast storm problem. In this paper, we propose a novel Estimate-Hops Route Discovery (EHRD) scheme, which uses cached route history to adjust the TTL value automatically localizing the flood to a limited region of the network, and implement it in Dynamic Source Routing (DSR) protocol. Simulation results show that DSR with this mechanism can offer better efficiency than basic flooding approach.</description><subject>Analytical models</subject><subject>Broadcasting</subject><subject>Computer science</subject><subject>Floods</subject><subject>History</subject><subject>Mobile ad hoc networks</subject><subject>Routing protocols</subject><subject>Scheduling</subject><subject>Storms</subject><issn>2161-9646</issn><isbn>9781424421077</isbn><isbn>1424421071</isbn><isbn>142442108X</isbn><isbn>9781424421084</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1jE1Lw0AURUe0YFu7deNm_kDie5nvZaitFVoFKeiuTCYTHW0zkolK_fVW1AuXw12cS8g5Qo4I5vIhTOMuLwB0LrQ6IiPkBecFgn48JhOj9P9W6oQMC5SYGcnlgIx-HAMgFTslk5Re4BAumNZqSGYlXUZnt-HL9iG29D6-96F9olchufjhuz1defds25B2tIkdXcUqbD0ta7qIjt76_jN2r-mMDBq7TX7yxzFZz2fr6SJb3l3fTMtlFgz0GQrJrJKsloYVBpl04NBVokYUFQKgbbQHxEO9s9hUrAKlrWNMgIFasTG5-L0N3vvNWxd2tttvuFSaG8G-ARdpTo8</recordid><startdate>200810</startdate><enddate>200810</enddate><creator>Fengfu Zou</creator><creator>Xinming Zhang</creator><creator>Enbo Wang</creator><creator>Wenbo Zhu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200810</creationdate><title>A Localization Routing Discovery Mechanism for Mobile Ad Hoc Networks</title><author>Fengfu Zou ; Xinming Zhang ; Enbo Wang ; Wenbo Zhu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-1563a763d69329136c0c1cb5d115b1001af8e011e01eca1fb3b078ac335090d73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Analytical models</topic><topic>Broadcasting</topic><topic>Computer science</topic><topic>Floods</topic><topic>History</topic><topic>Mobile ad hoc networks</topic><topic>Routing protocols</topic><topic>Scheduling</topic><topic>Storms</topic><toplevel>online_resources</toplevel><creatorcontrib>Fengfu Zou</creatorcontrib><creatorcontrib>Xinming Zhang</creatorcontrib><creatorcontrib>Enbo Wang</creatorcontrib><creatorcontrib>Wenbo Zhu</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>Fengfu Zou</au><au>Xinming Zhang</au><au>Enbo Wang</au><au>Wenbo Zhu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Localization Routing Discovery Mechanism for Mobile Ad Hoc Networks</atitle><btitle>2008 4th International Conference on Wireless Communications, Networking and Mobile Computing</btitle><stitle>WiCom</stitle><date>2008-10</date><risdate>2008</risdate><spage>1</spage><epage>4</epage><pages>1-4</pages><issn>2161-9646</issn><isbn>9781424421077</isbn><isbn>1424421071</isbn><eisbn>142442108X</eisbn><eisbn>9781424421084</eisbn><abstract>In mobile ad hoc networks, most reactive routing protocols often broadcast a route request by flooding for route discovery, and use only a time-to-live (TTL) field, the value of which is simply decreased by one at each node, to limit the broadcast radius. When the TTL reaches zero, the request packet is discarded before finding target. Such blind flooding will cause considerable routing overheads and result in serious redundancy, contention and collision which are known as broadcast storm problem. In this paper, we propose a novel Estimate-Hops Route Discovery (EHRD) scheme, which uses cached route history to adjust the TTL value automatically localizing the flood to a limited region of the network, and implement it in Dynamic Source Routing (DSR) protocol. Simulation results show that DSR with this mechanism can offer better efficiency than basic flooding approach.</abstract><pub>IEEE</pub><doi>10.1109/WiCom.2008.587</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2161-9646 |
| ispartof | 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing, 2008, p.1-4 |
| issn | 2161-9646 |
| language | eng |
| recordid | cdi_ieee_primary_4678495 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Analytical models Broadcasting Computer science Floods History Mobile ad hoc networks Routing protocols Scheduling Storms |
| title | A Localization Routing Discovery Mechanism for Mobile Ad Hoc 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-17T11%3A25%3A45IST&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%20Localization%20Routing%20Discovery%20Mechanism%20for%20Mobile%20Ad%20Hoc%20Networks&rft.btitle=2008%204th%20International%20Conference%20on%20Wireless%20Communications,%20Networking%20and%20Mobile%20Computing&rft.au=Fengfu%20Zou&rft.date=2008-10&rft.spage=1&rft.epage=4&rft.pages=1-4&rft.issn=2161-9646&rft.isbn=9781424421077&rft.isbn_list=1424421071&rft_id=info:doi/10.1109/WiCom.2008.587&rft_dat=%3Cieee_6IE%3E4678495%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=142442108X&rft.eisbn_list=9781424421084&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4678495&rfr_iscdi=true |