Stochastic Routing in Wireless Sensor Networks

Fikret Sivrikaya; Thomas Geithner; Cuong Truong; Manzoor Ahmed Khan; Sahin Albayrak

doi:10.1109/ICCW.2009.5208012

Stochastic Routing in Wireless Sensor Networks

Fikret Sivrikaya, Thomas Geithner, Cuong Truong, Manzoor Ahmed Khan, Sahin Albayrak

Institute of Computer Engineering

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.

Original language	English
Title of host publication	2009 IEEE International Conference on Communications Workshops
Number of pages	5
Publisher	IEEE
Publication date	18.11.2009
Pages	1-5
Article number	5208012
ISBN (Print)	978-1-4244-3437-4
DOIs	https://doi.org/10.1109/ICCW.2009.5208012
Publication status	Published - 18.11.2009
Event	2009 IEEE International Conference on Communications - Dresden, Germany Duration: 14.06.2009 → 18.06.2009 Conference number: 78026

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1109/ICCW.2009.5208012

Cite this

@inproceedings{ab2557f1daec4a3baa7d518e22fc4ee5,

title = "Stochastic Routing in Wireless Sensor Networks",

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.",

author = "Fikret Sivrikaya and Thomas Geithner and Cuong Truong and Khan, {Manzoor Ahmed} and Sahin Albayrak",

year = "2009",

month = nov,

day = "18",

doi = "10.1109/ICCW.2009.5208012",

language = "English",

isbn = "978-1-4244-3437-4",

series = "IEEE International Conference on Communications Workshops",

publisher = "IEEE",

pages = "1--5",

booktitle = "2009 IEEE International Conference on Communications Workshops",

note = "2009 IEEE International Conference on Communications, ICC 2009 ; Conference date: 14-06-2009 Through 18-06-2009",

}

Sivrikaya, F, Geithner, T, Truong, C, Khan, MA & Albayrak, S 2009, Stochastic Routing in Wireless Sensor Networks. in 2009 IEEE International Conference on Communications Workshops., 5208012, IEEE International Conference on Communications Workshops, IEEE, pp. 1-5, 2009 IEEE International Conference on Communications, Dresden, Saxony, Germany, 14.06.09. https://doi.org/10.1109/ICCW.2009.5208012

TY - GEN

T1 - Stochastic Routing in Wireless Sensor Networks

AU - Sivrikaya, Fikret

AU - Geithner, Thomas

AU - Truong, Cuong

AU - Khan, Manzoor Ahmed

AU - Albayrak, Sahin

N1 - Conference code: 78026

PY - 2009/11/18

Y1 - 2009/11/18

N2 - 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.

AB - 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.

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-70449433959&origin=inward&txGid=9d80de0566d11e6b6b2a861d6babab16

U2 - 10.1109/ICCW.2009.5208012

DO - 10.1109/ICCW.2009.5208012

M3 - Conference contribution

SN - 978-1-4244-3437-4

T3 - IEEE International Conference on Communications Workshops

SP - 1

EP - 5

BT - 2009 IEEE International Conference on Communications Workshops

PB - IEEE

T2 - 2009 IEEE International Conference on Communications

Y2 - 14 June 2009 through 18 June 2009

ER -

Stochastic Routing in Wireless Sensor Networks

Abstract

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this