Results 11 to 20 of about 47,653 (229)

Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity [PDF]

open access: yesIEEE Access, 2016
Industrial wireless sensor networks (IWSNs) are required to provide highly reliable and real-time transmission. Moreover, for connected K-neighborhood (CKN) sleep scheduling-based duty-cycled IWSNs in which the network lifetime of IWSNs can be prolonged,
Lei Shu   +4 more
doaj   +2 more sources

Dynamic Routing and Spectrum Assignment Based on the Consecutive Sub-Channels in Flexible-Grid Optical Networks

open access: yesIEEE Access, 2022
Variable bandwidth channels can be created in Flexible Grid Optical Networks using Optical Orthogonal Frequency Division Multiplexing (O-OFDM). This allows more efficient spectrum use by allocating integral multiple of basic bandwidth slots (sub-channels)
Varsha Lohani   +2 more
doaj   +1 more source

A schedule-based Public Transit Routing Algorithm for Finding K-shortest Paths Considering Transfer Penalties

open access: closedThe Journal of The Korea Institute of Intelligent Transport Systems, 2018
Inwoo Jeon, Hyunwoo Nam, Chulmin Jun
openalex   +3 more sources

Location‐based data delivery between vehicles and infrastructure

open access: yesIET Intelligent Transport Systems, 2020
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

KFOA: K-mean Clustering, Firefly Based Data Rate Optimization and ACO Routing for Congestion Control in WSN [PDF]

open access: yesInternational 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

open access: yesInformation, 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

Research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet

open access: yesScientific 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

Space Efficient Edge-Fault Tolerant Routing [PDF]

open access: yes, 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

Hybrid Optimized Approaches for Routing and Resource Reservation Protocols in Optical Networks

open access: yesIEEE 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

Evaluation of available bandwidth as a routing metric for delay-sensitive IEEE 802.15.4-based ad-hoc networks [PDF]

open access: yes, 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

Home - About - Disclaimer - Privacy