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: On Demand Distance Vector Routing</title> <meta name="description" content="Search results for: On Demand Distance Vector Routing"> <meta name="keywords" content="On Demand Distance Vector 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="On Demand Distance Vector 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="On Demand Distance Vector 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> 6406</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: On Demand Distance Vector Routing</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">6406</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">6405</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">6404</span> Mechanism for Network Security via Routing Protocols Estimated with Network Simulator 2 (NS-2)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rashid%20Mahmood">Rashid Mahmood</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Sufyan"> Muhammad Sufyan</a>, <a href="https://publications.waset.org/abstracts/search?q=Nasir%20Ahmed"> Nasir Ahmed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The MANETs have lessened transportation and decentralized network. There are numerous basis of routing protocols. We derived the MANETs protocol into three major categories like Reactive, Proactive and hybrid. In these protocols, we discussed only some protocols like Distance Sequenced Distance Vector (DSDV), Ad hoc on Demand Distance Vector (AODV) and Dynamic Source Routing (DSR). The AODV and DSR are both reactive type of protocols. On the other hand, DSDV is proactive type protocol here. We compare these routing protocols for network security estimated by network simulator (NS-2). In this dissertation some parameters discussed such as simulation time, packet size, number of node, packet delivery fraction, push time and speed etc. We will construct all these parameters on routing protocols under suitable conditions for network security measures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DSDV" title="DSDV">DSDV</a>, <a href="https://publications.waset.org/abstracts/search?q=AODV" title=" AODV"> AODV</a>, <a href="https://publications.waset.org/abstracts/search?q=DSR%20NS-2" title=" DSR NS-2"> DSR NS-2</a>, <a href="https://publications.waset.org/abstracts/search?q=PDF" title=" PDF"> PDF</a>, <a href="https://publications.waset.org/abstracts/search?q=push%20time" title=" push time"> push time</a> </p> <a href="https://publications.waset.org/abstracts/24997/mechanism-for-network-security-via-routing-protocols-estimated-with-network-simulator-2-ns-2" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24997.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">433</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">6403</span> Performance Analysis and Energy Consumption of Routing Protocol in Manet Using Grid Topology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vivek%20Kumar%20Singh">Vivek Kumar Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Tripti%20Singh"> Tripti Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An ad hoc wireless network consists of mobile networks which creates an underlying architecture for communication without the help of traditional fixed-position routers. Ad-hoc On-demand Distance Vector (AODV) is a routing protocol used for Mobile Ad hoc Network (MANET). Nevertheless, the architecture must maintain communication routes although the hosts are mobile and they have limited transmission range. There are different protocols for handling the routing in the mobile environment. Routing protocols used in fixed infrastructure networks cannot be efficiently used for mobile ad-hoc networks, so that MANET requires different protocols. This paper presents the performance analysis of the routing protocols used various parameter-patterns with Two-ray model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AODV" title="AODV">AODV</a>, <a href="https://publications.waset.org/abstracts/search?q=packet%20transmission%20rate" title=" packet transmission rate"> packet transmission rate</a>, <a href="https://publications.waset.org/abstracts/search?q=pause%20time" title=" pause time"> pause time</a>, <a href="https://publications.waset.org/abstracts/search?q=ZRP" title=" ZRP"> ZRP</a>, <a href="https://publications.waset.org/abstracts/search?q=QualNet%206.1" title=" QualNet 6.1"> QualNet 6.1</a> </p> <a href="https://publications.waset.org/abstracts/19914/performance-analysis-and-energy-consumption-of-routing-protocol-in-manet-using-grid-topology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19914.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">828</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">6402</span> The Impact of Malicious Attacks 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/abstracts/search?q=Habib%20Gorine">Habib Gorine</a>, <a href="https://publications.waset.org/abstracts/search?q=Rabia%20Saleh"> Rabia Saleh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile Ad-Hoc Networks are the special type of wireless networks which share common security requirements with other networks such as confidentiality, integrity, authentication, and availability, which need to be addressed in order to secure data transfer through the network. Their routing protocols are vulnerable to various malicious attacks which could have a devastating consequence on data security. In this paper, three types of attacks such as selfish, gray hole, and black hole attacks have been applied to the two most important routing protocols in MANET named dynamic source routing and ad-hoc on demand distance vector in order to analyse and compare the impact of these attacks on the Network performance in terms of throughput, average delay, packet loss, and consumption of energy using NS2 simulator. <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=wireless%20networks" title=" wireless networks"> wireless 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=malicious%20attacks" title=" malicious attacks"> malicious attacks</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20networks%20simulation" title=" wireless networks simulation"> wireless networks simulation</a> </p> <a href="https://publications.waset.org/abstracts/88341/the-impact-of-malicious-attacks-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/abstracts/88341.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">320</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">6401</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">6400</span> Energy Efficient Routing Protocol with Ad Hoc On-Demand Distance Vector for MANET</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Thamizhmaran">K. Thamizhmaran</a>, <a href="https://publications.waset.org/abstracts/search?q=Akshaya%20Devi%20Arivazhagan"> Akshaya Devi Arivazhagan</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Anitha"> M. Anitha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> On the case of most important systematic issue that must need to be solved in means of implementing a data transmission algorithm on the source of Mobile adhoc networks (MANETs). That is, how to save mobile nodes energy on meeting the requirements of applications or users as the mobile nodes are with battery limited. On while satisfying the energy saving requirement, hence it is also necessary of need to achieve the quality of service. In case of emergency work, it is necessary to deliver the data on mean time. Achieving quality of service in MANETs is also important on while. In order to achieve this requirement, Hence, we further implement the Energy-Aware routing protocol for system of Mobile adhoc networks were it being proposed, that on which saves the energy as on every node by means of efficiently selecting the mode of energy efficient path in the routing process by means of Enhanced AODV routing protocol. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ad-Hoc%20networks" title="Ad-Hoc networks">Ad-Hoc networks</a>, <a href="https://publications.waset.org/abstracts/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=AODV" title=" AODV"> AODV</a>, <a href="https://publications.waset.org/abstracts/search?q=EAODV" title=" EAODV"> EAODV</a> </p> <a href="https://publications.waset.org/abstracts/22293/energy-efficient-routing-protocol-with-ad-hoc-on-demand-distance-vector-for-manet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22293.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">370</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">6399</span> Performance Analysis of Routing Protocols for WLAN Based Wireless Sensor Networks (WSNs)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Noman%20Shabbir">Noman Shabbir</a>, <a href="https://publications.waset.org/abstracts/search?q=Roheel%20Nawaz"> Roheel Nawaz</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20N.%20Iqbal"> Muhammad N. Iqbal</a>, <a href="https://publications.waset.org/abstracts/search?q=Junaid%20Zafar"> Junaid Zafar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper focuses on the performance evaluation of routing protocols in WLAN based Wireless Sensor Networks (WSNs). A comparative analysis of routing protocols such as Ad-hoc On-demand Distance Vector Routing System (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR) is been made against different network parameters like network load, end to end delay and throughput in small, medium and large-scale sensor network scenarios to identify the best performing protocol. Simulation results indicate that OLSR gives minimum network load in all three scenarios while AODV gives the best throughput in small scale network but in medium and large scale networks, DSR is better. In terms of delay, OLSR is more efficient in small and medium scale network while AODV is slightly better in large networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=WLAN" title="WLAN">WLAN</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=AODV" title=" AODV"> AODV</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> </p> <a href="https://publications.waset.org/abstracts/48412/performance-analysis-of-routing-protocols-for-wlan-based-wireless-sensor-networks-wsns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48412.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">449</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">6398</span> Performance Comparison of AODV and Soft AODV Routing Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abhishek">Abhishek</a>, <a href="https://publications.waset.org/abstracts/search?q=Seema%20Devi"> Seema Devi</a>, <a href="https://publications.waset.org/abstracts/search?q=Jyoti%20Ohri"> Jyoti Ohri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A mobile ad hoc network (MANET) represents a system of wireless mobile nodes that can self-organize freely and dynamically into arbitrary and temporary network topology. Unlike a wired network, wireless network interface has limited transmission range. Routing is the task of forwarding data packets from source to a given destination. Ad-hoc On Demand Distance Vector (AODV) routing protocol creates a path for a destination only when it required. This paper describes the implementation of AODV routing protocol using MATLAB-based Truetime simulator. In MANET's node movements are not fixed while they are random in nature. Hence intelligent techniques i.e. fuzzy and ANFIS are used to optimize the transmission range. In this paper, we compared the transmission range of AODV, fuzzy AODV and ANFIS AODV. For soft computing AODV, we have taken transmitted power and received threshold as input and transmission range as output. ANFIS gives better results as compared to fuzzy AODV. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ANFIS" title="ANFIS">ANFIS</a>, <a href="https://publications.waset.org/abstracts/search?q=AODV" title=" AODV"> AODV</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy" title=" fuzzy"> fuzzy</a>, <a href="https://publications.waset.org/abstracts/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/abstracts/search?q=reactive%20routing%20protocol" title=" reactive routing protocol"> reactive routing protocol</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=truetime" title=" truetime "> truetime </a> </p> <a href="https://publications.waset.org/abstracts/25434/performance-comparison-of-aodv-and-soft-aodv-routing-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25434.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">498</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">6397</span> Analysis of Two Methods to Estimation Stochastic Demand in the Vehicle Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fatemeh%20Torfi">Fatemeh Torfi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Estimation of stochastic demand in physical distribution in general and efficient transport routs management in particular is emerging as a crucial factor in urban planning domain. It is particularly important in some municipalities such as Tehran where a sound demand management calls for a realistic analysis of the routing system. The methodology involved critically investigating a fuzzy least-squares linear regression approach (FLLRs) to estimate the stochastic demands in the vehicle routing problem (VRP) bearing in mind the customer's preferences order. A FLLR method is proposed in solving the VRP with stochastic demands. Approximate-distance fuzzy least-squares (ADFL) estimator ADFL estimator is applied to original data taken from a case study. The SSR values of the ADFL estimator and real demand are obtained and then compared to SSR values of the nominal demand and real demand. Empirical results showed that the proposed methods can be viable in solving problems under circumstances of having vague and imprecise performance ratings. The results further proved that application of the ADFL was realistic and efficient estimator to face the stochastic demand challenges in vehicle routing system management and solve relevant problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20least-squares" title="fuzzy least-squares">fuzzy least-squares</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic" title=" stochastic"> stochastic</a>, <a href="https://publications.waset.org/abstracts/search?q=location" title=" location"> location</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20problems" title=" routing problems "> routing problems </a> </p> <a href="https://publications.waset.org/abstracts/3439/analysis-of-two-methods-to-estimation-stochastic-demand-in-the-vehicle-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3439.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">434</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">6396</span> Speed up Vector Median Filtering by Quasi Euclidean Norm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vinai%20K.%20Singh">Vinai K. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For reducing impulsive noise without degrading image contours, median filtering is a powerful tool. In multiband images as for example colour images or vector fields obtained by optic flow computation, a vector median filter can be used. Vector median filters are defined on the basis of a suitable distance, the best performing distance being the Euclidean. Euclidean distance is evaluated by using the Euclidean norms which is quite demanding from the point of view of computation given that a square root is required. In this paper an optimal piece-wise linear approximation of the Euclidean norm is presented which is applied to vector median filtering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=euclidean%20norm" title="euclidean norm">euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi%20euclidean%20norm" title=" quasi euclidean norm"> quasi euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20median%20filtering" title=" vector median filtering"> vector median filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=applied%20mathematics" title=" applied mathematics"> applied mathematics</a> </p> <a href="https://publications.waset.org/abstracts/21942/speed-up-vector-median-filtering-by-quasi-euclidean-norm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21942.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">474</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">6395</span> Vector Quantization Based on Vector Difference Scheme for Image Enhancement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Biji%20Jacob">Biji Jacob</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vector quantization algorithm which uses minimum distance calculation for codebook generation, a time consuming calculation performed on each pixel values leads to computation complexity. The codebook is updated by comparing the distance of each vector to their centroid vector and measure for their closeness. In this paper vector quantization is modified based on vector difference algorithm for image enhancement purpose. In the proposed scheme, vector differences between the vectors are considered as the new generation vectors or new codebook vectors. The codebook is updated by comparing the new generation vector with a threshold value having minimum error with the parent vector. The minimum error decides the fitness of each newly generated vector. Thus the codebook is generated in an adaptive manner and the fitness value is determined for the suppression of the degraded portion of the image and thereby leads to the enhancement of the image through the adaptive searching capability of the vector quantization through vector difference algorithm. Experimental results shows that the vector difference scheme efficiently modifies the vector quantization algorithm for enhancing the image with peak signal to noise ratio (PSNR), mean square error (MSE), Euclidean distance (E_dist) as the performance parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=codebook" title="codebook">codebook</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20enhancement" title=" image enhancement"> image enhancement</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20difference" title=" vector difference"> vector difference</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20quantization" title=" vector quantization"> vector quantization</a> </p> <a href="https://publications.waset.org/abstracts/39597/vector-quantization-based-on-vector-difference-scheme-for-image-enhancement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39597.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">267</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">6394</span> Formal Implementation of Routing Information Protocol Using Event-B</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=Tadashi%20Shiroma"> Tadashi Shiroma</a>, <a href="https://publications.waset.org/abstracts/search?q=Tomokazu%20Nagata"> Tomokazu Nagata</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuji%20Taniguchi"> Yuji Taniguchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Morikazu%20Nakamura"> Morikazu Nakamura</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The goal of this paper is to explore the use of formal methods for Dynamic Routing, The purpose of network communication with dynamic routing is sending a massage from one node to others by using pacific protocols. In dynamic routing connections are possible based on protocols of Distance vector (Routing Information Protocol, Border Gateway protocol), Link State (Open Shortest Path First, Intermediate system Intermediate System), Hybrid (Enhanced Interior Gateway Routing Protocol). The responsibility for proper verification becomes crucial with Dynamic Routing. Formal methods can play an essential role in the Routing, development of Networks and testing of distributed systems. Event-B is a formal technique consists of describing rigorously the problem; introduce solutions or details in the refinement steps to obtain more concrete specification, and verifying that proposed solutions are correct. The system is modeled in terms of an abstract state space using variables with set theoretic types and the events that modify state variables. Event-B is a variant of B, was designed for developing distributed systems. In Event-B, the events consist of guarded actions occurring spontaneously rather than being invoked. The invariant state properties must be satisfied by the variables and maintained by the activation of the events. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20rout%20RIP" title="dynamic rout RIP">dynamic rout RIP</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=event-B" title=" event-B"> event-B</a>, <a href="https://publications.waset.org/abstracts/search?q=pro-B" title=" pro-B"> pro-B</a> </p> <a href="https://publications.waset.org/abstracts/38499/formal-implementation-of-routing-information-protocol-using-event-b" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38499.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">401</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">6393</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">6392</span> Adaptive Energy-Aware Routing (AEAR) for Optimized Performance in Resource-Constrained Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Innocent%20Uzougbo%20Onwuegbuzie">Innocent Uzougbo Onwuegbuzie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless Sensor Networks (WSNs) are crucial for numerous applications, yet they face significant challenges due to resource constraints such as limited power and memory. Traditional routing algorithms like Dijkstra, Ad hoc On-Demand Distance Vector (AODV), and Bellman-Ford, while effective in path establishment and discovery, are not optimized for the unique demands of WSNs due to their large memory footprint and power consumption. This paper introduces the Adaptive Energy-Aware Routing (AEAR) model, a solution designed to address these limitations. AEAR integrates reactive route discovery, localized decision-making using geographic information, energy-aware metrics, and dynamic adaptation to provide a robust and efficient routing strategy. We present a detailed comparative analysis using a dataset of 50 sensor nodes, evaluating power consumption, memory footprint, and path cost across AEAR, Dijkstra, AODV, and Bellman-Ford algorithms. Our results demonstrate that AEAR significantly reduces power consumption and memory usage while optimizing path weight. This improvement is achieved through adaptive mechanisms that balance energy efficiency and link quality, ensuring prolonged network lifespan and reliable communication. The AEAR model's superior performance underlines its potential as a viable routing solution for energy-constrained WSN environments, paving the way for more sustainable and resilient sensor network deployments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks%20%28WSNs%29" title="wireless sensor networks (WSNs)">wireless sensor networks (WSNs)</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20energy-aware%20routing%20%28AEAR%29" title=" adaptive energy-aware routing (AEAR)"> adaptive energy-aware routing (AEAR)</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20algorithms" title=" routing algorithms"> routing algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=energy" title=" energy"> energy</a>, <a href="https://publications.waset.org/abstracts/search?q=efficiency" title=" efficiency"> efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20lifespan" title=" network lifespan"> network lifespan</a> </p> <a href="https://publications.waset.org/abstracts/188257/adaptive-energy-aware-routing-aear-for-optimized-performance-in-resource-constrained-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/188257.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">36</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">6391</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">6390</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">6389</span> Top-K Shortest Distance as a Similarity Measure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andrey%20Lebedev">Andrey Lebedev</a>, <a href="https://publications.waset.org/abstracts/search?q=Ilya%20Dmitrenok"> Ilya Dmitrenok</a>, <a href="https://publications.waset.org/abstracts/search?q=JooYoung%20Lee"> JooYoung Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Leonard%20Johard"> Leonard Johard</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Top-k shortest path routing problem is an extension of finding the shortest path in a given network. Shortest path is one of the most essential measures as it reveals the relations between two nodes in a network. However, in many real world networks, whose diameters are small, top-k shortest path is more interesting as it contains more information about the network topology. Many variations to compute top-k shortest paths have been studied. In this paper, we apply an efficient top-k shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Then, we also propose a top-k distance based graph matching algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20matching" title="graph matching">graph matching</a>, <a href="https://publications.waset.org/abstracts/search?q=link%20prediction" title=" link prediction"> link prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=shortest%20path" title=" shortest path"> shortest path</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity" title=" similarity"> similarity</a> </p> <a href="https://publications.waset.org/abstracts/63488/top-k-shortest-distance-as-a-similarity-measure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63488.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">358</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">6388</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">6387</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">6386</span> A Polynomial Time Clustering Algorithm for Solving the Assignment Problem in the Vehicle Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lydia%20Wahid">Lydia Wahid</a>, <a href="https://publications.waset.org/abstracts/search?q=Mona%20F.%20Ahmed"> Mona F. Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Nevin%20Darwish"> Nevin Darwish</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The vehicle routing problem (VRP) consists of a group of customers that needs to be served. Each customer has a certain demand of goods. A central depot having a fleet of vehicles is responsible for supplying the customers with their demands. The problem is composed of two subproblems: The first subproblem is an assignment problem where the number of vehicles that will be used as well as the customers assigned to each vehicle are determined. The second subproblem is the routing problem in which for each vehicle having a number of customers assigned to it, the order of visits of the customers is determined. Optimal number of vehicles, as well as optimal total distance, should be achieved. In this paper, an approach for solving the first subproblem (the assignment problem) is presented. In the approach, a clustering algorithm is proposed for finding the optimal number of vehicles by grouping the customers into clusters where each cluster is visited by one vehicle. Finding the optimal number of clusters is NP-hard. This work presents a polynomial time clustering algorithm for finding the optimal number of clusters and solving the assignment problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problems" title="vehicle routing problems">vehicle routing problems</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithms" title=" clustering algorithms"> clustering algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Clarke%20and%20Wright%20Saving%20Method" title=" Clarke and Wright Saving Method"> Clarke and Wright Saving Method</a>, <a href="https://publications.waset.org/abstracts/search?q=agglomerative%20hierarchical%20clustering" title=" agglomerative hierarchical clustering"> agglomerative hierarchical clustering</a> </p> <a href="https://publications.waset.org/abstracts/85552/a-polynomial-time-clustering-algorithm-for-solving-the-assignment-problem-in-the-vehicle-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85552.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">393</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">6385</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">6384</span> A Model for Helicopter Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Sipahioglu">Aydin Sipahioglu</a>, <a href="https://publications.waset.org/abstracts/search?q=Gokhan%20Celik"> Gokhan Celik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Helicopter routing problem (HRP) is finding good tours for helicopter so as to pick up and deliver personnel or material among specified nodes, mutually. It can be encountered in case of being lots of supply and demand points for different commodities and requiring delivering commodities with helicopter. For instance, to deliver personnel or material from shore to oil rig is a good example. In fact, HRP is a branch of vehicle routing problem with pickup and delivery (VRPPD). However, it has additional constraints such that fuel capacity, performance of helicopter in different altitude and temperature, and the number of maximum takeoff and landing allowed. This kind of pickup and delivery problems can be classified into 3 groups, basically. 1-1 (one to one), M-M (many to many) and 1-M-1 (one to many to one). 1-1 means each commodity has only one supply and one demand point. M-M means there can be more than one supply and demand points for each kind of commodity. 1-M-1 means commodities at depot are delivered to demand points and commodities at customers are delivered to depot. In this case helicopter takes off from its own base, complete its tour and return to its own base. In this study, we define 1-M-M-1 type HRP. That means helicopter takes off from its home base, deliver commodities among the nodes as well as between depot and customers and return to its home base. These problems have NP-hard nature. Therefore, obtaining a good solution in a reasonable time is not easy. In this study, a model is offered for 1-M-M-1 type HRP. It is shown on small scale test instances that the model can find the optimal solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=helicopter%20routing%20problem" title="helicopter routing problem">helicopter routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20with%20pickup%20and%20delivery" title=" vehicle routing with pickup and delivery"> vehicle routing with pickup and delivery</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title=" integer programming"> integer programming</a> </p> <a href="https://publications.waset.org/abstracts/9651/a-model-for-helicopter-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9651.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">430</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">6383</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">6382</span> Improving the Global Competitiveness of SMEs by Logistics Transportation Management: Case Study Chicken Meat Supply Chain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Vanichkobchinda">P. Vanichkobchinda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Logistics Transportation techniques, Open Vehicle Routing (OVR) is an approach toward transportation cost reduction, especially for long distance pickup and delivery nodes. The outstanding characteristic of OVR is that the route starting node and ending node are not necessary the same as in typical vehicle routing problems. This advantage enables the routing to flow continuously and the vehicle does not always return to its home base. This research aims to develop a heuristic for the open vehicle routing problem with pickup and delivery under time window and loading capacity constraints to minimize the total distance. The proposed heuristic is developed based on the Insertion method, which is a simple method and suitable for the rapid calculation that allows insertion of the new additional transportation requirements along the original paths. According to the heuristic analysis, cost comparisons between the proposed heuristic and companies are using method, nearest neighbor method show that the insertion heuristic. Moreover, the proposed heuristic gave superior solutions in all types of test problems. In conclusion, the proposed heuristic can effectively and efficiently solve the open vehicle routing. The research indicates that the improvement of new transport's calculation and the open vehicle routing with "Insertion Heuristic" represent a better outcome with 34.3 percent in average. in cost savings. Moreover, the proposed heuristic gave superior solutions in all types of test problems. In conclusion, the proposed heuristic can effectively and efficiently solve the open vehicle routing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=business%20competitiveness" title="business competitiveness">business competitiveness</a>, <a href="https://publications.waset.org/abstracts/search?q=cost%20reduction" title=" cost reduction"> cost reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=SMEs" title=" SMEs"> SMEs</a>, <a href="https://publications.waset.org/abstracts/search?q=logistics%20transportation" title=" logistics transportation"> logistics transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=VRP" title=" VRP"> VRP</a> </p> <a href="https://publications.waset.org/abstracts/25842/improving-the-global-competitiveness-of-smes-by-logistics-transportation-management-case-study-chicken-meat-supply-chain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25842.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">685</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">6381</span> Dynamic Route Optimization in Vehicle Adhoc Networks: A Heuristics Routing Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rafi%20Ullah">Rafi Ullah</a>, <a href="https://publications.waset.org/abstracts/search?q=Shah%20Muhammad%20Emaduddin"> Shah Muhammad Emaduddin</a>, <a href="https://publications.waset.org/abstracts/search?q=Taha%20Jilani"> Taha Jilani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vehicle Adhoc Networks (VANET) belongs to a special class of Mobile Adhoc Network (MANET) with high mobility. Network is created by road side vehicles equipped with communication devices like GPS and Wifi etc. Since the environment is highly dynamic due to difference in speed and high mobility of vehicles and weak stability of the network connection, it is a challenging task to design an efficient routing protocol for such an unstable environment. Our proposed algorithm uses heuristic for the calculation of optimal path for routing the packet efficiently in collaboration with several other parameters like geographical location, speed, priority, the distance among the vehicles, communication range, and networks congestion. We have incorporated probabilistic, heuristic and machine learning based approach inconsistency with the relay function of the memory buffer to keep the packet moving towards the destination. These parameters when used in collaboration provide us a very strong and admissible heuristics. We have mathematically proved that the proposed technique is efficient for the routing of packets, especially in a medical emergency situation. These networks can be used for medical emergency, security, entertainment and routing purposes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heuristics%20routing" title="heuristics routing">heuristics routing</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligent%20routing" title=" intelligent routing"> intelligent routing</a>, <a href="https://publications.waset.org/abstracts/search?q=VANET" title=" VANET"> VANET</a>, <a href="https://publications.waset.org/abstracts/search?q=route%20optimization" title=" route optimization"> route optimization</a> </p> <a href="https://publications.waset.org/abstracts/101651/dynamic-route-optimization-in-vehicle-adhoc-networks-a-heuristics-routing-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/101651.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">177</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">6380</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">6379</span> Instance Selection for MI-Support Vector Machines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amy%20M.%20Kwon">Amy M. Kwon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Support vector machine (SVM) is a well-known algorithm in machine learning due to its superior performance, and it also functions well in multiple-instance (MI) problems. Our study proposes a schematic algorithm to select instances based on Hausdorff distance, which can be adapted to SVMs as input vectors under the MI setting. Based on experiments on five benchmark datasets, our strategy for adapting representation outperformed in comparison with original approach. In addition, task execution times (TETs) were reduced by more than 80% based on MissSVM. Hence, it is noteworthy to consider this representation adaptation to SVMs under MI-setting. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machine" title="support vector machine">support vector machine</a>, <a href="https://publications.waset.org/abstracts/search?q=Margin" title=" Margin"> Margin</a>, <a href="https://publications.waset.org/abstracts/search?q=Hausdorff%20distance" title=" Hausdorff distance"> Hausdorff distance</a>, <a href="https://publications.waset.org/abstracts/search?q=representation%20selection" title=" representation selection"> representation selection</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple-instance%20learning" title=" multiple-instance learning"> multiple-instance learning</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a> </p> <a href="https://publications.waset.org/abstracts/186528/instance-selection-for-mi-support-vector-machines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186528.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">34</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">6378</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">6377</span> Fuzzy Vehicle Routing Problem for Extreme Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20Sirbiladze">G. Sirbiladze</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Ghvaberidze"> B. Ghvaberidze</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Matsaberidze"> B. Matsaberidze</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A fuzzy vehicle routing problem is considered in the possibilistic environment. A new criterion, maximization of expectation of reliability for movement on closed routes is constructed. The objective of the research is to implement a two-stage scheme for solution of this problem. Based on the algorithm of preferences on the first stage, the sample of so-called “promising” routes will be selected. On the second stage, for the selected promising routes new bi-criteria problem will be solved - minimization of total traveled distance and maximization of reliability of routes. The problem will be stated as a fuzzy-partitioning problem. Two possible solutions of this scheme are considered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problem" title="vehicle routing problem">vehicle routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20partitioning%20problem" title=" fuzzy partitioning problem"> fuzzy partitioning problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple-criteria%20optimization" title=" multiple-criteria optimization"> multiple-criteria optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=possibility%20theory" title=" possibility theory"> possibility theory</a> </p> <a href="https://publications.waset.org/abstracts/9460/fuzzy-vehicle-routing-problem-for-extreme-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9460.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">547</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=On%20Demand%20Distance%20Vector%20Routing&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&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/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&page=213">213</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%20Routing&page=214">214</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=On%20Demand%20Distance%20Vector%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>