A Markov-based channel model algorithm for wireless networks

  • Authors:

  • Almudena Konrad;Ben Y. Zhao;Anthony D. Joseph;Reiner Ludwig

  • Affiliations:

  • Computer Science Division, UC Berkeley, Berkeley, CA;Computer Science Division, UC Berkeley, Berkeley, CA;Computer Science Division, UC Berkeley, Berkeley, CA;Ericsson Research, Herzogenrath, Germany

  • Venue:
  • Wireless Networks
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Techniques for modeling and simulating channel conditions play an essential role in understanding network protocol and application behavior. In [11], we demonstrated that inaccurate modeling using a traditional analytical model yielded suboptimal error control protocol parameters choices. In this paper, we demonstrate that time-varying effects on wireless channels result in wireless traces which exhibit non-stationary behavior over small window sizes. We then present an algorithm that extracts stationary components from a collected trace in order to provide analytical channel models that, relative to traditional approaches, more accurately represent characteristics such as burstiness, statistical distribution of errors, and packet loss processes. Our algorithm also generates artificial traces with the same statistical characteristics as actual collected network traces. For validation, we develop a channel model for the circuit-switched data service in GSM and show that it: (1) more closely approximates GSM channel characteristics than traditional Markov models and (2) generates artificial traces that closely match collected traces' statistics. Using these traces in a simulator environment enables future protocol and application testing under different controlled and repeatable conditions.