Fast convergence in stochastic routing for wireless sensor networks : an analytical perspective
Files
(Published version)
Date
2012
Authors
Wijetunge, U.S.
Perreau, S.
Pollok, A.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Global Communications Conference (GLOBECOM), 2012, iss.6503107, pp.164-170
Statement of Responsibility
Conference Name
2012 IEEE Global Communications Conference : Globecom 2012 - Ad Hoc and Sensor Networking Symposium (3 Dec 2012 - 7 Dec 2012 : Anaheim, California)
Abstract
Improving convergence rate is one of the major challenges in stochastic routing for wireless sensor networks. Randomized approach of node selection results in a higher convergence time which is not desirable for delay-sensitive applications. In [4], we proposed a novel routing algorithm that performs better than the existing methods in terms of the convergence rate. In this paper, we analyze the basic concept behind our proposed routing algorithm, improving the rate of routing out of the neighborhood for any given node, which will improve the convergence rate. Furthermore, we derive bounds for transition probabilities which will improve the convergence rate with reference to the random walking strategy and formulate a closed-form expression for optimal transition probability selection.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2012 IEEE
Access Condition Notes: Accepted manuscript is available