4-DMWM Approach for Caching Based Optimal D2D Pairing and Channel Allocation: Centralized and Distributed Algorithm Design

Caching popular contents at mobile devices can potentially improve the quality of service for mobile users and relieve traffic burden of base station in cellular networks. In this paper, we jointly consider the resource allocation, the cached contents, and the distance between two devices for the op...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE access Ročník 4; s. 9213 - 9224
Hlavní autori: Miao, Lu, Bai, Bo, Chen, Wei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
4-dimensional maximum weighted matching (4-DMWM)
Algorithms
Caching
Cellular communication
centralized algorithm
Channel allocation
Complexity
Complexity theory
D2D caching
Device-to-device communication
distributed algorithm
Distributed algorithms
Electronic devices
Greedy algorithms
Iterative methods
Optimization
Radio equipment
Receivers
Resource allocation
Resource management
Transmitters
weighted 4-uniform hypergraph
ISSN:2169-3536, 2169-3536
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Caching popular contents at mobile devices can potentially improve the quality of service for mobile users and relieve traffic burden of base station in cellular networks. In this paper, we jointly consider the resource allocation, the cached contents, and the distance between two devices for the optimal device pairing problem in centralized and distributed cases, where the BS is the central controller in the centralized case. The joint optimization problem of device-to-device (D2D) caching with channel allocation is formulated as a weighted four-uniform hypergraph model. The optimal solution for the problem is 4-D maximum weighted matching (4-DMWM), which is NP-hard unfortunately. To approach the 4-DMWM with low-complexity, we adopt the greedy algorithm and the squareIMP algorithm in the centralized case. Moreover, distributed algorithms are also designed for the caching problem in both synchronous and asynchronous cases. The simulation results will illustrate that the squareIMP algorithm can be used to get a better transmission rate with the complexity of O(n 5 ), while the greedy algorithm can be used in the case with stringent latency requirement for centralized 4-DMWM problem. The sum rate of distributed asynchronous algorithm is close to the centralized greedy algorithm with the complexity of O(n 2 ) for each device. However, the simulation result of the synchronous algorithm is slightly lower than the centralized algorithm, where each device performs O(n 2 ) computational operations in each iteration. Therefore, the algorithms proposed in this paper can be used in different cases for solving optimal D2D pairing and channel allocation problem.
AbstractList Caching popular contents at mobile devices can potentially improve the quality of service for mobile users and relieve traffic burden of base station in cellular networks. In this paper, we jointly consider the resource allocation, the cached contents, and the distance between two devices for the optimal device pairing problem in centralized and distributed cases, where the BS is the central controller in the centralized case. The joint optimization problem of device-to-device (D2D) caching with channel allocation is formulated as a weighted four-uniform hypergraph model. The optimal solution for the problem is 4-D maximum weighted matching (4-DMWM), which is NP-hard unfortunately. To approach the 4-DMWM with low-complexity, we adopt the greedy algorithm and the squareIMP algorithm in the centralized case. Moreover, distributed algorithms are also designed for the caching problem in both synchronous and asynchronous cases. The simulation results will illustrate that the squareIMP algorithm can be used to get a better transmission rate with the complexity of O(n5), while the greedy algorithm can be used in the case with stringent latency requirement for centralized 4-DMWM problem. The sum rate of distributed asynchronous algorithm is close to the centralized greedy algorithm with the complexity of O(n2) for each device. However, the simulation result of the synchronous algorithm is slightly lower than the centralized algorithm, where each device performs O(n2) computational operations in each iteration. Therefore, the algorithms proposed in this paper can be used in different cases for solving optimal D2D pairing and channel allocation problem.
Caching popular contents at mobile devices can potentially improve the quality of service for mobile users and relieve traffic burden of base station in cellular networks. In this paper, we jointly consider the resource allocation, the cached contents, and the distance between two devices for the optimal device pairing problem in centralized and distributed cases, where the BS is the central controller in the centralized case. The joint optimization problem of device-to-device (D2D) caching with channel allocation is formulated as a weighted four-uniform hypergraph model. The optimal solution for the problem is 4-D maximum weighted matching (4-DMWM), which is NP-hard unfortunately. To approach the 4-DMWM with low-complexity, we adopt the greedy algorithm and the squareIMP algorithm in the centralized case. Moreover, distributed algorithms are also designed for the caching problem in both synchronous and asynchronous cases. The simulation results will illustrate that the squareIMP algorithm can be used to get a better transmission rate with the complexity of O(n 5 ), while the greedy algorithm can be used in the case with stringent latency requirement for centralized 4-DMWM problem. The sum rate of distributed asynchronous algorithm is close to the centralized greedy algorithm with the complexity of O(n 2 ) for each device. However, the simulation result of the synchronous algorithm is slightly lower than the centralized algorithm, where each device performs O(n 2 ) computational operations in each iteration. Therefore, the algorithms proposed in this paper can be used in different cases for solving optimal D2D pairing and channel allocation problem.
Author Wei Chen
Bo Bai
Lu Miao
Author_xml – sequence: 1
  givenname: Lu
  orcidid: 0000-0003-2337-9319
  surname: Miao
  fullname: Miao, Lu
