Sciweavers

1687 search results - page 5 / 338
» On the complexity of scheduling in wireless networks
Sort
View
SUTC
2010
IEEE
15 years 1 months ago
Pushing the Throughput Limit of Low-Complexity Wireless Embedded Sensing Systems
—To maximize the communication throughput for wireless sensing systems, designers have attempted various combinations of protocol design and manual code optimization. Although th...
Vahid Salmani, Pai H. Chou
CORR
2007
Springer
111views Education» more  CORR 2007»
14 years 9 months ago
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
N. Praneeth Kumar, Ashutosh Deepak Gore, Abhay Kar...
INFOCOM
2007
IEEE
15 years 3 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
INFOCOM
2007
IEEE
15 years 3 months ago
Low-Complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
Longbi Lin, Xiaojun Lin, Ness B. Shroff
ICC
2007
IEEE
143views Communications» more  ICC 2007»
15 years 3 months ago
A Stochastic Framework for Scheduling in Wireless Packet Access Networks
— We put forth a unified framework for downlink and uplink scheduling of multiple connections with diverse qualityof-service requirements, where each connection transmits using ...
Xin Wang, Georgios B. Giannakis