CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <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>  <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>    <title>Search results for: multipath routing</title> <meta name="description" content="Search results for: multipath routing"> <meta name="keywords" content="multipath 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="multipath 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/abstracts/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="multipath 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> 303</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: multipath routing</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">303</span> Survey: Topology Hiding in Multipath Routing Protocol in MANET</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akshay%20Suhas%20Phalke">Akshay Suhas Phalke</a>, <a href="https://publications.waset.org/abstracts/search?q=Manohar%20S.%20Chaudhari"> Manohar S. Chaudhari </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have discussed the multipath routing with its variants. Our purpose is to discuss the different types of the multipath routing mechanism. Here we also put the taxonomy of the multipath routing. Multipath routing is used for the alternate path routing, reliable transmission of data and for better utilization of network resources. We also discussed the multipath routing for topology hiding such as TOHIP. In multipath routing, different parameters such as energy efficiency, packet delivery ratio, shortest path routing, fault tolerance play an important role. We have discussed a number of multipath routing protocol based on different parameters lastly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-path%20routing" title="multi-path routing">multi-path routing</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=topology" title=" topology"> topology</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20detection" title=" fault detection"> fault detection</a>, <a href="https://publications.waset.org/abstracts/search?q=trust" title=" trust"> trust</a> </p> <a href="https://publications.waset.org/abstracts/45654/survey-topology-hiding-in-multipath-routing-protocol-in-manet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45654.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">353</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">302</span> Signal Strength Based Multipath Routing for Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chothmal">Chothmal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a route discovery process which uses the signal strength on a link as a parameter of its inclusion in the route discovery method. The proposed signal-to-interference and noise ratio (SINR) based multipath reactive routing protocol is named as SINR-MP protocol. The proposed SINR-MP routing protocols has two following two features: a) SINR-MP protocol selects routes based on the SINR of the links during the route discovery process therefore it select the routes which has long lifetime and low frame error rate for data transmission, and b) SINR-MP protocols route discovery process is multipath which discovers more than one SINR based route between a given source destination pair. The multiple routes selected by our SINR-MP protocol are node-disjoint in nature which increases their robustness against link failures, as failure of one route will not affect the other route. The secondary route is very useful in situations where the primary route is broken because we can now use the secondary route without causing a new route discovery process. Due to this, the network overhead caused by a route discovery process is avoided. This increases the network performance greatly. The proposed SINR-MP routing protocol is implemented in the trail version of network simulator called Qualnet. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ad%20hoc%20networks" title="ad hoc networks">ad hoc networks</a>, <a href="https://publications.waset.org/abstracts/search?q=quality%20of%20service" title=" quality of service"> quality of service</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20streaming" title=" video streaming"> video streaming</a>, <a href="https://publications.waset.org/abstracts/search?q=H.264%2FSVC" title=" H.264/SVC"> H.264/SVC</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20routes" title=" multiple routes"> multiple routes</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20traces" title=" video traces"> video traces</a> </p> <a href="https://publications.waset.org/abstracts/46573/signal-strength-based-multipath-routing-for-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46573.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">249</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">301</span> Energy Efficient Clustering with Reliable and Load-Balanced Multipath Routing for Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alamgir%20Naushad">Alamgir Naushad</a>, <a href="https://publications.waset.org/abstracts/search?q=Ghulam%20Abbas"> Ghulam Abbas</a>, <a href="https://publications.waset.org/abstracts/search?q=Shehzad%20Ali%20Shah"> Shehzad Ali Shah</a>, <a href="https://publications.waset.org/abstracts/search?q=Ziaul%20Haq%20Abbas"> Ziaul Haq Abbas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Unlike conventional networks, it is particularly challenging to manage resources efficiently in Wireless Sensor Networks (WSNs) due to their inherent characteristics, such as dynamic network topology and limited bandwidth and battery power. To ensure energy efficiency, this paper presents a routing protocol for WSNs, namely, Enhanced Hybrid Multipath Routing (EHMR), which employs hierarchical clustering and proposes a next hop selection mechanism between nodes according to a maximum residual energy metric together with a minimum hop count. Load-balancing of data traffic over multiple paths is achieved for a better packet delivery ratio and low latency rate. Reliability is ensured in terms of higher data rate and lower end-to-end delay. EHMR also enhances the fast-failure recovery mechanism to recover a failed path. Simulation results demonstrate that EHMR achieves a higher packet delivery ratio, reduced energy consumption per-packet delivery, lower end-to-end latency, and reduced effect of data rate on packet delivery ratio when compared with eminent WSN routing protocols. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy%20efficiency" title="energy efficiency">energy efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=load-balancing" title=" load-balancing"> load-balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20clustering" title=" hierarchical clustering"> hierarchical clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=multipath%20routing" title=" multipath routing"> multipath routing</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title=" wireless sensor networks"> wireless sensor networks</a> </p> <a href="https://publications.waset.org/abstracts/169528/energy-efficient-clustering-with-reliable-and-load-balanced-multipath-routing-for-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/169528.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">85</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">300</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/abstracts/search?q=H.%20Aoudia">H. Aoudia</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Touati"> Y. Touati</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20H.%20Teguig"> E. H. Teguig</a>, <a href="https://publications.waset.org/abstracts/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/abstracts/search?q=routing%20protocol" title="routing protocol">routing protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a> </p> <a href="https://publications.waset.org/abstracts/14550/hybrid-hierarchical-routing-protocol-for-wsn-lifetime-maximization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14550.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">469</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">299</span> Adaptive Routing in NoC-Based Heterogeneous MPSoCs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20K.%20Benhaoua">M. K. Benhaoua</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20E.%20H.%20Benyamina"> A. E. H. Benyamina</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Djeradi"> T. Djeradi</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Boulet"> P. Boulet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose adaptive routing that considers the routing of communications in order to optimize the overall performance. The routing technique uses a newly proposed Algorithm to route communications between the tasks. The routing we propose of the communications leads to a better optimization of several performance metrics (time and energy consumption). Experimental results show that the proposed routing approach provides significant performance improvements when compared to those using static routing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-processor%20systems-on-chip%20%28mpsocs%29" title="multi-processor systems-on-chip (mpsocs)">multi-processor systems-on-chip (mpsocs)</a>, <a href="https://publications.waset.org/abstracts/search?q=network-on-chip%20%28noc%29" title=" network-on-chip (noc)"> network-on-chip (noc)</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20architectures" title=" heterogeneous architectures"> heterogeneous architectures</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20routin" title=" adaptive routin"> adaptive routin</a> </p> <a href="https://publications.waset.org/abstracts/31233/adaptive-routing-in-noc-based-heterogeneous-mpsocs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31233.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">375</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">298</span> Quality of Service Based Routing Algorithm for Real Time Applications in MANETs Using Ant Colony and Fuzzy Logic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Farahnaz%20Karami">Farahnaz Karami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Routing is an important, challenging task in mobile ad hoc networks due to node mobility, lack of central control, unstable links, and limited resources. An ant colony has been found to be an attractive technique for routing in Mobile Ad Hoc Networks (MANETs). However, existing swarm intelligence based routing protocols find an optimal path by considering only one or two route selection metrics without considering correlations among such parameters making them unsuitable lonely for routing real time applications. Fuzzy logic combines multiple route selection parameters containing uncertain information or imprecise data in nature, but does not have multipath routing property naturally in order to provide load balancing. The objective of this paper is to design a routing algorithm using fuzzy logic and ant colony that can solve some of routing problems in mobile ad hoc networks, such as nodes energy consumption optimization to increase network lifetime, link failures rate reduction to increase packet delivery reliability and providing load balancing to optimize available bandwidth. In proposed algorithm, the path information will be given to fuzzy inference system by ants. Based on the available path information and considering the parameters required for quality of service (QoS), the fuzzy cost of each path is calculated and the optimal paths will be selected. NS2.35 simulation tools are used for simulation and the results are compared and evaluated with the newest QoS based algorithms in MANETs according to packet delivery ratio, end-to-end delay and routing overhead ratio criterions. The simulation results show significant improvement in the performance of these networks in terms of decreasing end-to-end delay, and routing overhead ratio, and also increasing packet delivery ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20ad%20hoc%20networks" title="mobile ad hoc networks">mobile ad hoc networks</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=quality%20of%20service" title=" quality of service"> quality of service</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony" title=" ant colony"> ant colony</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic" title=" fuzzy logic"> fuzzy logic</a> </p> <a href="https://publications.waset.org/abstracts/177059/quality-of-service-based-routing-algorithm-for-real-time-applications-in-manets-using-ant-colony-and-fuzzy-logic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177059.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">64</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">297</span> A Method for Processing Unwanted Target Caused by Reflection in Secondary Surveillance Radar</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khanh%20D.Do">Khanh D.Do</a>, <a href="https://publications.waset.org/abstracts/search?q=Loi%20V.Nguyen"> Loi V.Nguyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Thanh%20N.Nguyen"> Thanh N.Nguyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Thang%20M.Nguyen"> Thang M.Nguyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Vu%20T.Tran"> Vu T.Tran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Along with the development of Secondary surveillance radar (SSR) in air traffic surveillance systems, the Multipath phenomena has always been a noticeable problem. This following article discusses the geometrical aspect and power aspect of the Multipath interference caused by reflection in SSR and proposes a method to deal with these unwanted multipath targets (ghosts) by false-target position predicting and adaptive target suppressing. A field-experiment example is mentioned at the end of the article to demonstrate the efficiency of this measure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multipath" title="multipath">multipath</a>, <a href="https://publications.waset.org/abstracts/search?q=secondary%20surveillance%20radar" title=" secondary surveillance radar"> secondary surveillance radar</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20signal%20processing" title=" digital signal processing"> digital signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=reflection" title=" reflection"> reflection</a> </p> <a href="https://publications.waset.org/abstracts/154203/a-method-for-processing-unwanted-target-caused-by-reflection-in-secondary-surveillance-radar" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154203.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">162</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">296</span> Routing Metrics and Protocols for Wireless Mesh Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samira%20Kalantary">Samira Kalantary</a>, <a href="https://publications.waset.org/abstracts/search?q=Zohre%20Saatzade"> Zohre Saatzade</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless Mesh Networks (WMNs) are low-cost access networks built on cooperative routing over a backbone composed of stationary wireless routers. WMNs must deal with the highly unstable wireless medium. Thus, routing metrics and protocols are evolving by designing algorithms that consider link quality to choose the best routes. In this work, we analyse the state of the art in WMN metrics and propose taxonomy for WMN routing protocols. Performance measurements of a wireless mesh network deployed using various routing metrics are presented and corroborate our analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20mesh%20networks" title="wireless mesh networks">wireless mesh networks</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20protocols" title=" routing protocols"> routing protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20metrics" title=" routing metrics"> routing metrics</a>, <a href="https://publications.waset.org/abstracts/search?q=bioinformatics" title=" bioinformatics"> bioinformatics</a> </p> <a href="https://publications.waset.org/abstracts/2240/routing-metrics-and-protocols-for-wireless-mesh-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2240.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">453</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">295</span> Artificial Bee Colony Based Modified Energy Efficient Predictive Routing in MANET</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akhil%20Dubey">Akhil Dubey</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajnesh%20Singh"> Rajnesh Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In modern days there occur many rapid modifications in field of ad hoc network. These modifications create many revolutionary changes in the routing. Predictive energy efficient routing is inspired on the bee’s behavior of swarm intelligence. Predictive routing improves the efficiency of routing in the energetic point of view. The main aim of this routing is the minimum energy consumption during communication and maximized intermediate node’s remaining battery power. This routing is based on food searching behavior of bees. There are two types of bees for the exploration phase the scout bees and for the evolution phase forager bees use by this routing. This routing algorithm computes the energy consumption, fitness ratio and goodness of the path. In this paper we review the literature related with predictive routing, presenting modified routing and simulation result of this algorithm comparison with artificial bee colony based routing schemes in MANET and see the results of path fitness and probability of fitness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20ad%20hoc%20network" title="mobile ad hoc network">mobile ad hoc network</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20bee%20colony" title=" artificial bee colony"> artificial bee colony</a>, <a href="https://publications.waset.org/abstracts/search?q=PEEBR" title=" PEEBR"> PEEBR</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20predictive%20routing" title=" modified predictive routing"> modified predictive routing</a> </p> <a href="https://publications.waset.org/abstracts/33480/artificial-bee-colony-based-modified-energy-efficient-predictive-routing-in-manet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33480.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">416</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">294</span> A Survey 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/abstracts/search?q=R.%20Poonkuzhali">R. Poonkuzhali</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Y.%20Sanavullah"> M. Y. Sanavullah</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20R.%20Gurupriya"> M. R. Gurupriya</a> </p> <p class="card-text"><strong>Abstract:</strong></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 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 class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ETX" title="ETX">ETX</a>, <a href="https://publications.waset.org/abstracts/search?q=opportunistic%20routing" title=" opportunistic routing"> opportunistic routing</a>, <a href="https://publications.waset.org/abstracts/search?q=PSR" title=" PSR"> PSR</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput" title=" throughput"> throughput</a> </p> <a href="https://publications.waset.org/abstracts/14837/a-survey-of-novel-opportunistic-routing-protocols-in-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14837.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">494</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">293</span> A Low Power Consumption Routing Protocol Based on a Meta-Heuristics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kaddi%20Mohammed">Kaddi Mohammed</a>, <a href="https://publications.waset.org/abstracts/search?q=Benahmed%20Khelifa%20D.%20Benatiallah"> Benahmed Khelifa D. Benatiallah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A sensor network consists of a large number of sensors deployed in areas to monitor and communicate with each other through a wireless medium. The collected routing data in the network consumes most of the energy of the sensor nodes. For this purpose, multiple routing approaches have been proposed to conserve energy resource at the sensors and to overcome the challenges of its limitation. In this work, we propose a new low energy consumption routing protocol for wireless sensor networks based on a meta-heuristic methods. Our protocol is to operate more fairly energy when routing captured data to the base station. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=WSN" title="WSN">WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=energy" title=" energy"> energy</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a> </p> <a href="https://publications.waset.org/abstracts/47922/a-low-power-consumption-routing-protocol-based-on-a-meta-heuristics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47922.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">343</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">292</span> Performance Analysis of Ad-Hoc Network Routing Protocols</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=I.%20Baddari">I. Baddari</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Riahla"> A. Riahla</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Mezghich"> M. Mezghich</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today in the literature, we discover a lot of routing algorithms which some have been the subject of normalization. Two great classes Routing algorithms are defined, the first is the class reactive algorithms and the second that of algorithms proactive. The aim of this work is to make a comparative study between some routing algorithms. Two comparisons are considered. The first will focus on the protocols of the same class and second class on algorithms of different classes (one reactive and the other proactive). Since they are not based on analytical models, the exact evaluation of some aspects of these protocols is challenging. Simulations have to be done in order to study their performances. Our simulation is performed in NS2 (Network Simulator 2). It identified a classification of the different routing algorithms studied in a metrics such as loss of message, the time transmission, mobility, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ad-hoc%20network%20routing%20protocol" title="ad-hoc network routing protocol">ad-hoc network routing protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=NS2" title=" NS2"> NS2</a>, <a href="https://publications.waset.org/abstracts/search?q=delay" title=" delay"> delay</a>, <a href="https://publications.waset.org/abstracts/search?q=packet%20loss" title=" packet loss"> packet loss</a>, <a href="https://publications.waset.org/abstracts/search?q=wideband" title=" wideband"> wideband</a>, <a href="https://publications.waset.org/abstracts/search?q=mobility" title=" mobility"> mobility</a> </p> <a href="https://publications.waset.org/abstracts/23093/performance-analysis-of-ad-hoc-network-routing-protocols" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23093.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">400</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">291</span> Cloud-Based Dynamic Routing with Feedback in Formal Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jawid%20Ahmad%20Baktash">Jawid Ahmad Baktash</a>, <a href="https://publications.waset.org/abstracts/search?q=Mursal%20Dawodi"> Mursal Dawodi</a>, <a href="https://publications.waset.org/abstracts/search?q=Tomokazu%20Nagata"> Tomokazu Nagata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the rapid growth of Cloud Computing, Formal Methods became a good choice for the refinement of message specification and verification for Dynamic Routing in Cloud Computing. Cloud-based Dynamic Routing is becoming increasingly popular. We propose feedback in Formal Methods for Dynamic Routing and Cloud Computing; the model and topologies show how to send messages from index zero to all others formally. The responsibility of proper verification becomes crucial with Dynamic Routing in the cloud. Formal Methods can play an essential role in the routing and development of Networks, and the testing of distributed systems. Event-B is a formal technique that consists of describing the problem rigorously and introduces solutions or details in the refinement steps. Event-B is a variant of B, designed for developing distributed systems and message passing of the dynamic routing. In Event-B and formal methods, the events consist of guarded actions occurring spontaneously rather than being invoked. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud" title="cloud">cloud</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20routing" title=" dynamic routing"> dynamic routing</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20method" title=" formal method"> formal method</a>, <a href="https://publications.waset.org/abstracts/search?q=Pro-B" title=" Pro-B"> Pro-B</a>, <a href="https://publications.waset.org/abstracts/search?q=event-B" title=" event-B"> event-B</a> </p> <a href="https://publications.waset.org/abstracts/49044/cloud-based-dynamic-routing-with-feedback-in-formal-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49044.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">423</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">290</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/abstracts/search?q=Khadija%20Raissi">Khadija Raissi</a>, <a href="https://publications.waset.org/abstracts/search?q=Bechir%20Ben%20Gouissem"> Bechir Ben Gouissem</a> </p> <p class="card-text"><strong>Abstract:</strong></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 class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=VANET" title="VANET">VANET</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20city" title=" smart city"> smart city</a>, <a href="https://publications.waset.org/abstracts/search?q=AODV" title=" AODV"> AODV</a>, <a href="https://publications.waset.org/abstracts/search?q=OLSR" title=" OLSR"> OLSR</a>, <a href="https://publications.waset.org/abstracts/search?q=DSR" title=" DSR"> DSR</a>, <a href="https://publications.waset.org/abstracts/search?q=OLSR" title=" OLSR"> OLSR</a>, <a href="https://publications.waset.org/abstracts/search?q=VMASC" title=" VMASC"> VMASC</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20protocols" title=" routing protocols"> routing protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=NS3" title=" NS3"> NS3</a> </p> <a href="https://publications.waset.org/abstracts/81898/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/abstracts/81898.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">297</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">289</span> Care: A Cluster Based Approach for Reliable and Efficient Routing Protocol in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Prasanth">K. Prasanth</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Hafeezullah%20Khan"> S. Hafeezullah Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Haribalakrishnan"> B. Haribalakrishnan</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Arun"> D. Arun</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Jayapriya"> S. Jayapriya</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Dhivya"> S. Dhivya</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Vijayarangan"> N. Vijayarangan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main goal of our approach is to find the optimum positions for the sensor nodes, reinforcing the communications in points where certain lack of connectivity is found. Routing is the major problem in sensor network’s data transfer between nodes. We are going to provide an efficient routing technique to make data signal transfer to reach the base station soon without any interruption. Clustering and routing are the two important key factors to be considered in case of WSN. To carry out the communication from the nodes to their cluster head, we propose a parameterizable protocol so that the developer can indicate if the routing has to be sensitive to either the link quality of the nodes or the their battery levels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clusters" title="clusters">clusters</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title=" wireless sensor networks"> wireless sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=three%20phases" title=" three phases"> three phases</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor%20networks" title=" sensor networks"> sensor networks</a> </p> <a href="https://publications.waset.org/abstracts/1733/care-a-cluster-based-approach-for-reliable-and-efficient-routing-protocol-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1733.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">505</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">288</span> GIS-Based Topographical Network for Minimum “Exertion” Routing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Katherine%20Carl%20Payne">Katherine Carl Payne</a>, <a href="https://publications.waset.org/abstracts/search?q=Moshe%20Dror"> Moshe Dror</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of minimum cost routing has been extensively explored in a variety of contexts. While there is a prevalence of routing applications based on least distance, time, and related attributes, exertion-based routing has remained relatively unexplored. In particular, the network structures traditionally used to construct minimum cost paths are not suited to representing exertion or finding paths of least exertion based on road gradient. In this paper, we introduce a topographical network or “topograph” that enables minimum cost routing based on the exertion metric on each arc in a given road network as it is related to changes in road gradient. We describe an algorithm for topograph construction and present the implementation of the topograph on a road network of the state of California with ~22 million nodes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=topograph" title="topograph">topograph</a>, <a href="https://publications.waset.org/abstracts/search?q=RPE" title=" RPE"> RPE</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a> </p> <a href="https://publications.waset.org/abstracts/20618/gis-based-topographical-network-for-minimum-exertion-routing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20618.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">546</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">287</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/abstracts/search?q=Fares%20Laouacheria">Fares Laouacheria</a>, <a href="https://publications.waset.org/abstracts/search?q=Said%20Kechida"> Said Kechida</a>, <a href="https://publications.waset.org/abstracts/search?q=Moncef%20Chabi"> Moncef Chabi</a> </p> <p class="card-text"><strong>Abstract:</strong></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–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 "X" and travel time "K" 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 class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=HEC-HMS" title="HEC-HMS">HEC-HMS</a>, <a href="https://publications.waset.org/abstracts/search?q=hydrological%20modelling" title=" hydrological modelling"> hydrological modelling</a>, <a href="https://publications.waset.org/abstracts/search?q=Muskingum%20routing%20model" title=" Muskingum routing model"> Muskingum routing model</a>, <a href="https://publications.waset.org/abstracts/search?q=Muskingum-Cunge%20routing%20model" title=" Muskingum-Cunge routing model"> Muskingum-Cunge routing model</a> </p> <a href="https://publications.waset.org/abstracts/93598/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/abstracts/93598.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">278</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">286</span> Routing in IP/LEO Satellite Communication Systems: Past, Present and Future</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Hussein">Mohammed Hussein</a>, <a href="https://publications.waset.org/abstracts/search?q=Abualseoud%20Hanani"> Abualseoud Hanani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Low Earth Orbit (LEO) satellite constellation system, routing data from the source all the way to the destination constitutes a daunting challenge because LEO satellite constellation resources are spare and the high speed movement of LEO satellites results in a highly dynamic network topology. This situation limits the applicability of traditional routing approaches that rely on exchanging topology information upon change or setup of a connection. Consequently, in recent years, many routing algorithms and implementation strategies for satellite constellation networks with Inter Satellite Links (ISLs) have been proposed. In this article, we summarize and classify some of the most representative solutions according to their objectives, and discuss their advantages and disadvantages. Finally, with a look into the future, we present some of the new challenges and opportunities for LEO satellite constellations in general and routing protocols in particular. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LEO%20satellite%20constellations" title="LEO satellite constellations">LEO satellite constellations</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20topology" title=" dynamic topology"> dynamic topology</a>, <a href="https://publications.waset.org/abstracts/search?q=IP%20routing" title=" IP routing"> IP routing</a>, <a href="https://publications.waset.org/abstracts/search?q=inter-satellite-links" title=" inter-satellite-links"> inter-satellite-links</a> </p> <a href="https://publications.waset.org/abstracts/54344/routing-in-ipleo-satellite-communication-systems-past-present-and-future" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54344.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">381</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">285</span> Comparative Analysis of Geographical Routing Protocol in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rahul%20Malhotra">Rahul Malhotra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The field of wireless sensor networks (WSN) engages a lot of associates in the research community as an interdisciplinary field of interest. This type of network is inexpensive, multifunctionally attributable to advances in micro-electromechanical systems and conjointly the explosion and expansion of wireless communications. A mobile ad hoc network is a wireless network without fastened infrastructure or federal management. Due to the infrastructure-less mode of operation, mobile ad-hoc networks are gaining quality. During this work, we have performed an efficient performance study of the two major routing protocols: Ad hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) protocols. We have used an accurate simulation model supported NS2 for this purpose. Our simulation results showed that AODV mitigates the drawbacks of the DSDV and provides better performance as compared to DSDV. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=routing%20protocol" title="routing protocol">routing protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/abstracts/search?q=AODV" title=" AODV"> AODV</a>, <a href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing" title=" On Demand Distance Vector Routing"> On Demand Distance Vector Routing</a>, <a href="https://publications.waset.org/abstracts/search?q=DSR" title=" DSR"> DSR</a>, <a href="https://publications.waset.org/abstracts/search?q=Dynamic%20Source%20Routing" title=" Dynamic Source Routing"> Dynamic Source Routing</a> </p> <a href="https://publications.waset.org/abstracts/94683/comparative-analysis-of-geographical-routing-protocol-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94683.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">275</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">284</span> Simple Multipath Compensation for Frequency Modulated Signals: A Case of Radio Frequency vs. Quadrature Baseband</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lusungu%20Ndovi">Lusungu Ndovi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Radio propagation from point-to-point is affected by the physical channel in many ways. A signal arriving at a destination travels through a number of different paths which are referred to as multi-paths. Research in this area of wireless communications has progressed well over the years with the research taking different angles of focus. By this is meant that some researchers focus on ways of reducing or eluding Multipath effects whilst others focus on ways of mitigating the effects of Multipath through compensation schemes. Baseband processing is seen as one field of signal processing that is cardinal to the advancement of software-defined radio technology. This has led to wide research into the carrying out certain algorithms at baseband. This paper considers compensating for Multipath for Frequency Modulated signals. The compensation process is carried out at Radio frequency (RF) and at Quadrature baseband (QBB) and the results are compared. Simulations are carried out using MatLab so as to show the benefits of working at lower QBB frequencies than at RF. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quadrature%20baseband" title="quadrature baseband">quadrature baseband</a>, <a href="https://publications.waset.org/abstracts/search?q=qadio%20frequency" title=" qadio frequency"> qadio frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=qultipath%20compensation" title=" qultipath compensation"> qultipath compensation</a>, <a href="https://publications.waset.org/abstracts/search?q=frequency%20qodulation" title=" frequency qodulation"> frequency qodulation</a>, <a href="https://publications.waset.org/abstracts/search?q=signal%20processing" title=" signal processing"> signal processing</a> </p> <a href="https://publications.waset.org/abstracts/28979/simple-multipath-compensation-for-frequency-modulated-signals-a-case-of-radio-frequency-vs-quadrature-baseband" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28979.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">481</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">283</span> A Comparative and Critical Analysis of Some Routing Protocols in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ishtiaq%20Wahid">Ishtiaq Wahid</a>, <a href="https://publications.waset.org/abstracts/search?q=Masood%20Ahmad"> Masood Ahmad</a>, <a href="https://publications.waset.org/abstracts/search?q=Nighat%20Ayub"> Nighat Ayub</a>, <a href="https://publications.waset.org/abstracts/search?q=Sajad%20Ali"> Sajad Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Lifetime of a wireless sensor network (WSN) is directly proportional to the energy consumption of its constituent nodes. Routing in wireless sensor network is very challenging due its inherit characteristics. In hierarchal routing the sensor ﬁled is divided into clusters. The cluster-heads are selected from each cluster, which forms a hierarchy of nodes. The cluster-heads are used to transmit the data to the base station while other nodes perform the sensing task. In this way the lifetime of the network is increased. In this paper a comparative study of hierarchal routing protocols are conducted. The simulation is done in NS-2 for validation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=WSN" title="WSN">WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=cluster" title=" cluster"> cluster</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor%20networks" title=" sensor networks"> sensor networks</a> </p> <a href="https://publications.waset.org/abstracts/41484/a-comparative-and-critical-analysis-of-some-routing-protocols-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41484.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">479</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">282</span> A Dynamic Round Robin Routing for Z-Fat Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20O.%20Adda">M. O. Adda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a topology called Zoned fat tree (Z-Fat tree) which is a further extension to the classical fat trees. The extension relates to the provision of extra degree of connectivity to maximize the number of deployed ports per routing nodes, and hence increases the bisection bandwidth especially for slimmed fat trees. The extra links, when classical routing is used, tend, in deterministic environment, to be under-utilized for some traffic patterns, hence achieving poor performance. We suggest two versions of a dynamic round robin scheme that outperforms the classical D-mod-k and S-mod-K routing and show by simulation that our proposal utilize all the extra added links to the classical fat tree, and achieve better performance for general applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=deterministic%20routing" title="deterministic routing">deterministic routing</a>, <a href="https://publications.waset.org/abstracts/search?q=fat%20tree" title=" fat tree"> fat tree</a>, <a href="https://publications.waset.org/abstracts/search?q=interconnection" title=" interconnection"> interconnection</a>, <a href="https://publications.waset.org/abstracts/search?q=traffic%20pattern" title=" traffic pattern"> traffic pattern</a> </p> <a href="https://publications.waset.org/abstracts/40045/a-dynamic-round-robin-routing-for-z-fat-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40045.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">484</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">281</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/abstracts/search?q=Apidet%20Booranawong">Apidet Booranawong</a>, <a href="https://publications.waset.org/abstracts/search?q=Wiklom%20Teerapabkajorndet"> Wiklom Teerapabkajorndet</a> </p> <p class="card-text"><strong>Abstract:</strong></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 class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=WSANs" title="WSANs">WSANs</a>, <a href="https://publications.waset.org/abstracts/search?q=building%20temperature%20control" title=" building temperature control"> building temperature control</a>, <a href="https://publications.waset.org/abstracts/search?q=AODV%20routing%20protocol" title=" AODV routing protocol"> AODV routing protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=control%20system%20error" title=" control system error"> control system error</a>, <a href="https://publications.waset.org/abstracts/search?q=settling%20time" title=" settling time"> settling time</a>, <a href="https://publications.waset.org/abstracts/search?q=delay" title=" delay"> delay</a>, <a href="https://publications.waset.org/abstracts/search?q=delivery%20ratio" title=" delivery ratio "> delivery ratio </a> </p> <a href="https://publications.waset.org/abstracts/3379/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/abstracts/3379.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">339</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">280</span> Adaptive Routing Protocol for Dynamic Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fayez%20Mostafa%20Alhamoui">Fayez Mostafa Alhamoui</a>, <a href="https://publications.waset.org/abstracts/search?q=Adnan%20Hadi%20Mahdi%20Al-%20Helali"> Adnan Hadi Mahdi Al- Helali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main issue in designing a wireless sensor network (WSN) is the finding of a proper routing protocol that complies with the several requirements of high reliability, short latency, scalability, low power consumption, and many others. This paper proposes a novel routing algorithm that complies with these design requirements. The new routing protocol divides the WSN into several sub-networks and each sub-network is divided into several clusters. This division is designed to reduce the number of radio transmission and hence decreases the power consumption. The network division may be changed dynamically to adapt with the network changes and allows the realization of the design requirements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title="wireless sensor networks">wireless sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20protocols" title=" routing protocols"> routing protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=AD%20HOC%20topology" title=" AD HOC topology"> AD HOC topology</a>, <a href="https://publications.waset.org/abstracts/search?q=cluster" title=" cluster"> cluster</a>, <a href="https://publications.waset.org/abstracts/search?q=sub-network" title=" sub-network"> sub-network</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN%20design%20requirements" title=" WSN design requirements"> WSN design requirements</a> </p> <a href="https://publications.waset.org/abstracts/37365/adaptive-routing-protocol-for-dynamic-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37365.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">537</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">279</span> Virtual Routing Function Allocation Method for Minimizing Total Network Power Consumption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kenichiro%20Hida">Kenichiro Hida</a>, <a href="https://publications.waset.org/abstracts/search?q=Shin-Ichi%20Kuribayashi"> Shin-Ichi Kuribayashi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a conventional network, most network devices, such as routers, are dedicated devices that do not have much variation in capacity. In recent years, a new concept of network functions virtualisation (NFV) has come into use. The intention is to implement a variety of network functions with software on general-purpose servers and this allows the network operator to select their capacities and locations without any constraints. This paper focuses on the allocation of NFV-based routing functions which are one of critical network functions, and presents the virtual routing function allocation algorithm that minimizes the total power consumption. In addition, this study presents the useful allocation policy of virtual routing functions, based on an evaluation with a ladder-shaped network model. This policy takes the ratio of the power consumption of a routing function to that of a circuit and traffic distribution between areas into consideration. Furthermore, the present paper shows that there are cases where the use of NFV-based routing functions makes it possible to reduce the total power consumption dramatically, in comparison to a conventional network, in which it is not economically viable to distribute small-capacity routing functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=NFV" title="NFV">NFV</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20routing%20function" title=" virtual routing function"> virtual routing function</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20power%20consumption" title=" minimum power consumption"> minimum power consumption</a> </p> <a href="https://publications.waset.org/abstracts/52508/virtual-routing-function-allocation-method-for-minimizing-total-network-power-consumption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52508.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">341</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">278</span> Emerging Research Trends in Routing Protocol for Wireless Sensor Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Subhra%20Prosun%20Paul">Subhra Prosun Paul</a>, <a href="https://publications.waset.org/abstracts/search?q=Shruti%20Aggarwal"> Shruti Aggarwal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Now a days Routing Protocol in Wireless Sensor Network has become a promising technique in the different fields of the latest computer technology. Routing in Wireless Sensor Network is a demanding task due to the different design issues of all sensor nodes. Network architecture, no of nodes, traffic of routing, the capacity of each sensor node, network consistency, service value are the important factor for the design and analysis of Routing Protocol in Wireless Sensor Network. Additionally, internal energy, the distance between nodes, the load of sensor nodes play a significant role in the efficient routing protocol. In this paper, our intention is to analyze the research trends in different routing protocols of Wireless Sensor Network in terms of different parameters. In order to explain the research trends on Routing Protocol in Wireless Sensor Network, different data related to this research topic are analyzed with the help of Web of Science and Scopus databases. The data analysis is performed from global perspective-taking different parameters like author, source, document, country, organization, keyword, year, and a number of the publication. Different types of experiments are also performed, which help us to evaluate the recent research tendency in the Routing Protocol of Wireless Sensor Network. In order to do this, we have used Web of Science and Scopus databases separately for data analysis. We have observed that there has been a tremendous development of research on this topic in the last few years as it has become a very popular topic day by day. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analysis" title="analysis">analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20protocol" title=" routing protocol"> routing protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=research%20trends" title=" research trends"> research trends</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a> </p> <a href="https://publications.waset.org/abstracts/141889/emerging-research-trends-in-routing-protocol-for-wireless-sensor-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141889.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">215</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">277</span> Performance Evaluation of DSR and OLSR Routing Protocols in MANET Using Varying Pause Time </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yassine%20Meraihi">Yassine Meraihi</a>, <a href="https://publications.waset.org/abstracts/search?q=Dalila%20Acheli"> Dalila Acheli</a>, <a href="https://publications.waset.org/abstracts/search?q=Rabah%20Meraihi"> Rabah Meraihi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> MANET for Mobile Ad hoc NETwork is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized administration, due to the higher mobility and limited radio transmission range, routing is an important issue in ad hoc network, so in order to ensure reliable and efficient route between to communicating nodes quickly, an appropriate routing protocol is needed. In this paper, we present the performance analysis of two mobile ad hoc network routing protocols namely DSR and OLSR using NS2.34, the performance is determined on the basis of packet delivery ratio, throughput, average jitter and end to end delay with varying pause time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DSR" title="DSR">DSR</a>, <a href="https://publications.waset.org/abstracts/search?q=OLSR" title=" OLSR"> OLSR</a>, <a href="https://publications.waset.org/abstracts/search?q=quality%20of%20service" title=" quality of service"> quality of service</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20protocols" title=" routing protocols"> routing protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=MANET" title=" MANET"> MANET</a> </p> <a href="https://publications.waset.org/abstracts/19417/performance-evaluation-of-dsr-and-olsr-routing-protocols-in-manet-using-varying-pause-time" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19417.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">552</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">276</span> Evaluation of Collect Tree Protocol for Structural Health Monitoring System Using Wireless Sensor Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amira%20Zrelli">Amira Zrelli</a>, <a href="https://publications.waset.org/abstracts/search?q=Tahar%20Ezzedine"> Tahar Ezzedine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Routing protocol may enhance the lifetime of sensor network, it has a highly importance, especially in wireless sensor network (WSN). Therefore, routing protocol has a big effect in these networks, thus the choice of routing protocol must be studied before setting up our network. In this work, we implement the routing protocol collect tree protocol (CTP) which is one of the hierarchic protocols used in structural health monitoring (SHM). Therefore, to evaluate the performance of this protocol, we choice to work with Contiki system and Cooja simulator. By throughput and RSSI evaluation of each node, we will deduce about the utility of CTP in structural monitoring system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CTP" title="CTP">CTP</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=SHM" title=" SHM"> SHM</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20protocol" title=" routing protocol"> routing protocol</a> </p> <a href="https://publications.waset.org/abstracts/72336/evaluation-of-collect-tree-protocol-for-structural-health-monitoring-system-using-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72336.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">296</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">275</span> A Golay Pair Based Synchronization Algorithm for Distributed Multiple-Input Multiple-Output System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Weizhi%20Zhong">Weizhi Zhong</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaoyi%20Lu"> Xiaoyi Lu</a>, <a href="https://publications.waset.org/abstracts/search?q=Lei%20Xu"> Lei Xu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to solve the problem of inaccurate synchronization for distributed multiple-input multiple-output (MIMO) system in multipath environment, a golay pair aided timing synchronization method is proposed in this paper. A new synchronous training sequence based on golay pair is designed. By utilizing the aperiodic auto-correlation complementary property of the new training sequence, the fine timing point is obtained at the receiver. Simulation results show that, compared with the tradition timing synchronization approaches, the proposed algorithm can provide high accuracy in synchronization, especially under multipath condition. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20MIMO%20system" title="distributed MIMO system">distributed MIMO system</a>, <a href="https://publications.waset.org/abstracts/search?q=golay%20pair" title=" golay pair"> golay pair</a>, <a href="https://publications.waset.org/abstracts/search?q=multipath" title=" multipath"> multipath</a>, <a href="https://publications.waset.org/abstracts/search?q=synchronization" title=" synchronization"> synchronization</a> </p> <a href="https://publications.waset.org/abstracts/72014/a-golay-pair-based-synchronization-algorithm-for-distributed-multiple-input-multiple-output-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72014.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">247</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">274</span> Performance Comparison of Reactive, Proactive and Hybrid Routing Protocols in Wireless Ad Hoc Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kumar%20Manoj">Kumar Manoj</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramesh%20Kumar"> Ramesh Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Kumari%20Arti"> Kumari Arti</a>, <a href="https://publications.waset.org/abstracts/search?q=Kumar%20Prashant"> Kumar Prashant </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Routing protocols have a central role in any mobile ad hoc network (MANET). There are many routing protocols that exhibit different performance levels in different scenarios. In this paper we compare AODV, DSDV, DSR and ZRP routing protocol in mobile ad hoc networks to determine the best operational conditions for each protocol. We analyses these routing protocols by extensive simulations in OPNET simulator and show that how pause time and the number of nodes affect their performance. In this study, performance is measured in terms of control traffic received, control traffic sent, data traffic received, data traffic sent, throughput, retransmission attempts. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MANET" title="MANET">MANET</a>, <a href="https://publications.waset.org/abstracts/search?q=AODV" title=" AODV"> AODV</a>, <a href="https://publications.waset.org/abstracts/search?q=DSDV" title=" DSDV"> DSDV</a>, <a href="https://publications.waset.org/abstracts/search?q=DSR" title=" DSR"> DSR</a>, <a href="https://publications.waset.org/abstracts/search?q=ZRP" title=" ZRP"> ZRP</a> </p> <a href="https://publications.waset.org/abstracts/16614/performance-comparison-of-reactive-proactive-and-hybrid-routing-protocols-in-wireless-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16614.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">678</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/abstracts/search?q=multipath%20routing&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multipath%20routing&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">© 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">×</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>