Cooperative Spectrum Sharing Between D2D Users and Edge-Users: A Matching Theory Perspective

11/02/2018 ∙ by Yiling Yuan, et al. ∙ FUDAN University 0

The device-to-device (D2D) communication theoretically provides both the cellular traffic offloading and convenient content delivery directly among proximity users. However, in practice, no matter in underlay or overlay mode, the employment of D2D may impair the performance of the cellular links. Therefore, it is important to design a spectrum sharing scheme, under which the performance of both links can be improved simultaneously. In this paper, we consider the cell-edge user (CEU) scenario, where both sides have the demand to improve the quality of experience or service. Therefore, CEUs and D2D users both have intentions to form pairs, namely, CEU-D2D pairs, to cooperate mutually. Different from the conventional equilibrium point evaluation, the stable matching between D2D users and CEUs are formulated under matching theory framework instead. For each CEU-D2D pair, a two-stage pricing-based Stackelberg game is modeled to describe the willingness to cooperate, where the win-win goal is reached finally.



There are no comments yet.


page 1

page 2

page 3

page 4

page 5

page 6

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Recently, the wireless networks witness a dramatically increasing demand of local area service. In this context, a promising technology called device-to-device (D2D) communication, which enables direct communication between two mobile users in proximity without through base station, has attracted attention in both industry and academic [1, 2]. The adoption of D2D communications brings many advantages [3]: allowing high-rate, low-delay, low-power transmission, extending the cellular coverage, etc.

One big challenge for implementing D2D communication is how to allocate spectrum resource for D2D communications efficiently. Due to the controllable interference in licensed spectrum, it has been proposed that both the D2D and cellular users share the same spectrum, namely, underlay D2D and overlay D2D mode [4]. For the former, the D2D and cellular links use the same spectrum at the same time, which could increase the spectrum reuse factor if a well designed interference management is available. For the latter, the operator allocates dedicated cellular resource to D2D links, which will incur lower spectrum efficiency albeit less interference.

However, no matter in underlay or overlay mode, most literature mainly focuses on improving the performance of D2D links while ensuring that the performance of cellular links will not be severely degraded. The utility of cellular link is rarely considered. Furthermore, because information is directly exchanged between D2D users bypassing base station (BS), the operator can only charge the D2D users based on how much resource they use irrespective of the data flow through D2D link[5], which may lead to lower utility. Therefore, it is still important for the operator to design a spectrum sharing scheme to improve its utility, which can also incentive D2D devices owned by selfish users to participate at the same time. On the one hand, for D2D users who aim to improve the quality of experience, the unlicensed band is free but too crowded, while sharing licensed spectrum provides higher performance but relies upon an agreement with BS. On the other hand, in cellular network, the cell-edge users (CEUs) usually suffer from poor channel condition so that their performance requirements are often hard to meet. Therefore, if D2D users assist CEU transmissions in exchange for access to licensed spectrum, the win-win outcome is achieved and higher benefit is available for the operators.

Cooperative relay technology [6] is a promising technology in improving the spectrum efficiency of cellular networks. In such scheme, the source broadcasts the signal to the destination and mobile users nearby first, and then these users help relay the received signal to the destination. The well-known relaying schemes include Amplify-and-Forward (AF) and Decode-and-Forward (DF). Motivated by this, many cooperative D2D communication relaying schemes for cellular networks [7, 8, 9], where D2D users can serve as a relay for the cellular user to earn opportunity to access the licensed spectrum band, are proposed. However, these schemes are designed from the perspective of D2D links.

