Results 31 to 40 of about 407,365 (309)
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
Applied Sciences, 2023 Urban traffic congestion is a pressing issue, demanding effective and cost-efficient solutions. This paper develops the Traffic Weighted Multi-Maps (TWM) method to solve the Traffic Assignment Problem in Intelligent Transportation Systems (ITS).
Alvaro Paricio-Garcia +1 more
doaj +1 more source
Ranking paths in stochastic time-dependent networks [PDF]
, 2014 In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a "time-adaptive strategy" that assigns successors to
Kim Allan Andersen +2 more
core +1 more source
International Journal of Interactive Multimedia and Artificial Intelligence, 2020 The concept of Internet of Things (IoT) was proposed by Professor Kevin Ashton of the Massachusetts Institute of Technology (MIT) in 1999. IoT is an environment that people understand in many different ways depending on their requirement, point of view ...
Sumit Kumar +4 more
doaj +1 more source
Polynomial Time $k$-Shortest Multi-Criteria Prioritized and All-Criteria-Disjoint Paths [PDF]
arXiv, 2021 The shortest secure path (routing) problem in communication networks has to deal with multiple attack layers e.g., man-in-the-middle, eavesdropping, packet injection, packet insertion, etc. Consider different probabilities for each such attack over an edge, probabilities that can differ across edges.
arxiv
IEEE Access, 2021 Deploying flying ferries in large-scaled wireless sensor networks can prevent data gathering and distribution from physical communication restrictions on the ground.
Chih-Lin Hu +3 more
doaj +1 more source
An efficient shortest path routing algorithm in the data centre network DPillar. [PDF]
, 2015 DPillar has recently been proposed as a server-centric data centre network and is combinatorially related to the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving a symmetry
A Greenberg +9 more
core +4 more sources
Brown-Field Migration Aware Routing and Spectrum Assignment in Backbone Optical Networks
Applied Sciences, 2022 With the development of optical networks technology, broad attention has been paid to flexible grid technology in optical networks due to its ability to carry large-capacity information as well as provide flexible and fine-grained services through on ...
Xiaosong Yu +7 more
doaj +1 more source
Collaborative Approach for Improving the Scheduling and Providing Advanced Security in Wireless Sensor Network [PDF]
, 2017 Recent advances in Wireless Sensor Networks (WSN) have focused towards Geographic forwarding mechanism. It is a promising routing scheme in wireless sensor networks, in which the forwarding decision is determined purely based on the location of each node.
, Ms. Sonu Mohadikar, Prof. M.M Baig
core +2 more sources
Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths [PDF]
arXiv, 2023 The restoration lemma is a classic result by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [PODC '01], which relates the structure of shortest paths in a graph $G$ before and after some edges in the graph fail. Their work shows that, after one edge failure, any replacement shortest path avoiding this failing edge can be partitioned into two pre ...
arxiv