CN103052078A - Pricing method for maximizing revenue of primary user in cognitive network - Google Patents

Pricing method for maximizing revenue of primary user in cognitive network Download PDF

Info

Publication number
CN103052078A
CN103052078A CN2012105638414A CN201210563841A CN103052078A CN 103052078 A CN103052078 A CN 103052078A CN 2012105638414 A CN2012105638414 A CN 2012105638414A CN 201210563841 A CN201210563841 A CN 201210563841A CN 103052078 A CN103052078 A CN 103052078A
Authority
CN
China
Prior art keywords
user
power
secondary user
pricing
sigma
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN2012105638414A
Other languages
Chinese (zh)
Other versions
CN103052078B (en
Inventor
王正强
蒋铃鸽
何晨
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Jiaotong University
Original Assignee
Shanghai Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shanghai Jiaotong University filed Critical Shanghai Jiaotong University
Priority to CN201210563841.4A priority Critical patent/CN103052078B/en
Publication of CN103052078A publication Critical patent/CN103052078A/en
Application granted granted Critical
Publication of CN103052078B publication Critical patent/CN103052078B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a method for maximizing the revenue of a primary user in a cognitive network. The method comprises the following steps of: initializing the power of a secondary user; judging whether the initialized power of the secondary user meets the maximum interference power limit of the secondary user or not according to the initialized power of the secondary user, and if the initialized power of the secondary user meets the maximum interference power limit, providing a pricing method of the primary user, and finishing the method, otherwise entering the next step; for the condition that the initialized power of the secondary user does not meet the maximum interference power limit in the second step, iteratively searching for the power of the secondary user; traversing the power of the secondary user, which is obtained by the iterative searching, to find the power, by which the revenue of the primary user can be maximized, of a group of secondary users, and making a price according to the power by the primary user. Under the condition that the primary user knows the information of an interference channel of the secondary user for the primary user, an optimal price for the primary user can be found by iteration of at most n times, and the power of the secondary user during the searching of each time is calculated by an analytical expression; and the method has the advantages of high searching speed, practicability and feasibility.

Description

Pricing method for maximizing revenue of main user in cognitive network
Technical Field
The invention relates to the technical field of spectrum resource management, in particular to a pricing method for maximizing the income of a main user in a cognitive network.
Background
In spectrum sharing situations, a primary user may allow a secondary user to access its own spectrum with appropriate power by charging for interference caused by the secondary user. For a master user, firstly, in order to ensure the service quality of the master user, a reasonable pricing method needs to be adopted for each secondary user so that the total interference caused by the secondary users to the master user is smaller than a certain threshold; meanwhile, as the price affects the demand of the secondary user, the primary user needs to adopt a better pricing method in order to maximize the income of the primary user. Therefore, in order to ensure that the interference when the secondary user accesses does not affect the normal communication of the primary user and maximize the benefit of the primary user, the primary user needs to reasonably price the interference caused by each secondary user. The pricing of the primary user is too low, so that the interference of the secondary user is too large and is larger than the interference threshold of the primary user; the pricing of the primary user is too high, the purchase demand of the secondary user is reduced, and therefore the income of the secondary user is reduced. Therefore, a better pricing method is needed to maximize the income of the user owner on the premise of ensuring the service quality of the user owner.
In recent years, research on pricing methods to maximize revenue for primary users in cognitive networks is receiving increasing attention. The prior literature search shows that the relevant literature is as follows:
an article entitled "printing for uplink power control magnetic networks" was published by Hui Yu et al in 2010 IEEE Transactions on vehicle Technology, May.2010, vol.59, No.4, pp.1769-1778. In the article, a secondary user can rent the frequency spectrum of a primary user and is allowed to access under a certain interference threshold. In the model, as the maximum utility function formula of the main user is non-convex, the strategy of the main user is set into a certain linear proportional relation by the article, and then the income problem of the main user is converted into a univariate optimization problem to solve a group of pricing, however, the method can only obtain a suboptimal pricing algorithm.
Yuan Wu et al, 2011 IEEE Transactions on Wireless Communications, Jan.2011, vol.10, No.1, pp.12-19, published an article entitled "Joint printing and Power Allocation for Dynamic Spectrum Access Networks with Stackelberg Game Model". The article provides a new pricing model, the model considers the guarantee of the service quality of a main user, the problem of joint pricing and power control in the cognitive network is modeled into a Stackelberg game problem, and a low-complexity heuristic algorithm is provided to maximize the income of the main user.
As known from relevant research, in order to maximize the income of the primary user and simultaneously satisfy the service quality of the primary user, the primary user needs to adopt a more reasonable pricing method for the secondary user. The invention provides a pricing method for maximizing the income of the main user, which is based on monotonicity of a utility function of the main user about interference power and converts a non-convex problem of the income of the main user into an equivalency convex problem.
Disclosure of Invention
The invention provides a pricing method for maximizing the income of a master user, aiming at the defect that the conventional pricing method for the master user in a cognitive network cannot guarantee the maximization of the income of the master user. The method and the device can enable the primary user to realize the maximization of the primary user benefit through an iterative method under the condition that the primary user knows the link channel information and the preference weight of the rate of the secondary user. The pricing method finds the optimal solution for maximizing the benefits of the primary user on the premise of ensuring that the interference of the secondary user to the primary user is smaller than a given interference threshold, improves the benefits of the primary user compared with the traditional pricing method based on linear proportion, and increases the total benefits and the throughput of a secondary user network.
According to one aspect of the invention, the pricing method for maximizing the income of the primary user in the cognitive network comprises the following specific steps:
the first step is as follows: initializing secondary user power;
the second step is that: judging whether the maximum interference power limit of the secondary user is met or not according to the secondary user initialization power, if so, giving a pricing method of the primary user, and ending the method; otherwise, entering the third step;
the third step: aiming at the condition that the initialization power of the secondary user does not meet the maximum interference power limit in the second step, iteratively searching the power of the secondary user;
the fourth step: and (4) finding a group of power of the secondary users maximizing the benefits of the primary users by traversing the power of the secondary users obtained by the iterative search in the third step, and pricing by the primary users according to the power.
Preferably, in a first step, in particular, the transmission power p of the individual secondary users i is initializedi p i = 1 L - 1 max ( Lw i ( T + σ 2 ) λ - ( T + σ 2 ) , 0 ) / h i , i = 1 , · · · , n ,
Wherein, wiIs a preference factor of a secondary user i, n is the number of secondary users, L is the spread spectrum gain of a cognitive user, T is the interference threshold of a primary user, hiIs the channel gain, σ, at the secondary user i to the base station2Is background noise; parameter lambda pass equation 1 L - 1 Σ i = 1 n max ( Lw i ( T + σ 2 ) λ - ( T + σ 2 ) , 0 ) = T Giving out; the number of initialization iterations k is 1.
Preferably, in the second step, in particular if for all i ∈ {1, …, n }, the condition hipi≤PmaxIs established, wherein PmaxPricing of primary user for maximum interference power per secondary user
Figure BDA00002632165800031
Comprises the following steps:
Figure BDA00002632165800032
transmission power of secondary user
Figure BDA00002632165800033
Figure BDA00002632165800033
1, …, n, and pricing is finished; if the condition is not satisfied, go to the third step.
Preferably, in the third step, in particular for all less than
Figure BDA00002632165800034
When the value of k is (i) ═ k-1,
Figure BDA00002632165800035
j-1, …, i-1, power of the kth iteration sub-user j
Figure BDA00002632165800036
Is given by the equation p jk * = max ( Lw j ( T + σ 2 ) λ - ( T k + σ 2 ) L - 1 , 0 ) / h j , j ≥ i Determining; wherein the parameter TkBy a system of equations
Σ i = k n max ( w i a k λ - a k b , 0 ) = T k max ( w j a k λ - a k b , 0 ) = p max ,
Obtaining, updating the iteration number to k +1 times, wherein the equation set
Figure BDA000026321658000310
Preferably, in a fourth step, primary user pricing in particular
Figure BDA000026321658000311
Comprises the following steps:
Figure BDA000026321658000312
i is 1, …, n, wherein
Figure BDA000026321658000313
The corresponding optimal transmitting power of the secondary user i under the optimal pricing of the primary user is as follows:
Figure BDA000026321658000314
wherein,
Figure BDA000026321658000315
for the power of user i for the jth iteration,
Figure BDA000026321658000316
the power of the sub-user i for the kth iteration.
Compared with the prior art, the invention has the beneficial effects that: the method searches the pricing strategy for maximizing the income of the main user through the optimality condition of the main user, and can find the pricing for maximizing the income of the main user instead of a set of suboptimal pricing compared with the traditional pricing method based on linear proportion constraint. The method provided by the invention can improve the income of the primary user and simultaneously improve the income and the throughput of the secondary user. The algorithm has an analytical expression, so that the execution speed is high, and the feasibility and the practicability are better.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
FIG. 1 is a flow chart of a pricing method for maximizing revenue of primary users in a cognitive network provided in accordance with the present invention;
FIG. 2 is a graph of primary user gain when the interference power threshold is increased from 0 to 20 in accordance with the present invention;
FIG. 3 is a graph of the total secondary user gain when the interference power threshold is increased from 0 to 20 in accordance with the present invention;
fig. 4 is a graph of the secondary user and rate for the present invention when the interference power threshold is increased from 0 to 20.
Detailed Description
The embodiments of the present invention will be described in detail below with reference to the accompanying drawings: the present embodiment is implemented on the premise of the technical solution of the present invention, and a detailed implementation manner and a specific operation process are given, but the protection scope of the present invention is not limited to the following embodiments.
This embodiment is a pricing scheme for maximizing the revenue of the primary user, and the background noise is zero mean gaussian white noise value σ2The spreading gain L of the secondary user is 32, and the link gain h of the secondary user satisfies 0,1]Is uniformly distributed, the preference factor of the secondary user is [0,300]Is uniformly distributed, the result is 104The sub-simulations were averaged.
The first step, initializing the transmitting power of each secondary user: p i = 1 L - 1 max ( Lw i ( T + σ 2 ) λ - ( T + σ 2 ) , 0 ) / h i , i = 1 , · · · , n , wherein: w is aiPreference factor for secondary user i, n is number of secondary users, L is spread spectrum gain of cognitive user, T is interference threshold set by primary user, hi is channel gain from secondary user i to base station, sigma2Is background noise. λ is the equation: 1 L - 1 Σ i = 1 n max ( Lw i ( T + σ 2 ) λ - ( T + σ 2 ) , 0 ) = T the solution of (1). The number of initialization iterations k is 1.
Second, if there is h for all i ∈ {1, …, n }, there is hipi≤PmaxIs formed, wherein PmaxPricing of secondary users for maximum received power from each secondary user to the base station
Figure BDA00002632165800043
Comprises the following steps:
Figure BDA00002632165800044
transmission power of secondary user
Figure BDA00002632165800045
Comprises the following steps:
Figure BDA00002632165800046
and i is 1, …, n, and the pricing is finished. Otherwise, go to the third step.
The third step: when in use
Figure BDA00002632165800047
When the number i is equal to k-1,
Figure BDA00002632165800048
j-1, …, i-1. Power of the kth iteration sub-user j
Figure BDA00002632165800049
Is given by the equation
p jk * = max ( Lw j ( T + σ 2 ) λ - ( T k + σ 2 ) L - 1 , 0 ) / h j , j ≥ i Determining;
wherein, TkIs a system of equations:
Σ i = k n max ( w i a k λ - a k b , 0 ) = T k max ( w j a k λ - a k b , 0 ) = p max ,
updating the iteration number to k +1 times, wherein the equation set
Figure BDA00002632165800052
Figure BDA00002632165800053
The fourth step: order to
Figure BDA00002632165800054
Then the transmit power of the secondary user is: p i * = p ij * , the pricing of the main user is as follows: λ i * = Lw i Σ j ≠ i h j p j * + σ 2 + Lh i p i * , i = 1 , · · · , n .
the secondary user initialization power is as follows: p i = 1 L - 1 max ( Lw i ( T + σ 2 ) λ - ( T + σ 2 ) , 0 ) / h i , , i is 1,2, …, n.T is the primary user interference threshold, L is the secondary user spreading gain, h is the secondary user spreading gainiChannel gain, σ, for sub-user i to base station2Is background noise. Where λ is given by the equation: 1 L - 1 Σ i = 1 n max ( Lw i ( T + σ 2 ) λ - ( T + σ 2 ) , 0 ) = T and (4) giving.
The optimal pricing criterion of the master user is as follows: if the power to the base station is less than P for the used secondary usersmaxThen the pricing of the master user is:
Figure BDA00002632165800059
wherein:is the transmit power of the secondary user i. If there is at least one secondary user to base station power greater than PmaxThen the best possible transmit power is obtained by an iterative search as follows.
The iterative search is as follows:
when in use
Figure BDA000026321658000511
When the number i is equal to k-1,
Figure BDA000026321658000512
j=1,…,i-1.
p jk * = max ( Lw j ( T + σ 2 ) λ - ( T k + σ 2 ) L - 1 , 0 ) / h j , j ≥ i .
wherein T iskIs a system of equations:
Σ i = k n max ( w i a k λ - a k b , 0 ) = T k max ( w j a k λ - a k b , 0 ) = p max ,
wherein, in the system of equations
Figure BDA00002632165800062
Figure BDA00002632165800063
Updating the iteration times to k +1 times;
the optimal pricing of the master user is as follows: λ i * = Lw i Σ j ≠ i h j p j * + σ 2 + Lh i p i * , i = 1 , · · · , n , wherein
Figure BDA00002632165800065
For the optimal transmit power of the secondary user, the value of j is:
Figure BDA00002632165800066
in this embodiment, fig. 2 shows primary user profit graphs obtained by respectively adopting a proportional linear pricing method and the method of this embodiment; FIG. 3 is a graph of the total profit of the secondary user obtained by the proportional linear pricing method and the method of the present embodiment; fig. 4 is a graph of secondary users and rates obtained using the proportional linear pricing method and the method of the present embodiment, respectively. As can be seen from fig. 2: compared with a proportional linear pricing method, the implementation method obtains higher income of the main user. As can be seen from fig. 3: the total benefit of the secondary user obtained by the proposed method is higher than that obtained by the proportional linear pricing method, and as can be seen from fig. 4: the proposed method achieves a higher rate of secondary user summation than the proportional linear pricing method. The combination of fig. 2, fig. 3 and fig. 4 shows that the sum rate of the cognitive network is improved by the method compared with the traditional cost-based method. The method obtains the optimal pricing strategy of the master user, and the method can effectively solve related problems such as power control based on pricing in the cognitive network.
The foregoing description of specific embodiments of the present invention has been presented. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes and modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention.