In this paper, we investigate a cooperative spectrum sharing scheme between D2D users and CEUs. When CEUs suffer from poor performance, they can select D2D transmitter as relay to satisfy their requirements, and these D2D pairs are able to access licensed spectrum in return. Utilities of cellular links and D2D links are both considered. A joint optimization framework based on game theory is proposed to characterize this kind of cooperation. Stackelberg game is used to model the interaction between CEU and D2D pair. Furthermore, when there are several CEUs and D2D pairs, they all seek appropriate partners to maximize their utilities. Thus we model the pairing problem as a marriage market to find stable CEU-D2D pairs given the preferences of both sides. Analytic and numerical results show that the proposed scheme can improve the performance of CEU and D2D users can gain considerable throughput, which makes both sides have intentions to cooperate. Moreover, under mild conditions, CEU can push the utility of the paired D2D user to be zero because of its leading role in the cooperation.

The rest of this paper is organized as follows. In Section II, the system model and problem formulation are established. In Section III, The joint optimization algorithm is presented. The Section IV gives the numerical results and performance analysis, and finally Section V concludes this paper.

Ii System Model and Problem Formulation

Ii-a System Model

We consider a single cell of cellular networks. There are cell-edge users that communicate in conventional way through base station. We assume these users suffer from poor channel conditions so that their date rate requirements in the uplink can’t be satisfied. Only uplink scenario is considered in this paper because of the limited power budget of user equipments. Let define the set of these users. Besides, there are transmitter-receiver pairs already operating in D2D mode. The set of D2D pairs is denoted by . There is no dedicated channel for D2D communication. Therefore, in order to transmit its own data, the D2D user relays the cellular data in the uplink and gets access to the channels occupied by CEUs alternatively.

We assume the time division multiple access (TDMA) technique is adopted. In case of cooperation, the normalized frame structure is shown in Figure.1. In order to reduce overhead, we assume only D2D transmitters are involved in relay procedure111The scheme proposed can also be applied to the case where D2D receivers are allowed to relay for CEU. In this case, for a D2D pair, the device bringing higher utility is selected to provide relay transmission for CEU, which, however, will introduce extra overhead.. In the first phase, CEU broadcasts its data with power to D2D transmitter (DT) and BS. In the second phase, DT relays the received data with power to BS in decode-and-forward way. In the last phase, DT transmits its own data to D2D receiver (DR) with power . The first phase and second phase both last of the frame length, which constitute the relay transmission provided by D2D users for CEU. The third phase lasts of the frame length, which is allocated for D2D link. We refer to as allocation coefficient.

The distanced based pathloss channel model considering multi-path fading[10] is used in this paper. The notations for channel gains between different nodes are listed in table I. We assume the channel gains are known to all nodes. Let denote the noise power.

Fig. 1: Frame Structure
notation physical meaning
channel gain between th CEU and BS
channel gain between th CEU and th DT
channel gain between th DT and BS
channel gain between th DT and th DR
TABLE I: Notations for Channel Gains

Ii-B Problem Formulation

The achievable data rate of CEU in the direct link, denoted by , is


The outage refers to the case that , where defines the data rate requirement.

When cooperating with D2D user , the data rate for th CEU is limited by the minimum rate of the first two transmission phase, i.e.:



For convenience, we define . If , the win-win situation will be achieved, which encourage CEU to cooperate with D2D pairs. At the same time, the achievable data rate of D2D link is


where . However, if , the cooperation couldn’t be reached and .

Moreover, in order to avoid spectrum overuse, D2D pairs have to pay for using the licensed spectrum, referred to as spectrum leasing [11]. Therefore, payoff function for D2D is defined as following:


In (4), is the satisfaction of D2D pair with its data rate, is the equivalent revenue with respect to the satisfaction of D2D pair and is the cost per unit relay transmission energy. We define in the logarithmic form in this paper, namely . Besides, is the price coefficient. The payoff consists of three parts. The first term is the benefit from achievable transmission rate, the second term is the cost of energy for relay and the last term is the price charged for leasing spectrum. In addition, the payoff function of CEU can be defined as


where is the satisfaction of CEU with its transmission rate. We define in the logarithmic form also. The first term is the equivalent revenue in terms of satisfaction and the second term is the payment from th D2D pair. When , we define that .

