Effective Small Social Community Aware D2D Resource Allocation Underlaying Cellular Networks
Social-aware device-to-device (D2D) resource allocation utilizes social ties in human-formed social networks to allocate spectrum resources between D2D users and cellular users. In this letter, we consider the small size social communities formed by people with similar interests and exploit them to...
Gespeichert in:
| Veröffentlicht in: | IEEE wireless communications letters 2017-12, Vol.6 (6), p.822-825 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 825 |
|---|---|
| container_issue | 6 |
| container_start_page | 822 |
| container_title | IEEE wireless communications letters |
| container_volume | 6 |
| creator | Feng, Zebing Feng, Zhiyong Gulliver, T. Aaron |
| description | Social-aware device-to-device (D2D) resource allocation utilizes social ties in human-formed social networks to allocate spectrum resources between D2D users and cellular users. In this letter, we consider the small size social communities formed by people with similar interests and exploit them to optimize the resource allocation of the communities. This results in an optimal graph matching problem among communities to solve the D2D resource allocation problem. Solutions are derived via bipartite graph matching and an effective small social community resource allocation algorithm corresponding to the cases of small and high D2D user loads. |
| doi_str_mv | 10.1109/LWC.2017.2747555 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_ieee_primary_8023857</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8023857</ieee_id><sourcerecordid>10_1109_LWC_2017_2747555</sourcerecordid><originalsourceid>FETCH-LOGICAL-c263t-b54a4d9d596392d2e08b064da99701167d3fed5969e7998210a82f015fc6e7b63</originalsourceid><addsrcrecordid>eNo9kE1LAzEQhoMoWGrvgpf8ga352CSbY9nWDygK1uJFWNLsRFazG0l2Lf33trR0LjPwvs8cHoRuKZlSSvT98qOcMkLVlKlcCSEu0IhRyTLGc3F5vrm6RpOUvsl-JKGMFiP0uXAObN_8AV61xnu8CrYxHpehbYeu6Xd4tjUR8JzN8RukMEQLeOZ9sKZvQofXXQ3Rm13TfeESvB-8ifgF-m2IP-kGXTnjE0xOe4zWD4v38ilbvj4-l7NlZpnkfbYRuclrXQstuWY1A1JsiMxro7UilEpVcweHVIPSumCUmII5QoWzEtRG8jEix782hpQiuOo3Nq2Ju4qS6iCo2guqDoKqk6A9cndEGgA41wvCeCEU_wfBRmE6</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Effective Small Social Community Aware D2D Resource Allocation Underlaying Cellular Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Feng, Zebing ; Feng, Zhiyong ; Gulliver, T. Aaron</creator><creatorcontrib>Feng, Zebing ; Feng, Zhiyong ; Gulliver, T. Aaron</creatorcontrib><description>Social-aware device-to-device (D2D) resource allocation utilizes social ties in human-formed social networks to allocate spectrum resources between D2D users and cellular users. In this letter, we consider the small size social communities formed by people with similar interests and exploit them to optimize the resource allocation of the communities. This results in an optimal graph matching problem among communities to solve the D2D resource allocation problem. Solutions are derived via bipartite graph matching and an effective small social community resource allocation algorithm corresponding to the cases of small and high D2D user loads.</description><identifier>ISSN: 2162-2337</identifier><identifier>EISSN: 2162-2345</identifier><identifier>DOI: 10.1109/LWC.2017.2747555</identifier><identifier>CODEN: IWCLAF</identifier><language>eng</language><publisher>IEEE</publisher><subject>Complexity theory ; Device-to-device communication ; Device-to-device communications ; graph matching ; Interference ; Optimization ; resource allocation ; Resource management ; social networks ; Switches</subject><ispartof>IEEE wireless communications letters, 2017-12, Vol.6 (6), p.822-825</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c263t-b54a4d9d596392d2e08b064da99701167d3fed5969e7998210a82f015fc6e7b63</citedby><cites>FETCH-LOGICAL-c263t-b54a4d9d596392d2e08b064da99701167d3fed5969e7998210a82f015fc6e7b63</cites><orcidid>0000-0001-5865-6094 ; 0000-0001-5322-222X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8023857$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8023857$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Feng, Zebing</creatorcontrib><creatorcontrib>Feng, Zhiyong</creatorcontrib><creatorcontrib>Gulliver, T. Aaron</creatorcontrib><title>Effective Small Social Community Aware D2D Resource Allocation Underlaying Cellular Networks</title><title>IEEE wireless communications letters</title><addtitle>LWC</addtitle><description>Social-aware device-to-device (D2D) resource allocation utilizes social ties in human-formed social networks to allocate spectrum resources between D2D users and cellular users. In this letter, we consider the small size social communities formed by people with similar interests and exploit them to optimize the resource allocation of the communities. This results in an optimal graph matching problem among communities to solve the D2D resource allocation problem. Solutions are derived via bipartite graph matching and an effective small social community resource allocation algorithm corresponding to the cases of small and high D2D user loads.</description><subject>Complexity theory</subject><subject>Device-to-device communication</subject><subject>Device-to-device communications</subject><subject>graph matching</subject><subject>Interference</subject><subject>Optimization</subject><subject>resource allocation</subject><subject>Resource management</subject><subject>social networks</subject><subject>Switches</subject><issn>2162-2337</issn><issn>2162-2345</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1LAzEQhoMoWGrvgpf8ga352CSbY9nWDygK1uJFWNLsRFazG0l2Lf33trR0LjPwvs8cHoRuKZlSSvT98qOcMkLVlKlcCSEu0IhRyTLGc3F5vrm6RpOUvsl-JKGMFiP0uXAObN_8AV61xnu8CrYxHpehbYeu6Xd4tjUR8JzN8RukMEQLeOZ9sKZvQofXXQ3Rm13TfeESvB-8ifgF-m2IP-kGXTnjE0xOe4zWD4v38ilbvj4-l7NlZpnkfbYRuclrXQstuWY1A1JsiMxro7UilEpVcweHVIPSumCUmII5QoWzEtRG8jEix782hpQiuOo3Nq2Ju4qS6iCo2guqDoKqk6A9cndEGgA41wvCeCEU_wfBRmE6</recordid><startdate>201712</startdate><enddate>201712</enddate><creator>Feng, Zebing</creator><creator>Feng, Zhiyong</creator><creator>Gulliver, T. Aaron</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-5865-6094</orcidid><orcidid>https://orcid.org/0000-0001-5322-222X</orcidid></search><sort><creationdate>201712</creationdate><title>Effective Small Social Community Aware D2D Resource Allocation Underlaying Cellular Networks</title><author>Feng, Zebing ; Feng, Zhiyong ; Gulliver, T. Aaron</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c263t-b54a4d9d596392d2e08b064da99701167d3fed5969e7998210a82f015fc6e7b63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Complexity theory</topic><topic>Device-to-device communication</topic><topic>Device-to-device communications</topic><topic>graph matching</topic><topic>Interference</topic><topic>Optimization</topic><topic>resource allocation</topic><topic>Resource management</topic><topic>social networks</topic><topic>Switches</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Feng, Zebing</creatorcontrib><creatorcontrib>Feng, Zhiyong</creatorcontrib><creatorcontrib>Gulliver, T. Aaron</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><jtitle>IEEE wireless communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Feng, Zebing</au><au>Feng, Zhiyong</au><au>Gulliver, T. Aaron</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Effective Small Social Community Aware D2D Resource Allocation Underlaying Cellular Networks</atitle><jtitle>IEEE wireless communications letters</jtitle><stitle>LWC</stitle><date>2017-12</date><risdate>2017</risdate><volume>6</volume><issue>6</issue><spage>822</spage><epage>825</epage><pages>822-825</pages><issn>2162-2337</issn><eissn>2162-2345</eissn><coden>IWCLAF</coden><abstract>Social-aware device-to-device (D2D) resource allocation utilizes social ties in human-formed social networks to allocate spectrum resources between D2D users and cellular users. In this letter, we consider the small size social communities formed by people with similar interests and exploit them to optimize the resource allocation of the communities. This results in an optimal graph matching problem among communities to solve the D2D resource allocation problem. Solutions are derived via bipartite graph matching and an effective small social community resource allocation algorithm corresponding to the cases of small and high D2D user loads.</abstract><pub>IEEE</pub><doi>10.1109/LWC.2017.2747555</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0001-5865-6094</orcidid><orcidid>https://orcid.org/0000-0001-5322-222X</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2162-2337 |
| ispartof | IEEE wireless communications letters, 2017-12, Vol.6 (6), p.822-825 |
| issn | 2162-2337 2162-2345 |
| language | eng |
| recordid | cdi_ieee_primary_8023857 |
| source | IEEE Electronic Library (IEL) |
| subjects | Complexity theory Device-to-device communication Device-to-device communications graph matching Interference Optimization resource allocation Resource management social networks Switches |
| title | Effective Small Social Community Aware D2D Resource Allocation Underlaying Cellular Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T07%3A33%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Effective%20Small%20Social%20Community%20Aware%20D2D%20Resource%20Allocation%20Underlaying%20Cellular%20Networks&rft.jtitle=IEEE%20wireless%20communications%20letters&rft.au=Feng,%20Zebing&rft.date=2017-12&rft.volume=6&rft.issue=6&rft.spage=822&rft.epage=825&rft.pages=822-825&rft.issn=2162-2337&rft.eissn=2162-2345&rft.coden=IWCLAF&rft_id=info:doi/10.1109/LWC.2017.2747555&rft_dat=%3Ccrossref_RIE%3E10_1109_LWC_2017_2747555%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8023857&rfr_iscdi=true |