Claims (5)

1. A pricing method for maximizing revenue of a main user in a cognitive network is characterized by comprising the following specific steps:
the first step is as follows: initializing secondary user power;
the second step is that: judging whether the maximum interference power limit of the secondary user is met or not according to the secondary user initialization power, if so, giving a pricing method of the primary user, and ending the method; otherwise, entering the third step;
the third step: aiming at the condition that the initialization power of the secondary user does not meet the maximum interference power limit in the second step, iteratively searching the power of the secondary user;
the fourth step: and (4) finding a group of power of the secondary users maximizing the benefits of the primary users by traversing the power of the secondary users obtained by the iterative search in the third step, and pricing by the primary users according to the power.
2. A pricing method for maximizing primary user revenue in cognitive network according to claim 1, characterized in that in the first step, specifically, initializing the transmission power p of each secondary user ii p i = 1 L - 1 max ( Lw i ( T + σ 2 ) λ - ( T + σ 2 ) , 0 ) / h i , i = 1 , · · · , n ,
Wherein, wiIs a preference factor of a secondary user i, n is the number of secondary users, L is the spread spectrum gain of a cognitive user, T is the interference threshold of a primary user, hiIs the channel gain, σ, at the secondary user i to the base station2Is background noise; parameter lambda pass equation 1 L - 1 Σ i = 1 n max ( Lw i ( T + σ 2 ) λ - ( T + σ 2 ) , 0 ) = T Giving out; the number of initialization iterations k is 1.
3. A pricing method in cognitive networks maximizing primary user revenue as claimed in claim 2, characterized by the fact that in the second step, condition h is applied, in particular if for all i e {1, …, n }, all i e {1, …, n }ipi≤PmaxIs established, wherein PmaxPricing of primary user for maximum interference power per secondary user
Figure FDA00002632165700013
Comprises the following steps:
Figure FDA00002632165700014
transmission power of secondary userThe pricing is finished; if the condition is not satisfied, go to the third step.
4. A pricing method for maximizing primary user revenue in cognitive networks according to claim 3, wherein in the third step, specifically for all less than all
Figure FDA00002632165700016
When the value of k is (i) ═ k-1,
Figure FDA00002632165700017
j-1, …, i-1, power of the kth iteration sub-user j
Figure FDA00002632165700018
Is given by the equation p jk * = max ( Lw j ( T + σ 2 ) λ - ( T k + σ 2 ) L - 1 , 0 ) / h j , j is more than or equal to i; wherein the parameter TkBy a system of equations
Σ i = k n max ( w i a k λ - a k b , 0 ) = T k max ( w j a k λ - a k b , 0 ) = p max ,
Obtaining, updating the iteration number to k +1 times, wherein the equation set
Figure FDA00002632165700023
Figure FDA00002632165700024
5. A pricing method for maximizing primary user revenue in cognitive network according to claim 4, wherein in the fourth step, in particular, primary user pricingComprises the following steps:
Figure FDA00002632165700026
i is 1, …, n, wherein
Figure FDA00002632165700027
Optimal transmit power for secondary user i:wherein,
Figure FDA00002632165700029
for the power of user i for the jth iteration,the power of the sub-user i for the kth iteration.
CN201210563841.4A 2012-12-21 2012-12-21 The pricing method of revenue of primary user is maximized in cognition network Expired - Fee Related CN103052078B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210563841.4A CN103052078B (en) 2012-12-21 2012-12-21 The pricing method of revenue of primary user is maximized in cognition network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210563841.4A CN103052078B (en) 2012-12-21 2012-12-21 The pricing method of revenue of primary user is maximized in cognition network

Publications (2)

Publication Number Publication Date
CN103052078A true CN103052078A (en) 2013-04-17
CN103052078B CN103052078B (en) 2015-10-14

Family

ID=48064551

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210563841.4A Expired - Fee Related CN103052078B (en) 2012-12-21 2012-12-21 The pricing method of revenue of primary user is maximized in cognition network

Country Status (1)

Country Link
CN (1) CN103052078B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103744399A (en) * 2014-01-10 2014-04-23 上海交通大学 Dynamic network control method used for vehicle participatory sensing system
CN104010288A (en) * 2014-05-22 2014-08-27 上海交通大学 Optimal power control method based on pricing in cognitive network
CN107172624A (en) * 2017-04-20 2017-09-15 浙江工业大学 A kind of frequency spectrum pricing method based on secondary user's normal state preference distribution
CN111246486A (en) * 2020-01-13 2020-06-05 中原工学院 Non-perfect perception cognitive network starkeberg-based game resource allocation method

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102695131A (en) * 2012-05-18 2012-09-26 上海交通大学 Distributed power control method in cognitive network on basis of cooperative game

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102695131A (en) * 2012-05-18 2012-09-26 上海交通大学 Distributed power control method in cognitive network on basis of cooperative game

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
SHAMIK SENGUPTA等: "An Economic Framework for Dynamic Spectrum Access and Service Pricing", 《IEEE/ACM TRANSACTIONS ON NETWORKING》 *
罗丽平等: "具有约束条件的认知无线电网络最优频谱价格函数", 《电子学报》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103744399A (en) * 2014-01-10 2014-04-23 上海交通大学 Dynamic network control method used for vehicle participatory sensing system
CN103744399B (en) * 2014-01-10 2016-01-06 上海交通大学 Dynamic network control method in a kind of vehicle participatory sensory perceptual system
CN104010288A (en) * 2014-05-22 2014-08-27 上海交通大学 Optimal power control method based on pricing in cognitive network
CN104010288B (en) * 2014-05-22 2017-07-11 上海交通大学 Optimal power control method based on price in cognition network
CN107172624A (en) * 2017-04-20 2017-09-15 浙江工业大学 A kind of frequency spectrum pricing method based on secondary user's normal state preference distribution
CN111246486A (en) * 2020-01-13 2020-06-05 中原工学院 Non-perfect perception cognitive network starkeberg-based game resource allocation method
CN111246486B (en) * 2020-01-13 2021-05-28 中原工学院 Non-perfect perception cognitive network starkeberg-based game resource allocation method

Also Published As

Publication number Publication date
CN103052078B (en) 2015-10-14

Similar Documents

Publication Publication Date Title
Cai et al. A graph-coloring based resource allocation algorithm for D2D communication in cellular networks
Han et al. Uplink channel reusing selection optimization for device-to-device communication underlaying cellular networks
CN108990071B (en) NOMA-based two-step power distribution method in CR network system
CN104105193B (en) A kind of power distribution method based on Starckelberg games in heterogeneous network
CN107613556B (en) Full-duplex D2D interference management method based on power control
CN102271338A (en) Method for cognizing channel and power joint distribution of radio network
CN105050176A (en) Stackelberg game power control method based on interruption probability constraint in cognitive radio network
CN108712746B (en) Partially overlapped channel aggregation game model and learning method
CN102364973A (en) Sharing spectrum access-based carrier and power combined allocation method
CN103052078B (en) The pricing method of revenue of primary user is maximized in cognition network
CN105813209A (en) Energy harvesting-based dynamic spectrum allocation method of D2D communication under cellular network
CN105682231B (en) The power and temporal joint distribution method of cognitive radio networks collaboration communication
CN103687023A (en) Optimization wireless resource method based on time delay differentiated services and proportionality rate constraints
CN107105453A (en) Heterogeneous network selection cut-in method based on analytic hierarchy process (AHP) and evolutionary game theory
CN103582105B (en) A kind of large scale scale heterogeneous cellular network maximizes the optimization method of system benefit
CN104010288B (en) Optimal power control method based on price in cognition network
CN106059734B (en) Massive mimo system pilot distribution method based on edge customer interference metric values
CN105282746A (en) Cognitive radio network frequency spectrum distribution method based on embedded particle swarm gaming
CN111343721B (en) D2D distributed resource allocation method for maximizing generalized energy efficiency of system
CN102547725B (en) Based on the network terminal probability access control method of cognitive radio
CN102843691B (en) Femtocell network spectrum distributing method based on tabu search
CN104640189A (en) Method for adjusting power of ultra-dense heterogeneous network by combining Lagrange duality with improved particle swarm
Liu et al. Dynamic multiple access based on deep reinforcement learning for Internet of Things
CN103619023B (en) Macrocell frequency spectrum pricing and power distribution method based on femtocell base station sensing
Wang et al. Low complexity joint spectrum resource and power allocation for ultra dense networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20151014

Termination date: 20171221