Because all CEUs and D2D users are selfish, they have the incentive to maximize their performance. Therefore, it is natural to formulate the problem from a game theoretic perspective. In this paper, we focus on the following three problems.

Ii-B1 Pairing Problem

Each CEU is selfish and can always make autonomous decision about its partner. Each D2D pair can also make its own decision to choose its partner. Therefore, it is important to decide a stable matching between CEUs and D2D pairs, in which each CEU and D2D pairs have no intention to deviate.

Ii-B2 Pricing Adjustment Problem for each CEU

Each CEU can control the price charged to D2D pairs for access to its occupied channel.

Ii-B3 Spectrum Leasing Problem for each D2D pair

Each D2D pair can decide the allocation coefficient to improve its performance further given the price imposed by CEU.

Motivated by the hierarchical game model proposed in [12], we consider the joint hierarchical optimization framework addressing above three problem in this paper. More specifically, we model the pairing problem as marriage market problem. Then we establish a Stackelberg game, in which CEU is the leader to decide the price and D2D pair is the follower. The entire framework is depicted in Fig.2.

Fig. 2: Joint optimization framework

Iii Joint optimization Framework

Iii-a Stackelberg Game for Pricing and Spectrum Leasing

When CEU and D2D pair are paired, CEU can determine the price charged to D2D pair in its occupied spectrum, and D2D pair can decide which would influence the utility of CEU. The interaction between CEU and D2D pair, that decides their actions to be taken in sequential manner, makes it natural to model the above pricing and spectrum leasing problem as a Stackelberg Game. The CEU is a leader and its action is to decide the price when D2D pair accesses its occupied spectrum. The D2D pair is a follower and it determines the according to the price imposed by CEU. We seek a Stackelberg equilibrium to the proposed problem using backward induction method.

When given the price charged by th CEU, the best strategy for th D2D pair can be found as an optimization problem shown in (6).


The first constraint guarantees that CEU is willing to cooperate. It is easy to find out that if , the problem is infeasible.

Proposition 1

Suppose , then the solution to problem (6) is:


Omitted for brevity.

As the leader of the game, CEU decides the price to maximize its utility with the knowledge of the strategy of th D2D pair according to its decision. Therefore, the optimal price can be found as following:


The first constraint is used to guarantee the D2D pair has the intention to cooperate. It is easy to verify that if , the problem above is infeasible.

Theorem 1

Suppose the pair is formed by th CEU and th D2D pair, and below conditions are satisfied:


Then, is the Stackelberg equilibrium of the game, where is given in (7) and is expressed as following:


The set is defined as following:



Omitted for brevity.

If cooperation can’t be reached, which means that problem (6) or problem (8) is infeasible, we define that . Furthermore, under a mild condition, we find that .

Proposition 2

If , then .


If , then it means that the following inequality holds:


After some algerbraic manipulations, we can get an inequality as following:


Therefore, . Besides, because , we can find that over . Consequently, .

On the other hand, if ,it is easy to verify that now. Using the similar idea, we can show that . Therefore, we can also conclude that .

Practically, is usually small, such as 0.1W. Moreover, the transmission power is not the major part of the power consumption for UEs, which means that is unlikely to be much larger than . Therefore, the assumption in Proposition 2 is reasonable in most scenarios. So we assume the condition is met in our simulations. Intuitionally, Proposition 2 is resulted from the leading role of CEU in the cooperation. Although the utility is zero, D2D pair still has an intention to participate in the cooperation due to positive throughput.

Iii-B Matching Game for Pairing

In this section, we study the pairing problem when there are several CEUs and D2D pairs. We will model pairing problem as a marriage market, also known as two-sided one-to-one matching market. Originally stemmed from economics[13], matching theory provides a mathematically tractable solution to handle with the problem of matching players in two distinct sets, according to each player’s individual preference and information. Matching theory has become a promising framework for resource allocation in wireless communication. This framework has many advantages[14]: (1) It has efficient distributed implementations without centralized control; (2) Unlike most game-theoretic solutions, .e.g. Nash equilibrium, it has more suitable solution when applied to pairing problem; (3) It defines general preferences that can handle complex considerations.

