— The seminar work of Gupta and Kumar [1] showed that multi-hop wireless networks with capacity scalable with the number of nodes, n, are achievable in theory. The transport capa...
Conventional routing algorithms in mobile ad hoc networks (MANETs), i.e., multi-hop forwarding, assume the existence of contemporaneous source-destination paths and are not scalabl...
: Traditional ad hoc routing protocols do not work in intermittently connected networks since end-to-end paths may not exist in such networks. Hence, routing mechanisms that can wi...
Many distributed multimedia applications have the ability to adapt to uctuations in the network conditions. By adjusting temporal and spatial quality to available bandwidth, or man...
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...