Sciweavers

1687 search results - page 163 / 338
» On the complexity of scheduling in wireless networks
Sort
View
AICT
2005
IEEE
157views Communications» more  AICT 2005»
15 years 8 months ago
Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Automatic repeat request (ARQ) schemes are effective to recover non-real-time data corrupted by channel errors, but their use with real-time traffic is seldom considered because p...
Jose A. Afonso, Joaquim E. Neves
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 6 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
TWC
2008
87views more  TWC 2008»
15 years 6 months ago
A token-based scheduling scheme for WLANs supporting voice/data traffic and its performance analysis
Most of the existing medium access control (MAC) protocols for wireless local area networks (WLANs) provide prioritized access by adjusting the contention window sizes or interfram...
Ping Wang, Weihua Zhuang
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
16 years 14 days ago
How OEMs and suppliers can face the network integration challenges
Systems integration is a major challenge in many industries. Systematic analysis of the complex integration effects, especially with respect to timing and performance, significant...
Kai Richter, Rolf Ernst
INFOCOM
2002
IEEE
15 years 11 months ago
On the capacity of wireless networks: The relay case
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
Michael Gastpar, Martin Vetterli