Stochastic approach to quality of service in data gathering for wireless sensor networks
No Thumbnail Available
In a rare event detection application, asynchronous sleep/wake scheduling is energy efficient because of overhead involved for synchronization in synchronous sleep/wake scheduling. As sensor nodes wake-up independently, asynchronous sleep/wake scheduling increases delay. For such an application, satisfying delay constraint and lifetime requirement with minimum deployment cost is a challenging problem. Specifically, in a rare event-detection application, like fire or disastrous event detection, an event detected close to the central facility needs to reach faster than an event detected far away. In our first contribution, we address the problem of finding a minimum cost WSN for a set of spatially differentiated QoS requirements. First, we use a stochastic approach to calculate the expected e2e delay for a given sensor density. We use this analysis to find the critical expected sensor density that satisfies given e2e delay constraint and lifetime requirement. Later we extended this analysis to find the minimum cost network for a set of spatially differentiated delay constraints and the lifetime requirement. We also verified our mathematical expressions using Monte Carlo simulation and show effectiveness in NS2 simulation.
Supervisor: S. V. Rao
COMPUTER SCIENCE AND ENGINEERING