Results 51 to 60 of about 407,365 (309)

Routing in Wireless Mesh Networks: Two Soft Computing Based Approaches [PDF]

open access: yesInternational Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.3, June 2013, 2013
Due to dynamic network conditions, routing is the most critical part in WMNs and needs to be optimised. The routing strategies developed for WMNs must be efficient to make it an operationally self configurable network. Thus we need to resort to near shortest path evaluation.
arxiv   +1 more source

Fundamental schemes to determine disjoint paths for multiple failure scenarios [PDF]

open access: yes, 2020
Disjoint path routing approaches can be used to cope with multiple failure cenarios. This can be achieved using a set of k (k>2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks).
Babarczi, Péter   +5 more
core   +1 more source

A systematic review of electron FLASH dosimetry and beam control mechanisms utilized with modified non‐clinical LINACs

open access: yesJournal of Applied Clinical Medical Physics, EarlyView.
Abstract Background FLASH has been shown to spare normal tissue toxicity while maintaining tumor control. However, existing irradiation platforms and dosimetry are not compatible. Consequently, an abundance of FLASH delivery devices and new dosimetry across all modalities has been created.
Justin DeFrancisco, Siyong Kim
wiley   +1 more source

Secure Routing Path Using Trust Values for Wireless Sensor Networks [PDF]

open access: yeshttp://airccse.org/journal/ijcis/current2014.html, 2014
Traditional cryptography-based security mechanisms such as authentication and authorization are not effective against insider attacks like wormhole, sinkhole, selective forwarding attacks, etc., Trust based approaches have been widely used to counter insider attacks in wireless sensor networks.
arxiv   +1 more source

Bridging Nature and Technology: A Perspective on Role of Machine Learning in Bioinspired Ceramics

open access: yesAdvanced Engineering Materials, EarlyView.
Machine learning (ML) is revolutionizing the development of bioinspired ceramics. This article investigates how ML can be used to design new ceramic materials with exceptional performance, inspired by the structures found in nature. The research highlights how ML can predict material properties, optimize designs, and create advanced models to unlock a ...
Hamidreza Yazdani Sarvestani   +2 more
wiley   +1 more source

K connectivity algorithm based on flow network in wireless sensor networks

open access: yes物联网学报, 2019
Wireless sensor networks(WSN) connectivity is an important way to ensure network fault tolerance.Conventional multi-routing algorithms often have common paths,which will lead to premature connectivity failure of the whole WSN due to node damage ...
Jie HU, Jie ZHAN, Baoquan REN
doaj   +2 more sources

An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar [PDF]

open access: yes, 2016
DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before
Erickson, A.   +3 more
core   +4 more sources

A Workflow‐Centric Approach to Generating FAIR Data Objects for Computationally Generated Microstructure‐Sensitive Mechanical Data

open access: yesAdvanced Engineering Materials, EarlyView.
A novel metadata schema is introduced to address the sparsity of microstructure‐sensitive mechanical data. The design follows the material modeling workflow, as each run results in the definition of unique data objects. The schema includes categorical elements to ensure findability, accessibility, interoperability, and reusability (FAIR). This approach
Ronak Shoghi, Alexander Hartmaier
wiley   +1 more source

Disjoint Shortest Paths with Congestion on DAGs [PDF]

open access: yesarXiv, 2020
In the k-Disjoint Shortest Paths problem, a set of terminal pairs of vertices $\{(s_i,t_i)\mid 1\le i\le k\}$ is given and we are asked to find paths $P_1,\ldots,P_k$ such that each path $P_i$ is a shortest path from $s_i$ to $t_i$ and every vertex of the graph routes at most one of them.
arxiv  

Home - About - Disclaimer - Privacy