Research Article
A Demonstration of a Relaying Selection Scheme for Maximizing a Diamond Network’s Throughput
573 downloads
@INPROCEEDINGS{10.1007/978-3-642-35576-9_45, author={Apostolos Apostolaras and Kostas Choumas and Ilias Syrigos and Giannis Kazdaridis and Thanasis Korakis and Iordanis Koutsopoulos and Antonios Argyriou and Leandros Tassiulas}, title={A Demonstration of a Relaying Selection Scheme for Maximizing a Diamond Network’s Throughput}, proceedings={Testbeds and Research Infrastructure. Development of Networks and Communities. 8th International ICST Conference, TridentCom 2012, Thessanoliki, Greece, June 11-13, 2012, Revised Selected Papers}, proceedings_a={TRIDENTCOM}, year={2012}, month={12}, keywords={Scheduling Cooperation Relay Selection}, doi={10.1007/978-3-642-35576-9_45} }- Apostolos Apostolaras
Kostas Choumas
Ilias Syrigos
Giannis Kazdaridis
Thanasis Korakis
Iordanis Koutsopoulos
Antonios Argyriou
Leandros Tassiulas
Year: 2012
A Demonstration of a Relaying Selection Scheme for Maximizing a Diamond Network’s Throughput
TRIDENTCOM
Springer
DOI: 10.1007/978-3-642-35576-9_45
Abstract
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 driver [3] and [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.
Copyright © 2012–2024 ICST
