Name
Abstract | ||
|---|---|---|
Random-access algorithms such as the Carrier-Sense Multiple-Access (CSMA) protocol provide a popular mechanism for distributed medium access control in large-scale wireless networks. In recent years fairly tractable models have been shown to yield remarkably accurate throughput estimates in scenarios with saturated buffers. In contrast, in non-saturated scenarios, where nodes refrain from competition for the medium when their buffers are empty, a complex two-way interaction arises between the activity states and the buffer contents of the various nodes. As a result, the throughput characteristics in such scenarios have largely remained elusive so far. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.peva.2014.07.014 | Performance Evaluation |
Keywords | Field | DocType |
CSMA protocol,Stability conditions,Throughput performance,Wireless networks | Wireless network,Computer science,Stability conditions,Computer network,Access control,Interference graph,Throughput,Distributed computing | Journal |
Volume | ISSN | Citations |
79 | 0166-5316 | 4 |
PageRank | References | Authors |
0.52 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabio Cecchi | 1 | 21 | 4.09 |
| Sem C. Borst | 2 | 4 | 0.52 |
| J. S. H. van Leeuwaarden | 3 | 18 | 2.27 |