Konstantinos P. Tsoukatos

Learn More
— We consider a CDMA wireless ad–hoc network in the high SINR regime. We introduce a suite of cross–layer algorithms for joint flow control, routing, scheduling and power control. The algorithms guarantee forwarding of all incoming traffic, with an energy expenditure that can get arbitrarily close to the minimum possible. When traffic arrival rates lie(More)
— We introduce cross–layer, distributed power control algorithms that guarantee maximum possible data throughput in multihop CDMA wireless networks. Throughput maximization, for given power budget, is achieved by jointly performing dynamic routing and scheduling together with power control. The cross–layer interaction consists in differential queue length(More)
We consider a model of a multipath routing system, where arriving customers are routed to a set of identical, parallel, single server queues, according to balancing policies operating without state information. After completion of service, customers are required to leave the system in their order of arrival, thus incurring an additional rese-quencing delay.(More)
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 per data transmission. A variant of the algorithm employing the exponential scheduling rule steers queue length ratios to desired targets.
We consider backlog-driven power control and antenna beamforming as a means to maximize network throughput in a wireless uplink, where a base station receives with an antenna array from single-antenna wireless users. Throughput maximization gives rise to an optimization problem which is in general non-concave. We introduce a cross-layer, alternating(More)