A Cascaded Channel-Power Allocation for D2D Underlaid Cellular Networks Using Matching Theory

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

We consider a device-to-device (D2D) underlaid cellular network, where each cellular channel can be shared by several D2D pairs and only one channel can be allocated to each D2D pair. We try to maximize the sum rate of D2D pairs while limiting the interference to cellular links. Due to the lack of global information in large scale networks, resource allocation is hard to be implemented in a centralized way. Therefore, we design a novel distributed resource allocation scheme which is based on local information and requires little coordination and communication between D2D pairs. Specifically, we decompose the original problem into two cascaded subproblems, namely channel allocation and power control. The cascaded structure of our scheme enables us to cope with them respectively. Then a two-stage algorithm is proposed. In the first stage, we model the channel allocation problem as a many-to-one matching with externalities and try to find a strongly swap-stable matching. In the second stage, we adopt a pricing mechanism and develop an iterative two-step algorithm to solve the power control problem.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/13/2021

Centralized QoS-Aware Resource Allocation for D2D Communications with Multiple D2D Pairs in One Resource Block

Device-to-device (D2D) communications can result in spectral efficiency ...
10/31/2018

Matching Game Based Framework for Two-Timescale Cooperative D2D Communication

We consider a cooperative device-to-device (D2D) communication system, w...
05/01/2019

D2D Multicast in Underlay Cellular Networks with Exclusion Zones

Underlay device-to-device (D2D) multicast communication has potential to...
07/20/2020

Distributed Double Auctions for Large-Scale Device-to-Device Resource Trading

Mobile users in future wireless networks face limited wireless resources...
07/02/2018

Unified Scheduling for Predictable Communication Reliability in Cellular Networks with D2D Links

Cellular networks with D2D links are increasingly being explored for mis...
12/05/2020

Two-Timescale Resource Allocation for Cooperative D2D Communication: A Matching Game Approach

In this paper, we consider a cooperative device-todevice (D2D) communica...
12/13/2021

Distributed pricing-based resource allocation for dense device-to-device communications in beyond 5G networks

Considering the dramatic increase of data rate demand in beyond fifth ge...
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

Device-to-device (D2D) communication as an underlay to cellular networks is one of the key technologies to meet the dramatically increasing traffic demand and provide better user experience in future cellular networks[1]. The basic idea is to allow nearby mobile devices to reuse cellular spectrum by establishing direct communication links without interacting with base station (BS).

One big challenge for implementing underlaid D2D communication is how to allocate spectrum resource efficiently. To date, numerous resource allocation schemes have been proposed [2, 3, 4]. In [2], an efficient scheme was developed to jointly optimize the channel allocation and power control. Nevertheless, only one D2D pair was allowed to use one cellular channel, which may limit the system throughput. The spectrum efficiency of the cellular system can be improved further if multiple D2D pairs are allowed to share the same channels[3, 4].

Most of existing resource allocation schemes worked in centralized way. These schemes are developed under the assumption that the channel state information (CSI) between every transmitter and receiver is available to a central controller (e.g., the BS), which incurs heavy overhead. Therefore, it is more preferable to design a distributed resource allocation scheme with limited local channel information[5, 6, 7, 8, 9]. In [5], authors studied the system that allowed the channels to be shared by several D2D pairs. Nonetheless, the proposed algorithm lacked an efficient distributed power control approach to guarantee the service level of cellular user (CU). In [6, 7, 8, 9], authors investigated the system where D2D pairs could reuse all the channels. However, the D2D pairs in close proximity will suffer from severe mutual interference, which may make the interference management complicated.

In this paper, we consider the system where each channel can be shared by multiple D2D pairs and each D2D pairs can reuse at most one channel at each slot. The distributed resource allocation schemes for such system are less explored in the literature. Unlike [5], we try to maximize the sum rate of D2D pairs while guaranteeing the service level of CUs. We decompose the original problem into two cascaded subproblems: channel allocation and power control, and then a two-stage distributed algorithm is proposed.

Specifically, in the first stage, the channel allocation problem is modelled as many-to-one matching, which is suitable for assignment problem between two disjoint sets of players with local information. Unlike many existing works for resource allocation, the proposed matching game has externalities, which are resulted from the mutual interference among D2D pairs sharing the same channel. A distributed algorithm is proposed to find a strongly swap-stable matching as solution. Moreover, the existence of strongly swap-stable matching is proved. In the second stage, a pricing mechanism is adopted and an iterative two-step algorithm is presented to solve the power control problem. At the beginning, a virtual price factor based on the received interference is broadcast. Then, each D2D pair independently maximizes its utility according to the virtual price factor. The virtual price factor acts as control signal to limit the interference. Our contribution is that the proposed scheme can be implemented via distributed decision at each device based on local information. Moreover, the cascaded structure can reduce the exchange of control signal in need. The numerical simulations show the proposed algorithm with limited CSI is efficient and the throughput loss compared to brute-force method is small in our setup.

The rest of this paper is organized as follows. In Section II, the system model and problem formulation are established. In Section III, a two-stage algorithm is proposed to solve the two subproblems respectively. The Section IV gives the numerical results. Finally Section V concludes this paper.

Ii System Model and problem formulation

Ii-a System Model

We study a D2D underlaid cellular network comprised of a BS, CUs and D2D pairs. The scenario where D2D pairs reuse uplink resource is considered in this paper. The set of CUs and D2D pairs are denoted by and respectively. All devices are equipped with one antenna. The network is provided with a set of orthogonal frequency channels. We assume a fully loaded cellular network, i.e., . Each channels has been already allocated to one cellular user. For simplicity, CU is referred to the CU assigned to channel in our discussion. Multiple D2D pairs can share the same cellular channels and each D2D pair is allowed to access at most one cellular channel. The set of D2D pairs sharing the channel is denoted by , and when . Then, the SINR of D2D pair on channel is given by

(1)

where and are the transmit powers of cellular link and D2D pair , respectively, denotes the channel gain from D2D transmitter to D2D receiver on channel , is the channel gain from CU to D2D receiver on channel , and is the noise power.

Ii-B Problem Formulation

In this paper, we aim to maximize the sum rate of D2D pairs while guaranteeing the maximum interference to cellular users. Mathematically, the problem can be formulated as

(2a)
(2b)
(2c)
(2d)

where , , is the maximum transmit power and denotes the channel gain from D2D transmitter to cellular link on channel . The constraint (2c), referred to as interference constraint, is for protection of cellular links, where is the interference tolerance level which depends on the requirements and channel gain of cellular link on channel . Moreover, we assume only local information is available at each device. Explicitly, D2D pair only knows the channel gain and , and the BS only knows .111We assume the system works in TDD mode. Hence, due to channel reciprocity, these CSI can be easily obtained by listening to the pilot transmitted by CU or other devices .

Fig. 1: Framework for resource allocation

Iii Channel allocation and power control

Problem (2

) is a mixed integer non-linear programming problem, which is usually intractable. Moreover, only local information is available, which makes the problem more difficult to solve. Therefore, our goal is to develop a efficient distributed approach. For this purpose, we decompose the problem into two cascaded subproblems, namely channel allocation and power control. The former one is solved by matching theory and a pricing mechanism is adopted for the latter one. The entire framework is depicted in Fig.

1.

Iii-a Channel Allocation Stage

We consider the optimization problem of the channel allocation solution given the transmit power by solving the following optimization problem:

(3a)
(3b)
(3c)

In problem (3), the interference constraint (2c

) will be considered in power control stage. In order to estimate the contribution of each D2D pair to the overall throughput, D2D transmitters are requested to transmit at power

, as represented in constraint (3c).

To solve problem (3), which is a combinational optimization problem, we model it as many-to-one matching game. Originally stemming from economics[10], matching theory provides a mathematical framework to cope with the problem of matching players in two distinct sets, based on each player’s individual preference and local information. It has been used for many resource allocation problems in communication networks[11]. In our context, one side is D2D pairs and the other side is the cellular channels. In the implementation, the BS will make decisions on behalf of channel .

Definition 1.

A many-to-one matching is a subset of such that , where is the quota of CU , and .

If the number of D2D pair in , say , is less than , then has “holes” represented as D2D pairs with no preference over matchings. In this paper, we assume for simplicity. We will also use to denote the channel reused by D2D pair . Utility function is adopted to describe the preferences of agents over matchings. Given matching , the utility of D2D pair is defined as follows:

(4)

where is the gain obtained from accessing channel , is the equivalent revenue with respective to gain , and is the price for using cellular channel. We set when D2D pair is not matched with any channel. Specifically, the gain is represented as follows:

(5)

where is tradeoff coefficient and denotes the set of D2D pairs reusing channel . The difference between the first two terms of (5) can be regarded as the benefit from channel, which takes into consideration both the channel gain and interference from cellular link, and only depends on the matched channel itself. The last term is the loss resulted from the mutual interference between D2D pairs. The following lemma implies that can be regarded as a lower bound of the aggregated throughput of D2D pairs.

Lemma 1.

Suppose that each D2D pair is matched with one channel. Then, given , for any matching ,

Proof:

where the inequality (a) follows from the standard logarithm inequality, . ∎

In addition, the utility of channel is defined as follows:

(6)

where quantifies the degree of violation of the constraint (2c) and is the cost coefficient. Note that (4) and (6) can be calculated locally at each device.

Because of the interference between D2D pairs, the utility of D2D pair will be affected by the choice of other D2D pairs. Thus the proposed matching has externalities and is called many-to-one matching with externalities[10]. Due to the externalities, the stable matching, which is a solution concept used widely in matching theory, may not exist. To this end, we look at another stability concept, based on the concept of swap-matching[12]:

Definition 2.

Given a matching , two D2D pairs and two channels with , a swap-matching is .

In the swap-matching, two involved D2D pairs exchange their matched channels while all other matchings remain the same. Moreover, one of the D2D pair can be a “hole”, thus allowing D2D pairs to move into available vacancies.

Definition 3.

A matching is strongly swap-stable if and only if there exists no swap-matching such that: and , and at least one of the above three inequalities is strict.

Note that the above swap-stability is stronger than that defined in [12]. The rationality of our stability notion comes from the observation that the BS aims to maximize the total utility of CUs and can permit monetary transfer among CUs. Algorithm 1 is proposed to find a strongly swap-stable matching. The initialization step is based on Gale-Shapely (GS) algorithm. Each D2D pair ranks channels based on the descending order of estimated SINR. Meanwhile, each channel ranks the D2D pair according to the ascending order of interference channel gain . Then, each D2D pair proposes to its most preferred channel, and each channel accepts the most preferred D2D pair and rejects the others. Initialization step terminates when each D2D pair is accepted by a channel, which can be guaranteed by the assumption . Next, the algorithm seeks ”approved” swap-matching until no such swap-matching exists.

1:
2:D2D pairs and channels construct their preference lists based on estimated SINR and interference channel gain , respectively.
3:Each D2D pair proposes to its most preferred channel that has not rejected it before.
4:Each channel keeps the most preferred D2D pairs and rejects the others.
5:Repeat step 2 and 3 until each D2D pair is accepted by a channel.
6:
7:Each D2D pair searches for swap-matching ”approved” by the players involved in the swap. Then, .
8:If is changed, repeat step 5.
Algorithm 1 Stage 1: Channel Allocation for D2D Pairs

To prove the convergence of Algorithm 1, we introduce a potential function for the proposed game:

Theorem 1.

Algorithm 1 always converges to a strongly swap-stable matching.

Proof:

The proof is based on the fact that the potential function is improved. after each swap operation in Algorithm 1, which is proved as follows.

Note that each D2D pair is matched with one channel after initialization. Assume the ”approved” swap-matching is . For convenience, let . For , and . Moreover, we assume . Thus

Expanding and canceling the like terms, and using the symmetric property of , we obtain

Considering the utilities of players involved in the swap, we can find out that

Thus we can conclude that the potential function is improved ager swap. The proof is similar when one of D2D pairs is a ”hole”.

Furthermore, he number of possible matching between D2D pairs and channels is limited, Algorithm 1 will terminate at finite steps. On the other hand, the algorithm does not terminate until there is no any ”approved” swap-matching. Therefore, we can conclude that the final matching is swap-stable. ∎

Iii-B Power Control Stage

Since all the cellular channels are orthogonal, we can decouple the power control problem into subproblems, where we consider each channel independently. For simplicity, we focus on the power control problem of channel . Similar to [6, 5], we adopt a pricing mechanism consisted of two steps. In the first step, the BS determines the virtual price factor to control the received interference. In the second step, with the virtual price information, each D2D pair adjusts transmit power aiming to maximize its utility. To solve the two-step problem, the backward induction technique is adopted. We start with the transmit power determination problem, called lower problem. Then we investigate the price factor adjustment problem, called upper problem.

Iii-B1 Lower Problem

Because each D2D pair maximize its own utility independently with local information, it is natural to model the lower problem as non-cooperative game. The power control game model is defined as , where is the set of D2D pairs assigned to channel , is the set of joint action profiles of all players, and is the payoff function of player . The payoff function is defined as follows:

(7)

where is defined in (1) and is the action profile of all players. The first term can be considered as reward, which is an approximation of achievable rate. The second term is the cost charged by the BS, which is proportional to the interference caused by this D2D pair to cellular link.

We will adopt a well-studied solution notion known as Nash Equilibrium (NE)[13], from which no players has intention to unilaterally deviate. A NE of our game model is given in Theorem 2.

Theorem 2.

Given , is a NE of proposed power control game, where

(8)
Proof:

Let denote the joint action profile of all players except player . Given and , player would like to maximize its utility as follows:

(9a)
(9b)

The objective function is concave in . After solving problem (9), we can obtain the best response of player : . Note that this best response implies that a rational player will always take a fixed action no matter what actions are taken by its opponents. Consequently, we can conclude that in NE, each player would take the action . ∎

Iii-B2 Upper Problem

In upper problem, the BS will adjust the virtual price factor to limit the interference to cellular link. On the one hand, too small will result in the interference exceeding the interference tolerance level. On the other hand, too large will result in low transmit power of D2D pairs, which leads to low sum rate of D2D pairs and inefficient spectrum utilization. Therefore, it is natural to seek a appropriate which could maximize the sum rate of D2D pairs while guaranteeing the service level of CU. However, only interference information is available at the BS. Thus, it is difficult to find such . To this end, instead of adjusting to obtain the optimal power allocation, we try to seek such that the power profile obtained in the following lower problem is Pareto optimal, which is defined as follows:

Definition 4.

A power profile satisfying constraint (2c) is Pareto optimal if there exists no power profile satisfying constraint (2c) could improve one D2D pair’s rate without deteriorating other D2D pairs’ rates.

Theorem 3.

If a power profile satisfying , then it is Pareto optimal.

Proof:

We will prove the theorem by contradiction. Suppose there is another power profile which can increase or maintain the performance of all D2D pairs. Then there must exist a set of D2D pairs such that for any D2D pair , decreases. Let and . Consequently, for . Hence

which is incompatible with our assumptions. ∎

Theorem 3 implies that the virtual price factor is “appropriate” if it can lead to a power profile which makes the interference constraint (2c) tight. Additionally, from (8), it is easy to find out that is a non-increasing function of . So a simple bisection algorithm can be used to find the “appropriate” according to the received interference at the BS. The algorithm solving the power control problem is depicted in Algorithm 2, where is the price such that . According to Theorem 3 and the monotonicity of , Algorithm 2 will converge to the price factor leading to a Pareto optimal power profile. We consider non-trivial case, where the interference at the BS exceed if all D2D pairs transmit using , otherwise we just set .

1:Initialization: given channel ,, let , ;
2:while  do
3:     The BS calculates and broadcasts it;
4:     Each D2D pair , calculate according to (8);
5:     if  then
6:          ;
7:     else
8:          ;
9:     end if
10:end while
11:;
Algorithm 2 Stage 2: Power Control for channel

Iv Numerical Simulations

The performance of our proposed algorithms is investigated through simulation in this section. The channel used in simulation is , where

is fast fading gain with exponential distribution,

is the pathloss exponent and is the distance between transmitter and receiver. The D2D pairs and CUs are distributed uniformly within the cell. We set and . Other configuration parameters are depicted in Table.I.

Parameters Value
Cell radius 500 m
Noise power() -100 dBm
Pathloss exponent() 4
Transmit power of CU() 20 mW
Maximum D2D power() 20 mW
Length of D2D links 50 m
TABLE I: Simulation Configure Parameters
(a) Performance of Algorithm 2 with .
(b) Overall performance of our scheme with .
Fig. 2: Performance evaluation of our proposed scheme with different interference tolerance level.

At first, we evaluate the performance of our proposed scheme with different interference tolerance levels normalized by the signal strength of cellular link. Fig.(a)a evaluates the achieved sum rate of D2D pairs of Algorithm 2. The results of locally optimal solution, which are obtained by fmincon solver of Matlab, are given for comparison. It can be seen that the performance of Algorithm 2 is close to the solution obtained by fmincon solver. Fig.(b)b evaluates the overall performance of our scheme. The brute-force scheme given for comparison is the algorithm which explores the all possible channel assignments and adopts fmincon solver for power control. We can find that the performance loss of our scheme compared with brute-force scheme is at most and is below when interference tolerance level is larger than -5 dB, and the performance gain over random scheme is larger than .

(a) Sum rate of D2D pairs.
(b) Sum rate of CUs.
Fig. 3: Performance of different schemes with different interference tolerance level, .

Next, Fig.3 compares the performance of different schemes for different interference tolerance level normalized by the signal strength of cellular link. The interference minimization is referred to as the scheme in which is minimized in channel allocation stage [5] and Algorithm 2
is used for power control stage. Fig.3 shows that as the interference tolerance level increases, the sum rate of CUs decreases because D2D pairs are allowed to share the channel more aggressively which leads to more interference. On the other hand, the sum rate of D2D pairs increases as increases, since D2D pairs are allowed to transmit at higher power. Moreover, adopting the proposed scheme, the D2D pairs can get much better performance, at the cost of less sum rate of CUs. However, such trade-off is worthy in terms of increasing spectrum efficiency. For instance, when , adopting our scheme, the performance loss of CU is about compared with other two schemes, but the sum rate of D2D pairs is at least greater than that of other schemes. Because of high-throughput of D2D pairs, the proposed scheme can yield considerable gain over other scheme in terms of the sum rate of entire system.

Fig. 4: The sum rate of D2D pairs with different number of D2D pairs, .

Finally, Fig.4 compares the sum rate of D2D pairs achieved by different schemes for different number of D2D pairs. We consider two another schemes as comparison, referred to as centralized scheme and orthogonal scheme respectively. The first scheme is proposed in [3] to maximize the sum rate of D2D pairs in centralized way. The second scheme is similar to the algorithm proposed in [2], which assumes each channel is used by at most one D2D pair. This scheme chooses D2D pairs to maximize the sum rate of D2D pairs. From Fig.4, we can see that the sum rate of the orthogonal scheme grows approximately sublinearly as the number of D2D pairs increases, while the other three schemes grows almost linearly, which indicates that allowing multiple D2D pairs to reuse one cellular channel can improve the performance of entire system greatly. Moreover, the proposed scheme performs almost the same as the centralized scheme and outperforms the other three schemes significantly. So we can conclude that our scheme is an efficient distributed resource allocation scheme in large scale D2D underlaid cellular networks.

V Conclusion

In this paper, we propose a distributed resource allocation scheme for D2D underlaid cellular networks where each channel can be shared by one CU and several D2D pairs. We try to maximize the sum rate of D2D pairs while limiting the interference to cellular links. To solve the problem, we decompose the problem into two cascaded subproblems: channel allocation and power control problem, and a two-stage algorithm is proposed. Firstly, we model the channel allocation problem as a many-to-one matching game with externalities and try to find a strongly swap-stable matching. Secondly, we adopt price mechanism and propose an iterative two-step algorithm to solve the problem. Finally we present numerical results to verify the efficiency of our scheme. However, the interference information between D2D pairs is not fully utilized. In future work, such information can be used to design a more efficient algorithm for power distribution.

Acknowledgment

This work was supported by the NSF of China (No. 61501124, No.71731004).

References

  • [1] 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.
  • [2] D. Feng, L. Lu, Y. W. Yi, and G. Y. Li, “Device-to-device communications underlaying cellular networks,” IEEE Trans. Commun., vol. 61, no. 8, pp. 3541–3551, 2013.
  • [3] W. Zhao and S. Wang, “Resource sharing scheme for device-to-device communication underlaying cellular networks,” IEEE Trans. Commun., vol. 63, no. 12, pp. 4838–4848, 2015.
  • [4] T. D. Hoang, L. B. Le, and T. Le-Ngoc, “Resource allocation for D2D communications under proportional fairness,” in Proc. IEEE GLOBECOM, 2015, pp. 1259–1264.
  • [5] S. Maghsudi and S. Sta czak, “Hybrid centralized -distributed resource allocation for device-to-device communication underlaying cellular networks,” IEEE Trans. Veh. Technol., vol. 65, no. 4, pp. 2481–2495, April 2016.
  • [6] Q. Ye, M. Al-Shalash, C. Caramanis, and J. G. Andrews, “Distributed resource allocation in device-to-device enhanced cellular networks,” IEEE Trans. Commun., vol. 63, no. 2, pp. 441–454, 2015.
  • [7] R. Yin, G. Yu, C. Zhong, and Z. Zhang, “Distributed resource allocation for D2D communication underlaying cellular networks,” in Proc. IEEE ICC Workshops, 2013, pp. 138–143.
  • [8] M. Hasan and E. Hossain, “Distributed resource allocation in D2D-enabled multi-tier cellular networks: An auction approach,” in Proc. IEEE ICC, 2015, pp. 2949–2954.
  • [9] H. H. Nguyen, M. Hasegawa, and W. J. Hwang, “Distributed resource allocation for D2D communications underlay cellular networks,” IEEE Communications Letters, vol. 20, no. 5, pp. 942–945, May 2016.
  • [10] A. E. Roth and A. Marilda Oliveira, Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis.   Cambridge University Press, 1992.
  • [11] 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.
  • [12] E. Bodine-Baron, C. Lee, A. Chong, B. Hassibi, and A. Wierman, “Peer effects and stability in matching markets,” in

    Proc. of Int l Conf. on Algorithmic game theory

    , 2011, pp. 117–129.
  • [13] M. J. Osborne and A. Rubinstein, A course in game theory.   MIT Press, 1994.