Results 281 to 290 of about 37,081 (313)

Performance of route caching strategies in Dynamic Source Routing

Proceedings 21st International Conference on Distributed Computing Systems Workshops, 2002
On-demand routing protocols for mobile ad hoc networks utilize route caching in different forms in order to reduce the routing overheads as well as to improve the route discovery latency. For route caches to be effective, they need to adapt to frequent topology changes.
Mahesh K. Marina, Samir Ranjan Das
openaire   +1 more source

COVERAGE AND ROUTING IN DYNAMIC NETWORKS

2016
Dynamic networks have become ubiquitous in the current technological framework. Such networks have widespread applications in commercial, public safety and military domains. Systems utilizing these networks are deployed in scenarios influencing critical aspects of human lives, e.g.
openaire   +2 more sources

Hybrid Dynamic Route Planners

Proceedings of the 19th International Conference on Computer Systems and Technologies, 2018
In most European countries, websites are available with route planners and real time information about incidents and expected delay on the highways. These websites enable car drivers to plan their route from start to destination. On their way, they can use route planners on their smart phone or other devices.
openaire   +1 more source

A Basic Dynamic Routing Problem and Diffusion

IEEE Transactions on Communications, 1978
Diffusion theory has sometimes been successful in providing excellent approximate solutions to difficult queueing problems. Here we explore whether such methods can be used to analyze a basic dynamic routing strategy associated with a single idealized node in a data network. We analyze a dynamic routing policy where messages, or packets, that arrive at
Gerard J. Foschini, Jack Salz
openaire   +1 more source

Routing with dynamic cluster awareness in DTNs

2015 21st Asia-Pacific Conference on Communications (APCC), 2015
This paper proposes a cluster-based routing scheme for improving cost-effectiveness of message delivery in delay-tolerant networks. The proposed scheme is designed, as follows: (1) every node calculates the expected node density in network proximity; (2) every node perceives whether it stays in a cluster or not; (3) every node can ask for relay nodes ...
Chih-Lin Hu, Hung-Tsung Huang
openaire   +1 more source

Dynamic routing-and-inventory problems: a review

Transportation Research Part A: Policy and Practice, 1998
TRANSPORTATIONS ...
FAVARETTO, Daniela, BAITA F., PESENTI, Raffaele, UKOVICH W.   +3 more
openaire   +3 more sources

Trust-Based Route Selection in Dynamic Source Routing

2006
Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Nodes rely on each other to route packets to other mobile nodes or toward stationary nodes that may act as a gateway to a fixed network. Mobile nodes are generally assumed to participate as routers in the mobile wireless network.
Christian Damsgaard Jensen, Paul O'Connell   +1 more
openaire   +1 more source

Anticipation in Dynamic Vehicle Routing

2018
For many routing applications, decision making is conducted under incomplete information. The information is only revealed successively during the execution of the routing. In many cases, dispatchers adapt their decisions dynamically to new information.
openaire   +1 more source

Two Parallel Queues with Dynamic Routing

IEEE Transactions on Communications, 1986
We consider two parallel M/M/1 queueing systems where a new arrival (customer, job, message) joins the shorter of the two queues. Such problems arise naturally in computer communications and packet switched data networks. An asymptotic approach is developed to obtain approximations to the steady-state joint distribution of the number of customers in ...
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier   +3 more
openaire   +2 more sources

Dynamic Route Optimization and Automation of Industrial Routes at WM

INFORMS Journal on Applied Analytics
WM, the leading provider of environmental and sustainability solutions, faced significant challenges in optimizing its industrial waste collection routes following the coronavirus disease 2019 pandemic. Traditionally, these routes were planned manually, a process that was time consuming, labor intensive, and suboptimal with multiple factors that needed
Hemachandra Pillutla, Seongbae Kim, Chao Zhou, Heesu Hwang, Sergiy Savchenko, Stuart Greene, Marcel Dalby   +6 more
openaire   +1 more source