TU Berlin

Main document

Literature Database Entry

torres-gomez2020minimizing

Jorge Torres Gómez, Maximo Morales-Céspedes, Ana García Armada and Gangolf Hirtz, "Minimizing Age of Information on NOMA Communication Schemes for Vehicular Communication Applications," Proceedings of 12th IEEE/IET International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP 2020), Virtual Conference, July 2020, pp. 1–6.

Abstract

Real-time communication schemes supporting fresh information are of major importance for vehicular networks. In this direction, the Age of Information (AoI) concept is a power-full tool to operate with. Current publications bring equal importance to the AoI of packets in spite of the common case of unequal channel capacity and source entropy between them, this results in reduced user perception of fairness. This report analyses the use of power-domain NOMA to balance the assigned power between nodes to reduce the overall AoI. We verify an improved user perception of fairness in regard to the freshness of information at the destination.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Jorge Torres Gómez
Maximo Morales-Céspedes
Ana García Armada
Gangolf Hirtz

BibTeX reference

@inproceedings{torres-gomez2020minimizing,
    author = {Torres G{\'{o}}mez, Jorge and Morales-C{\'{e}}spedes, Maximo and Armada, Ana Garc{\'{i}}a and Hirtz, Gangolf},
    doi = {10.1109/CSNDSP49049.2020.9249492},
    title = {{Minimizing Age of Information on NOMA Communication Schemes for Vehicular Communication Applications}},
    pages = {1--6},
    publisher = {IEEE},
    address = {Virtual Conference},
    booktitle = {12th IEEE/IET International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP 2020)},
    month = {7},
    year = {2020},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Extras

TKN is co-organizing

Featured Paper

News