Joint stochastic routing and scheduling for multihop wireless ad-hoc networks

Alejandro Ribeiro, Georgios B. Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We consider the problem of finding multihop routes in a wireless ad-hoc network jointly with scheduling transmission times of different information flows. Taking into account the unreliable nature of wireless channels, we derive a joint stochastic routing-scheduling algorithm whereby schedules and routes are selected at random with certain probabilities that we optimize. We prove that if there exists a set of (random) schedules and routes ensuring that all queues in the network are stable, our protocol converges to one such set. Our approach to the problem is to: i) characterize the set of schedulingrouting policies guaranteeing that all queues in the network are stable; ii) show that this can be reduced to finding a set of auxiliary variables in a convex polyhedron; and iii) use dual decomposition techniques to develop an algorithm converging to a point inside this convex polyhedron.

Original languageEnglish (US)
Title of host publicationSPAWC 2007 - 8th IEEE Workshop on Signal Advances in Wireless Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)1424409551, 9781424409556
DOIs
StatePublished - Jan 1 2007
Event8th IEEE Signal Processing Advances in Wireless Communications, SPAWC 2007 - Helsinki, Finland
Duration: Jun 17 2007Jun 20 2007

Publication series

NameIEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC

Other

Other8th IEEE Signal Processing Advances in Wireless Communications, SPAWC 2007
CountryFinland
CityHelsinki
Period6/17/076/20/07

Fingerprint Dive into the research topics of 'Joint stochastic routing and scheduling for multihop wireless ad-hoc networks'. Together they form a unique fingerprint.

Cite this