Αναζήτηση
Αποτελέσματα 1-10 από 13
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, ...
Low-complexity beamforming techniques for IEEE 802.11n WLANs
(2009)
The impetus of the present study is to describe a downlink beamforming method that increase spectrum efficiency and significantly reduces implementation complexity and power consumption compare to beamforming technique at ...
Cross-layer power control in wireless networks
(2006)
We introduce a power control algorithm that exploits queue length information to achieve maximum data throughput in single-hop CDMA wireless networks. The algorithm operates in real-time, i.e., executes a single iteration ...
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
(2003)
Sharing the locally common spectrum among the links of the same vicinity is a fundamental problem in wire-less ad-hoc networks. Lately some scheduling approaches have been proposed that guarantee fair share of the bandwidth ...
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 ...
Layered multicast rate control based on lagrangian relaxation and dynamic programming
(2004)
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based on a combination of lagrangian relaxation ...
Joint multiuser downlink beamforming and admission control: A semidefinite relaxation approach
(2007)
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network operator's perspective (e.g., UMTS, 802.16e). ...
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 ...