COMPARATIVE ANALYSIS ON REDUCING ROUTE DISCOVERY LATENCY IN MANET USING DIFFERENT TECHNIQUES
MANET is a selfconfiguring network, in which topology is dynamic. These nodes are struggling to cope with the normal effect of radio communication channels, multiuser interference, multipath fading etc. The design of an optimum routing protocol for MANET is highly difficult. To determine the connect...
Gespeichert in:
| Veröffentlicht in: | International journal of advanced research in computer science 2018-06, Vol.9 (3), p.68-71 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 71 |
|---|---|
| container_issue | 3 |
| container_start_page | 68 |
| container_title | International journal of advanced research in computer science |
| container_volume | 9 |
| creator | Kaur, Dilpreet |
| description | MANET is a selfconfiguring network, in which topology is dynamic. These nodes are struggling to cope with the normal effect of radio communication channels, multiuser interference, multipath fading etc. The design of an optimum routing protocol for MANET is highly difficult. To determine the connectivity of network organizations, there is a need for an efficient algorithm link scheduling, and routing in such dynamic scenarios, becomes very important. The efficiency of a routing algorithm depends on the proficient and winning route computation. Usually, the shortest path algorithm is a successful method to calculate the optimal way in static networks. But this idea is not possible in MANET platform. There are many factors which can be considered for routing. Multihop paths are used in MANET for interconnecting the nodes. All the nodes are present in the network which are used for path construction for delivering a packet from source to destination node. |
| doi_str_mv | 10.26483/ijarcs.v9i3.6030 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2101252514</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2101252514</sourcerecordid><originalsourceid>FETCH-LOGICAL-c704-63984b467b93eb22120c8b25444bf2ec8a5bc5dec245f9355de07b7ca46b7e523</originalsourceid><addsrcrecordid>eNpNkF1LwzAYhYMoOOZ-gHcBrzvTfLW5LF22BbpU23QwEEITW9hQN9tN8N_bOS88N--5eHgPPADch2iKOY3J43ZXd76ffoktmXJE0BUYIRHxgHERXf_rt2DS9zs0hAjBKRqBlzRfPSVFYtRawkQn2aZUJcw1LOSsSpVewCKvjIQzVab5WhYbmCVG6nQDlYarREsDq_KMzdR8LgupDTQyXWr1XMnyDty09VvfTP7uGJi5NOkyyPKFSpMs8BGiAScipo7yyAnSOIxDjHzsMKOUuhY3Pq6Z8-y18ZiyVhA2VBS5yNeUu6hhmIzBw-Xtodt_npr-aHf7U_cxLFocohAzzEI6UOGF8t2-77umtYdu-1533zZE9lejvWi0Z432rJH8AM5QX0o</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2101252514</pqid></control><display><type>article</type><title>COMPARATIVE ANALYSIS ON REDUCING ROUTE DISCOVERY LATENCY IN MANET USING DIFFERENT TECHNIQUES</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Kaur, Dilpreet</creator><creatorcontrib>Kaur, Dilpreet ; Student.RIEIT Rayat Group of Institutions, Railmazra Ropar, India</creatorcontrib><description>MANET is a selfconfiguring network, in which topology is dynamic. These nodes are struggling to cope with the normal effect of radio communication channels, multiuser interference, multipath fading etc. The design of an optimum routing protocol for MANET is highly difficult. To determine the connectivity of network organizations, there is a need for an efficient algorithm link scheduling, and routing in such dynamic scenarios, becomes very important. The efficiency of a routing algorithm depends on the proficient and winning route computation. Usually, the shortest path algorithm is a successful method to calculate the optimal way in static networks. But this idea is not possible in MANET platform. There are many factors which can be considered for routing. Multihop paths are used in MANET for interconnecting the nodes. All the nodes are present in the network which are used for path construction for delivering a packet from source to destination node.</description><identifier>ISSN: 0976-5697</identifier><identifier>EISSN: 0976-5697</identifier><identifier>DOI: 10.26483/ijarcs.v9i3.6030</identifier><language>eng</language><publisher>Udaipur: International Journal of Advanced Research in Computer Science</publisher><subject>Algorithms ; Delivery scheduling ; Nodes ; Optimization ; Radio communications ; Shortest-path problems</subject><ispartof>International journal of advanced research in computer science, 2018-06, Vol.9 (3), p.68-71</ispartof><rights>May 2018. This work is published under https://creativecommons.org/licenses/by-nc-sa/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Kaur, Dilpreet</creatorcontrib><creatorcontrib>Student.RIEIT Rayat Group of Institutions, Railmazra Ropar, India</creatorcontrib><title>COMPARATIVE ANALYSIS ON REDUCING ROUTE DISCOVERY LATENCY IN MANET USING DIFFERENT TECHNIQUES</title><title>International journal of advanced research in computer science</title><description>MANET is a selfconfiguring network, in which topology is dynamic. These nodes are struggling to cope with the normal effect of radio communication channels, multiuser interference, multipath fading etc. The design of an optimum routing protocol for MANET is highly difficult. To determine the connectivity of network organizations, there is a need for an efficient algorithm link scheduling, and routing in such dynamic scenarios, becomes very important. The efficiency of a routing algorithm depends on the proficient and winning route computation. Usually, the shortest path algorithm is a successful method to calculate the optimal way in static networks. But this idea is not possible in MANET platform. There are many factors which can be considered for routing. Multihop paths are used in MANET for interconnecting the nodes. All the nodes are present in the network which are used for path construction for delivering a packet from source to destination node.</description><subject>Algorithms</subject><subject>Delivery scheduling</subject><subject>Nodes</subject><subject>Optimization</subject><subject>Radio communications</subject><subject>Shortest-path problems</subject><issn>0976-5697</issn><issn>0976-5697</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpNkF1LwzAYhYMoOOZ-gHcBrzvTfLW5LF22BbpU23QwEEITW9hQN9tN8N_bOS88N--5eHgPPADch2iKOY3J43ZXd76ffoktmXJE0BUYIRHxgHERXf_rt2DS9zs0hAjBKRqBlzRfPSVFYtRawkQn2aZUJcw1LOSsSpVewCKvjIQzVab5WhYbmCVG6nQDlYarREsDq_KMzdR8LgupDTQyXWr1XMnyDty09VvfTP7uGJi5NOkyyPKFSpMs8BGiAScipo7yyAnSOIxDjHzsMKOUuhY3Pq6Z8-y18ZiyVhA2VBS5yNeUu6hhmIzBw-Xtodt_npr-aHf7U_cxLFocohAzzEI6UOGF8t2-77umtYdu-1533zZE9lejvWi0Z432rJH8AM5QX0o</recordid><startdate>20180620</startdate><enddate>20180620</enddate><creator>Kaur, Dilpreet</creator><general>International Journal of Advanced Research in Computer Science</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20180620</creationdate><title>COMPARATIVE ANALYSIS ON REDUCING ROUTE DISCOVERY LATENCY IN MANET USING DIFFERENT TECHNIQUES</title><author>Kaur, Dilpreet</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c704-63984b467b93eb22120c8b25444bf2ec8a5bc5dec245f9355de07b7ca46b7e523</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Delivery scheduling</topic><topic>Nodes</topic><topic>Optimization</topic><topic>Radio communications</topic><topic>Shortest-path problems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kaur, Dilpreet</creatorcontrib><creatorcontrib>Student.RIEIT Rayat Group of Institutions, Railmazra Ropar, India</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace 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>ProQuest Central Basic</collection><jtitle>International journal of advanced research in computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kaur, Dilpreet</au><aucorp>Student.RIEIT Rayat Group of Institutions, Railmazra Ropar, India</aucorp><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>COMPARATIVE ANALYSIS ON REDUCING ROUTE DISCOVERY LATENCY IN MANET USING DIFFERENT TECHNIQUES</atitle><jtitle>International journal of advanced research in computer science</jtitle><date>2018-06-20</date><risdate>2018</risdate><volume>9</volume><issue>3</issue><spage>68</spage><epage>71</epage><pages>68-71</pages><issn>0976-5697</issn><eissn>0976-5697</eissn><abstract>MANET is a selfconfiguring network, in which topology is dynamic. These nodes are struggling to cope with the normal effect of radio communication channels, multiuser interference, multipath fading etc. The design of an optimum routing protocol for MANET is highly difficult. To determine the connectivity of network organizations, there is a need for an efficient algorithm link scheduling, and routing in such dynamic scenarios, becomes very important. The efficiency of a routing algorithm depends on the proficient and winning route computation. Usually, the shortest path algorithm is a successful method to calculate the optimal way in static networks. But this idea is not possible in MANET platform. There are many factors which can be considered for routing. Multihop paths are used in MANET for interconnecting the nodes. All the nodes are present in the network which are used for path construction for delivering a packet from source to destination node.</abstract><cop>Udaipur</cop><pub>International Journal of Advanced Research in Computer Science</pub><doi>10.26483/ijarcs.v9i3.6030</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0976-5697 |
| ispartof | International journal of advanced research in computer science, 2018-06, Vol.9 (3), p.68-71 |
| issn | 0976-5697 0976-5697 |
| language | eng |
| recordid | cdi_proquest_journals_2101252514 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Algorithms Delivery scheduling Nodes Optimization Radio communications Shortest-path problems |
| title | COMPARATIVE ANALYSIS ON REDUCING ROUTE DISCOVERY LATENCY IN MANET USING DIFFERENT TECHNIQUES |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T03%3A49%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=COMPARATIVE%20ANALYSIS%20ON%20REDUCING%20ROUTE%20DISCOVERY%20LATENCY%20IN%20MANET%20USING%20DIFFERENT%20TECHNIQUES&rft.jtitle=International%20journal%20of%20advanced%20research%20in%20computer%20science&rft.au=Kaur,%20Dilpreet&rft.aucorp=Student.RIEIT%20Rayat%20Group%20of%20Institutions,%20Railmazra%20Ropar,%20India&rft.date=2018-06-20&rft.volume=9&rft.issue=3&rft.spage=68&rft.epage=71&rft.pages=68-71&rft.issn=0976-5697&rft.eissn=0976-5697&rft_id=info:doi/10.26483/ijarcs.v9i3.6030&rft_dat=%3Cproquest_cross%3E2101252514%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2101252514&rft_id=info:pmid/&rfr_iscdi=true |