Results 51 to 60 of about 855,248 (321)
Internet routing paths stability model and relation to forwarding paths [PDF]
Analysis of real datasets to characterize the local stability properties of the Internet routing paths suggests that extending the route selection criteria to account for such property would not increase the routing path length.
Careglio, Davide+3 more
core +2 more sources
MAP: Medial Axis Based Geometric Routing in Sensor Networks [PDF]
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication.
Bruck, Jehoshua+2 more
core +1 more source
Aβ42 promotes the aggregation of α‐synuclein splice isoforms via heterogeneous nucleation
The aggregation of amyloid‐β (Aβ) and α‐synuclein (αSyn) is associated with Alzheimer's and Parkinson's diseases. This study reveals that Aβ aggregates serve as potent nucleation sites for the aggregation of αSyn and its splice isoforms, shedding light on the intricate interplay between these two pathogenic proteins.
Alexander Röntgen+2 more
wiley +1 more source
DCPVP: Distributed Clustering Protocol Using Voting and Priority for Wireless Sensor Networks
This paper presents a new clustering protocol for designing energy-efficient hierarchical wireless sensor networks (WSNs) by dividing the distributed sensor network into virtual sensor groups to satisfy the scalability and prolong the network lifetime in
Hooman Hematkhah, Yousef S. Kavian
doaj +1 more source
Experimentation Environments for Data Center Routing Protocols: A Comprehensive Review
The Internet architecture has been undergoing a significant refactoring, where the past preeminence of transit providers has been replaced by content providers, which have a ubiquitous presence throughout the world, seeking to improve the user experience,
Leonardo Alberro+2 more
doaj +1 more source
Congestion-gradient driven transport on complex networks
We present a study of transport on complex networks with routing based on local information. Particles hop from one node of the network to another according to a set of routing rules with different degrees of congestion awareness, ranging from random ...
Bassler, Kevin E.+5 more
core +1 more source
Probabilistic Routing Protocol for Intermittently Connected Networks [PDF]
This document is a product of the Delay Tolerant Networking Research Group and has been reviewed by that group. No objections to its publication as an RFC were raised.
Davies, Elwyn+3 more
core +2 more sources
In this work, we reveal how different enzyme binding configurations influence the fluorescence decay of NAD(P)H in live cells using time‐resolved anisotropy imaging and fluorescence lifetime imaging microscopy (FLIM). Mathematical modelling shows that the redox states of the NAD and NADP pools govern these configurations, shaping their fluorescence ...
Thomas S. Blacker+8 more
wiley +1 more source
We propose a method for task allocation to multiple physical agents that works when tasks have temporal and spatial constraints and agents have different capacities. Assuming that the problem is over-constrained, we need to find allocations that maximize
Mitiche Hakim+2 more
doaj +1 more source
An Agenda-Based Routing Protocol in Delay Tolerant Mobile Sensor Networks
Routing in delay tolerant mobile sensor networks (DTMSNs) is challenging due to the networks’ intermittent connectivity. Most existing routing protocols for DTMSNs use simplistic random mobility models for algorithm design and performance evaluation.
Hai-Gang Gong+3 more
doaj +1 more source