CINXE.COM

Search results for: Hierarchical routing

<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script> <!-- Yandex.Metrika counter --> <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: Hierarchical routing</title> <meta name="description" content="Search results for: Hierarchical routing"> <meta name="keywords" content="Hierarchical routing"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="Hierarchical routing" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="Hierarchical routing"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 504</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Hierarchical routing</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">504</span> A Review: Comparative Study of Enhanced Hierarchical Clustering Protocols in WSN</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Sangeetha">M. Sangeetha</a>, <a href="https://publications.waset.org/search?q=A.%20Sabari"> A. Sabari</a>, <a href="https://publications.waset.org/search?q=T.%20Shanthi%20Priya"> T. Shanthi Priya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Recent advances in wireless networking technologies introduce several energy aware routing protocols in sensor networks. Such protocols aim to extend the lifetime of network by reducing the energy consumption of nodes. Many researchers are looking for certain challenges that are predominant in the grounds of energy consumption. One such protocol that addresses this energy consumption issue is &lsquo;Cluster based hierarchical routing protocol&rsquo;. In this paper, we intend to discuss some of the major hierarchical routing protocols adhering towards sensor networks. Furthermore, we examine and compare several aspects and characteristics of few widely explored hierarchical clustering protocols, and its operations in wireless sensor networks (WSN). This paper also presents a discussion on the future research topics and the challenges of hierarchical clustering in WSNs.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clustering" title="Clustering">Clustering</a>, <a href="https://publications.waset.org/search?q=Energy%20Efficiency" title=" Energy Efficiency"> Energy Efficiency</a>, <a href="https://publications.waset.org/search?q=Hierarchical%20routing" title=" Hierarchical routing"> Hierarchical routing</a>, <a href="https://publications.waset.org/search?q=Wireless%20sensor%20networks." title=" Wireless sensor networks."> Wireless sensor networks.</a> </p> <a href="https://publications.waset.org/9999736/a-review-comparative-study-of-enhanced-hierarchical-clustering-protocols-in-wsn" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999736/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999736/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999736/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999736/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999736/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999736/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999736/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999736/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999736/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999736/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999736.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2653</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">503</span> Simulations of Routing Protocols of Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kristoffer%20Clyde%20Magsino">Kristoffer Clyde Magsino</a>, <a href="https://publications.waset.org/search?q=H.%20Srikanth%20Kamath"> H. Srikanth Kamath</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Wireless Sensor Network is widely used in electronics. Wireless sensor networks are now used in many applications including military, environmental, healthcare applications, home automation and traffic control. We will study one area of wireless sensor networks, which is the routing protocol. Routing protocols are needed to send data between sensor nodes and the base station. In this paper, we will discuss two routing protocols, such as datacentric and hierarchical routing protocol. We will show the output of the protocols using the NS-2 simulator. This paper will compare the simulation output of the two routing protocol using Nam. We will simulate using Xgraph to find the throughput and delay of the protocol.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=data-centric%20routing%20protocol" title="data-centric routing protocol">data-centric routing protocol</a>, <a href="https://publications.waset.org/search?q=hierarchical%20routingprotocol" title=" hierarchical routingprotocol"> hierarchical routingprotocol</a>, <a href="https://publications.waset.org/search?q=Nam" title=" Nam"> Nam</a>, <a href="https://publications.waset.org/search?q=NS-2" title=" NS-2"> NS-2</a>, <a href="https://publications.waset.org/search?q=Routing%20Protocol" title=" Routing Protocol"> Routing Protocol</a>, <a href="https://publications.waset.org/search?q=sensor%20nodes" title=" sensor nodes"> sensor nodes</a>, <a href="https://publications.waset.org/search?q=SPIN" title=" SPIN"> SPIN</a>, <a href="https://publications.waset.org/search?q=throughput" title="throughput">throughput</a>, <a href="https://publications.waset.org/search?q=Xgraph" title=" Xgraph"> Xgraph</a> </p> <a href="https://publications.waset.org/6029/simulations-of-routing-protocols-of-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6029/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6029/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6029/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6029/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6029/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6029/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6029/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6029/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6029/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6029/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6029.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2120</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">502</span> Hybrid Hierarchical Routing Protocol for WSN Lifetime Maximization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=H.%20Aoudia">H. Aoudia</a>, <a href="https://publications.waset.org/search?q=Y.%20Touati"> Y. Touati</a>, <a href="https://publications.waset.org/search?q=E.%20H.%20Teguig"> E. H. Teguig</a>, <a href="https://publications.waset.org/search?q=A.%20Ali%20Cherif"> A. Ali Cherif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conceiving and developing routing protocols for wireless sensor networks requires considerations on constraints such as network lifetime and energy consumption. In this paper, we propose a hybrid hierarchical routing protocol named HHRP combining both clustering mechanism and multipath optimization taking into account residual energy and RSSI measures. HHRP consists of classifying dynamically nodes into clusters where coordinators nodes with extra privileges are able to manipulate messages, aggregate data and ensure transmission between nodes according to TDMA and CDMA schedules. The reconfiguration of the network is carried out dynamically based on a threshold value which is associated with the number of nodes belonging to the smallest cluster. To show the effectiveness of the proposed approach HHRP, a comparative study with LEACH protocol is illustrated in simulations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Routing%20protocols" title="Routing protocols">Routing protocols</a>, <a href="https://publications.waset.org/search?q=energy%20optimization" title=" energy optimization"> energy optimization</a>, <a href="https://publications.waset.org/search?q=clustering." title=" clustering."> clustering.</a> </p> <a href="https://publications.waset.org/10004818/hybrid-hierarchical-routing-protocol-for-wsn-lifetime-maximization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004818/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004818/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004818/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004818/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004818/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004818/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004818/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004818/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004818/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004818/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004818.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">902</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">501</span> A Review of Coverage and Routing for Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hamid%20Barati">Hamid Barati</a>, <a href="https://publications.waset.org/search?q=Ali%20Movaghar"> Ali Movaghar</a>, <a href="https://publications.waset.org/search?q=Ali%20Barati"> Ali Barati</a>, <a href="https://publications.waset.org/search?q=Arash%20Azizi%20Mazreah"> Arash Azizi Mazreah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The special constraints of sensor networks impose a number of technical challenges for employing them. In this review, we study the issues and existing protocols in three areas: coverage and routing. We present two types of coverage problems: to determine the minimum number of sensor nodes that need to perform active sensing in order to monitor a certain area; and to decide the quality of service that can be provided by a given sensor network. While most routing protocols in sensor networks are data-centric, there are other types of routing protocols as well, such as hierarchical, location-based, and QoS-aware. We describe and compare several protocols in each group. We present several multipath routing protocols and single-path with local repair routing protocols, which are proposed for recovering from sensor node crashes. We also discuss some transport layer schemes for reliable data transmission in lossy wireless channels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Sensor%20networks" title="Sensor networks">Sensor networks</a>, <a href="https://publications.waset.org/search?q=Coverage" title=" Coverage"> Coverage</a>, <a href="https://publications.waset.org/search?q=Routing" title=" Routing"> Routing</a>, <a href="https://publications.waset.org/search?q=Robustness." title=" Robustness."> Robustness.</a> </p> <a href="https://publications.waset.org/5224/a-review-of-coverage-and-routing-for-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5224/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5224/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5224/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5224/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5224/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5224/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5224/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5224/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5224/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5224/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5224.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1680</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">500</span> A Theory in Optimization of Ad-hoc Routing Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Kargar">M. Kargar</a>, <a href="https://publications.waset.org/search?q=F.Fartash"> F.Fartash</a>, <a href="https://publications.waset.org/search?q=T.%20Saderi"> T. Saderi</a>, <a href="https://publications.waset.org/search?q=M.%20Ebrahimi%20Dishabi"> M. Ebrahimi Dishabi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper optimization of routing in ad-hoc networks is surveyed and a new method for reducing the complexity of routing algorithms is suggested. Using binary matrices for each node in the network and updating it once the routing is done, helps nodes to stop repeating the routing protocols in each data transfer. The algorithm suggested can reduce the complexity of routing to the least amount possible. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ad-hoc%20Networks" title="Ad-hoc Networks">Ad-hoc Networks</a>, <a href="https://publications.waset.org/search?q=Algorithm" title=" Algorithm"> Algorithm</a>, <a href="https://publications.waset.org/search?q=Protocol" title=" Protocol"> Protocol</a>, <a href="https://publications.waset.org/search?q=RoutingTrain." title=" RoutingTrain."> RoutingTrain.</a> </p> <a href="https://publications.waset.org/9047/a-theory-in-optimization-of-ad-hoc-routing-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9047/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9047/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9047/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9047/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9047/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9047/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9047/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9047/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9047/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9047/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9047.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1672</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">499</span> MiSense Hierarchical Cluster-Based Routing Algorithm (MiCRA) for Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kavi%20K.%20Khedo">Kavi K. Khedo</a>, <a href="https://publications.waset.org/search?q=R.%20K.%20Subramanian"> R. K. Subramanian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless sensor networks (WSN) are currently receiving significant attention due to their unlimited potential. These networks are used for various applications, such as habitat monitoring, automation, agriculture, and security. The efficient nodeenergy utilization is one of important performance factors in wireless sensor networks because sensor nodes operate with limited battery power. In this paper, we proposed the MiSense hierarchical cluster based routing algorithm (MiCRA) to extend the lifetime of sensor networks and to maintain a balanced energy consumption of nodes. MiCRA is an extension of the HEED algorithm with two levels of cluster heads. The performance of the proposed protocol has been examined and evaluated through a simulation study. The simulation results clearly show that MiCRA has a better performance in terms of lifetime than HEED. Indeed, MiCRA our proposed protocol can effectively extend the network lifetime without other critical overheads and performance degradation. It has been noted that there is about 35% of energy saving for MiCRA during the clustering process and 65% energy savings during the routing process compared to the HEED algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clustering%20algorithm" title="Clustering algorithm">Clustering algorithm</a>, <a href="https://publications.waset.org/search?q=energy%20consumption" title=" energy consumption"> energy consumption</a>, <a href="https://publications.waset.org/search?q=hierarchical%20model" title="hierarchical model">hierarchical model</a>, <a href="https://publications.waset.org/search?q=sensor%20networks." title=" sensor networks."> sensor networks.</a> </p> <a href="https://publications.waset.org/4921/misense-hierarchical-cluster-based-routing-algorithm-micra-for-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4921/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4921/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4921/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4921/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4921/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4921/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4921/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4921/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4921/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4921/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4921.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1780</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">498</span> A Comparative Study of Novel Opportunistic Routing Protocols in Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Poonkuzhali">R. Poonkuzhali</a>, <a href="https://publications.waset.org/search?q=M.%20Y.%20Sanavullah"> M. Y. Sanavullah</a>, <a href="https://publications.waset.org/search?q=M.%20R.%20Gurupriya"> M. R. Gurupriya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Opportunistic routing is used, where the network has the features like dynamic topology changes and intermittent network connectivity. In Delay tolerant network or Disruption tolerant network opportunistic forwarding technique is widely used. The key idea of opportunistic routing is selecting forwarding nodes to forward data packets and coordination among these nodes to avoid duplicate transmissions. This paper gives the analysis of pros and cons of various opportunistic routing techniques used in MANET.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Expected%20Transmission%20Count%20%28ETX%29" title="Expected Transmission Count (ETX)">Expected Transmission Count (ETX)</a>, <a href="https://publications.waset.org/search?q=Opportunistic%0D%0Arouting" title=" Opportunistic routing"> Opportunistic routing</a>, <a href="https://publications.waset.org/search?q=Proactive%20Source%20Routing%20%28PSR%29" title=" Proactive Source Routing (PSR)"> Proactive Source Routing (PSR)</a>, <a href="https://publications.waset.org/search?q=throughput." title=" throughput."> throughput.</a> </p> <a href="https://publications.waset.org/9999570/a-comparative-study-of-novel-opportunistic-routing-protocols-in-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999570/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999570/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999570/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999570/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999570/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999570/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999570/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999570/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999570/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999570/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999570.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2412</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">497</span> Performance Evaluation of Routing Protocols For High Density Ad Hoc Networks based on Qos by GlomoSim Simulator </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=E.%20Ahvar">E. Ahvar</a>, <a href="https://publications.waset.org/search?q=M.%20Fathy"> M. Fathy </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of three routing protocols for mobile ad hoc networks: Dynamic Source Routing (DSR) , Ad Hoc On-Demand Distance Vector Routing (AODV), location-aided routing(LAR1).The performance differentials are analyzed using varying network load, mobility, and network size. We simulate protocols with GLOMOSIM simulator. Based on the observations, we make recommendations about when the performance of either protocol can be best. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ad%20hoc%20Network" title="Ad hoc Network ">Ad hoc Network </a>, <a href="https://publications.waset.org/search?q=Glomosim" title=" Glomosim "> Glomosim </a>, <a href="https://publications.waset.org/search?q=routing%20protocols." title=" routing protocols."> routing protocols.</a> </p> <a href="https://publications.waset.org/8612/performance-evaluation-of-routing-protocols-for-high-density-ad-hoc-networks-based-on-qos-by-glomosim-simulator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8612/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8612/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8612/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8612/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8612/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8612/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8612/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8612/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8612/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8612/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8612.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1619</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">496</span> A Preemptive Link State Spanning Tree Source Routing Scheme for Opportunistic Data Forwarding in MANET</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Poonkuzhali">R. Poonkuzhali</a>, <a href="https://publications.waset.org/search?q=M.%20Y.%20Sanavullah"> M. Y. Sanavullah</a>, <a href="https://publications.waset.org/search?q=A.%20Sabari"> A. Sabari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Opportunistic Data Forwarding (ODF) has drawn much attention in mobile adhoc networking research in recent years. The effectiveness of ODF in MANET depends on a suitable routing protocol which provides a powerful source routing services. PLSR is featured by source routing, loop free and small routing overhead. The update messages in PLSR are integrated into a tree structure and no need to time stamp routing updates which reduces the routing overhead.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mobile%20ad%20hoc%20network%20%28MANET%29" title="Mobile ad hoc network (MANET)">Mobile ad hoc network (MANET)</a>, <a href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29" title=" Opportunistic data forwarding (ODF)"> Opportunistic data forwarding (ODF)</a>, <a href="https://publications.waset.org/search?q=Preemptive%20link%20state%20spanning%20tree%20routing%20%28PLSR%29" title=" Preemptive link state spanning tree routing (PLSR)"> Preemptive link state spanning tree routing (PLSR)</a>, <a href="https://publications.waset.org/search?q=Depth%20First%20Search%20%28DFS%29." title=" Depth First Search (DFS)."> Depth First Search (DFS).</a> </p> <a href="https://publications.waset.org/9998678/a-preemptive-link-state-spanning-tree-source-routing-scheme-for-opportunistic-data-forwarding-in-manet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998678/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998678/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998678/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998678/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998678/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998678/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998678/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998678/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998678/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998678/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998678.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1935</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">495</span> Evaluating Performance of Quality-of-Service Routing in Large Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=V.%20Narasimha%20Raghavan">V. Narasimha Raghavan</a>, <a href="https://publications.waset.org/search?q=M.%20Venkatesh"> M. Venkatesh</a>, <a href="https://publications.waset.org/search?q=T.%20Peer%20Meera%20Labbai"> T. Peer Meera Labbai</a>, <a href="https://publications.waset.org/search?q=Praveen%20Dwarakanath%20Prabhu"> Praveen Dwarakanath Prabhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The performance and complexity of QoS routing depends on the complex interaction between a large set of parameters. This paper investigated the scaling properties of source-directed link-state routing in large core networks. The simulation results show that the routing algorithm, network topology, and link cost function each have a significant impact on the probability of successfully routing new connections. The experiments confirm and extend the findings of other studies, and also lend new insight designing efficient quality-of-service routing policies in large networks.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=QoS" title="QoS">QoS</a>, <a href="https://publications.waset.org/search?q=Link-State%20Routing" title=" Link-State Routing"> Link-State Routing</a>, <a href="https://publications.waset.org/search?q=Dijkstra" title=" Dijkstra"> Dijkstra</a>, <a href="https://publications.waset.org/search?q=Path%20Selection" title=" Path Selection"> Path Selection</a>, <a href="https://publications.waset.org/search?q=Path%20Computation." title="Path Computation.">Path Computation.</a> </p> <a href="https://publications.waset.org/7007/evaluating-performance-of-quality-of-service-routing-in-large-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7007/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7007/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7007/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7007/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7007/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7007/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7007/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7007/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7007/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7007/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7007.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1581</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">494</span> Completion Latin Square for Wavelength Routing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ali%20Habiboghli">Ali Habiboghli</a>, <a href="https://publications.waset.org/search?q=Rouhollah%20Mostafaei"> Rouhollah Mostafaei</a>, <a href="https://publications.waset.org/search?q=Vasif%20Nabiyev"> Vasif Nabiyev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Optical network uses a tool for routing called Latin router. These routers use particular algorithms for routing. For example, we can refer to LDF algorithm that uses backtracking (one of CSP methods) for problem solving. In this paper, we proposed new approached for completion routing table (DRA&CRA algorithm) and compare with pervious proposed ways and showed numbers of backtracking, blocking and run time for DRA algorithm less than LDF and CRA algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Latin%20Router" title="Latin Router">Latin Router</a>, <a href="https://publications.waset.org/search?q=Constraint%20Satisfaction%20Problem" title=" Constraint Satisfaction Problem"> Constraint Satisfaction Problem</a>, <a href="https://publications.waset.org/search?q=Wavelength%20Routing." title="Wavelength Routing.">Wavelength Routing.</a> </p> <a href="https://publications.waset.org/13950/completion-latin-square-for-wavelength-routing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13950/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13950/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13950/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13950/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13950/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13950/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13950/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13950/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13950/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13950/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13950.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1655</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">493</span> Exploiting Query Feedback for Efficient Query Routing in Unstructured Peer-to-peer Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Iskandar%20Ishak">Iskandar Ishak</a>, <a href="https://publications.waset.org/search?q=Naomie%20Salim"> Naomie Salim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Unstructured peer-to-peer networks are popular due to its robustness and scalability. Query schemes that are being used in unstructured peer-to-peer such as the flooding and interest-based shortcuts suffer various problems such as using large communication overhead long delay response. The use of routing indices has been a popular approach for peer-to-peer query routing. It helps the query routing processes to learn the routing based on the feedbacks collected. In an unstructured network where there is no global information available, efficient and low cost routing approach is needed for routing efficiency. In this paper, we propose a novel mechanism for query-feedback oriented routing indices to achieve routing efficiency in unstructured network at a minimal cost. The approach also applied information retrieval technique to make sure the content of the query is understandable and will make the routing process not just based to the query hits but also related to the query content. Experiments have shown that the proposed mechanism performs more efficient than flood-based routing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Unstructured%20peer-to-peer" title="Unstructured peer-to-peer">Unstructured peer-to-peer</a>, <a href="https://publications.waset.org/search?q=Searching" title=" Searching"> Searching</a>, <a href="https://publications.waset.org/search?q=Retrieval" title=" Retrieval"> Retrieval</a>, <a href="https://publications.waset.org/search?q=Internet." title="Internet.">Internet.</a> </p> <a href="https://publications.waset.org/1111/exploiting-query-feedback-for-efficient-query-routing-in-unstructured-peer-to-peer-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1111/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1111/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1111/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1111/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1111/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1111/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1111/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1111/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1111/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1111/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1111.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1535</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">492</span> Energy Efficient Data Aggregation in Sensor Networks with Optimized Cluster Head Selection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=D.%20Naga%20Ravi%20Kiran">D. Naga Ravi Kiran</a>, <a href="https://publications.waset.org/search?q=C.%20G.%20Dethe"> C. G. Dethe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless Sensor Network (WSN) routing is complex due to its dynamic nature, computational overhead, limited battery life, non-conventional addressing scheme, self-organization, and sensor nodes limited transmission range. An energy efficient routing protocol is a major concern in WSN. LEACH is a hierarchical WSN routing protocol to increase network life. It performs self-organizing and re-clustering functions for each round. This study proposes a better sensor networks cluster head selection for efficient data aggregation. The algorithm is based on Tabu search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Wireless%20Sensor%20Network%20%28WSN%29" title="Wireless Sensor Network (WSN)">Wireless Sensor Network (WSN)</a>, <a href="https://publications.waset.org/search?q=LEACH" title=" LEACH"> LEACH</a>, <a href="https://publications.waset.org/search?q=Clustering" title=" Clustering"> Clustering</a>, <a href="https://publications.waset.org/search?q=Tabu%20Search." title=" Tabu Search."> Tabu Search.</a> </p> <a href="https://publications.waset.org/10002914/energy-efficient-data-aggregation-in-sensor-networks-with-optimized-cluster-head-selection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002914/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002914/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002914/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002914/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002914/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002914/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002914/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002914/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002914/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002914/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002914.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2027</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">491</span> A Review on Enhanced Dynamic Clustering in WSN</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Sangeetha">M. Sangeetha</a>, <a href="https://publications.waset.org/search?q=A.%20Sabari"> A. Sabari</a>, <a href="https://publications.waset.org/search?q=K.%20Elakkiya"> K. Elakkiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recent advancement in wireless internetworking has presented a number of dynamic routing protocols based on sensor networks. At present, a number of revisions are made based on their energy efficiency, lifetime and mobility. However, to the best of our knowledge no extensive survey of this special type has been prepared. At present, review is needed in this area where cluster-based structures for dynamic wireless networks are to be discussed. In this paper, we examine and compare several aspects and characteristics of some extensively explored hierarchical dynamic clustering protocols in wireless sensor networks. This document also presents a discussion on the future research topics and the challenges of dynamic hierarchical clustering in wireless sensor networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Dynamic%20cluster" title="Dynamic cluster">Dynamic cluster</a>, <a href="https://publications.waset.org/search?q=Hierarchical%20clustering" title=" Hierarchical clustering"> Hierarchical clustering</a>, <a href="https://publications.waset.org/search?q=Wireless%20sensor%20networks." title=" Wireless sensor networks."> Wireless sensor networks.</a> </p> <a href="https://publications.waset.org/10005049/a-review-on-enhanced-dynamic-clustering-in-wsn" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005049/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005049/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005049/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005049/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005049/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005049/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005049/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005049/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005049/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005049/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005049.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1376</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">490</span> Routing Load Analysis over 802.11 DCF of Reactive Routing Protocols DSR and DYMO</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Parma%20Nand">Parma Nand</a>, <a href="https://publications.waset.org/search?q=S.C.%20Sharma"> S.C. Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The Mobile Ad-hoc Network (MANET) is a collection of self-configuring and rapidly deployed mobile nodes (routers) without any central infrastructure. Routing is one of the potential issues. Many routing protocols are reported but it is difficult to decide which one is best in all scenarios. In this paper on demand routing protocols DSR and DYMO based on IEEE 802.11 DCF MAC protocol are examined and characteristic summary of these routing protocols is presented. Their performance is analyzed and compared on performance measuring metrics throughput, dropped packets due to non availability of routes, duplicate RREQ generated for route discovery and normalized routing load by varying CBR data traffic load using QualNet 5.0.2 network simulator.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adhoc%20networks" title="Adhoc networks">Adhoc networks</a>, <a href="https://publications.waset.org/search?q=wireless%20networks" title=" wireless networks"> wireless networks</a>, <a href="https://publications.waset.org/search?q=CBR" title=" CBR"> CBR</a>, <a href="https://publications.waset.org/search?q=routingprotocols" title=" routingprotocols"> routingprotocols</a>, <a href="https://publications.waset.org/search?q=route%20discovery" title=" route discovery"> route discovery</a>, <a href="https://publications.waset.org/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/search?q=performance%20evaluation" title=" performance evaluation"> performance evaluation</a>, <a href="https://publications.waset.org/search?q=MAC" title=" MAC"> MAC</a>, <a href="https://publications.waset.org/search?q=IEEE%20802.11." title=" IEEE 802.11."> IEEE 802.11.</a> </p> <a href="https://publications.waset.org/7088/routing-load-analysis-over-80211-dcf-of-reactive-routing-protocols-dsr-and-dymo" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7088/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7088/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7088/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7088/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7088/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7088/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7088/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7088/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7088/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7088/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7088.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1724</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">489</span> Performance Evaluation of Routing Protocols for High Density Ad Hoc Networks Based on Energy Consumption by GlomoSim Simulator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=E.%20Ahvar">E. Ahvar</a>, <a href="https://publications.waset.org/search?q=M.%20Fathy"> M. Fathy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of three routing protocols for mobile ad hoc networks: Dynamic Source Routing (DSR), Ad Hoc On-Demand Distance Vector Routing (AODV), location-aided routing (LAR1).Our evaluation is based on energy consumption in mobile ad hoc networks. The performance differentials are analyzed using varying network load, mobility, and network size. We simulate protocols with GLOMOSIM simulator. Based on the observations, we make recommendations about when the performance of either protocol can be best.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ad%20hoc%20Network" title="Ad hoc Network">Ad hoc Network</a>, <a href="https://publications.waset.org/search?q=energy%20consumption" title=" energy consumption"> energy consumption</a>, <a href="https://publications.waset.org/search?q=Glomosim" title=" Glomosim"> Glomosim</a>, <a href="https://publications.waset.org/search?q=routing%20protocols." title=" routing protocols."> routing protocols.</a> </p> <a href="https://publications.waset.org/11935/performance-evaluation-of-routing-protocols-for-high-density-ad-hoc-networks-based-on-energy-consumption-by-glomosim-simulator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11935/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11935/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11935/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11935/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11935/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11935/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11935/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11935/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11935/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11935/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11935.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2135</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">488</span> QoS Routing in Wired Sensor Networks with Partial Updates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Arijit%20Ghos">Arijit Ghos</a>, <a href="https://publications.waset.org/search?q=Tony%20Gigargis"> Tony Gigargis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> QoS routing is an important component of Traffic Engineering in networks that provide QoS guarantees. QoS routing is dependent on the link state information which is typically flooded across the network. This affects both the quality of the routing and the utilization of the network resources. In this paper, we examine establishing QoS routes with partial state updates in wired sensor networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=" title=""></a> </p> <a href="https://publications.waset.org/8241/qos-routing-in-wired-sensor-networks-with-partial-updates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8241/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8241/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8241/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8241/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8241/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8241/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8241/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8241/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8241/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8241/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8241.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1206</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">487</span> Multi-Label Hierarchical Classification for Protein Function Prediction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Helyane%20B.%20Borges"> Helyane B. Borges</a>, <a href="https://publications.waset.org/search?q=Julio%20Cesar%20Nievola"> Julio Cesar Nievola</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Hierarchical classification is a problem with applications in many areas as protein function prediction where the dates are hierarchically structured. Therefore, it is necessary the development of algorithms able to induce hierarchical classification models. This paper presents experimenters using the algorithm for hierarchical classification called Multi-label Hierarchical Classification using a Competitive Neural Network (MHC-CNN). It was tested in ten datasets the Gene Ontology (GO) Cellular Component Domain. The results are compared with the Clus-HMC and Clus-HSC using the hF-Measure.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hierarchical%20Classification" title=" Hierarchical Classification"> Hierarchical Classification</a>, <a href="https://publications.waset.org/search?q=Competitive%20Neural%20Network" title=" Competitive Neural Network"> Competitive Neural Network</a>, <a href="https://publications.waset.org/search?q=Global%20Classifier." title=" Global Classifier."> Global Classifier.</a> </p> <a href="https://publications.waset.org/16089/multi-label-hierarchical-classification-for-protein-function-prediction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16089/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16089/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16089/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16089/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16089/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16089/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16089/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16089/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16089/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16089/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16089.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2380</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">486</span> Faster FPGA Routing Solution using DNA Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Manpreet%20Singh">Manpreet Singh</a>, <a href="https://publications.waset.org/search?q=Parvinder%20Singh%20Sandhu"> Parvinder Singh Sandhu</a>, <a href="https://publications.waset.org/search?q=Manjinder%20Singh%20Kahlon"> Manjinder Singh Kahlon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are many classical algorithms for finding routing in FPGA. But Using DNA computing we can solve the routes efficiently and fast. The run time complexity of DNA algorithms is much less than other classical algorithms which are used for solving routing in FPGA. The research in DNA computing is in a primary level. High information density of DNA molecules and massive parallelism involved in the DNA reactions make DNA computing a powerful tool. It has been proved by many research accomplishments that any procedure that can be programmed in a silicon computer can be realized as a DNA computing procedure. In this paper we have proposed two tier approaches for the FPGA routing solution. First, geometric FPGA detailed routing task is solved by transforming it into a Boolean satisfiability equation with the property that any assignment of input variables that satisfies the equation specifies a valid routing. Satisfying assignment for particular route will result in a valid routing and absence of a satisfying assignment implies that the layout is un-routable. In second step, DNA search algorithm is applied on this Boolean equation for solving routing alternatives utilizing the properties of DNA computation. The simulated results are satisfactory and give the indication of applicability of DNA computing for solving the FPGA Routing problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=FPGA" title="FPGA">FPGA</a>, <a href="https://publications.waset.org/search?q=Routing" title=" Routing"> Routing</a>, <a href="https://publications.waset.org/search?q=DNA%20Computing." title=" DNA Computing."> DNA Computing.</a> </p> <a href="https://publications.waset.org/15969/faster-fpga-routing-solution-using-dna-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15969/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15969/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15969/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15969/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15969/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15969/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15969/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15969/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15969/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15969/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15969.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1592</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">485</span> Impact of MAC Layer on the Performance of Routing Protocols in Mobile Ad hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=T.G.%20Basavaraju">T.G. Basavaraju</a>, <a href="https://publications.waset.org/search?q=Subir%20Kumar%20Sarkar"> Subir Kumar Sarkar</a>, <a href="https://publications.waset.org/search?q=C%20Puttamadappa"> C Puttamadappa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile Ad hoc Networks is an autonomous system of mobile nodes connected by multi-hop wireless links without centralized infrastructure support. As mobile communication gains popularity, the need for suitable ad hoc routing protocols will continue to grow. Efficient dynamic routing is an important research challenge in such a network. Bandwidth constrained mobile devices use on-demand approach in their routing protocols because of its effectiveness and efficiency. Many researchers have conducted numerous simulations for comparing the performance of these protocols under varying conditions and constraints. Most of them are not aware of MAC Protocols, which will impact the relative performance of routing protocols considered in different network scenarios. In this paper we investigate the choice of MAC protocols affects the relative performance of ad hoc routing protocols under different scenarios. We have evaluated the performance of these protocols using NS2 simulations. Our results show that the performance of routing protocols of ad hoc networks will suffer when run over different MAC Layer protocols. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=AODV" title="AODV">AODV</a>, <a href="https://publications.waset.org/search?q=DSR" title=" DSR"> DSR</a>, <a href="https://publications.waset.org/search?q=DSDV" title=" DSDV"> DSDV</a>, <a href="https://publications.waset.org/search?q=MAC" title=" MAC"> MAC</a>, <a href="https://publications.waset.org/search?q=MANETs" title=" MANETs"> MANETs</a>, <a href="https://publications.waset.org/search?q=relativeperformance" title=" relativeperformance"> relativeperformance</a> </p> <a href="https://publications.waset.org/1537/impact-of-mac-layer-on-the-performance-of-routing-protocols-in-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1537/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1537/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1537/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1537/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1537/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1537/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1537/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1537/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1537/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1537/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1537.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2679</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">484</span> A Hypercube Social Feature Extraction and Multipath Routing in Delay Tolerant Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Balaji">S. Balaji</a>, <a href="https://publications.waset.org/search?q=M.%20Rajaram"> M. Rajaram</a>, <a href="https://publications.waset.org/search?q=Y.%20Harold%20Robinson"> Y. Harold Robinson</a>, <a href="https://publications.waset.org/search?q=E.%20Golden%20Julie"> E. Golden Julie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Delay Tolerant Networks (DTN) which have sufficient state information include trajectory and contact information, to protect routing efficiency. However, state information is dynamic and hard to obtain without a global and/or long-term collection process. To deal with these problems, the internal social features of each node are introduced in the network to perform the routing process. This type of application is motivated from several human contact networks where people contact each other more frequently if they have more social features in common. Two unique processes were developed for this process; social feature extraction and multipath routing. The routing method then becomes a hypercube&ndash;based feature matching process. Furthermore, the effectiveness of multipath routing is evaluated and compared to that of single-path routing.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Delay%20tolerant%20networks" title="Delay tolerant networks">Delay tolerant networks</a>, <a href="https://publications.waset.org/search?q=entropy" title=" entropy"> entropy</a>, <a href="https://publications.waset.org/search?q=human%20contact%20networks" title=" human contact networks"> human contact networks</a>, <a href="https://publications.waset.org/search?q=hyper%20cubes" title=" hyper cubes"> hyper cubes</a>, <a href="https://publications.waset.org/search?q=multipath%20Routing" title=" multipath Routing"> multipath Routing</a>, <a href="https://publications.waset.org/search?q=social%20features." title=" social features. "> social features. </a> </p> <a href="https://publications.waset.org/10005841/a-hypercube-social-feature-extraction-and-multipath-routing-in-delay-tolerant-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005841/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005841/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005841/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005841/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005841/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005841/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005841/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005841/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005841/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005841/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005841.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1305</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">483</span> Comparative Study of Ad Hoc Routing Protocols in Vehicular Ad-Hoc Networks for Smart City</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Khadija%20Raissi">Khadija Raissi</a>, <a href="https://publications.waset.org/search?q=Bechir%20Ben%20Gouissem"> Bechir Ben Gouissem</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we perform the investigation of some routing protocols in Vehicular Ad-Hoc Network (VANET) context. Indeed, we study the efficiency of protocols like Dynamic Source Routing (DSR), Ad hoc On-demand Distance Vector Routing (AODV), Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing convention (OLSR) and Vehicular Multi-hop algorithm for Stable Clustering (VMASC) in terms of packet delivery ratio (PDR) and throughput. The performance evaluation and comparison between the studied protocols shows that the VMASC is the best protocols regarding fast data transmission and link stability in VANETs. The validation of all results is done by the NS3 simulator.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=VANET" title="VANET">VANET</a>, <a href="https://publications.waset.org/search?q=smart%20city" title=" smart city"> smart city</a>, <a href="https://publications.waset.org/search?q=AODV" title=" AODV"> AODV</a>, <a href="https://publications.waset.org/search?q=OLSR" title=" OLSR"> OLSR</a>, <a href="https://publications.waset.org/search?q=DSR" title=" DSR"> DSR</a>, <a href="https://publications.waset.org/search?q=OLSR" title=" OLSR"> OLSR</a>, <a href="https://publications.waset.org/search?q=VMASC" title=" VMASC"> VMASC</a>, <a href="https://publications.waset.org/search?q=routing%20protocols" title=" routing protocols"> routing protocols</a>, <a href="https://publications.waset.org/search?q=NS3." title=" NS3."> NS3.</a> </p> <a href="https://publications.waset.org/10008705/comparative-study-of-ad-hoc-routing-protocols-in-vehicular-ad-hoc-networks-for-smart-city" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008705/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008705/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008705/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008705/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008705/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008705/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008705/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008705/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008705/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008705/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008705.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1027</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">482</span> Upgrading Performance of DSR Routing Protocol in Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mehdi%20Alilou">Mehdi Alilou</a>, <a href="https://publications.waset.org/search?q=Mehdi%20Dehghan"> Mehdi Dehghan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Routing in mobile ad hoc networks is a challenging task because nodes are free to move randomly. In DSR like all On- Demand routing algorithms, route discovery mechanism is associated with great delay. More Clearly in DSR routing protocol to send route reply packet, when current route breaks, destination seeks a new route. In this paper we try to change route selection mechanism proactively. We also define a link stability parameter in which a stability value is assigned to each link. Given this feature, destination node can estimate stability of routes and can select the best and more stable route. Therefore we can reduce the delay and jitter of sending data packets.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=DSR" title="DSR">DSR</a>, <a href="https://publications.waset.org/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/search?q=proactive" title=" proactive"> proactive</a>, <a href="https://publications.waset.org/search?q=routing." title=" routing."> routing.</a> </p> <a href="https://publications.waset.org/11308/upgrading-performance-of-dsr-routing-protocol-in-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11308/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11308/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11308/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11308/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11308/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11308/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11308/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11308/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11308/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11308/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11308.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2358</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">481</span> Low Latency Routing Algorithm for Unmanned Aerial Vehicles Ad-Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abdel%20Ilah%20Alshabtat">Abdel Ilah Alshabtat</a>, <a href="https://publications.waset.org/search?q=Liang%20Dong"> Liang Dong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we proposed a new routing protocol for Unmanned Aerial Vehicles (UAVs) that equipped with directional antenna. We named this protocol Directional Optimized Link State Routing Protocol (DOLSR). This protocol is based on the well known protocol that is called Optimized Link State Routing Protocol (OLSR). We focused in our protocol on the multipoint relay (MPR) concept which is the most important feature of this protocol. We developed a heuristic that allows DOLSR protocol to minimize the number of the multipoint relays. With this new protocol the number of overhead packets will be reduced and the End-to-End delay of the network will also be minimized. We showed through simulation that our protocol outperformed Optimized Link State Routing Protocol, Dynamic Source Routing (DSR) protocol and Ad- Hoc On demand Distance Vector (AODV) routing protocol in reducing the End-to-End delay and enhancing the overall throughput. Our evaluation of the previous protocols was based on the OPNET network simulation tool. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mobile%20Ad-Hoc%20Networks" title="Mobile Ad-Hoc Networks">Mobile Ad-Hoc Networks</a>, <a href="https://publications.waset.org/search?q=Ad-Hoc%20RoutingProtocols" title=" Ad-Hoc RoutingProtocols"> Ad-Hoc RoutingProtocols</a>, <a href="https://publications.waset.org/search?q=Optimized%20link%20State%20Routing%20Protocol" title=" Optimized link State Routing Protocol"> Optimized link State Routing Protocol</a>, <a href="https://publications.waset.org/search?q=Unmanned%20AerialVehicles" title=" Unmanned AerialVehicles"> Unmanned AerialVehicles</a>, <a href="https://publications.waset.org/search?q=Directional%20Antenna." title=" Directional Antenna."> Directional Antenna.</a> </p> <a href="https://publications.waset.org/5721/low-latency-routing-algorithm-for-unmanned-aerial-vehicles-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5721/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5721/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5721/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5721/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5721/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5721/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5721/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5721/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5721/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5721/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5721.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2507</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">480</span> TBOR: Tree Based Opportunistic Routing for Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Y.%20Harold%20Robinson">Y. Harold Robinson</a>, <a href="https://publications.waset.org/search?q=M.%20Rajaram"> M. Rajaram</a>, <a href="https://publications.waset.org/search?q=E.%20Golden%20Julie"> E. Golden Julie</a>, <a href="https://publications.waset.org/search?q=S.%20Balaji"> S. Balaji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A mobile ad hoc network (MANET) is a wireless communication network where nodes that are not within direct transmission range establish their communication via the help of other nodes to forward data. Routing protocols in MANETs are usually categorized as proactive. Tree Based Opportunistic Routing (TBOR) finds a multipath link based on maximum probability of the throughput. The simulation results show that the presented method is performed very well compared to the existing methods in terms of throughput, delay and routing overhead. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mobile%20ad%20hoc%20networks" title="Mobile ad hoc networks">Mobile ad hoc networks</a>, <a href="https://publications.waset.org/search?q=opportunistic%20data%20forwarding" title=" opportunistic data forwarding"> opportunistic data forwarding</a>, <a href="https://publications.waset.org/search?q=proactive%20Source%20routing" title=" proactive Source routing"> proactive Source routing</a>, <a href="https://publications.waset.org/search?q=BFS." title=" BFS."> BFS.</a> </p> <a href="https://publications.waset.org/10005195/tbor-tree-based-opportunistic-routing-for-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005195/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005195/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005195/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005195/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005195/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005195/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005195/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005195/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005195/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005195/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005195.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1222</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">479</span> Estimation of the Parameters of Muskingum Methods for the Prediction of the Flood Depth in the Moudjar River Catchment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Fares%20Laouacheria">Fares Laouacheria</a>, <a href="https://publications.waset.org/search?q=Said%20Kechida"> Said Kechida</a>, <a href="https://publications.waset.org/search?q=Moncef%20Chabi"> Moncef Chabi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The objective of the study was based on the hydrological routing modelling for the continuous monitoring of the hydrological situation in the Moudjar river catchment, especially during floods with Hydrologic Engineering Center&ndash;Hydrologic Modelling Systems (HEC-HMS). The HEC-GeoHMS was used to transform data from geographic information system (GIS) to HEC-HMS for delineating and modelling the catchment river in order to estimate the runoff volume, which is used as inputs to the hydrological routing model. Two hydrological routing models were used, namely Muskingum and Muskingum routing models, for conducting this study. In this study, a comparison between the parameters of the Muskingum and Muskingum-Cunge routing models in HEC-HMS was used for modelling flood routing in the Moudjar river catchment and determining the relationship between these parameters and the physical characteristics of the river. The results indicate that the effects of input parameters such as the weighting factor &quot;X&quot; and travel time &quot;K&quot; on the output results are more significant, where the Muskingum routing model was more sensitive to input parameters than the Muskingum-Cunge routing model. This study can contribute to understand and improve the knowledge of the mechanisms of river floods, especially in ungauged river catchments.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=HEC-HMS" title="HEC-HMS">HEC-HMS</a>, <a href="https://publications.waset.org/search?q=hydrological%20modelling" title=" hydrological modelling"> hydrological modelling</a>, <a href="https://publications.waset.org/search?q=Muskingum%20routing%20model" title=" Muskingum routing model"> Muskingum routing model</a>, <a href="https://publications.waset.org/search?q=Muskingum-Cunge%20routing%20model." title=" Muskingum-Cunge routing model. "> Muskingum-Cunge routing model. </a> </p> <a href="https://publications.waset.org/10009619/estimation-of-the-parameters-of-muskingum-methods-for-the-prediction-of-the-flood-depth-in-the-moudjar-river-catchment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10009619/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10009619/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10009619/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10009619/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10009619/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10009619/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10009619/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10009619/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10009619/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10009619/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10009619.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1195</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">478</span> Routing in Mobile Wireless Networks for Realtime Multimedia Applications- Reuse of Virtual Circuits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.Khaja%20Kamaluddin">A.Khaja Kamaluddin</a>, <a href="https://publications.waset.org/search?q=B.Muhammed%20Yousoof"> B.Muhammed Yousoof</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Routing places an important role in determining the quality of service in wireless networks. The routing methods adopted in wireless networks have many drawbacks. This paper aims to review the current routing methods used in wireless networks. This paper proposes an innovative solution to overcome the problems in routing. This solution is aimed at improving the Quality of Service. This solution is different from others as it involves the resuage of the part of the virtual circuits. This improvement in quality of service is important especially in propagation of multimedia applications like video, animations etc. So it is the dire need to propose a new solution to improve the quality of service in ATM wireless networks for multimedia applications especially during this era of multimedia based applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Packet%20buffering" title="Packet buffering">Packet buffering</a>, <a href="https://publications.waset.org/search?q=Routing%20Table" title=" Routing Table"> Routing Table</a>, <a href="https://publications.waset.org/search?q=Virtual%20Circuits%0A%28VC%29" title=" Virtual Circuits (VC)"> Virtual Circuits (VC)</a> </p> <a href="https://publications.waset.org/205/routing-in-mobile-wireless-networks-for-realtime-multimedia-applications-reuse-of-virtual-circuits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/205/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/205/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/205/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/205/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/205/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/205/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/205/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/205/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/205/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/205/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/205.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1642</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">477</span> Adaptive Fuzzy Routing in Opportunistic Network (AFRON)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Payam%20Nabhani">Payam Nabhani</a>, <a href="https://publications.waset.org/search?q=Sima%20Radmanesh"> Sima Radmanesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Opportunistic network is a kind of Delay Tolerant Networks (DTN) where the nodes in this network come into contact with each other opportunistically and communicate wirelessly and, an end-to-end path between source and destination may have never existed, and disconnection and reconnection is common in the network. In such a network, because of the nature of opportunistic network, perhaps there is no a complete path from source to destination for most of the time and even if there is a path; the path can be very unstable and may change or break quickly. Therefore, routing is one of the main challenges in this environment and, in order to make communication possible in an opportunistic network, the intermediate nodes have to play important role in the opportunistic routing protocols. In this paper we proposed an Adaptive Fuzzy Routing in opportunistic network (AFRON). This protocol is using the simple parameters as input parameters to find the path to the destination node. Using Message Transmission Count, Message Size and Time To Live parameters as input fuzzy to increase delivery ratio and decrease the buffer consumption in the all nodes of network.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Opportunistic%20Routing" title="Opportunistic Routing">Opportunistic Routing</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20Routing" title=" Fuzzy Routing"> Fuzzy Routing</a>, <a href="https://publications.waset.org/search?q=Opportunistic%20Network" title=" Opportunistic Network"> Opportunistic Network</a>, <a href="https://publications.waset.org/search?q=Message%20Routing." title=" Message Routing."> Message Routing.</a> </p> <a href="https://publications.waset.org/8280/adaptive-fuzzy-routing-in-opportunistic-network-afron" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8280/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8280/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8280/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8280/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8280/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8280/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8280/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8280/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8280/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8280/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8280.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1537</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">476</span> A Characterized and Optimized Approach for End-to-End Delay Constrained QoS Routing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=P.S.Prakash">P.S.Prakash</a>, <a href="https://publications.waset.org/search?q=S.Selvan"> S.Selvan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> QoS Routing aims to find paths between senders and receivers satisfying the QoS requirements of the application which efficiently using the network resources and underlying routing algorithm to be able to find low-cost paths that satisfy given QoS constraints. The problem of finding least-cost routing is known to be NP hard or complete and some algorithms have been proposed to find a near optimal solution. But these heuristics or algorithms either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we analyzed two algorithms namely Characterized Delay Constrained Routing (CDCR) and Optimized Delay Constrained Routing (ODCR). The CDCR algorithm dealt an approach for delay constrained routing that captures the trade-off between cost minimization and risk level regarding the delay constraint. The ODCR which uses an adaptive path weight function together with an additional constraint imposed on the path cost, to restrict search space and hence ODCR finds near optimal solution in much quicker time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=QoS" title="QoS">QoS</a>, <a href="https://publications.waset.org/search?q=Delay" title=" Delay"> Delay</a>, <a href="https://publications.waset.org/search?q=Routing" title=" Routing"> Routing</a>, <a href="https://publications.waset.org/search?q=Optimization" title=" Optimization"> Optimization</a> </p> <a href="https://publications.waset.org/9058/a-characterized-and-optimized-approach-for-end-to-end-delay-constrained-qos-routing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9058/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9058/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9058/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9058/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9058/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9058/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9058/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9058/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9058/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9058/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9058.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1274</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">475</span> An Enhanced AODV Routing Protocol for Wireless Sensor and Actuator Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Apidet%20Booranawong">Apidet Booranawong</a>, <a href="https://publications.waset.org/search?q=Wiklom%20Teerapabkajorndet"> Wiklom Teerapabkajorndet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>An enhanced ad-hoc on-demand distance vector routing (E-AODV) protocol for control system applications in wireless sensor and actuator networks (WSANs) is proposed. Our routing algorithm is designed by considering both wireless network communication and the control system aspects. Control system error and network delay are the main selection criteria in our routing protocol. The control and communication performance is evaluated on multi-hop IEEE 802.15.4 networks for building-temperature control systems. The Gilbert-Elliott error model is employed to simulate packet loss in wireless networks. The simulation results demonstrate that the E-AODV routing approach can significantly improve the communication performance better than an original AODV routing under various packet loss rates. However, the control performance result by our approach is not much improved compared with the AODV routing solution.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=WSANs" title="WSANs">WSANs</a>, <a href="https://publications.waset.org/search?q=building%20temperature%20control" title=" building temperature control"> building temperature control</a>, <a href="https://publications.waset.org/search?q=AODV%20routing%20protocol" title=" AODV routing protocol"> AODV routing protocol</a>, <a href="https://publications.waset.org/search?q=control%20system%20error" title=" control system error"> control system error</a>, <a href="https://publications.waset.org/search?q=settling%20time" title=" settling time"> settling time</a>, <a href="https://publications.waset.org/search?q=delay" title=" delay"> delay</a>, <a href="https://publications.waset.org/search?q=delivery%20ratio." title=" delivery ratio. "> delivery ratio. </a> </p> <a href="https://publications.waset.org/9996824/an-enhanced-aodv-routing-protocol-for-wireless-sensor-and-actuator-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9996824/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9996824/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9996824/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9996824/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9996824/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9996824/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9996824/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9996824/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9996824/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9996824/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9996824.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2253</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=16">16</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=17">17</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hierarchical%20routing&amp;page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">&copy; 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">&times;</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>

Pages: 1 2 3 4 5 6 7 8 9 10