– sequence: 2
  givenname: Bo
  surname: Bai
  fullname: Bai, Bo
– sequence: 3
  givenname: Wei
  orcidid: 0000-0002-9066-1448
  surname: Chen
  fullname: Chen, Wei
BookMark eNqFUcFu3CAUtKpUaprmC3JB6tlbjLGxe3PtNImUKJXSqkf0gOddVg5sMXtovr44jqKql3Lh8ZiZBzPvsxPnHWbZRUE3RUHbT13fXz48bBgt6g2rOWWCvslOWVG3eVmV9clf9bvsfJ73NK0mtSpxmj3xfLj7eUe6wyF40Dsy-kD6VFi3JV9gRkPuD9E-wkQGNpBvYMNyA86QfgfO4US6afIaovXuM-nRxQCTfUq8BTPYOQarjjGdu2nrg427RzLgbLfuQ_Z2hGnG85f9LPvx9fJ7f53f3l_d9N1trjltYg6qaDTjbNSjKhXjAhstalWOo0I-CgaiNRyhqrUpaqo5B10qBWVDjQEcdXmW3ay6xsNeHkL6TPgtPVj53PBhKyFEqyeUwJURoEUFteCATatoGmSMadFghYvWx1UrufXriHOUe38MLj1fMl5VLW8YYwlVrigd_DwHHF-nFlQumck1M7lkJl8yS6z2H5a28dnXZKmd_sO9WLkWEV-nCdFwUbDyDxJvqFo
CODEN IAECCG
CitedBy_id crossref_primary_10_1109_ACCESS_2020_2981665
crossref_primary_10_3390_app12031343
crossref_primary_10_1002_dac_5112
crossref_primary_10_1109_ACCESS_2018_2871142
crossref_primary_10_1109_JSYST_2022_3148445
crossref_primary_10_1177_1550147720951337
Cites_doi 10.1109/TIT.2011.2110170
10.1109/INFCOM.2011.5935079
10.1109/ICC.2016.7510697
10.1109/WCSP.2015.7341306
10.1109/TWC.2011.092011.101114
10.1109/TWC.2011.060811.102120
10.1109/JSAC.2011.110116
10.1109/TIT.2012.2205733
10.4108/eai.26-10-2015.150598
10.1109/SPAWC.2016.7536886
10.1109/TAC.2015.2512043
10.1109/TIT.2015.2504556
10.1109/TWC.2015.2512984
10.1109/TIT.2012.2227454
10.1109/MWC.2016.7553029
10.1109/GLOCOM.2016.7841692
10.1109/TIT.2013.2281606
10.1109/MCOM.2014.6736753
10.1109/JSAC.2015.2452672
10.1109/ICC.2016.7510807
10.1007/3-540-44985-X_19
10.1109/JSAC.2012.120219
10.1016/S0020-0190(02)00393-9
10.1109/TNET.2014.2317316
10.1109/ISIT.2016.7541655
10.1109/18.910572
10.1109/JSAC.2013.SUP.0513031
10.1109/TCOMM.2010.04.080478
10.1007/978-1-84882-507-9
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
DBID 97E
ESBDL
RIA
RIE
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
DOA
DOI 10.1109/ACCESS.2016.2640270
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE Xplore Open Access Journals
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL) - NZ
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Engineered Materials Abstracts
METADEX
Technology Research Database
Materials Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Materials Research Database
Engineered Materials Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
METADEX
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Materials Research Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2169-3536
EndPage 9224
ExternalDocumentID oai_doaj_org_article_a4bd7ac75a674ae89b0b3fddd9ede5ec
10_1109_ACCESS_2016_2640270
7784712
Genre orig-research
GrantInformation_xml – fundername: National Basic Research Program of China (973 Program)
  grantid: 2013CB336600; 2012CB316000
– fundername: National Natural Science Foundation of China
  grantid: 61671269; 61322111; 61321061; 61401249
  funderid: 10.13039/501100001809
– fundername: Specialized Research Fund for the Doctoral Program of Higher Education
  grantid: 20130002120001
GroupedDBID 0R~
4.4
5VS
6IK
97E
AAJGR
ABAZT
ABVLG
ACGFS
ADBBV
AGSQL
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
ESBDL
GROUPED_DOAJ
IPLJI
JAVBF
KQ8
M43
M~E
O9-
OCL
OK1
RIA
RIE
RNS
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
RIG
ID FETCH-LOGICAL-c408t-ab18c242fcfb3b247e8c76b3ffbe4f72a79d4ea56cd160c44ac3bba380ddaefc3
IEDL.DBID DOA
ISICitedReferencesCount 9
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000395560800021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2169-3536
IngestDate Fri Oct 03 12:49:39 EDT 2025
Mon Jun 30 06:19:33 EDT 2025
Sat Nov 29 06:21:57 EST 2025
Tue Nov 18 21:30:18 EST 2025
Tue Aug 26 16:43:02 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/OAPA.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c408t-ab18c242fcfb3b247e8c76b3ffbe4f72a79d4ea56cd160c44ac3bba380ddaefc3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-2337-9319
0000-0002-9066-1448
OpenAccessLink https://doaj.org/article/a4bd7ac75a674ae89b0b3fddd9ede5ec
PQID 2455948222
PQPubID 4845423
PageCount 12
ParticipantIDs crossref_citationtrail_10_1109_ACCESS_2016_2640270
crossref_primary_10_1109_ACCESS_2016_2640270
doaj_primary_oai_doaj_org_article_a4bd7ac75a674ae89b0b3fddd9ede5ec
ieee_primary_7784712
proquest_journals_2455948222
PublicationCentury 2000
PublicationDate 20160000
2016-00-00
20160101
2016-01-01
PublicationDateYYYYMMDD 2016-01-01
PublicationDate_xml – year: 2016
  text: 20160000
PublicationDecade 2010
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE access
PublicationTitleAbbrev Access
PublicationYear 2016
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref31
ba?tu? (ref7) 2015
ref30
ref11
ref32
ref10
ref2
ref17
ref16
ref19
ref18
miao (ref20) 0
ref24
ref23
ref25
ref22
ref21
ref28
ref27
ref29
ref8
ref9
ref4
ref3
ref6
ref5
yu (ref1) 2011; 10
(ref26) 2009
References_xml – ident: ref24
  doi: 10.1109/TIT.2011.2110170
– start-page: 1
  year: 2015
  ident: ref7
  article-title: Cache-enabled small cell networks: Modeling and tradeoffs
  publication-title: EURASIP J Wireless Commun Netw
– ident: ref30
  doi: 10.1109/INFCOM.2011.5935079
– ident: ref9
  doi: 10.1109/ICC.2016.7510697
– ident: ref32
  doi: 10.1109/WCSP.2015.7341306
– ident: ref11
  doi: 10.1109/TWC.2011.092011.101114
– volume: 10
  start-page: 2752
  year: 2011
  ident: ref1
  article-title: Resource sharing optimization for device-to-device communication underlaying cellular networks
  publication-title: IEEE Trans Wireless Commun
  doi: 10.1109/TWC.2011.060811.102120
– ident: ref15
  doi: 10.1109/JSAC.2011.110116
– ident: ref4
  doi: 10.1109/TIT.2012.2205733
– ident: ref16
  doi: 10.4108/eai.26-10-2015.150598
– ident: ref18
  doi: 10.1109/SPAWC.2016.7536886
– ident: ref31
  doi: 10.1109/TAC.2015.2512043
– ident: ref5
  doi: 10.1109/TIT.2015.2504556
– ident: ref13
  doi: 10.1109/TWC.2015.2512984
– ident: ref28
  doi: 10.1109/TIT.2012.2227454
– ident: ref17
  doi: 10.1109/MWC.2016.7553029
– ident: ref10
  doi: 10.1109/GLOCOM.2016.7841692
– ident: ref6
  doi: 10.1109/TIT.2013.2281606
– ident: ref3
  doi: 10.1109/MCOM.2014.6736753
– ident: ref8
  doi: 10.1109/JSAC.2015.2452672
– ident: ref14
  doi: 10.1109/ICC.2016.7510807
– ident: ref21
  doi: 10.1007/3-540-44985-X_19
– ident: ref29
  doi: 10.1109/JSAC.2012.120219
– ident: ref22
  doi: 10.1016/S0020-0190(02)00393-9
– year: 2009
  ident: ref26
  publication-title: Evolved Universal Terrestrial Radio Access (EUTRA) Physical Channels and Modulation
– ident: ref12
  doi: 10.1109/TNET.2014.2317316
– year: 0
  ident: ref20
  article-title: 4-DMWM approach for caching based optimal D2D pairing and channel allocation
  publication-title: submitted to Proc ICC 2017
– ident: ref19
  doi: 10.1109/ISIT.2016.7541655
– ident: ref25
  doi: 10.1109/18.910572
– ident: ref2
  doi: 10.1109/JSAC.2013.SUP.0513031
– ident: ref23
  doi: 10.1109/TCOMM.2010.04.080478
– ident: ref27
  doi: 10.1007/978-1-84882-507-9
SSID ssj0000816957
Score 2.0688345
Snippet Caching popular contents at mobile devices can potentially improve the quality of service for mobile users and relieve traffic burden of base station in...
SourceID doaj
proquest
crossref
ieee
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 9213
SubjectTerms 4-dimensional maximum weighted matching (4-DMWM)
Algorithms
Caching
Cellular communication
centralized algorithm
Channel allocation
Complexity
Complexity theory
D2D caching
Device-to-device communication
distributed algorithm
Distributed algorithms
Electronic devices
Greedy algorithms
Iterative methods
Optimization
Radio equipment
Receivers
Resource allocation
Resource management
Transmitters
weighted 4-uniform hypergraph
SummonAdditionalLinks – databaseName: IEEE Electronic Library (IEL) - NZ
  dbid: RIE
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELZKxQEOvArqQkE-cGxaJ7HjhNt2Q8WlpQcQvVl-jGGlbRZttxz665lx3AgEQuKWRB7L1mfP2JOZbxh7W_oYu9bZwlWNLaSCsnDCuqKOrg6WsjF9SMUm9Pl5e3nZXeywwykXBgBS8Bkc0WP6lx_W_oZcZcdaky5FhXtPaz3mak3-FCog0SmdiYVK0R3PFwucA0VvNUdo9vH-JX4zPomjPxdV-UMTJ_Ny-vj_BvaEPcrHSD4fcX_KdmB4xh7-Qi64x25l0Z99OePzzBrO8XjKF2PsJD9B4xX4R9QXV9hNX_X8wi5JjtshcEo5GAC7X5GpI-je8ewGXt6iHLXpiXGXimXh-3z1db1Zbr9d8T4FhDxnn0_ff1p8KHKlhcJL0W4L68rWo7GOHiFyldTQet24OkYHMurK6i5IsKrxoWyEl9L62jlbtyIEC9HXL9jusB5gn3HVaB1LK7R2qB8qcHhilKLG5RBUqLyaseoOAuMzDTlVw1iZdB0RnRlxM4SbybjN2OEk9H1k4fh38xPCdmpKFNrpA4Jm8o40VrqgrdfKNlpaaDsncMIhhA4CKPAztkdAT51kjGfs4G6lmLzdr00lFdHe4Fnr5d-lXrEHNMDRd3PAdrebG3jN7vsf2-X15k1ayT8BbTDzpg
  priority: 102
  providerName: IEEE
Title 4-DMWM Approach for Caching Based Optimal D2D Pairing and Channel Allocation: Centralized and Distributed Algorithm Design
URI https://ieeexplore.ieee.org/document/7784712
https://www.proquest.com/docview/2455948222
https://doaj.org/article/a4bd7ac75a674ae89b0b3fddd9ede5ec
Volume 4
WOSCitedRecordID wos000395560800021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NT9wwELUQ4kAPVVtAXUqRDz2S4jh2nPS2bEC9LOVAVW6WP9uVloCWpQcO_e2dccxqKyS49BIpke3YfuOZsTV-Q8in0sXYNtYUltemEDKUhWXGFlW0lTd4G9P5lGxCnZ83V1ftxVqqL4wJG-iBh4k7NsJ6ZZySplbChKa1zFbRe98GH2RwqH3B61nbTCUd3JR1K1WmGSpZezyeTGBEGMtVfwYnAHZj7B9TlBj7c4qVJ3o5GZuzN-R19hLpeOjdW7IR-nfk1Rp34A55EEU3_TGl40wKTsH7pJMhNJKegG3y9Buog2topuMdvTAzrEdN7yneKOgDND9HS4bIfKH5lHf2APWwTIeEupgLC97H8583i9ny1zXtUrzHLvl-dno5-VrkRAqFE6xZFsaWjQNbHB0gYLlQoXGqhmmMNoiouFGtF8HI2vmyZk4I4yprTdUw702Irtojm_1NH94TKmulYmmYUhaWPw8WHELBKkDbS8-dHBH-OKfaZZZxTHYx12m3wVo9AKERCJ2BGJGjVaXbgWTj-eInCNaqKDJkpw8gNzrLjX5JbkZkB6FeNaIU2mk-IgeP0Ou8mu80FxJZbcCV2v8fv_5AtnE4w0HOAdlcLu7DR7Llfi9nd4vDJMjwnP45PUzXEf8C6TH7cw
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELaqggQceBXE0hZ84Ni0jmPHSW_bDVUR3aWHInqz_EpZaZtF2y2H_npmHDcCFSFxSyKPZeuzZ-zJzDeEfMhd29aVNZnlpcmEDHlmmbFZ0drCG8zGdD4Wm1CzWXVxUZ9tkL0hFyaEEIPPwj4-xn_5fulu0FV2oBTqUlC4D6QQPO-ztQaPCpaQqKVK1EI5qw_GkwnMAuO3yn0w_HADY3-Yn8jSn8qq3NPF0cAcP_u_oT0nT9NBko575F-QjdC9JE9-oxfcIrcia6bfpnSceMMpHFDppI-epEdgvjz9AhrjCrppeEPPzBzlqOk8xaSDLkD3CzR2CN4hTY7g-S3IYZsGOXexXBa8jxeXy9V8_f2KNjEk5BX5evzxfHKSpVoLmROsWmfG5pUDc906AMlyoULlVGmLtrVBtIobVXsRjCydz0vmhDCusNYUFfPehNYVr8lmt-zCG0JlqVSbG6aUBQ3Bg4Uzo2AFLAgvPXdyRPgdBNolInKsh7HQ8ULCat3jphE3nXAbkb1B6EfPw_Hv5keI7dAUSbTjBwBNpz2pjbBeGaekKZUwoaotgwl77-vggwxuRLYQ6KGThPGI7NytFJ02_LXmQiLxDZy23v5d6j15dHI-PdWnn2aft8ljHGzvydkhm-vVTdglD93P9fx69S6u6l85Ifbt
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=4-DMWM+Approach+for+Caching+Based+Optimal+D2D+Pairing+and+Channel+Allocation%3A+Centralized+and+Distributed+Algorithm+Design&rft.jtitle=IEEE+access&rft.au=Lu+Miao&rft.au=Bo+Bai&rft.au=Wei+Chen&rft.date=2016&rft.pub=IEEE&rft.eissn=2169-3536&rft.volume=4&rft.spage=9213&rft.epage=9224&rft_id=info:doi/10.1109%2FACCESS.2016.2640270&rft.externalDocID=7784712
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon