Abstract

We propose a new location-based stochastic routing approach that is well-suited for wireless sensor networks deployed for public safety applications such as emergency evacuations or search and rescue operations. We first introduce a new modeling and evaluation framework based on Markov chains for randomized routing. Based on this evaluation framework, we study the load balancing and routing performance aspects of i) a near-optimal solution using the complete topology information, ii) a heuristic algorithm that uses only local neighborhood information. Numerical studies using the evaluation framework show that our heuristic routing approach scales well with both network size and density, considering the combined problem of routing and load balancing.

@INPROCEEDINGS{5208012,
author={Sivrikaya, F. and Geithner, T. and Truong, C. and Khan, M.A. and Albayrak, S.},
booktitle={Communications Workshops, 2009. ICC Workshops 2009. IEEE International Conference on}, title={Stochastic Routing in Wireless Sensor Networks},
year={2009},
month=june,
volume={},
number={},
pages={1 -5},
keywords={Markov chain;emergency evacuation;heuristic algorithm;heuristic routing approach;load balancing;local neighborhood information;location-based stochastic routing approach;public safety application;randomized routing;wireless sensor network;Markov processes;resource allocation;telecommunication network routing;wireless sensor networks;},
doi={10.1109/ICCW.2009.5208012},
ISSN={},
isbn ={978-1-4244-3437-4},}