26 search results - page 2 / 6 » Random access over multiple access channels: A queuing persp... |
INFOCOM
1989
IEEE
13 years 9 months ago
1989
IEEE
Consider M - HChoose P - T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method f...
GLOBECOM
2008
IEEE
13 years 12 months ago
2008
IEEE
— 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...
INFOCOM
2008
IEEE
13 years 12 months ago
2008
IEEE
—We consider a time-slotted multipacket reception channel, shared by a finite number of mobile users who transmit to a common base station. Each user is allocated a fixed data ...
VTC
2007
IEEE
13 years 11 months ago
2007
IEEE
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
GLOBECOM
2008
IEEE
13 years 12 months ago
2008
IEEE
Abstract—In multi-user multiple-input multiple-output (MUMIMO) systems, channel state information at the transmitter (CSIT) allows for multi-user spatial multiplexing and thus in...