On the Performance Evaluation of Query-Based Wireless Sensor Networks

Abstract

We present a queueing-theoretic framework to evaluate the performance of large-scale, querybased wireless sensor networks whose nodes detect and advertise significant events that are useful for only a limited time; queries generated by the nodes of the network are also time-limited. The main performance parameter is the steady state proportion of generated queries that fail to be answered on time. Using an infinite transmission range model, we first provide an approximation for this parameter that is insensitive to the size of the network. Subsequently, we approximate the proportion of failed queries when the transmission range is limited and show that this proportion converges to its infinite range counterpart as the sensor transmission range tends to infinity. The analytical approximations are shown to be remarkably accurate when compared with benchmark values obtained using a commercial network simulator.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2012
Accession Number
ADA560720

Entities

People

  • Guvenc Degirmenci
  • Jeffrey P. Kharoufeh
  • Rusty O. Baldwin

Organizations

  • University of Pittsburgh

Tags

Communities of Interest

  • Biomedical
  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • C Programming Language
  • Computer Programming
  • Computers
  • Detectors
  • Distribution Functions
  • Networks
  • Probability
  • Random Variables
  • Random Walk
  • Routing Protocols
  • Sensor Networks
  • Simulations
  • Simulators
  • Steady State
  • Wireless Communications
  • Wireless Networks
  • Wireless Sensor Networks

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.
  • Mathematics or Statistics
  • Neural Network Machine Learning.