In our model, CEU and D2D pair can only be paired when they agree to cooperate with each other. Therefore, it is natural to model the interaction between the set of CEUs and the set of D2D pairs as an one-to-one matching game for solving the pairing problem. The CEU has a preference over all the D2D pairs. We use to denote the ordinal relationship of th CEU. For instance, means that th CEU prefers th D2D pair to th D2D pair. If , we have . Besides, if and , we will have . Similarly, we can define the preferences of D2D pairs. Let denote the ordinal relationship of th D2D pair. We use the relationship to mean that agent is unacceptable to , which is equivalent to the fact that agent and agent will not cooperate mutually in proposed scenario. Note that th CEU is unacceptable to th D2D pair if and only if th D2D pair is unacceptable to th CEU.

The major solution concept in matching game is matching which is defined as follows.

Definition 1

A matching is a function from to such that if and only if , and , , for .

The definition implies that the outcome matches the agent on one side to the one on the other side, or to the empty set. The agents’ preferences over the matchings are coincident with their preferences over the matched partner in outcomes. In this paper, we seek a particular matching structure, which is defined as follows.

Definition 2

A matching is blocked by the CEU-D2D pair , if and , . A matching is individual rational if for . A matching is stable if it is individual rational and not blocked by any CEU-D2D pair.

Deferred-Acceptance algorithm[15] can be used to find a stable matching outcome. We propose an algorithm to solve the joint optimization problem, which is depicted in Algorithm 1. The algorithm consists of two stages. At the first stage, D2D pairs send their profile including channel state information(CSI) to the available CEUs. After receiving the information from D2D pairs, CEUs can calculate the price according to Theorem 1 and establish their preferences over D2D pairs respectively. Then CEUs send the information containing CSI and price to D2D pairs. Each D2D pair can choose its best strategy according to the received information, and rank the CEUs depending on the achievable utility and data rate. At the second stage, each CEU proposes to its most preferred D2D pairs. Then each D2D pair will accept the most preferred one among the proposed CEUs and reject the rest. After that, the rejected CEUs propose to the next favourite D2D pairs and each D2D pair compares the new proposers and its temporary partner then selects the favourite one. The procedure will continue until no CEU is rejected. Any tie is broken in arbitrary way.

Algorithm 1: A Joint Optimization Algorithm
Initialization: Let and be the preference list of CEU and D2D pair respectively.
Stage 1: Price Adjustment and Spectrum Leasing
  • CEUs and D2D pairs exchange their profile information:

    • Each CEU computes the price for every D2D pair .

    • Each D2D pair chooses the best strategy according to .

  • Each CEU establishes its preference list which only contains acceptable D2D pairs. And each D2D pair establishes its preference list , similarly.

Stage 2: CEU-D2D Pairing
WHILE who was rejected
  • Each CEU applies to its favourite D2D pair according to its preference.

  • Each D2D pair chooses the most preferred one considering the previous partner (if any) and the new applicants, and rejects the rest.

  • If CEU is rejected, it removes the D2D pair which it applies to at current round from its preference list .

The complexity of stage 2 is . The stable matching for marriage market always exists [13, 15]. Besides, we note that the outcome of Deferred-Acceptance algorithm is optimal for the set of players who make the proposals[13]. Therefore, the proposed algorithm will lead to a stable matching between CEUs and D2D pairs, which is optimal in term of CEUs.

It can be found that the stable matching structure is closely related to the preferences of CEUs and D2D pairs, which also depend on the resulting utilities from different CEU-D2D pairs formed. Furthermore, it turns out that the resulting payoffs are directly determined by allocation coefficients and pricing coefficients. By using the optimal pricing coefficients and allocation coefficients , CEU and D2D can have the highest payoff when they form a CEU-D2D pair. Therefore, the outcome is stable in the sense that each CEU cannot improve its payoff further by unilaterally changing its price coefficient or paired partner and each D2D pair cannot improve its payoff, neither.

Iv Simulations

The performance of our proposed joint optimization algorithm is investigated through simulation in this section. We use the pathloss based channel model considering multi-path fading[10]. For example, the channel gain between CEU and BS can be expressed as:


where is a constant determined by system parameter,

is fast fading with exponential distribution,

is the pathloss exponent and is the distance between the BS and CEU . The CEUs are distributed at the edge of the cell, and the D2D pairs are uniformly within the cell. We also assume the distance between the CEUs and DTs is less than 300 meters. When computing the utility function, we set and . The detailed configuration parameters are depicted in Table.II.

Parameters Value
Cell radius 500
Noise power() -114dBm
Pathloss constant()
Pathloss exponent() 4
CEU Tx power() 100mW
D2D Tx power() 100mW
Distance bewteen DT and DR 20m
Numbers of CEUs () 20
Required SNR for CEUs 5dB
TABLE II: Simulation Configure Parameters

We first present the total utility and sum-rate of each agent with different numbers of D2D pairs using proposed algorithm in Fig.3. We can observe that the total utility of D2D pairs is always zero, which complies with Proposition 2. However, the zero-utility doesn’t mean the zero sum-rate. The D2D pairs have high sum-rate although their total utility is zero. Consequently, D2D pairs are motivated to cooperate with CEUs. Besides, the total and sum-rate of CEUs are increasing with the increase of the number of D2D pairs. The major reason for performance improvement is that the more D2D pairs means the more opportunities to find better partners.

(a) Total utility of agents
(b) Sum-rate of agents
Fig. 3: Performance of proposed algorithm with different numbers of D2D pairs

We mainly compare the following two approaches for our scenario. The first one is random matching with Stackelberg game. In this scheme, D2D pairs and CEUs are randomly matched. The optimal pricing coefficients and allocation coefficients are used if D2D pair and CEU are willing to cooperate mutually. The second one is stable random with fixed price. In this scheme, D2D pair decides the best strategy given fixed price coefficient. Afterwards the second stage of Algorithm 1 is used to decide the matching between D2D pairs and CEUs. The proposed algorithm is referred to as stable random with Stackelberg game. We will focus on the performance of CEUs, because of their leading roles in licensed spectrum.

Fig. 4: Outage percentage of CEU with different numbers of D2D pairs

Fig.4 compares the outage percentage of CEUs with different schemes for different number of D2D pairs. Our proposed algorithm has the least outage percentage. Moreover, we can observe that the performance achieved by stable matching has significant gain over that by random matching. That’s because stable matching takes the preference of each agents into consideration while the random matching doesn’t. Because outrage occurs only when matched partners are unacceptable to each other and thus price adjustment has a little effect on outrage percentage, our scheme performs a little better than the stable matching with fixed price. In addition, when the number of D2D pairs is more than 20, the outrage percentage achieved by random matching remains unchanged. That’s because the number of CEUs is 20, and the available D2D pairs is not enough when the number of D2D pairs is less than 20. In this situation, more D2D pairs means that more CEUs can be matched which leads to the decrease of outrage percentage. However, when there are more than 20 D2D pairs, each CEU have a matched partner, and outrage percentage will stay almost unchanged because of random matching.

Fig. 5: Sum-rate of CEU with different numbers of D2D pairs

Fig.5 compares the sum-rate of CEUs achieved by three schemes with different number of D2D pairs. As the number of D2D pairs increases, CEUs get more chance to access the cooperating relay and sum-rate will be improved. Fig.5 shows that the proposed joint optimization algorithm yields considerable gain over other schemes. Besides the benefit of stable matching, price adjustment can improve the performance of CEU further. Because of the same reason we have mentioned, the performance of random matching increases at first and remains unchanged when there are enough D2D pairs.

V Conclusion

In this paper, we investigate a cooperative spectrum sharing scheme between D2D users and CEUs, where D2D user relays the cellular data in the uplink to get access to the licensed channel, so that both sides can improve the quality of service through cooperation. Thus, unlike underlay and overlay mode, a win-win situation is achieved. Given the selfishness of each sides, we use a Stackelberg game to describe the willingness to cooperation. Further, we establish a stable marriage market to study the paring problem. We present numerical results to verify the efficiency of the proposed scheme.


This work was supported by the National Science and Technology Major Project of China (Grant No. 2015ZX03001040-002) , the NSF of China (Grant No. 61501124, No. 61402114)


  • [1] 3GPP, “Technical specification group services and system aspects: Feasibility study for proximity services (ProSe),” 3rd Generation Partnership Project (3GPP), TR 22.803 Rel-12, 2012.
  • [2] K. Doppler et al., “Device-to-device communication as an underlay to lte-advanced networks,” IEEE Commun. Mag., vol. 47, no. 12, pp. 42–49, Dec 2009.
  • [3] G. Fodor et al., “Design aspects of network assisted device-to-device communications,” IEEE Commun. Mag., vol. 50, no. 3, pp. 170–177, March 2012.
  • [4] A. Asadi, Q. Wang, and V. Mancuso, “A survey on device-to-device communication in cellular networks,” IEEE Commun. Surveys Tuts., vol. 16, no. 4, pp. 1801–1819, Fourthquarter 2014.
  • [5] L. Lei, Z. Zhong, C. Lin, and X. Shen, “Operator controlled device-to-device communications in lte-advanced networks,” IEEE Wireless Communications, vol. 19, no. 3, pp. 96–104, June 2012.
  • [6] A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity. part i. system description,” IEEE Trans. Commun., vol. 51, no. 11, pp. 1927–1938, Nov 2003.
  • [7] C. Ma et al., “Cooperative relaying schemes for device-to-device communication underlaying cellular networks,” in Proc. IEEE GLOBECOM, Dec 2013, pp. 3890–3895.
  • [8] S. Shalmashi and S. Ben Slimane, “Cooperative device-to-device communications in the downlink of cellular networks,” in Proc. IEEE WCNC, April 2014, pp. 2265–2270.
  • [9] Y. Cao, T. Jiang, and C. Wang, “Cooperative device-to-device communications in cellular networks,” IEEE Wireless Communications, vol. 22, no. 3, pp. 124–129, June 2015.
  • [10] D. Feng, L. Lu, Y. Yuan-Wu, G. Li, G. Feng, and S. Li, “Device-to-device communications underlaying cellular networks,” IEEE Trans. Commun., vol. 61, no. 8, pp. 3541–3551, August 2013.
  • [11] Y. Yi et al., “Cooperative communication-aware spectrum leasing in cognitive radio networks,” in Proc. IEEE DySPAN, April 2010, pp. 1–11.
  • [12] Y. Xiao, Z. Han, C. Yuen, and L. DaSilva, “Carrier aggregation between operators in next generation cellular networks: A stable roommate market,” IEEE Trans. Wireless Commun., vol. PP, no. 99, pp. 1–1, 2015.
  • [13] A. E. Roth and M. A. O. Sotomayor, Two-sided matching: A study in game-theoretic modeling and analysis.   Cambridge University Press, 1992.
  • [14] Y. Gu, W. Saad, M. Bennis, M. Debbah, and Z. Han, “Matching theory for future wireless networks: fundamentals and applications,” IEEE Commun. Mag., vol. 53, no. 5, pp. 52–59, May 2015.
  • [15] D. Gale and L. S. Shapley, “College admissions and the stability of marriage,” The American Mathematical Monthly, vol. 69, no. 1, pp. 9–15, 1962.