Sciweavers

27 search results - page 1 / 6
» High-Throughput Random Access via Codes on Graphs
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 3 months ago
High-Throughput Random Access via Codes on Graphs
—Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions an...
Gianluigi Liva, Enrico Paolini, Marco Chiani
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 4 months ago
A Distributed MAC Protocol for Cooperation in Random Access Networks
WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the ...
Georg Böcherer, Alexandre de Baynast
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
13 years 5 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
IPPS
2010
IEEE
13 years 2 months ago
A PRAM-NUMA model of computation for addressing low-TLP workloads
It is possible to implement the parallel random access machine (PRAM) on a chip multiprocessor (CMP) efficiently with an emulated shared memory (ESM) architecture to gain easy par...
Martti Forsell
GLOBECOM
2007
IEEE
13 years 4 months ago
Cooperative Beamforming for Wireless Ad Hoc Networks
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
Lun Dong, Athina P. Petropulu, H. Vincent Poor