Sciweavers

1687 search results - page 252 / 338
» On the complexity of scheduling in wireless networks
Sort
View
IMC
2004
ACM
15 years 11 months ago
Bandwidth estimation in broadband access networks
There has been much work on developing techniques for estimating the capacity and the available bandwidth of network paths based on end-point measurements. The focus has primarily...
Karthik Lakshminarayanan, Venkata N. Padmanabhan, ...
INFOCOM
2010
IEEE
15 years 4 months ago
Back-Pressure Routing for Intermittently Connected Networks
—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among di...
Jung Ryu, Lei Ying, Sanjay Shakkottai
ISCC
2003
IEEE
15 years 11 months ago
Throughput Achievable with No Relaying in a Mobile Interference Network
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
Elif Uysal-Biyikoglu, Abtin Keshavarzian
QSHINE
2005
IEEE
15 years 12 months ago
Retransmission Strategies for Wireless Connections with Resource-Limited Devices
Protocols designed to provide error-free communications over lossy links, at both data link and transport layers, commonly employ the idea of sliding windows, which is based on th...
Lavy Libman
FTNET
2007
107views more  FTNET 2007»
15 years 6 months ago
Network Optimization and Control
We study how protocol design for various functionalities within a communication network architecture can be viewed as a distributed resource allocation problem. This involves unde...
Srinivas Shakkottai, R. Srikant