Fully-distributed randomized cooperation in wireless sensor networks

dc.conference.dateJanuary 6-9, 2015
dc.conference.locationKAUST
dc.conference.nameAdvances in Uncertainty Quantification Methods, Algorithms and Applications (UQAW 2015)
dc.contributor.authorBader, Ahmed
dc.contributor.authorAbed-Meraim, Karim
dc.contributor.authorAlouini, Mohamed-Slim
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.contributor.institutionUniversité d'Oréans
dc.date.accessioned2017-06-05T08:35:47Z
dc.date.available2017-06-05T08:35:47Z
dc.date.issued2015-01-07
dc.description.abstractWhen marrying randomized distributed space-time coding (RDSTC) to geographical routing, new performance horizons can be created. In order to reach those horizons however, routing protocols must evolve to operate in a fully distributed fashion. In this letter, we expose a technique to construct a fully distributed geographical routing scheme in conjunction with RDSTC. We then demonstrate the performance gains of this novel scheme by comparing it to one of the prominent classical schemes.
dc.identifier.urihttp://hdl.handle.net/10754/624076
dc.titleFully-distributed randomized cooperation in wireless sensor networks
dc.typePoster
kaust.personBader, Ahmed
kaust.personAlouini, Mohamed-Slim
refterms.dateFOA2018-06-14T04:25:59Z
Files