On-demand route discovery in a unicast manner
While having high bandwidth-efficiency, the ad-hoc on-demand distance vector (AODV) routing protocol suffers from high signaling overhead due to route request (RREQ) messages flooding, especially when the node density and the number of connections are increased. In order to resolve this broadcast st...
Gespeichert in:
| Veröffentlicht in: | PloS one 2018-10, Vol.13 (10), p.e0204555-e0204555 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | e0204555 |
|---|---|
| container_issue | 10 |
| container_start_page | e0204555 |
| container_title | PloS one |
| container_volume | 13 |
| creator | Choi, Youngchol Yang, Hyun Jong |
| description | While having high bandwidth-efficiency, the ad-hoc on-demand distance vector (AODV) routing protocol suffers from high signaling overhead due to route request (RREQ) messages flooding, especially when the node density and the number of connections are increased. In order to resolve this broadcast storm problem of the AODV in a high node density mobile ad-hoc network, we propose a geographical on-demand route discovery scheme. Assuming a known location of the destination, the RREQ of the proposed routing protocol is propagated in a unicast manner by employing a novel parsing mechanism for possible duplicate RREQs. The routing overhead of the proposed routing protocol is greatly robust to the node density change. We derive the node density required for the proposed routing protocol to keep the same connectivity as the AODV under the circumstance where the nodes are uniformly distributed. In addition, we present an imaginary destination consideration method to incorporate the uncertainty of the destination's location due to mobility. Computer simulations show that the proposed scheme enables the RREQ propagation to cover 95% of the one-hop communication area centered at the originally known location of the destination without sacrificing the unicast feature. |
| doi_str_mv | 10.1371/journal.pone.0204555 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_plos_</sourceid><recordid>TN_cdi_plos_journals_2115231465</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A560248703</galeid><doaj_id>oai_doaj_org_article_7ff7fe7979a640eaa4ba9f1cb707c929</doaj_id><sourcerecordid>A560248703</sourcerecordid><originalsourceid>FETCH-LOGICAL-c692t-a6480e2ed0033abd715318c7731d6403fc546c7e9b62059c9a77b4b6e57b51073</originalsourceid><addsrcrecordid>eNqNkluL1DAYhoso7jr6D0QLguhFxxyapLkRlsXDwMKAp9uQpl9nMnSS2aRd3H9vxnaXqeyF5CIheb73O-TNspcYLTEV-MPOD8HpbnnwDpaIoJIx9ig7x5KSghNEH5-cz7JnMe4QYrTi_Gl2RhERlIrqPCvWrmhgr12TBz_0kDc2Gn8D4Ta3Ltf54KzRsc8T4SA8z560uovwYtoX2c_Pn35cfi2u1l9WlxdXheGS9IXmZYWAQIMQpbpuBGYUV0YIihteItoaVnIjQNapOCaN1ELUZc2BiZphJOgiez3qHjof1dRpVARjRiguOUvEaiQar3fqEOxeh1vltVV_L3zYKB16azpQom1FC0IKmepCoHVZa9liUwskjCQyaX2csg31HhoDrg-6m4nOX5zdqo2_URxzLtmx3HeTQPDXA8Re7dMUoeu0Az-MdQtWjp29-Qd9uLuJ2ujUgHWtT3nNUVRdMI5IWYk02UW2fIBKK32oNckWrU33s4D3s4DE9PC73-ghRrX6_u3_2fWvOfv2hN2C7vpt9N3QW-_iHCxH0AQfY4D2fsgYqaOr76ahjq5Wk6tT2KvTD7oPurMx_QMRuO8T</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2115231465</pqid></control><display><type>article</type><title>On-demand route discovery in a unicast manner</title><source>MEDLINE</source><source>DOAJ Directory of Open Access Journals</source><source>PubMed (Medline)</source><source>Public Library of Science</source><source>Free Full-Text Journals in Chemistry</source><source>EZB Electronic Journals Library</source><creator>Choi, Youngchol ; Yang, Hyun Jong</creator><contributor>Zukerman, Moshe</contributor><creatorcontrib>Choi, Youngchol ; Yang, Hyun Jong ; Zukerman, Moshe</creatorcontrib><description>While having high bandwidth-efficiency, the ad-hoc on-demand distance vector (AODV) routing protocol suffers from high signaling overhead due to route request (RREQ) messages flooding, especially when the node density and the number of connections are increased. In order to resolve this broadcast storm problem of the AODV in a high node density mobile ad-hoc network, we propose a geographical on-demand route discovery scheme. Assuming a known location of the destination, the RREQ of the proposed routing protocol is propagated in a unicast manner by employing a novel parsing mechanism for possible duplicate RREQs. The routing overhead of the proposed routing protocol is greatly robust to the node density change. We derive the node density required for the proposed routing protocol to keep the same connectivity as the AODV under the circumstance where the nodes are uniformly distributed. In addition, we present an imaginary destination consideration method to incorporate the uncertainty of the destination's location due to mobility. Computer simulations show that the proposed scheme enables the RREQ propagation to cover 95% of the one-hop communication area centered at the originally known location of the destination without sacrificing the unicast feature.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0204555</identifier><identifier>PMID: 30273378</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Algorithms ; Analysis ; Bandwidth ; Bandwidths ; Computer and Information Sciences ; Computer Communication Networks ; Computer network protocols ; Computer networks ; Computer simulation ; Demand ; Density ; Earth Sciences ; Engineering and Technology ; Flooding ; Global positioning systems ; Gossip ; GPS ; Mathematical models ; Medical imaging ; Mobile ad hoc networks ; Nodes ; Physical Sciences ; Protocol ; Routing ; Satellite communications ; Uncertainty ; Wireless networks</subject><ispartof>PloS one, 2018-10, Vol.13 (10), p.e0204555-e0204555</ispartof><rights>COPYRIGHT 2018 Public Library of Science</rights><rights>2018 Choi, Yang. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2018 Choi, Yang 2018 Choi, Yang</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c692t-a6480e2ed0033abd715318c7731d6403fc546c7e9b62059c9a77b4b6e57b51073</citedby><cites>FETCH-LOGICAL-c692t-a6480e2ed0033abd715318c7731d6403fc546c7e9b62059c9a77b4b6e57b51073</cites><orcidid>0000-0002-0717-3794</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC6166957/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC6166957/$$EHTML$$P50$$Gpubmedcentral$$Hfree_for_read</linktohtml><link.rule.ids>230,314,723,776,780,860,881,2095,2914,23846,27903,27904,53769,53771,79346,79347</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/30273378$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><contributor>Zukerman, Moshe</contributor><creatorcontrib>Choi, Youngchol</creatorcontrib><creatorcontrib>Yang, Hyun Jong</creatorcontrib><title>On-demand route discovery in a unicast manner</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>While having high bandwidth-efficiency, the ad-hoc on-demand distance vector (AODV) routing protocol suffers from high signaling overhead due to route request (RREQ) messages flooding, especially when the node density and the number of connections are increased. In order to resolve this broadcast storm problem of the AODV in a high node density mobile ad-hoc network, we propose a geographical on-demand route discovery scheme. Assuming a known location of the destination, the RREQ of the proposed routing protocol is propagated in a unicast manner by employing a novel parsing mechanism for possible duplicate RREQs. The routing overhead of the proposed routing protocol is greatly robust to the node density change. We derive the node density required for the proposed routing protocol to keep the same connectivity as the AODV under the circumstance where the nodes are uniformly distributed. In addition, we present an imaginary destination consideration method to incorporate the uncertainty of the destination's location due to mobility. Computer simulations show that the proposed scheme enables the RREQ propagation to cover 95% of the one-hop communication area centered at the originally known location of the destination without sacrificing the unicast feature.</description><subject>Algorithms</subject><subject>Analysis</subject><subject>Bandwidth</subject><subject>Bandwidths</subject><subject>Computer and Information Sciences</subject><subject>Computer Communication Networks</subject><subject>Computer network protocols</subject><subject>Computer networks</subject><subject>Computer simulation</subject><subject>Demand</subject><subject>Density</subject><subject>Earth Sciences</subject><subject>Engineering and Technology</subject><subject>Flooding</subject><subject>Global positioning systems</subject><subject>Gossip</subject><subject>GPS</subject><subject>Mathematical models</subject><subject>Medical imaging</subject><subject>Mobile ad hoc networks</subject><subject>Nodes</subject><subject>Physical Sciences</subject><subject>Protocol</subject><subject>Routing</subject><subject>Satellite communications</subject><subject>Uncertainty</subject><subject>Wireless networks</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>DOA</sourceid><recordid>eNqNkluL1DAYhoso7jr6D0QLguhFxxyapLkRlsXDwMKAp9uQpl9nMnSS2aRd3H9vxnaXqeyF5CIheb73O-TNspcYLTEV-MPOD8HpbnnwDpaIoJIx9ig7x5KSghNEH5-cz7JnMe4QYrTi_Gl2RhERlIrqPCvWrmhgr12TBz_0kDc2Gn8D4Ta3Ltf54KzRsc8T4SA8z560uovwYtoX2c_Pn35cfi2u1l9WlxdXheGS9IXmZYWAQIMQpbpuBGYUV0YIihteItoaVnIjQNapOCaN1ELUZc2BiZphJOgiez3qHjof1dRpVARjRiguOUvEaiQar3fqEOxeh1vltVV_L3zYKB16azpQom1FC0IKmepCoHVZa9liUwskjCQyaX2csg31HhoDrg-6m4nOX5zdqo2_URxzLtmx3HeTQPDXA8Re7dMUoeu0Az-MdQtWjp29-Qd9uLuJ2ujUgHWtT3nNUVRdMI5IWYk02UW2fIBKK32oNckWrU33s4D3s4DE9PC73-ghRrX6_u3_2fWvOfv2hN2C7vpt9N3QW-_iHCxH0AQfY4D2fsgYqaOr76ahjq5Wk6tT2KvTD7oPurMx_QMRuO8T</recordid><startdate>20181001</startdate><enddate>20181001</enddate><creator>Choi, Youngchol</creator><creator>Yang, Hyun Jong</creator><general>Public Library of Science</general><general>Public Library of Science (PLoS)</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>IOV</scope><scope>ISR</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-0717-3794</orcidid></search><sort><creationdate>20181001</creationdate><title>On-demand route discovery in a unicast manner</title><author>Choi, Youngchol ; Yang, Hyun Jong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c692t-a6480e2ed0033abd715318c7731d6403fc546c7e9b62059c9a77b4b6e57b51073</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Analysis</topic><topic>Bandwidth</topic><topic>Bandwidths</topic><topic>Computer and Information Sciences</topic><topic>Computer Communication Networks</topic><topic>Computer network protocols</topic><topic>Computer networks</topic><topic>Computer simulation</topic><topic>Demand</topic><topic>Density</topic><topic>Earth Sciences</topic><topic>Engineering and Technology</topic><topic>Flooding</topic><topic>Global positioning systems</topic><topic>Gossip</topic><topic>GPS</topic><topic>Mathematical models</topic><topic>Medical imaging</topic><topic>Mobile ad hoc networks</topic><topic>Nodes</topic><topic>Physical Sciences</topic><topic>Protocol</topic><topic>Routing</topic><topic>Satellite communications</topic><topic>Uncertainty</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Choi, Youngchol</creatorcontrib><creatorcontrib>Yang, Hyun Jong</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale in Context: Opposing Viewpoints</collection><collection>Gale in Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>ProQuest Nursing and Allied Health Journals</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological & Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>ProQuest Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>ProQuest Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Agriculture & Environmental Science Database</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Databases</collection><collection>Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ProQuest Materials Science Database</collection><collection>Nursing & Allied Health Database (Alumni Edition)</collection><collection>Meteorological & Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Agricultural Science Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>ProQuest Engineering Database</collection><collection>Nursing & Allied Health Premium</collection><collection>ProQuest Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials science collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection><collection>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Choi, Youngchol</au><au>Yang, Hyun Jong</au><au>Zukerman, Moshe</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On-demand route discovery in a unicast manner</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2018-10-01</date><risdate>2018</risdate><volume>13</volume><issue>10</issue><spage>e0204555</spage><epage>e0204555</epage><pages>e0204555-e0204555</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>While having high bandwidth-efficiency, the ad-hoc on-demand distance vector (AODV) routing protocol suffers from high signaling overhead due to route request (RREQ) messages flooding, especially when the node density and the number of connections are increased. In order to resolve this broadcast storm problem of the AODV in a high node density mobile ad-hoc network, we propose a geographical on-demand route discovery scheme. Assuming a known location of the destination, the RREQ of the proposed routing protocol is propagated in a unicast manner by employing a novel parsing mechanism for possible duplicate RREQs. The routing overhead of the proposed routing protocol is greatly robust to the node density change. We derive the node density required for the proposed routing protocol to keep the same connectivity as the AODV under the circumstance where the nodes are uniformly distributed. In addition, we present an imaginary destination consideration method to incorporate the uncertainty of the destination's location due to mobility. Computer simulations show that the proposed scheme enables the RREQ propagation to cover 95% of the one-hop communication area centered at the originally known location of the destination without sacrificing the unicast feature.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>30273378</pmid><doi>10.1371/journal.pone.0204555</doi><tpages>e0204555</tpages><orcidid>https://orcid.org/0000-0002-0717-3794</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1932-6203 |
| ispartof | PloS one, 2018-10, Vol.13 (10), p.e0204555-e0204555 |
| issn | 1932-6203 1932-6203 |
| language | eng |
| recordid | cdi_plos_journals_2115231465 |
| source | MEDLINE; DOAJ Directory of Open Access Journals; PubMed (Medline); Public Library of Science; Free Full-Text Journals in Chemistry; EZB Electronic Journals Library |
| subjects | Algorithms Analysis Bandwidth Bandwidths Computer and Information Sciences Computer Communication Networks Computer network protocols Computer networks Computer simulation Demand Density Earth Sciences Engineering and Technology Flooding Global positioning systems Gossip GPS Mathematical models Medical imaging Mobile ad hoc networks Nodes Physical Sciences Protocol Routing Satellite communications Uncertainty Wireless networks |
| title | On-demand route discovery in a unicast manner |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T17%3A54%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On-demand%20route%20discovery%20in%20a%20unicast%20manner&rft.jtitle=PloS%20one&rft.au=Choi,%20Youngchol&rft.date=2018-10-01&rft.volume=13&rft.issue=10&rft.spage=e0204555&rft.epage=e0204555&rft.pages=e0204555-e0204555&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0204555&rft_dat=%3Cgale_plos_%3EA560248703%3C/gale_plos_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2115231465&rft_id=info:pmid/30273378&rft_galeid=A560248703&rft_doaj_id=oai_doaj_org_article_7ff7fe7979a640eaa4ba9f1cb707c929&rfr_iscdi=true |