Results 21 to 30 of about 37,081 (313)

Dynamic Routing Method over Hybrid SDN for Flying Ad Hoc Networks

open access: yesمجلة بغداد للعلوم, 2018
Due to the high mobility and dynamic topology of the FANET network, maintaining communication links between UAVs is a challenging task. The topology of these networks is more dynamic than traditional mobile networks, which raises challenges for the ...
Baghdad Science Journal
doaj   +1 more source

Capsule Networks With Word-Attention Dynamic Routing for Cultural Relics Relation Extraction

open access: yesIEEE Access, 2020
Online museums and online cultural relic information provide abundant data for relation extraction research. However, in the relation extraction task of modelling space information, spatially insensitive methods of convolutional neural networks and long ...
Min Zhang, Guohua Geng
doaj   +1 more source

CARM: congestion adaptive routing method for on chip networks [PDF]

open access: yes, 2014
Network-on-Chip (NoC) has emerged as a long-term and efficient on-chip communication solution for MC-SoC and CMP micro-architectures to overcome bottleneck of traditional bus-based interconnects.
Laxmi, V.   +9 more
core   +1 more source

A Rolling Bearing Fault Diagnosis Method Based on Enhanced Integrated Filter Network

open access: yesMachines, 2022
Aiming at the difficulty of rolling bearing fault diagnosis in a strong noise environment, this paper proposes an enhanced integrated filter network. In the method, we firstly design an enhanced integrated filter, which includes the filter enhancement ...
Kang Wu   +4 more
doaj   +1 more source

Dynamic Highway-Node Routing [PDF]

open access: yes, 2007
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in present-day navigation systems: When an edge weight changes (e.g., due to a traffic jam), we can update the preprocessed information in 2-40ms allowing subsequent fast queries in ...
Schultes, D., Sanders, P.
openaire   +1 more source

Routing in a highly dynamic topology [PDF]

open access: yes2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005., 2005
Routing in mobile ad-hoc networks is hard because the topology can change very rapidly. By the time new paths are discovered, the network can change again - and in extreme cases, packets circulate endlessly and the system is unstable. Most attempts to solve this problem have required that the topology changes slowly. In this paper, we propose a routing
Yashar Ganjali, Nick McKeown
openaire   +1 more source

A Design of a Time Synchronization Protocol Based on Dynamic Route and Forwarding Certification

open access: yesSensors, 2020
Time synchronization is a key technique in large-scale wireless sensor network applications. In order to tackle the problems of multi-hop synchronization error accumulation, clock frequency skew swinging, and network topology changes, a time ...
Dejing Zhang, Yuan Yuan, Yanqing Bi
doaj   +1 more source

Maintenance efficient routing in wireless sensor networks [PDF]

open access: yes, 2005
Communication patterns define the energy depletion profile of a wireless sensor network. In particular, routing defines which areas of the sensor field are subject to a higher traffic load. In these areas, sensor nodes deplete faster than in areas with a
C. Sreenan   +5 more
core   +1 more source

Equilibria in Dynamic Selfish Routing [PDF]

open access: yes, 2009
In both transportation and communication networks we are faced with "selfish flows", where every agent sending flow over the network desires to get it to its destination as soon as possible. Such flows have been well studied in time-invariant networks in the last few years.
Elliot Anshelevich, Satish V. Ukkusuri
openaire   +1 more source

Location-Routing: Issues, Models and Methods [PDF]

open access: yes, 2006
This paper is a survey of location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects. We propose a classification scheme and look at a number of problem variants. Both exact and heuristic algorithms
Gábor Nagy   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy