This paper investigates data uploading in cellular networks with the consideration of device-to-device (D2D) communications. A generalized data uploading scheme is proposed by leveraging D2D cooperation among the devices to reduce the data uploading time. In this scheme, we extend the conventional schemes on cooperative D2D data uploading for cellular networks to a more general case, which considers D2D cooperation among both the devices with or without uploading data. To motivate D2D cooperation among all available devices, we organize the devices within communication range by offering them rewards to construct multi-hop D2D chains for data uploading. Specifically, we formulate the problem of chain formation among the devices for data uploading as a coalitional game. Based on merge-and-split rules, we develop a coalition formation algorithm to obtain the solution for the formulated coalitional game with convergence on a stable coalitional structure. Finally, extensive numerical results show the effectiveness of our proposed scheme in reducing the average data uploading time.
Xiaolan LIU
Future University Hakodate,Chuzhou University
Lisheng MA
Chuzhou University
Xiaohong JIANG
Future University Hakodate
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Xiaolan LIU, Lisheng MA, Xiaohong JIANG, "A Generalized Data Uploading Scheme for D2D-Enhanced Cellular Networks" in IEICE TRANSACTIONS on Communications,
vol. E102-B, no. 9, pp. 1914-1923, September 2019, doi: 10.1587/transcom.2018EBP3233.
Abstract: This paper investigates data uploading in cellular networks with the consideration of device-to-device (D2D) communications. A generalized data uploading scheme is proposed by leveraging D2D cooperation among the devices to reduce the data uploading time. In this scheme, we extend the conventional schemes on cooperative D2D data uploading for cellular networks to a more general case, which considers D2D cooperation among both the devices with or without uploading data. To motivate D2D cooperation among all available devices, we organize the devices within communication range by offering them rewards to construct multi-hop D2D chains for data uploading. Specifically, we formulate the problem of chain formation among the devices for data uploading as a coalitional game. Based on merge-and-split rules, we develop a coalition formation algorithm to obtain the solution for the formulated coalitional game with convergence on a stable coalitional structure. Finally, extensive numerical results show the effectiveness of our proposed scheme in reducing the average data uploading time.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBP3233/_p
Copy
@ARTICLE{e102-b_9_1914,
author={Xiaolan LIU, Lisheng MA, Xiaohong JIANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Generalized Data Uploading Scheme for D2D-Enhanced Cellular Networks},
year={2019},
volume={E102-B},
number={9},
pages={1914-1923},
abstract={This paper investigates data uploading in cellular networks with the consideration of device-to-device (D2D) communications. A generalized data uploading scheme is proposed by leveraging D2D cooperation among the devices to reduce the data uploading time. In this scheme, we extend the conventional schemes on cooperative D2D data uploading for cellular networks to a more general case, which considers D2D cooperation among both the devices with or without uploading data. To motivate D2D cooperation among all available devices, we organize the devices within communication range by offering them rewards to construct multi-hop D2D chains for data uploading. Specifically, we formulate the problem of chain formation among the devices for data uploading as a coalitional game. Based on merge-and-split rules, we develop a coalition formation algorithm to obtain the solution for the formulated coalitional game with convergence on a stable coalitional structure. Finally, extensive numerical results show the effectiveness of our proposed scheme in reducing the average data uploading time.},
keywords={},
doi={10.1587/transcom.2018EBP3233},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - A Generalized Data Uploading Scheme for D2D-Enhanced Cellular Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1914
EP - 1923
AU - Xiaolan LIU
AU - Lisheng MA
AU - Xiaohong JIANG
PY - 2019
DO - 10.1587/transcom.2018EBP3233
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2019
AB - This paper investigates data uploading in cellular networks with the consideration of device-to-device (D2D) communications. A generalized data uploading scheme is proposed by leveraging D2D cooperation among the devices to reduce the data uploading time. In this scheme, we extend the conventional schemes on cooperative D2D data uploading for cellular networks to a more general case, which considers D2D cooperation among both the devices with or without uploading data. To motivate D2D cooperation among all available devices, we organize the devices within communication range by offering them rewards to construct multi-hop D2D chains for data uploading. Specifically, we formulate the problem of chain formation among the devices for data uploading as a coalitional game. Based on merge-and-split rules, we develop a coalition formation algorithm to obtain the solution for the formulated coalitional game with convergence on a stable coalitional structure. Finally, extensive numerical results show the effectiveness of our proposed scheme in reducing the average data uploading time.
ER -