A Demonstration of a Relaying Selection Scheme for Maximizing a Diamond Network’s Throughput

We demonstrate a queue-aware algorithm studied in a diamond network topology. This algorithm’s decisions are obtained from an analytical optimization framework relying on our technical work [4] and we devise an implementation part by modifying the features of ath9k driver [3] and click modular route...

Full description

Saved in:
Bibliographic Details
Published inTestbeds and Research Infrastructure. Development of Networks and Communities pp. 408 - 410
Main Authors Apostolaras, Apostolos, Choumas, Kostas, Syrigos, Ilias, Kazdaridis, Giannis, Korakis, Thanasis, Koutsopoulos, Iordanis, Argyriou, Antonios, Tassiulas, Leandros
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2012
SeriesLecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Subjects
Cooperation
Relay Selection
Scheduling
Online AccessGet full text

Cover

More Information
Summary:We demonstrate a queue-aware algorithm studied in a diamond network topology. This algorithm’s decisions are obtained from an analytical optimization framework relying on our technical work [4] and we devise an implementation part by modifying the features of ath9k driver [3] and click modular router [5]. Performance evaluation is conducted through experimentation on the NITOS Wireless Testbed and it reveals a significant rise in total throughput considering a particular networking scenario while also it maintains stability of backlog queues when schedules indicated by Lyapunov-based technique as throughput optimal are selected. NITOS Wireless Testbed website: “http://nitlab.inf.uth.gr” [2].
Bibliography:The research leading to these results has received funding from the European Community’s Seventh Framework Programme, CONECT (FP7/2007-2013) under grant agreement no257616.
ISBN:9783642355752
3642355757
ISSN:1867-8211
1867-822X
DOI:10.1007/978-3-642-35576-9_45