Discrete-time Markov Model for Wireless Link Burstiness Simulations

  • Authors:
  • Yantao Li;Daniel Graham;Gang Zhou;Xin Qi;Shaojiang Deng;Di Xiao

  • Affiliations:
  • Department of Computer Science, The College of William and Mary, Williamsburg, USA 23187 and College of Computer and Information Science, Southwest University, Chongqing, China 400715;Department of Computer Science, The College of William and Mary, Williamsburg, USA 23187;Department of Computer Science, The College of William and Mary, Williamsburg, USA 23187;Department of Computer Science, The College of William and Mary, Williamsburg, USA 23187;College of Computer Science, Chongqing University, Chongqing, China 400044;College of Computer Science, Chongqing University, Chongqing, China 400044

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Link burstiness can negatively affect the performance of wireless networking protocols, by causing an extra of 15 % transmission cost. It describes the underlying behavior of packet delivery and provides insights into tuning protocols to improve performance. In this paper, we propose a discrete-time Markov model to simulate the burstiness behavior of wireless links, which provides a novel approach for link burstiness studies. More specifically, we first present a discrete-time Markov model with the input of $$\beta $$ value and the output of a sequence trace of burstiness traffic. Then we design an algorithm to simulate the Markov model, where the state transition represents the packet receptions or losses. Finally, we evaluate the proposed model in terms of distribution of link burstiness, accuracy and cost, and the results demonstrate that our model is able to accurately simulate the burstiness behavior.