Results 21 to 30 of about 80,592 (300)
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
KFOA: K-mean Clustering, Firefly Based Data Rate Optimization and ACO Routing for Congestion Control in WSN [PDF]
Wireless sensor network (WSN) is assortment of sensor nodes proficient in environmental information sensing, refining it and transmitting it to base station in sovereign manner.
Savita Sandeep Jadhav, Sangeeta Jadhav
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
Inwoo Jeon, Hyunwoo Nam, Chulmin Jun
openaire +2 more sources
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
Evaluation of available bandwidth as a routing metric for delay-sensitive IEEE 802.15.4-based ad-hoc networks [PDF]
In this paper, we evaluate available bandwidth as a routing metric for IEEE 802.15.4-based ad-hoc networks. The available bandwidth on a data forwarding path is an approximation of the forwarding path’s residual data relaying capacity.
Brown, Kenneth N. +3 more
core +1 more source
Ranking paths in stochastic time-dependent networks [PDF]
In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a "time-adaptive strategy" that assigns successors to
Kim Allan Andersen +2 more
core +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
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

