Wireless Distributed Storage in Socially Enabled D2D Communications

Wireless distributed storage systems can potentially relieve the centralized traffic burden of base stations (BSs), and further improve system reliability for content sharing in device-to-device (D2D) communications. Mobile devices [i.e., content requesters (CRs)] can not only download their desired...

Full description

Bibliographic Details
Main Authors: Li Wang, Huaqing Wu, Zhu Han
Format: Article
Language:English
Published: IEEE 2016-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/7440774/
id doaj-ba96b557ddec4a009d3c13a47cb7808d
record_format Article
spelling doaj-ba96b557ddec4a009d3c13a47cb7808d2021-03-29T19:41:00ZengIEEEIEEE Access2169-35362016-01-0141971198410.1109/ACCESS.2016.25466857440774Wireless Distributed Storage in Socially Enabled D2D CommunicationsLi Wang0Huaqing Wu1Zhu Han2Beijing Key Laboratory of Work Safety Intelligent Monitoring, School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing, ChinaBeijing Key Laboratory of Work Safety Intelligent Monitoring, School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing, ChinaDepartment of Electrical and Engineering, University of Houston, Houston, TX, USAWireless distributed storage systems can potentially relieve the centralized traffic burden of base stations (BSs), and further improve system reliability for content sharing in device-to-device (D2D) communications. Mobile devices [i.e., content requesters (CRs)] can not only download their desired contents from serving BSs, but can also get them from neighboring devices [i.e., content helpers (CHs)] with possession of the contents. However, D2D links between CRs and CHs are not necessarily stable, due to user mobility and the time-varying property of wireless links. This paper focuses on the utilization of socially enabled D2D links to deliver the desired contents based on distributed storage. We evaluate the success rate for downloading and repairing in D2D-assisted networks accordingly, by analyzing statistic social interaction information for potential D2D links. Thus, it is necessary to maintain or assign enough qualified D2D links to afford content downloading and repairing from neighboring devices. To reduce the overall system transmission cost, this paper further proposes a hierarchical bi-partite method to guarantee at least k admissible D2D links according to their statistical channel state information, by considering one type of erasure correcting codes, the maximum distance separable code. Simulation results demonstrate the performance and advantage of our proposed scheme.https://ieeexplore.ieee.org/document/7440774/Wireless distributed storagesocial interactionmaximum distance separable code
collection DOAJ
language English
format Article
sources DOAJ
author Li Wang
Huaqing Wu
Zhu Han
spellingShingle Li Wang
Huaqing Wu
Zhu Han
Wireless Distributed Storage in Socially Enabled D2D Communications
IEEE Access
Wireless distributed storage
social interaction
maximum distance separable code
author_facet Li Wang
Huaqing Wu
Zhu Han
author_sort Li Wang
title Wireless Distributed Storage in Socially Enabled D2D Communications
title_short Wireless Distributed Storage in Socially Enabled D2D Communications
title_full Wireless Distributed Storage in Socially Enabled D2D Communications
title_fullStr Wireless Distributed Storage in Socially Enabled D2D Communications
title_full_unstemmed Wireless Distributed Storage in Socially Enabled D2D Communications
title_sort wireless distributed storage in socially enabled d2d communications
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2016-01-01
description Wireless distributed storage systems can potentially relieve the centralized traffic burden of base stations (BSs), and further improve system reliability for content sharing in device-to-device (D2D) communications. Mobile devices [i.e., content requesters (CRs)] can not only download their desired contents from serving BSs, but can also get them from neighboring devices [i.e., content helpers (CHs)] with possession of the contents. However, D2D links between CRs and CHs are not necessarily stable, due to user mobility and the time-varying property of wireless links. This paper focuses on the utilization of socially enabled D2D links to deliver the desired contents based on distributed storage. We evaluate the success rate for downloading and repairing in D2D-assisted networks accordingly, by analyzing statistic social interaction information for potential D2D links. Thus, it is necessary to maintain or assign enough qualified D2D links to afford content downloading and repairing from neighboring devices. To reduce the overall system transmission cost, this paper further proposes a hierarchical bi-partite method to guarantee at least k admissible D2D links according to their statistical channel state information, by considering one type of erasure correcting codes, the maximum distance separable code. Simulation results demonstrate the performance and advantage of our proposed scheme.
topic Wireless distributed storage
social interaction
maximum distance separable code
url https://ieeexplore.ieee.org/document/7440774/
work_keys_str_mv AT liwang wirelessdistributedstorageinsociallyenabledd2dcommunications
AT huaqingwu wirelessdistributedstorageinsociallyenabledd2dcommunications
AT zhuhan wirelessdistributedstorageinsociallyenabledd2dcommunications
_version_ 1724195868087681024