CAMA: Efficient Modeling of the Capture Effect for Low-Power Wireless Networks
Network simulation is an essential tool for the design and evaluation of wireless network protocols, and realistic channel modeling is essential for meaningful analysis. Recently, several network protocols have demonstrated substantial network performance improvements by exploiting the capture effec...
Gespeichert in:
Veröffentlicht in: | ACM transactions on sensor networks 2014-11, Vol.11 (1), p.1-43 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Network simulation is an essential tool for the design and evaluation of wireless network protocols, and realistic channel modeling is essential for meaningful analysis. Recently, several network protocols have demonstrated substantial network performance improvements by exploiting the capture effect, but existing models of the capture effect are still not adequate for protocol simulation and analysis. Physical-level models that calculate the signal-to-interference-plus-noise ratio (SINR) for every incoming bit are too slow to be used for large-scale or long-term networking experiments, and link-level models such as those currently used by the NS2 simulator do not accurately predict protocol performance. In this article, we propose a new technique called the
capture modeling algorithm
(CAMA) that provides the simulation fidelity of physical-level models while achieving the simulation time of link-level models. We confirm the validity of CAMA through comparison with the empirical traces of the experiments conducted by various numbers of CC1000 and CC2420-based nodes in different scenarios. Our results indicate that CAMA can accurately predict the packet reception, corruption, and collision detection rates of real radios, while existing models currently used by the NS2 simulator produce substantial prediction error. |
---|---|
ISSN: | 1550-4859 1550-4867 |
DOI: | 10.1145/2629352 |