Αναζήτηση
Αποτελέσματα 1-5 από 5
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 ...
End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks
(2005)
Sharing the common spectrum among the links in a vicinity is a fundamental problem in wireless ad-hoc networks. Lately, some scheduling approaches have been proposed that guarantee fair share of bandwidth among the links. ...
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 ...
Lightweight cross-layer control algorithms for fairness and energy efficiency in CDMA Ad-Hoc networks
(2006)
We consider a CDMA wireless ad - hoc network in high SINR regime. We introduce a suite of cross - layer algorithms for joint flow control, routing, scheduling and power control. algorithms guarantee forwarding of all ...