Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

A bipartite graph based proportional fair scheduling strategy to improve throughput with multiple resource blocks

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 13 No. 4 (2023)

DOI
10.11591/ijece.v13i4.pp4280-4290
ISSN
2722-2578, 2088-8708
Published
2023-08-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The fifth-generation wireless communication is expected to provide a huge amount of capacity to cater to the need of an increasing number of mobile consumers, which can be satisfied by device-to-device (D2D) communication. Reusing the cellular user’s resources in an efficient manner helps to increase the spectrum efficiency of the network but it leads to severe interference. The important point in reusing cellular user resources is that D2D communication should not affect the cellular user’s efficiency. After achieving this requirement, the focus is now turned toward the allocation of resources to D2D communication. This resource allocation strategy is to be designed in such a way that it will not affect communication among the cellular user (CU). This scheme improves various performance objectives. This paper aims at designing a proportional fair resource allocation algorithm based on the bipartite graph which maintains the quality of service (QoS) of CUs while providing D2D communication. This algorithm can be merged with any other scheme of resource allocation for improving QoS and adopting changing channels. In this scheme, a D2D pair can be allocated with one or more than one resource blocks. The MATLAB simulations analyze the performance of the proposed scheme.

Collaboration network of the authors

5 authors · 6 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • R.M.D. Engineering College
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Jai Ganesh SekarAffiliation unknown1
Ezhumalai PeriyathambiR.M.D. Engineering College1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>A bipartite graph based proportional fair scheduling strategy to improve throughput with multiple resource blocks</dc:title><dc:creator>Kesavan, Dhivya</dc:creator><dc:creator>Periathambi, Ezhumalai</dc:creator><dc:creator>Chockkalingam, Arun</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p&amp;gt;The fifth-generation wireless communication is expected to provide a huge amount of capacity to cater to the need of an increasing number of mobile consumers, which can be satisfied by device-to-device (D2D) communication. Reusing the cellular user’s resources in an efficient manner helps to increase the spectrum efficiency of the network but it leads to severe interference. The important point in reusing cellular user resources is that D2D communication should not affect the cellular user’s efficiency. After achieving this requirement, the focus is now turned toward the allocation of resources to D2D communication. This resource allocation strategy is to be designed in such a way that it will not affect communication among the cellular user (CU). This scheme improves various performance objectives. This paper aims at designing a proportional fair resource allocation algorithm based on the bipartite graph which maintains the quality of service (QoS) of CUs while providing D2D communication. This algorithm can be merged with any other scheme of resource allocation for improving QoS and adopting changing channels. In this scheme, a D2D pair can be allocated with one or more than one resource blocks. The MATLAB simulations analyze the performance of the proposed scheme.&amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2023-08-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v13i4.pp4280-4290</dc:identifier><dc:identifier>10.11591/ijece.v13i4.pp4280-4290</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 13 No 4 (2023); 4280</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/28642/16777</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>