About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Quality, Reliability, Security and Robustness in Heterogeneous Systems. 17th EAI International Conference, QShine 2021, Virtual Event, November 29–30, 2021, Proceedings

Research Article

Joint Relay Selection and Frequency Allocation for D2D Communications

Download(Requires a free EAI acccount)
4 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-030-91424-0_10,
        author={Rathindra Nath Dutta and Sasthi C. Ghosh},
        title={Joint Relay Selection and Frequency Allocation for D2D Communications},
        proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Systems. 17th EAI International Conference, QShine 2021, Virtual Event, November 29--30, 2021, Proceedings},
        proceedings_a={QSHINE},
        year={2021},
        month={11},
        keywords={D2D communications Channel assignment Relay selection},
        doi={10.1007/978-3-030-91424-0_10}
    }
    
  • Rathindra Nath Dutta
    Sasthi C. Ghosh
    Year: 2021
    Joint Relay Selection and Frequency Allocation for D2D Communications
    QSHINE
    Springer
    DOI: 10.1007/978-3-030-91424-0_10
Rathindra Nath Dutta,*, Sasthi C. Ghosh
    *Contact email: rathin_r@isical.ac.in

    Abstract

    High demand for bandwidth has been the primary motivation for device to device (D2D) communication. In cases where direct communication is not possible, two D2D devices are allowed to communicate via relay nodes. The relay selection problem is concerned with the selection of suitable relay device for each such D2D pairs while frequency assignment problem aims to optimally share the available spectrum resources among the active devices satisfying their quality of service requirements. In this work, we present a joint approach to solve the relay selection and frequency allocation problem in context of D2D communications. We incorporated a network coding strategy into our problem formulation which halves the required time slots for a two-way D2D communication. Considering the underlying problem is NP-Complete, we formulated a linear programming based greedy method which shows near-optimal performance with polynomial time complexity. We also compare our proposed algorithm with two existing works and show throughput improvement.

    Keywords
    D2D communications Channel assignment Relay selection
    Published
    2021-11-17
    Appears in
    SpringerLink
    http://dx.doi.org/10.1007/978-3-030-91424-0_10
    Copyright © 2021–2025 ICST
    EBSCOProQuestDBLPDOAJPortico
    EAI Logo

    About EAI

    • Who We Are
    • Leadership
    • Research Areas
    • Partners
    • Media Center

    Community

    • Membership
    • Conference
    • Recognition
    • Sponsor Us

    Publish with EAI

    • Publishing
    • Journals
    • Proceedings
    • Books
    • EUDL