Sciweavers

79 search results - page 3 / 16
» Throughput of random access without message passing
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
Optimal wireless networks based on local channel state information
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
Yichuan Hu, Alejandro Ribeiro
ITIIS
2010
138views more  ITIIS 2010»
13 years 3 months ago
Performance Analysis of Large CDMA Random Access Systems with Retransmission Diversity over Fading Channels
The random access systems, with retransmission diversity (RD) employment, over large random spreading code division multiple access (CDMA) channel subject to fading is investigate...
Kai Yu, Yi Sun, Pingzhi Fan, Xianfu Lei, Lei Shu
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 5 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
ICC
2007
IEEE
288views Communications» more  ICC 2007»
13 years 11 months ago
Joint Channel State Based Random Access and Adaptive Modulation in Wireless LAN with Multi-Packet Reception
—Conventional 802.11 medium access control (MAC) characteristics. In particular, all of these designs adopted a protocols have been designed separately from the characteristics s...
Wei Lan Huang, Khaled Ben Letaief, Ying Jun Zhang
AAAI
2004
13 years 6 months ago
Affective Recruitment of Distributed Heterogeneous Agents
Members of multi-robot teams may need to collaborate to accomplish a task due to differences in capabilities. This paper describes an extension of the ALLIANCE architecture that e...
Aaron Gage, Robin R. Murphy