Αναζήτηση
Αποτελέσματα 1-4 από 4
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
(2005)
We present a framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility conditions, multi-hop sessions are dynamically offered allocations, ...
Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks
(2004)
We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes. The primary objective is to derive a distributed ...
On optimal cooperative route caching in large, memory-limited wireless ad hoc networks
(2004)
Caching is a popular mechanism for enhancing performance in various layers and applications of computer networking. We introduce both a model and algorithms for caching routing information in large, memory-limited wireless ...
Optimization driven multi-hop network design and experimentation: The approach of the FP7 project OPNEX
(2012)
The OPNEX project exemplifies system and optimization theory as the foundations for algorithms that provably maximize capacity of wireless networks. The algorithms termed in abstract network models have been converted to ...