Abstract
We propose an efficient simulation technique for the CSMA medium access protocol. It is based on the well-established model of using signal to interference and noise ratio (SINR), which is very accurate and allows for highly realistic predictions of collisions. However, traditional implementations require O(n) time to compute interference values. We evaluate how to speed this up by using efficient data structures such as k-d-trees or geometric hash tables in our implementation. There are different levels of accuracy, some of which allow for O(√n + a) lookups, where a is the number of nearby senders. We demonstrate the achievable speedup and discuss accuracy tradeoffs for different settings using the Shawn simulator.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems |
| Number of pages | 4 |
| Place of Publication | New York, NY, USA |
| Publisher | ACM |
| Publication date | 17.10.2010 |
| Pages | 59-62 |
| ISBN (Print) | 978-1-4503-0274-6 |
| DOIs | |
| Publication status | Published - 17.10.2010 |
| Event | 13th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems - Bodrum, Turkey Duration: 17.10.2010 → 21.10.2010 |
