Throughput Maximization for Multiple D2D Group Communications Underlaying Cellular Networks

In the scenario where multiple device-to-device (D2D) users and cellular users coexist, the large number of D2D users not only results in the shortage of spectrum resources but also brings interference to the communication of cellular users. In this paper, we establish a clustering model centered on...

Full description

Saved in:
Bibliographic Details
Published in:Wireless communications and mobile computing 2020, Vol.2020 (2020), p.1-10
Main Authors: Chen, Wei, Xu, Lei, Jia, Lu, He, Ji-Ai
Format: Article
Language:English
Subjects:
Algorithms
Cellular communication
Clustering
Communication
Game theory
Graph theory
Impact factors
Interference
Optimization
Public safety
Resource allocation
Spectrum allocation
User requirements
Utility functions
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c360t-b7f497bc21deb89e9bb1ccee89cedb9b8f6b10710e6f0720742120e98eff4503
cites cdi_FETCH-LOGICAL-c360t-b7f497bc21deb89e9bb1ccee89cedb9b8f6b10710e6f0720742120e98eff4503
container_end_page 10
container_issue 2020
container_start_page 1
container_title Wireless communications and mobile computing
container_volume 2020
creator Chen, Wei
Xu, Lei
Jia, Lu
He, Ji-Ai
description In the scenario where multiple device-to-device (D2D) users and cellular users coexist, the large number of D2D users not only results in the shortage of spectrum resources but also brings interference to the communication of cellular users. In this paper, we establish a clustering model centered on cellular users and propose a resource allocation algorithm based on a D2D clustering model. On the basis of ensuring the throughput requirements of cellular users, this algorithm reconstructs various matrices in the graph theory through probability models, sets the priority of D2D pairs, and maximizes the number of user accesses under interference tolerance. Besides, on the optimization of the number of users, we adopt the Rubinstein game model to adjust the game order according to the priority and optimize the bandwidth allocation mode, so as to improve the overall throughput of the network. Simulation results show that the proposed algorithm can increase the number of users and the network throughput, while shortening the spectrum allocation time by more than half.
doi_str_mv 10.1155/2020/8833579
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2451752988</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2451752988</sourcerecordid><originalsourceid>FETCH-LOGICAL-c360t-b7f497bc21deb89e9bb1ccee89cedb9b8f6b10710e6f0720742120e98eff4503</originalsourceid><addsrcrecordid>eNqF0D1PwzAQgGELgUQpbMzIEiOE2s6H4xGlUJBaWMrEENnJuXVJ4uAkKuXXkxIEI9Pd8OhOehE6p-SG0jCcMMLIJI59P-TiAI1o6BMvjjg__N0jcYxOmmZDCPEJoyP0ulw7263WddfihfwwpfmUrbEV1tbhRVe0pi4AT9kUz3pX48SWZVeZ7Bs1-KXKwRVyZ6oVTqAoukI6_ATt1rq35hQdaVk0cPYzx2h5f7dMHrz58-wxuZ17mR-R1lNcB4KrjNEcVCxAKEWzDCAWGeRKqFhHihJOCUSacEZ4wCgjIGLQOgiJP0aXw9na2fcOmjbd2M5V_ceUBSHlIRN9kzG6HlTmbNM40GntTCndLqUk3ddL9_XSn3o9vxr42lS53Jr_9MWgoTeg5Z9mNIiC0P8CQjJ6DQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2451752988</pqid></control><display><type>article</type><title>Throughput Maximization for Multiple D2D Group Communications Underlaying Cellular Networks</title><source>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</source><source>Wiley Open Access</source><creator>Chen, Wei ; Xu, Lei ; Jia, Lu ; He, Ji-Ai</creator><contributor>Vitucci, Enrico M. ; Enrico M Vitucci</contributor><creatorcontrib>Chen, Wei ; Xu, Lei ; Jia, Lu ; He, Ji-Ai ; Vitucci, Enrico M. ; Enrico M Vitucci</creatorcontrib><description>In the scenario where multiple device-to-device (D2D) users and cellular users coexist, the large number of D2D users not only results in the shortage of spectrum resources but also brings interference to the communication of cellular users. In this paper, we establish a clustering model centered on cellular users and propose a resource allocation algorithm based on a D2D clustering model. On the basis of ensuring the throughput requirements of cellular users, this algorithm reconstructs various matrices in the graph theory through probability models, sets the priority of D2D pairs, and maximizes the number of user accesses under interference tolerance. Besides, on the optimization of the number of users, we adopt the Rubinstein game model to adjust the game order according to the priority and optimize the bandwidth allocation mode, so as to improve the overall throughput of the network. Simulation results show that the proposed algorithm can increase the number of users and the network throughput, while shortening the spectrum allocation time by more than half.</description><identifier>ISSN: 1530-8669</identifier><identifier>EISSN: 1530-8677</identifier><identifier>DOI: 10.1155/2020/8833579</identifier><language>eng</language><publisher>Cairo, Egypt: Hindawi Publishing Corporation</publisher><subject>Algorithms ; Cellular communication ; Clustering ; Communication ; Game theory ; Graph theory ; Impact factors ; Interference ; Optimization ; Public safety ; Resource allocation ; Spectrum allocation ; User requirements ; Utility functions</subject><ispartof>Wireless communications and mobile computing, 2020, Vol.2020 (2020), p.1-10</ispartof><rights>Copyright © 2020 Ji-Ai He et al.</rights><rights>Copyright © 2020 Ji-Ai He et al. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c360t-b7f497bc21deb89e9bb1ccee89cedb9b8f6b10710e6f0720742120e98eff4503</citedby><cites>FETCH-LOGICAL-c360t-b7f497bc21deb89e9bb1ccee89cedb9b8f6b10710e6f0720742120e98eff4503</cites><orcidid>0000-0003-2510-4984 ; 0000-0002-1184-1652 ; 0000-0001-9227-5324</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2451752988/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2451752988?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,4024,25753,27923,27924,27925,37012,44590,75126</link.rule.ids></links><search><contributor>Vitucci, Enrico M.</contributor><contributor>Enrico M Vitucci</contributor><creatorcontrib>Chen, Wei</creatorcontrib><creatorcontrib>Xu, Lei</creatorcontrib><creatorcontrib>Jia, Lu</creatorcontrib><creatorcontrib>He, Ji-Ai</creatorcontrib><title>Throughput Maximization for Multiple D2D Group Communications Underlaying Cellular Networks</title><title>Wireless communications and mobile computing</title><description>In the scenario where multiple device-to-device (D2D) users and cellular users coexist, the large number of D2D users not only results in the shortage of spectrum resources but also brings interference to the communication of cellular users. In this paper, we establish a clustering model centered on cellular users and propose a resource allocation algorithm based on a D2D clustering model. On the basis of ensuring the throughput requirements of cellular users, this algorithm reconstructs various matrices in the graph theory through probability models, sets the priority of D2D pairs, and maximizes the number of user accesses under interference tolerance. Besides, on the optimization of the number of users, we adopt the Rubinstein game model to adjust the game order according to the priority and optimize the bandwidth allocation mode, so as to improve the overall throughput of the network. Simulation results show that the proposed algorithm can increase the number of users and the network throughput, while shortening the spectrum allocation time by more than half.</description><subject>Algorithms</subject><subject>Cellular communication</subject><subject>Clustering</subject><subject>Communication</subject><subject>Game theory</subject><subject>Graph theory</subject><subject>Impact factors</subject><subject>Interference</subject><subject>Optimization</subject><subject>Public safety</subject><subject>Resource allocation</subject><subject>Spectrum allocation</subject><subject>User requirements</subject><subject>Utility functions</subject><issn>1530-8669</issn><issn>1530-8677</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqF0D1PwzAQgGELgUQpbMzIEiOE2s6H4xGlUJBaWMrEENnJuXVJ4uAkKuXXkxIEI9Pd8OhOehE6p-SG0jCcMMLIJI59P-TiAI1o6BMvjjg__N0jcYxOmmZDCPEJoyP0ulw7263WddfihfwwpfmUrbEV1tbhRVe0pi4AT9kUz3pX48SWZVeZ7Bs1-KXKwRVyZ6oVTqAoukI6_ATt1rq35hQdaVk0cPYzx2h5f7dMHrz58-wxuZ17mR-R1lNcB4KrjNEcVCxAKEWzDCAWGeRKqFhHihJOCUSacEZ4wCgjIGLQOgiJP0aXw9na2fcOmjbd2M5V_ceUBSHlIRN9kzG6HlTmbNM40GntTCndLqUk3ddL9_XSn3o9vxr42lS53Jr_9MWgoTeg5Z9mNIiC0P8CQjJ6DQ</recordid><startdate>2020</startdate><enddate>2020</enddate><creator>Chen, Wei</creator><creator>Xu, Lei</creator><creator>Jia, Lu</creator><creator>He, Ji-Ai</creator><general>Hindawi Publishing Corporation</general><general>Hindawi</general><general>Hindawi Limited</general><scope>ADJCN</scope><scope>AHFXO</scope><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7XB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0003-2510-4984</orcidid><orcidid>https://orcid.org/0000-0002-1184-1652</orcidid><orcidid>https://orcid.org/0000-0001-9227-5324</orcidid></search><sort><creationdate>2020</creationdate><title>Throughput Maximization for Multiple D2D Group Communications Underlaying Cellular Networks</title><author>Chen, Wei ; Xu, Lei ; Jia, Lu ; He, Ji-Ai</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c360t-b7f497bc21deb89e9bb1ccee89cedb9b8f6b10710e6f0720742120e98eff4503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Cellular communication</topic><topic>Clustering</topic><topic>Communication</topic><topic>Game theory</topic><topic>Graph theory</topic><topic>Impact factors</topic><topic>Interference</topic><topic>Optimization</topic><topic>Public safety</topic><topic>Resource allocation</topic><topic>Spectrum allocation</topic><topic>User requirements</topic><topic>Utility functions</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Wei</creatorcontrib><creatorcontrib>Xu, Lei</creatorcontrib><creatorcontrib>Jia, Lu</creatorcontrib><creatorcontrib>He, Ji-Ai</creatorcontrib><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer science database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Wireless communications and mobile computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Wei</au><au>Xu, Lei</au><au>Jia, Lu</au><au>He, Ji-Ai</au><au>Vitucci, Enrico M.</au><au>Enrico M Vitucci</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Throughput Maximization for Multiple D2D Group Communications Underlaying Cellular Networks</atitle><jtitle>Wireless communications and mobile computing</jtitle><date>2020</date><risdate>2020</risdate><volume>2020</volume><issue>2020</issue><spage>1</spage><epage>10</epage><pages>1-10</pages><issn>1530-8669</issn><eissn>1530-8677</eissn><abstract>In the scenario where multiple device-to-device (D2D) users and cellular users coexist, the large number of D2D users not only results in the shortage of spectrum resources but also brings interference to the communication of cellular users. In this paper, we establish a clustering model centered on cellular users and propose a resource allocation algorithm based on a D2D clustering model. On the basis of ensuring the throughput requirements of cellular users, this algorithm reconstructs various matrices in the graph theory through probability models, sets the priority of D2D pairs, and maximizes the number of user accesses under interference tolerance. Besides, on the optimization of the number of users, we adopt the Rubinstein game model to adjust the game order according to the priority and optimize the bandwidth allocation mode, so as to improve the overall throughput of the network. Simulation results show that the proposed algorithm can increase the number of users and the network throughput, while shortening the spectrum allocation time by more than half.</abstract><cop>Cairo, Egypt</cop><pub>Hindawi Publishing Corporation</pub><doi>10.1155/2020/8833579</doi><tpages>10</tpages><orcidid>https://orcid.org/0000-0003-2510-4984</orcidid><orcidid>https://orcid.org/0000-0002-1184-1652</orcidid><orcidid>https://orcid.org/0000-0001-9227-5324</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1530-8669
ispartof Wireless communications and mobile computing, 2020, Vol.2020 (2020), p.1-10
issn 1530-8669
1530-8677
language eng
recordid cdi_proquest_journals_2451752988
source Publicly Available Content Database (Proquest) (PQ_SDU_P3); Wiley Open Access
subjects Algorithms
Cellular communication
Clustering
Communication
Game theory
Graph theory
Impact factors
Interference
Optimization
Public safety
Resource allocation
Spectrum allocation
User requirements
Utility functions
title Throughput Maximization for Multiple D2D Group Communications Underlaying Cellular Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T05%3A47%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Throughput%20Maximization%20for%20Multiple%20D2D%20Group%20Communications%20Underlaying%20Cellular%20Networks&rft.jtitle=Wireless%20communications%20and%20mobile%20computing&rft.au=Chen,%20Wei&rft.date=2020&rft.volume=2020&rft.issue=2020&rft.spage=1&rft.epage=10&rft.pages=1-10&rft.issn=1530-8669&rft.eissn=1530-8677&rft_id=info:doi/10.1155/2020/8833579&rft_dat=%3Cproquest_cross%3E2451752988%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c360t-b7f497bc21deb89e9bb1ccee89cedb9b8f6b10710e6f0720742120e98eff4503%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2451752988&rft_id=info:pmid/&rfr_iscdi=true