Robust stochastic routing and scheduling for wireless ad-hoc networks

Alejandro Ribeiro, Georgios B Giannakis

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

3 Scopus citations

Abstract

We discuss the design of robust protocols that despite poor knowledge about network connectivity achieve consistent performance. Optimal routes and schedules are obtained to (i) maximize a social network utility subject to a variance constraint; and (ii) minimize a variance cost subject to a minimum yield. Corresponding optimization problems are formulated and shown to be convex under mild conditions usually satisfied in practice. Protocols are obtained relying on dual decomposition algorithms that compute the solution of these optimization problems in a distributed manner. The resulting protocols yield utilities that come close to the prescribed requirement even when channel estimates are rough.

Original languageEnglish (US)
Title of host publicationIWCMC 2008 - International Wireless Communications and Mobile Computing Conference
Pages50-55
Number of pages6
DOIs
StatePublished - Oct 6 2008
EventInternational Wireless Communications and Mobile Computing Conference, IWCMC 2008 - Crete, Greece
Duration: Aug 6 2008Aug 8 2008

Publication series

NameIWCMC 2008 - International Wireless Communications and Mobile Computing Conference

Other

OtherInternational Wireless Communications and Mobile Computing Conference, IWCMC 2008
CountryGreece
CityCrete
Period8/6/088/8/08

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

Cite this