Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Ergebnis 13 von 31
IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, 2020, p.476-485
2020
Volltextzugriff (PDF)

Details

Autor(en) / Beteiligte
Titel
AoI and Throughput Tradeoffs in Routing-aware Multi-hop Wireless Networks
Ist Teil von
  • IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, 2020, p.476-485
Ort / Verlag
IEEE
Erscheinungsjahr
2020
Quelle
IEEE Electronic Library (IEL)
Beschreibungen/Notizen
  • The Age-of-Information (AoI) is a newly introduced metric for capturing information updating timeliness, as opposed to the network throughput, which is a conventional performance metric to measure the network transmission speed and robustness as a whole. While considerable work has addressed either optimal AoI or throughput individually, the inherent relationships between the two performance metrics are yet to be explored, especially in multi-hop networks. In this paper, we explore their relationships in multi-hop networks for the very first time, particularly focusing on the impacts of flexible routes on the two metrics. By developing a rigorous mathematical model with interference, channel allocation, link scheduling, and routing path selection taken into consideration, we build the interrelation between AoI and throughput in multi-hop networks. A multi-criteria optimization problem is formulated with the goal of simultaneously minimizing AoI and maximizing network throughput. To solve this problem, we resort to a novel approach by transforming the multi-criteria problem into a single objective one so as to find the weakly Pareto-optimal points iteratively, thereby allowing us to screen all Pareto-optimal points for the solution. A new algorithm based on the piece-wise linearization technique is then developed to closely linearize the non-linear terms in the single objective problem via their linear approximation segments to make it solvable. We formally prove that our algorithms can find all Pareto-optimal points in a finite number of iterations. From simulation results, we identify the tradeoff points of the optimal AoI and throughput, demonstrating that one performance metric improves at the expense of degrading the other, with the routing path found as one of the key factors in determining such a tradeoff.
Sprache
Englisch
Identifikatoren
eISSN: 2641-9874
DOI: 10.1109/INFOCOM41043.2020.9155444
Titel-ID: cdi_ieee_primary_9155444

Weiterführende Literatur

Empfehlungen zum selben Thema automatisch vorgeschlagen von bX