Elsevier

Computer Networks

Volume 166, 15 January 2020, 106955
Computer Networks

On social-aware data uploading study of D2D-enabled cellular networks

https://doi.org/10.1016/j.comnet.2019.106955Get rights and content

Abstract

The data uploading study of device-to-device (D2D) enabled cellular networks is critical for supporting their applications. Available data uploading studies for D2D-enabled cellular networks mainly consider either the cooperative scenarios with full trust or no trust, where the devices in the network forward data with each other in full cooperative or noncooperative way, while largely neglecting the effect of human social relationships on the cooperation behaviors among the devices under real scenarios. As a first step to address this issue, this paper extends the previous works on cooperative D2D data uploading for cellular networks to a more real social network scenario and investigates social-aware data uploading in D2D-enable cellular networks. We first propose an incentive mechanism to compensate the resource consumption (e.g., energy, memory, and time spent) of devices on data uploading. With this incentive mechanism, the nearby devices can obtain rewards such that they are willing to construct a multi-hop D2D chain to assist the other devices for data uploading. To this end, we adopt coalitional game to formulate the D2D chain with careful consideration of social-aware data uploading, where each device acts as a player and the individual reward is modeled as the utility function. We further design a coalition formation algorithm with merge-and-split rules to determine the solution for formulated D2D chain. Extensive simulations are conducted to illustrate the performance improvement of our proposed scheme in comparison with that of other state-of-the-art schemes.

Introduction

To meet the ever increasing demand on data traffic such as video streaming and multimedia file sharing, device-to-device (D2D) communication has drawn considerable attention from both academia and industry in recent years. In D2D communication, nearby devices can bypass base station (BS) to direct communication with each other by reusing spectrum resources of cellular networks, which enables such a communication to have many distinctive features, such as short-range transmission, low energy consumption and high spectral utilization [1], [2]. Data uploading is a critical issue in D2D-enabled cellular networks, which illustrates that users could cooperate with each other to deliver data destined for BS in a store-and-forward way. It holds great promise of various applications including public safety, disaster response, environment monitoring, and traffic management [3]. To facilitate these applications with data uploading requirements of stringent delay and reliability, it deserves to study the data uploading scheme in D2D-enable cellular networks.

Available studies on data uploading in D2D-enabled cellular networks mainly focus on two cooperative scenarios with full trust and no trust. The former one represents that all devices help to forward data due to their trustworthy relationships, while the latter one is that none of the devices is willing to help to forward data due to their untrustworthy relationships. The data uploading schemes based on D2D cooperation with no trust were investigated in [4], [5], [6], [7], where [4], [5] studied how to optimize the performance indicators (i.e., data quality, energy consumption and data cost) and [6], [7] considered the problem of privacy preserving for devices. Later, the data uploading schemes based on D2D cooperation with full trust were explored in [8], [9], [10], [11], where [8], [9], [10] addressed the resource allocation problem for multiple D2D and cellular users using different theoretical methods (i.e., game theory and stochastic geometry). In addition, the authors [11] studied how to construct the multi-hop D2D chains for data uploading from a game theory point of view, and designed the coalition formation algorithm to reduce the data uploading time.

Remarkably, the aforementioned works only represent the two extreme cases of cooperative D2D data uploading and do not consider cooperative behaviors among the devices in real social networks. In these networks, the devices are carried by human beings who have social relationships with each other, and thus different devices have different cooperative relationships due to the knowledge of human social relationships. As a result, while cooperating with unfamiliar devices, the devices may expose themselves to potential privacy threats, or deliberately fabricate erroneous and false messages to interrupt data uploading. Moreover, these works assume that the devices participate in D2D cooperation voluntarily. In reality, to assist other devices for data uploading, the devices need to consume their own resources (e.g., time, energy, and channel) so that they are often reluctant to participate in D2D cooperation without sufficient incentive. Also, the cooperative D2D data uploading schemes in these works are not applicable for our considered cooperative scenario in real social networks.

