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: random routing optimization technique</title> <meta name="description" content="Search results for: random routing optimization technique"> <meta name="keywords" content="random routing optimization technique"> <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="random routing optimization technique" 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="random routing optimization technique"> <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> 11244</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: random routing optimization technique</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11244</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">11243</span> An Ant Colony Optimization Approach for the Pollution Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Parthiban">P. Parthiban</a>, <a href="https://publications.waset.org/abstracts/search?q=Sonu%20Rajak"> Sonu Rajak</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Kannan"> N. Kannan</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Dhanalakshmi"> R. Dhanalakshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the Vehicle Routing Problem (VRP) with environmental considerations which is called Pollution Routing Problem (PRP). The objective is to minimize the operational and environmental costs. It consists of routing a number of vehicles to serve a set of customers, and determining fuel consumption, driver wages and their speed on each route segment, while respecting the capacity constraints and time windows. In this context, we presented an Ant Colony Optimization (ACO) approach, combined with a Speed Optimization Algorithm (SOA) to solve the PRP. The proposed solution method consists of two stages. Stage one is to solve a Vehicle Routing Problem with Time Window (VRPTW) using ACO and in the second stage a SOA is run on the resulting VRPTW solutions. Given a vehicle route, the SOA consists of finding the optimal speed on each arc of the route in order to minimize an objective function comprising fuel consumption costs and driver wages. The proposed algorithm tested on benchmark problem, the preliminary results show that the proposed algorithm is able to provide good solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=CO2%20emissions" title=" CO2 emissions"> CO2 emissions</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization" title=" combinatorial optimization"> combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=speed%20optimization" title=" speed optimization"> speed optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing" title=" vehicle routing"> vehicle routing</a> </p> <a href="https://publications.waset.org/abstracts/52973/an-ant-colony-optimization-approach-for-the-pollution-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52973.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">322</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">11242</span> Optrix: Energy Aware Cross Layer Routing Using Convex Optimization 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=Ali%20Shareef">Ali Shareef</a>, <a href="https://publications.waset.org/abstracts/search?q=Aliha%20Shareef"> Aliha Shareef</a>, <a href="https://publications.waset.org/abstracts/search?q=Yifeng%20Zhu"> Yifeng Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Energy minimization is of great importance in wireless sensor networks in extending the battery lifetime. One of the key activities of nodes in a WSN is communication and the routing of their data to a centralized base-station or sink. Routing using the shortest path to the sink is not the best solution since it will cause nodes along this path to fail prematurely. We propose a cross-layer energy efficient routing protocol Optrix that utilizes a convex formulation to maximize the lifetime of the network as a whole. We further propose, Optrix-BW, a novel convex formulation with bandwidth constraint that allows the channel conditions to be accounted for in routing. By considering this key channel parameter we demonstrate that Optrix-BW is capable of congestion control. Optrix is implemented in TinyOS, and we demonstrate that a relatively large topology of 40 nodes can converge to within 91% of the optimal routing solution. We describe the pitfalls and issues related with utilizing a continuous form technique such as convex optimization with discrete packet based communication systems as found in WSNs. We propose a routing controller mechanism that allows for this transformation. We compare Optrix against the Collection Tree Protocol (CTP) and we found that Optrix performs better in terms of convergence to an optimal routing solution, for load balancing and network lifetime maximization than CTP. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title="wireless sensor network">wireless sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=Energy%20Efficient%20Routing" title=" Energy Efficient Routing"> Energy Efficient Routing</a> </p> <a href="https://publications.waset.org/abstracts/17333/optrix-energy-aware-cross-layer-routing-using-convex-optimization-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17333.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">391</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">11241</span> Analysis of Decentralized on Demand Cross Layer in Cognitive Radio Ad Hoc Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Sri%20Janani">A. Sri Janani</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Immanuel%20Arokia%20James"> K. Immanuel Arokia James</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cognitive radio ad hoc networks different unlicensed users may acquire different available channel sets. This non-uniform spectrum availability imposes special design challenges for broadcasting in CR ad hoc networks. Cognitive radio automatically detects available channels in wireless spectrum. This is a form of dynamic spectrum management. Cross-layer optimization is proposed, using this can allow far away secondary users can also involve into channel work. So it can increase the throughput and it will overcome the collision and time delay. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20radio" title="cognitive radio">cognitive radio</a>, <a href="https://publications.waset.org/abstracts/search?q=cross%20layer%20optimization" title=" cross layer optimization"> cross layer optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=CR%20mesh%20network" title=" CR mesh network"> CR mesh network</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20spectrum" title=" heterogeneous spectrum"> heterogeneous spectrum</a>, <a href="https://publications.waset.org/abstracts/search?q=mesh%20topology" title=" mesh topology"> mesh topology</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique" title=" random routing optimization technique"> random routing optimization technique</a> </p> <a href="https://publications.waset.org/abstracts/47391/analysis-of-decentralized-on-demand-cross-layer-in-cognitive-radio-ad-hoc-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47391.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">359</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">11240</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">11239</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">176</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">11238</span> A Metaheuristic Approach for the Pollution-Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Parthiban">P. Parthiban</a>, <a href="https://publications.waset.org/abstracts/search?q=Sonu%20Rajak"> Sonu Rajak</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Dhanalakshmi"> R. Dhanalakshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an Ant Colony Optimization (ACO) approach, combined with a Speed Optimization Algorithm (SOA) to solve the Vehicle Routing Problem (VRP) with environmental considerations, which is well known as Pollution-Routing Problem (PRP). It consists of routing a number of vehicles to serve a set of customers, and determining fuel consumption, driver wages and their speed on each route segment, while respecting the capacity constraints and time windows. Since VRP is NP-hard problem, so PRP also a NP-hard problem, which requires metaheuristics to solve this type of problems. The proposed solution method consists of two stages. Stage one is to solve a Vehicle Routing Problem with Time Window (VRPTW) using ACO and in the second stage, a SOA is run on the resulting VRPTW solution. Given a vehicle route, the SOA consists of finding the optimal speed on each arc of the route to minimize an objective function comprising fuel consumption costs and driver wages. The proposed algorithm tested on benchmark problem, the preliminary results show that the proposed algorithm can provide good solutions within reasonable computational time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=CO2%20emissions" title=" CO2 emissions"> CO2 emissions</a>, <a href="https://publications.waset.org/abstracts/search?q=speed%20optimization" title=" speed optimization"> speed optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing" title=" vehicle routing"> vehicle routing</a> </p> <a href="https://publications.waset.org/abstracts/50237/a-metaheuristic-approach-for-the-pollution-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50237.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">359</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">11237</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">11236</span> An Algorithm to Depreciate the Energy Utilization Using a Bio-Inspired Method in Wireless Sensor Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Navdeep%20Singh%20Randhawa">Navdeep Singh Randhawa</a>, <a href="https://publications.waset.org/abstracts/search?q=Shally%20Sharma"> Shally Sharma </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless Sensor Network is an autonomous technology emanating in the current scenario at a fast pace. This technology faces a number of defiance’s and energy management is one of them, which has a huge impact on the network lifetime. To sustain energy the different types of routing protocols have been flourished. The classical routing protocols are no more compatible to perform in complicated environments. Hence, in the field of routing the intelligent algorithms based on nature systems is a turning point in Wireless Sensor Network. These nature-based algorithms are quite efficient to handle the challenges of the WSN as they are capable of achieving local and global best optimization solutions for the complex environments. So, the main attention of this paper is to develop a routing algorithm based on some swarm intelligent technique to enhance the performance of Wireless Sensor Network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title="wireless sensor network">wireless sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=swarm%20intelligence" title=" swarm intelligence"> swarm intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=MPRSO" title=" MPRSO"> MPRSO</a> </p> <a href="https://publications.waset.org/abstracts/57858/an-algorithm-to-depreciate-the-energy-utilization-using-a-bio-inspired-method-in-wireless-sensor-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57858.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">352</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">11235</span> IACOP - Route Optimization in Wireless Networks Using Improved Ant Colony Optimization Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Vasundra">S. Vasundra</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Venkatesh"> D. Venkatesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless networks have gone through an extraordinary growth in the past few years, and will keep on playing a crucial role in future data communication. The present wireless networks aim to make communication possible anywhere and anytime. With the converging of mobile and wireless communications with Internet services, the boundary between mobile personal telecommunications and wireless computer networks is disappearing. Wireless networks of the next generation need the support of all the advances on new architectures, standards, and protocols. Since an ad hoc network may consist of a large number of mobile hosts, this imposes a significant challenge on the design of an effective and efficient routing protocol that can work well in an environment with frequent topological changes. This paper proposes improved ant colony optimization (IACO) technique. It also maintains load balancing in wireless networks. The simulation results show that the proposed IACO performs better than existing routing techniques. <p class="card-text"><strong>Keywords:</strong> <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=ant%20colony%20optimization" title=" ant colony optimization"> ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=architecture" title=" architecture"> architecture</a> </p> <a href="https://publications.waset.org/abstracts/43366/iacop-route-optimization-in-wireless-networks-using-improved-ant-colony-optimization-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43366.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">421</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">11234</span> Relay-Augmented Bottleneck Throughput Maximization for Correlated Data Routing: A Game Theoretic Perspective</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Isra%20Elfatih%20Salih%20Edrees">Isra Elfatih Salih Edrees</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20Serdar%20Ufuk%20T%C3%BCreli"> Mehmet Serdar Ufuk Türeli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, an energy-aware method is presented, integrating energy-efficient relay-augmented techniques for correlated data routing with the goal of optimizing bottleneck throughput in wireless sensor networks. The system tackles the dual challenge of throughput optimization while considering sensor network energy consumption. A unique routing metric has been developed to enable throughput maximization while minimizing energy consumption by utilizing data correlation patterns. The paper introduces a game theoretic framework to address the NP-complete optimization problem inherent in throughput-maximizing correlation-aware routing with energy limitations. By creating an algorithm that blends energy-aware route selection strategies with the best reaction dynamics, this framework provides a local solution. The suggested technique considerably raises the bottleneck throughput for each source in the network while reducing energy consumption by choosing the best routes that strike a compromise between throughput enhancement and energy efficiency. Extensive numerical analyses verify the efficiency of the method. The outcomes demonstrate the significant decrease in energy consumption attained by the energy-efficient relay-augmented bottleneck throughput maximization technique, in addition to confirming the anticipated throughput benefits. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=correlated%20data%20aggregation" title="correlated data aggregation">correlated data aggregation</a>, <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=game%20theory" title=" game theory"> game theory</a>, <a href="https://publications.waset.org/abstracts/search?q=relay-augmented%20routing" title=" relay-augmented routing"> relay-augmented routing</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput%20maximization" title=" throughput maximization"> throughput maximization</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/177804/relay-augmented-bottleneck-throughput-maximization-for-correlated-data-routing-a-game-theoretic-perspective" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177804.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">81</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">11233</span> Multi-Objective Random Drift Particle Swarm Optimization Algorithm Based on RDPSO and Crowding Distance Sorting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yiqiong%20Yuan">Yiqiong Yuan</a>, <a href="https://publications.waset.org/abstracts/search?q=Jun%20Sun"> Jun Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Dongmei%20Zhou"> Dongmei Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianan%20Sun"> Jianan Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we presented a Multi-Objective Random Drift Particle Swarm Optimization algorithm (MORDPSO-CD) based on RDPSO and crowding distance sorting to improve the convergence and distribution with less computation cost. MORDPSO-CD makes the most of RDPSO to approach the true Pareto optimal solutions fast. We adopt the crowding distance sorting technique to update and maintain the archived optimal solutions. Introducing the crowding distance technique into MORDPSO can make the leader particles find the true Pareto solution ultimately. The simulation results reveal that the proposed algorithm has better convergence and distribution <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title="multi-objective optimization">multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20drift%20particle%20swarm%20optimization" title=" random drift particle swarm optimization"> random drift particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=crowding%20distance%20sorting" title=" crowding distance sorting"> crowding distance sorting</a>, <a href="https://publications.waset.org/abstracts/search?q=pareto%20optimal%20solution" title=" pareto optimal solution"> pareto optimal solution</a> </p> <a href="https://publications.waset.org/abstracts/44631/multi-objective-random-drift-particle-swarm-optimization-algorithm-based-on-rdpso-and-crowding-distance-sorting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44631.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">255</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">11232</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">11231</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">11230</span> An Application of Integrated Multi-Objective Particles Swarm Optimization and Genetic Algorithm Metaheuristic through Fuzzy Logic for Optimization of Vehicle Routing Problems in Sugar Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mukhtiar%20Singh">Mukhtiar Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Sumeet%20Nagar"> Sumeet Nagar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vehicle routing problem (VRP) is a combinatorial optimization and nonlinear programming problem aiming to optimize decisions regarding given set of routes for a fleet of vehicles in order to provide cost-effective and efficient delivery of both services and goods to the intended customers. This paper proposes the application of integrated particle swarm optimization (PSO) and genetic optimization algorithm (GA) to address the Vehicle routing problem in sugarcane industry in India. Suger industry is very prominent agro-based industry in India due to its impacts on rural livelihood and estimated to be employing around 5 lakhs workers directly in sugar mills. Due to various inadequacies, inefficiencies and inappropriateness associated with the current vehicle routing model it costs huge money loss to the industry which needs to be addressed in proper context. The proposed algorithm utilizes the crossover operation that originally appears in genetic algorithm (GA) to improve its flexibility and manipulation more readily and avoid being trapped in local optimum, and simultaneously for improving the convergence speed of the algorithm, level set theory is also added to it. We employ the hybrid approach to an example of VRP and compare its result with those generated by PSO, GA, and parallel PSO algorithms. The experimental comparison results indicate that the performance of hybrid algorithm is superior to others, and it will become an effective approach for solving discrete combinatory problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic" title="fuzzy logic">fuzzy logic</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problem" title=" vehicle routing problem"> vehicle routing problem</a> </p> <a href="https://publications.waset.org/abstracts/71436/an-application-of-integrated-multi-objective-particles-swarm-optimization-and-genetic-algorithm-metaheuristic-through-fuzzy-logic-for-optimization-of-vehicle-routing-problems-in-sugar-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71436.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">394</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">11229</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">11228</span> A Robust Optimization Model for the Single-Depot Capacitated Location-Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdolsalam%20Ghaderi">Abdolsalam Ghaderi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve the customers when the parameters may change under different circumstances. This problem has many applications, especially in the area of supply chain management and distribution systems. To get closer to real-world situations, travel time of vehicles, the fixed cost of vehicles usage and customers’ demand are considered as a source of uncertainty. A combined approach including robust optimization and stochastic programming was presented to deal with the uncertainty in the problem at hand. For this purpose, a mixed integer programming model is developed and a heuristic algorithm based on Variable Neighborhood Search(VNS) is presented to solve the model. Finally, the computational results are presented and future research directions are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=location-routing%20problem" title="location-routing problem">location-routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20optimization" title=" robust optimization"> robust optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20neighborhood%20search" title=" variable neighborhood search"> variable neighborhood search</a> </p> <a href="https://publications.waset.org/abstracts/83797/a-robust-optimization-model-for-the-single-depot-capacitated-location-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83797.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">269</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">11227</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">11226</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">11225</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">11224</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">11223</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">11222</span> Route Planning for Optimization Approach PSO_GA Sharing System (Scooter Sharing-Public Transportation) with Hybrid Optimization Approach PSO_GA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Ali%20Farrokhpour">Mohammad Ali Farrokhpour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the current decade and sustainable transportation systems, scooter sharing has attracted widespread attention as an environmentally-friendly means of public transportation which can help develop public transportation. The combination of scooters and subway in the area of sustainable transportation systems can provide a great many opportunities for developing access to public transportation. Of the challenges which have arisen and initiated discussions of interest about the implementation of a scooter-subway system to replace personal vehicles is the issue of routing in the aforementioned system. This has been chosen as the main subject of the present paper. Thus, the present paper provides an account for routing in this system. Because the issue of routing includes multiple factors such as time, costs, traffic, green spaces, etc., the above-mentioned problem is considered to be a multi-objective NP-hard optimization problem. For this purpose, the hybrid optimization approach of PSO-GA has been put forward in the present paper for the provided answers to be of higher accuracy and validity than those of normal optimization methods. The results obtained from modeling and problem solving for the case study in the MATLAB software are indicative of the efficiency and desirability of the model and the proposed approach for solving the model <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=route%20planning" title="route planning">route planning</a>, <a href="https://publications.waset.org/abstracts/search?q=scooter%20sharing" title=" scooter sharing"> scooter sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=public%20transportation" title=" public transportation"> public transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=sharing%20system" title=" sharing system"> sharing system</a> </p> <a href="https://publications.waset.org/abstracts/140393/route-planning-for-optimization-approach-pso-ga-sharing-system-scooter-sharing-public-transportation-with-hybrid-optimization-approach-pso-ga" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/140393.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">84</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">11221</span> A Survey on Various Technique of Modified TORA over MANET</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shreyansh%20Adesara">Shreyansh Adesara</a>, <a href="https://publications.waset.org/abstracts/search?q=Sneha%20Pandiya"> Sneha Pandiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The mobile ad-hoc network (MANET) is an important and open area research for the examination and determination of the performance evolution. Temporary ordered routing algorithm (TORA) is adaptable and distributed MANET routing algorithm which is totally dependent on internet MANET Encapsulation protocol (IMEP) for the detection of the link and sensing of the link. If IMEP detect the wrong link failure then the network suffer from congestion and unnecessary route maintenance. Thus, the improvement in link detection method of TORA is introduced by various methods on IMEP by different perspective from different person. There are also different reactive routing protocols like AODV, TORA and DSR has been compared for the knowledge of the routing scenario for different parameter and using different model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=IMEP" title="IMEP">IMEP</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20ad-hoc%20network" title=" mobile ad-hoc network"> mobile ad-hoc network</a>, <a href="https://publications.waset.org/abstracts/search?q=protocol" title=" protocol"> protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=TORA" title=" TORA"> TORA</a> </p> <a href="https://publications.waset.org/abstracts/44072/a-survey-on-various-technique-of-modified-tora-over-manet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44072.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">441</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">11220</span> Discrete Swarm with Passive Congregation for Cost Minimization of the Multiple Vehicle Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tarek%20Aboueldahab">Tarek Aboueldahab</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanan%20Farag"> Hanan Farag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cost minimization of Multiple Vehicle Routing Problem becomes a critical issue in the field of transportation because it is NP-hard optimization problem and the search space is complex. Many researches use the hybridization of artificial intelligence (AI) models to solve this problem; however, it can not guarantee to reach the best solution due to the difficulty of searching the whole search space. To overcome this problem, we introduce the hybrid model of Discrete Particle Swarm Optimization (DPSO) with a passive congregation which enable searching the whole search space to compromise between both local and global search. The practical experiment shows that our model obviously outperforms other hybrid models in cost minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cost%20minimization" title="cost minimization">cost minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-vehicle%20routing%20problem" title=" multi-vehicle routing problem"> multi-vehicle routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20congregation" title=" passive congregation"> passive congregation</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20swarm" title=" discrete swarm"> discrete swarm</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20congregation" title=" passive congregation"> passive congregation</a> </p> <a href="https://publications.waset.org/abstracts/157025/discrete-swarm-with-passive-congregation-for-cost-minimization-of-the-multiple-vehicle-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157025.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">98</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">11219</span> Estimation of Optimum Parameters of Non-Linear Muskingum Model of Routing Using Imperialist Competition Algorithm (ICA)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Davood%20Rajabi">Davood Rajabi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mojgan%20Yazdani"> Mojgan Yazdani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Non-linear Muskingum model is an efficient method for flood routing, however, the efficiency of this method is influenced by three applied parameters. Therefore, efficiency assessment of Imperialist Competition Algorithm (ICA) to evaluate optimum parameters of non-linear Muskingum model was addressed through this study. In addition to ICA, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) were also used aiming at an available criterion to verdict ICA. In this regard, ICA was applied for Wilson flood routing; then, routing of two flood events of DoAab Samsami River was investigated. In case of Wilson flood that the target function was considered as the sum of squared deviation (SSQ) of observed and calculated discharges. Routing two other floods, in addition to SSQ, another target function was also considered as the sum of absolute deviations of observed and calculated discharge. For the first floodwater based on SSQ, GA indicated the best performance, however, ICA was on first place, based on SAD. For the second floodwater, based on both target functions, ICA indicated a better operation. According to the obtained results, it can be said that ICA could be used as an appropriate method to evaluate the parameters of Muskingum non-linear model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Doab%20Samsami%20river" title="Doab Samsami river">Doab Samsami river</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=imperialist%20competition%20algorithm" title=" imperialist competition algorithm"> imperialist competition algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-exploratory%20algorithms" title=" meta-exploratory algorithms"> meta-exploratory algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Wilson%20flood" title=" Wilson flood"> Wilson flood</a> </p> <a href="https://publications.waset.org/abstracts/36518/estimation-of-optimum-parameters-of-non-linear-muskingum-model-of-routing-using-imperialist-competition-algorithm-ica" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36518.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">504</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">11218</span> Bi-Criteria Vehicle Routing Problem for Possibility Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bezhan%20Ghvaberidze">Bezhan Ghvaberidze</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A multiple criteria optimization approach for the solution of the Fuzzy Vehicle Routing Problem (FVRP) is proposed. For the possibility environment the levels of movements between customers are calculated by the constructed simulation interactive algorithm. The first criterion of the bi-criteria optimization problem - minimization of the expectation of total fuzzy travel time on closed routes is constructed for the FVRP. A new, second criterion – maximization of feasibility of movement on the closed routes is constructed by the Choquet finite averaging operator. The FVRP is reduced to the bi-criteria partitioning problem for the so called “promising” routes which were selected from the all admissible closed routes. The convenient selection of the “promising” routes allows us to solve the reduced problem in the real-time computing. For the numerical solution of the bi-criteria partitioning problem the -constraint approach is used. An exact algorithm is implemented based on D. Knuth’s Dancing Links technique and the algorithm DLX. The Main objective was to present the new approach for FVRP, when there are some difficulties while moving on the roads. This approach is called FVRP for extreme conditions (FVRP-EC) on the roads. Also, the aim of this paper was to construct the solving model of the constructed FVRP. Results are illustrated on the numerical example where all Pareto-optimal solutions are found. Also, an approach for more complex model FVRP with time windows was developed. A numerical example is presented in which optimal routes are constructed for extreme conditions on the roads. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization" title="combinatorial optimization">combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Fuzzy%20Vehicle%20routing%20problem" title=" Fuzzy Vehicle routing problem"> Fuzzy Vehicle routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20objective%20programming" title=" multiple objective programming"> multiple objective programming</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/59577/bi-criteria-vehicle-routing-problem-for-possibility-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59577.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">485</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">11217</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">342</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">11216</span> Parallel Random Number Generation for the Modern Supercomputer Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Roman%20Snytsar">Roman Snytsar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pseudo-random numbers are often used in scientific computing such as the Monte Carlo Simulations or the Quantum Inspired Optimization. Requirements for a parallel random number generator running in the modern multi-core vector environment are more stringent than those for sequential random number generators. As well as passing the usual quality tests, the output of the parallel random number generator must be verifiable and reproducible throughout the concurrent execution. We propose a family of vectorized Permuted Congruential Generators. Implementations are available for multiple modern vector modern computer architectures. Besides demonstrating good single core performance, the generators scale easily across many processor cores and multiple distributed nodes. We provide performance and parallel speedup analysis and comparisons between the implementations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pseudo-random%20numbers" title="pseudo-random numbers">pseudo-random numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20optimization" title=" quantum optimization"> quantum optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMD" title=" SIMD"> SIMD</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/152951/parallel-random-number-generation-for-the-modern-supercomputer-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152951.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">120</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">11215</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> <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=random%20routing%20optimization%20technique&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&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=random%20routing%20optimization%20technique&page=374">374</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&page=375">375</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20routing%20optimization%20technique&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>