Sciweavers

79 search results - page 2 / 16
» Throughput of random access without message passing
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 6 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
MOBICOM
2003
ACM
14 years 20 days ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
INFOCOM
1989
IEEE
13 years 11 months ago
An Efficient Multiple-Access Method for the Binary Adder Channel
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...
Israel Bar-David, Eli Plotnik, Raphael Rom
MOBIHOC
2009
ACM
14 years 8 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
MONET
2011
13 years 2 months ago
Achieving End-to-end Fairness in 802.11e Based Wireless Multi-Hop Mesh Networks Without Coordination
Abstract To mitigate the damaging impacts caused by interference and hidden terminals, it has been proposed to use orthogonal channels in wireless multi-hop mesh networks. We demon...
Tianji Li, Douglas J. Leith, Venkataramana Badarla...