Results 11 to 20 of about 50,964 (251)
KFOA: K-mean Clustering, Firefly Based Data Rate Optimization and ACO Routing for Congestion Control in WSN [PDF]
International Journal of Electronics and Telecommunications, 2022 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
Shortest Path Algorithms for Pedestrian Navigation Systems
Information, 2022 Efficient shortest path algorithms are of key importance for routing and navigation systems. However, these applications are designed focusing on the requirements of motor vehicles, and therefore, finding paths in pedestrian sections of urban areas is ...
Kyriakos Koritsoglou +3 more
doaj +1 more source
Scientific Reports, 2021 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
Shortest path routing algorithm for hierarchical interconnection network-on-chip [PDF]
, 2015 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
Hybrid Optimized Approaches for Routing and Resource Reservation Protocols in Optical Networks
IEEE Photonics Journal, 2021 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
Space Efficient Edge-Fault Tolerant Routing [PDF]
, 2012 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
Photonics, 2023 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
Evaluation of available bandwidth as a routing metric for delay-sensitive IEEE 802.15.4-based ad-hoc networks [PDF]
, 2016 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
Dynamic adaptive spectrum allocation in flexible grid optical network with multi‐path routing
IET Communications, 2021 Fragmentation is one of the major issues in elastic optical network (EON) due to its dynamic characteristics which may possibly degrade the spectrum efficiency.
Ujjwal Ujjwal +2 more
doaj +1 more source
Application of Traffic Weighted Multi-Map Optimization Strategies to Traffic Assignment
IEEE Access, 2021 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