Sciweavers

114 search results - page 6 / 23
» Random access transport capacity
Sort
View
CISS
2008
IEEE
13 years 9 months ago
Cross-layer multicommodity capacity expansion on ad hoc wireless networks of cognitive radios
Cognitive radios permit dynamic control of physical layer resources such as transmission power and constellation size; these degrees of freedom can be employed to achieve significa...
Alex Fridman, Steven Weber, Kapil R. Dandekar, Mos...
MOBIHOC
2007
ACM
14 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
INFOCOM
2003
IEEE
14 years 27 days ago
MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho...
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 7 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir
GLOBECOM
2008
IEEE
14 years 2 months ago
A New Upper Bound for a Binary Additive Noisy Multiple Access Channel with Feedback
— We use the idea of dependence balance [1] to obtain the first improvement over the cut-set bound for the discrete memoryless multiple access channel with noiseless feedback (M...
Ravi Tandon, Sennur Ulukus