Recently, there has been increased interest in utilizing social networking relationships among users to assist D2D communications. In [12], Li et al. investigated the impact of social network characteristics on D2D communication system, and proposed a social-aware D2D communication architecture to better understand D2D communication system. Considering the problem of the network traffic offloading for D2D communications, Zhang et al. [13] proposed a novel approach of social-aware D2D communication by exploiting social network layer and physical network layer. Datsika et al. [14] presented an energy efficient social-aware cooperative D2D MAC (SCD2D-MAC) protocol to reduce the energy consumption of D2D cooperation. Aoude et al. [15] developed a social-aware D2D data sharing Android mobile application and demonstrated its functionality and effectiveness under realistic operational constraints. Additionally, the problem of social-aware peer selection was investigated in [16], [17], [18], where Meng et al. [16] formulated a dynamic social-aware peer selection problem as a dynamic optimization problem and proposed the drift-plus penalty ratio algorithm to solve it. Wu et al. [17] formulated the social similarity (SS) aware D2D user equipment-to-network (UENW) relay selection (RS) issue as a multi-objective binary integer linear programming (MOBILP) problem, and further proposed a new two-stage D2D UENW selection scheme to ensure high system performances in terms of throughput, fairness and energy efficiency. Gao et al. [18] formulated the problem of dynamic peer selection with social awareness-aided spectrum-power trading into the infinite-horizon time-average renewal-reward problem, and the corresponding Lyapunov optimization concepts based drift-plus-penalty (DPP) algorithms were proposed to maximize the average sum energy efficiency.

Different from the above works, this paper investigates data uploading with the consideration of D2D cooperative behaviors in real social networks, and proposes an incentive mechanism to motivate more devices to participate in D2D cooperation, such that the data uploading latency can be reduced and the data uploading reliability can be enhanced. The main contributions of this paper are summarized as follows.

  • First,we extend the works of cooperative D2D data uploading to the more real social network scenario, where the devices carried by human beings have diverse cooperative behaviors due to the knowledge of human social relationships. This work covers the pervious works on cooperative D2D data uploading with full trust and no trust as the special cases.

  • A new incentive mechanism is then proposed to compensate for the resources consumption (e.g., energy, memory, and time spent) of devices in data uploading. With this incentive mechanism, the reward of each device is inversely proportional to the data uploading latency and directly proportional to the data uploading reliability. To maximize the reward received by each device, the nearby devices can construct a multi-hop D2D chain to assist the other devices for data uploading.

  • We further formulate D2D chain with careful consideration of social-aware data uploading as a coalitional game, where each device acts as a player and the individual reward is modeled as a utility function. Based on merge-and-split rules, we develop a coalition formation algorithm to determine the solution for formulated D2D chain.

  • Extensive simulations demonstrate that our work can achieve significant performance gain on successful ratio of data uploading in comparison with other state-of-the-art schemes.

The remainder of this paper is organized as follows. The system model is introduced in Section 2. We design an incentive mechanism in Section 3. Section 4 formulates cooperative D2D chain. We provide performance evaluation in Section 5. Finally, Section 6 concludes this paper.

Section snippets

System model

In this section, we introduce the system model of social-aware data uploading underlaying D2D-enabled cellular networks, including network model, communication model, transmission model and system workflow.

Incentive mechanism

The devices exert their effort levels (e.g., energy, memory, and time spent) to perform data uploading tasks, and then the system can offer the rewards (e.g., credit, money, etc.) to the devices for their contributions in return, which is called incentive mechanism. For example, if device i spends the time 5 s on the data uploading task. In return, the system platform should provide a reward 4$ per unit of time that device i exerts on the data uploading task. As a result, device i receives a

Cooperative D2D chain formation

In this section, we first introduce a coalitional game to formulate D2D chain formation with consideration of social-aware data uploading, and then present coalition formation algorithm based on merge-and-split rules to obtain the solution of the formulated D2D chain. Finally, we investigate the property of the proposed coalition formation algorithm in terms of computational complexity.

Performance evaluations

In this section, we provide simulation results to evaluate the performance of our proposed coalition formation algorithm. The evaluating settings, the impact of different parameters and the performance comparison with other data uploading schemes are presented as follows.

Conclusion

This paper investigated social-aware data uploading underlaying D2D-enabled cellular networks, and then proposed an incentive mechanism to compensate for the resource consumption of devices in data uploading. With this incentive mechanism, the nearby devices could obtain rewards such that they were willing to construct a multi-hop D2D chain to assist the other devices in data uploading. After that, we introduced coalitional game to formulate D2D chain with careful consideration of social-aware

Declaration of Competing Interest

The authors declare that there is no conflict of interest regarding the publication of this article.

Acknowledgments

This work was supported by the Open Project of the Shaanxi Key Laboratory of Network and System Security grant NSSOF1900109, National Natural Science Foundation of China grants 61962033 and 61702068, the Anhui NSF grant 1808085MF165, the Shaanxi Post-doctoral Research Grant 2018BSHEDZZ43, the Anhui Province grants gxgwfx2019060 and KJ2019A0643, the Anhui Provincial Department of Human Resources and Social Security for the Returned Overseas Chinese Scholars, the Yunnan Province grant

Xiaolan Liu received her B.S. and M.S. degrees in Electronic and Information Engineering form Naval Aeronautical University, China in 2007 and in Information and Communication Engineering from Dalian Maritime University, China in 2009, respectively. She is currently pursuing the Ph.D. degree at the School of Systems Information Science, Future University Hakodate, Japan and is also faculty member at the School of Computer and Information Engineering, Chuzhou University, China. Her research

References (51)

  • T. Sandholm et al.

    Coalition structure generation with worst case guarantees

    Artif. Intell.

    (1999)
  • A. Asadi et al.

    A survey on device-to-Device communication in cellular networks

    IEEE Commun. Surv. Tutorials

    (2014)
  • M. Ahmed et al.

    A survey on socially-Aware device-to-Device communications

    IEEE Commun. Surv. Tutorials

    (2018)
  • H. Nishiyama et al.

    Relay-by-Smartphone: realizing multihop device-to-Device communications

    IEEE Commun. Mag.

    (2014)
  • M. Siekkinen et al.

    Optimized upload strategies for live scalable video transmission from mobile mevices

    IEEE Trans. Mob. Comput.

    (2017)
  • L. Wang et al.

    Effsense: A Novel mobile crowd-Sensing framework for energy-Efficient and cost-Effective data uploading

    IEEE Trans. Syst. Man Cybern.: Syst.

    (2015)
  • R.B. Messaoud et al.

    Privacy preserving utility-aware mechanism for data uploading phase in participatory sensing

    IEEE Trans. Mob. Comput.

    (2018)
  • Z. Cai et al.

    A private and efficient mechanism for data uploading in smart cyber-Physical systems

    IEEE Trans. Netw. Sci. Eng.

    (2018)
  • Y. Li et al.

    Coalitional games for resource allocation in the device-to-Device uplink underlaying cellular networks

    IEEE Trans. Wireless Commun.

    (2014)
  • J. Dai et al.

    Analytical modeling of resource allocation in D2D overlaying multi-hop multi-channel uplink cellular networks

    IEEE Trans. Veh. Technol.

    (2017)
  • R. AliHemmati et al.

    Multi-Channel resource allocation toward ergodic rate maximization for underlay device-to-Device communications

    IEEE Trans. Wireless Commun.

    (2018)
  • L. Militano et al.

    A constrained coalition formation game for multihop D2D content uploading

    IEEE Trans. Wireless Commun.

    (2016)
  • Y. Li et al.

    Social-Aware D2D communications: qualitative insights and quantitative analysis

    IEEE Commun. Mag.

    (2014)
  • B. Zhang et al.

    Social-Aware peer discovery for D2D communications underlaying cellular networks

    IEEE Trans. Wireless Commun.

    (2015)
  • E. Datsika et al.

    Green cooperative device-to-Device communication: a social-Aware perspective

    IEEE Access

    (2016)
  • L. Aoude et al.

    Social-Aware device-to-Device offloading based on experimental mobility and content similarity models

    Wireless Commun. Mobile Comput.

    (2018)
  • Y. Meng et al.

    Dynamic social-aware peer selection scheme for cooperative device-to-device communications

    Proceedings of IEEE WCNC

    (2017)
  • K. Wu et al.

    D2D Relay selection based on joint fuzzy and entropy theories with social similarity

    IEEE Trans. Veh. Technol.

    (2018)
  • Y. Gao et al.

    Dynamic social-Aware peer selection for cooperative relay management with D2D communications

    IEEE Trans. Commun.

    (2019)
  • X. Li et al.

    Group-Sparse-Based joint power and resource block allocation design of hybrid device-to-Device and LTE-Advanced networks

    IEEE J. Sel. Areas Commun.

    (2016)
  • S. Hussain, Dynamic Radio Resource Management in 3GPP LTE,...
  • X. Chen et al.

    Efficiency resource allocation for device-to-Device underlay communication systems: A Reverse iterative combinatorial auction based approach

    IEEE J. Sel. Areas Commun.

    (2013)
  • Y. Li et al.

    Social-Aware resource allocation for device-to-Device communications underlaying cellular networks

    IEEE Wireless Commun. Lett.

    (2015)
  • X. Chen et al.

    Exploiting social ties for cooperative D2D communications: A Mobile social networking case

    IEEE/ACM Trans. Networking

    (2015)
  • K.W. Choi et al.

    Discovering mobile applications in cellular device-to-Device communications: hash function and bloom filter-Based approach

    IEEE Trans. Mob. Comput.

    (2016)
  • Cited by (5)

    • Road ahead for D2D communications

      2022, Interference Mitigation in Device-to-Device Communications
    • Optimizing Uploading Time and Energy Consumption in IoT 5G Networks

      2020, Proceedings - 2020 IEEE Latin-American Conference on Communications, LATINCOM 2020

    Xiaolan Liu received her B.S. and M.S. degrees in Electronic and Information Engineering form Naval Aeronautical University, China in 2007 and in Information and Communication Engineering from Dalian Maritime University, China in 2009, respectively. She is currently pursuing the Ph.D. degree at the School of Systems Information Science, Future University Hakodate, Japan and is also faculty member at the School of Computer and Information Engineering, Chuzhou University, China. Her research interests include cooperative D2D communication and data uploading.

    Bin Yang received his B.S. and M.S. degrees both in computer science from Shihezi University, China, in 2004 and from China University of Petroleum, Beijing Campus, in 2007, and Ph.D. degree in systems information science from Future University Hakodate, Japan in 2015, respectively. He is currently an associate professor at the School of Computer and Information Engineering, Chuzhou University, China, and is also a postdoctoral researcher at the School of Computer Science, Shaanxi Normal University, China. His research interests include mobile ad hoc networks, D2D communications and cyber security.

    Xiaohong Jiang received his B.S., M.S. and Ph.D degrees in 1989, 1992, and 1999 respectively, all from Xidian University, China. He is currently a full professor of Future University Hakodate, Japan. Before joining Future University Hakodate, Dr. Jiang was an associate professor of Tohoku University, Japan, from Feb. 2005 to Mar. 2010, an assistant professor in Japan Advanced Institute of Science and Technology (JAIST), from Oct. 2001 to Jan. 2005. Dr. Jiang was a JSPS research fellow at JAIST from Oct. 1999-Oct. 2001. He was a research associate in the University of Edinburgh from Mar. 1999-Oct. 1999. Dr. Jiang’s research interests include computer communications networks, mainly wireless networks and optical networks, network security, routers/switches design, etc. He has published over 260 technical papers at premium international journals and conferences, which include over 50 papers published in top IEEE journals and top IEEE conferences, like IEEE/ACM Transactions on Networking, IEEE Journal of Selected Areas on Communications, IEEE Transactions on Parallel and Distributed Systems, IEEE INFOCOM. Dr. Jiang was the winner of the Best Paper Award of IEEE HPCC 2014, IEEE WCNC 2012, IEEE WCNC 2008, IEEE ICC 2005-Optical Networking Symposium, and IEEE/IEICE HPSR 2002. He is a Senior Member of IEEE, a Member of ACM and IEICE.

    Lisheng Ma received his B.S., M.S. and Ph.D degrees from Taiyuan Normal University, China in 2004, from Southeast University, China in 2007 and from Future University Hakodate, Japan in 2017, respectively. He is currently an associate professor of Chuzhou University, China. His research interests include switching networks and data center networks.

    Shikai Shen received his B.S. and M.S. Degrees from Yunnan Normal University in 1984 and from Yunnan University in 2003, respectively. He is currently a professor with Kunming University, China. His research interests include wireless sensor networks, network coding, internet of things, etc.

    View full text