Results 21 to 30 of about 407,365 (309)
Location‐based data delivery between vehicles and infrastructure
Multi‐hop routing in vehicular ad‐hoc networks (VANETs) and wireless sensor networks has attracted significant interest of researchers in the wireless ad‐hoc networks community.
Farhan Khan, Sing Kiong Nguang
doaj +1 more source
Path Planning Algorithm for the Multiple Depot Vehicle Routing Problem Based on Parallel Clustering
It is necessary to study the problem of vehicle routing in multidistribution centers to improve the speed, time, and cost thereof. It is preferable to use as few vehicles as possible to complete the delivery of goods and minimize the total mileage.
Xue Han
semanticscholar +1 more source
OPC UA PubSub Over TSN is the core of the Industrial Internet and guarantees flexible interaction features for multiple parties in real-time for industrial communication.
Yan Song+4 more
doaj +1 more source
Hybrid Optimized Approaches for Routing and Resource Reservation Protocols in Optical Networks
We have proposed hybrid approaches to solve dynamic provisioning problems in fixed-grid and elastic optical networks (EON). The proposed approaches use the information from the optimization models, which normally are used to solve static problems, to ...
Akhtar Nawaz Khan+5 more
doaj +1 more source
Shortest path routing algorithm for hierarchical interconnection network-on-chip [PDF]
Interconnection networks play a significant role in efficient on-chip communication for multicore systems. This paper introduces a new interconnection topology called the Hierarchical Cross Connected Recursive network (HCCR) and a shortest path routing ...
Al Khanjari, Sharifa+2 more
core +1 more source
Filterless optical networks (FONs) have become a cost-effective solution for optical network deployment due to their low-cost characteristics. However, eliminating active switching elements causes signals to propagate over unintended links, wasting ...
Junling Yuan+5 more
doaj +1 more source
Space Efficient Edge-Fault Tolerant Routing [PDF]
Let G be an undirected weighted graph with n vertices and m edges, and k >= 1 be an integer. We preprocess the graph in O^~(mn) time, constructing a data structure of size O^~ k deg{v}+n^{1/k}) words per vertex v in V, which is then used by our routing ...
Rajan, Varun
core +1 more source
Application of Traffic Weighted Multi-Map Optimization Strategies to Traffic Assignment
Traffic Assignment Problem (TAP) is a critical issue for transportation and mobility models that deals mainly with the calculus and delivery of best-cost routes for the trips in a traffic network.
Alvaro Paricio, Miguel A. Lopez-Carmona
doaj +1 more source
Investigation of dynamic routing and spectrum allocation methods in elastic optical networks [PDF]
The introduction of flexible frequency grids and advanced modulation techniques to optical transmission, namely an elastic optical network, requires new routing and spectrum allocation techniques.
Biernacka, Edyta+2 more
core +2 more sources
Fuzzy Clustering with Multi-Constraint QoS Service Routing in Wireless Sensor Networks
This paper presents a fuzzy logic-based, service differentiated, QoS aware routing protocol (FMSR) offering multipath routing for WSNs, with the purpose of providing a service differentiated path meant for communication between nodes, based on actual ...
Jayashree V. Agarkhed+2 more
doaj +1 more source