Energy Efficient Uplink Transmission in CR OFDMA Network Under Fading Channel usingPricing Technique

Energy Efficient Uplink Transmission in CR OFDMA Network Under Fading Channel usingPricing Technique

1. Santhiya

   ECE Department, JCET Trichy, India

   S. Devapriya

   Associate professor, ECE Department, JCET Trichy, India

   Abstract This project investigates the sensing order problem for multi-user and multi-channel cognitive radio networks. The energy-efficient resource allocation in orthogonal frequency division multiple access-based cognitive radio (CR) technologies present great flexibility and practicability for future green wireless communications. To increase the energy efficiency and guarantee the primary transmitters quality-of service requirement using pricing factor. A linear pricing technique was introduced to handle both the inter-ST coupling

   – Spectrum competition among secondary users and intra-ST coupling – the relationship between available bandwidth and spectrum allocation. Simulation results demonstrate that the proposed strategy brings high EE. Additionally, by adjusting the pricing factors, a various performance can be achieved by the STs with different priorities. A distributed algorithm is devised to harvest the multi resource and multiuser gains, and the energy-efficient JSAPC is transformed to 1-D pricing- factor profile searching.

   Keywords pricing factor, linear pricing technique, orthogonal frequency division multiple access (OFDMA), Cognitive radio networks (CRNs), energy efficiency (EE), JSPAC algorithm.

   1. INTRODUCTION

      To improving energy efficiency (EE) for wireless communication networks are increasingly critical and has attracted extensive attention from both academic and industrial fields [1].The energy-efficient resource-allocation schemes should be designed for future wireless networks, which promisingly employ both the orthogonal frequency division multiple access (OFDMA) and cognitive radio (CR) technologies. CR important role are improving EE in future green wireless communications.

      The electromagnetic radio spectrum is one of the most precious and scarce natural resource. Wireless networks today follow a fixed spectrum assignment strategy, the use of which is licensed by government agencies. This results in a large portion of assigned spectrum being used only intermittently or not at all due to various factors such as amount of traffic load on licensed users or geographical variations. A cognitive radio relies on opportunistic communication between unlicensed or secondary users (SU) s over temporarily unused spectral bands that are licensed to their PUs.

      CR is an intelligent device that can coexist with licensed users without affecting their quality of service. The primary users actively participate in a non-cooperative game with secondary users by selecting a reasonable interference cap on the total interference they are willing to tolerate. They are rewarded for sharing their licensed spectrum, but are penalized if they do not meet their own target QoS. Consecutively, the secondary users aim to achieve energy efficient transmissions, while not causing extreme interference to the primary users being aware the only feasible sensing information of available transmission for whole CRN is from each single node, we examine network topology of CRN with spectrum map idea for slotted systems with different packet sizes under fading channels in traffic model.

      Different from the metric definition based on link connections to neighbors in conventional opportunistic routing, our proposed routing algorithm, Spectrum Aware Opportunistic Routing defines Opportunistic Link Transmission metrics based on both delay and possible connections to neighboring nodes. Current studies provide the potential of the CR technology in energy saving. However, there also exist some challenges for energy- efficient resource allocation in CRNs. For instance, SUs may selfishly compete for the scarce resources (i.e., spectrum and power) to improve their own EE. Furthermore, due to the strict quality of- service (QoS) requirements imposed by PUs, there are some specific connections among SUs [6]. As a result, the previous work focusing on EE in traditional OFDMA systems [10]-[13] cannot be directly used for the energy-efficient design in OFDMA CRNs.

      The multiuser gain in EE, we consider uplink energy- efficient transmission in multiuser OFDMA CRNs with the underlay paradigm are shown in Fig. 1, there are multiple secondary transmitters (STs) and a single primary transmitter (PT) sharing the same spectrum. In this paper, Both Primary transmitter (PT) and primary receiver (PR) are PUs and that both secondary transmitter (ST) and secondary receiver (SR) are SUs. . The PTs QoS requirement is described with its SINR threshold, which has been widely used in underlay CRNs [8], [9].

      We focus on this scenario mainly due to two reasons. First, for uplink transmission, each individual transmitter is

      powered by a battery with limited energy, and improving EE is a valid approach to prolonging the equipments lifetime. Second, for underlay systems, there is no need for spectrum sensing procedures, and STs can obtain the transmission opportunities without resorting to intricate signal processing and coding [7], [14].

      Fig1. Cognitive Radio Network scenario

   2. RELATED WORK

      In [1] Gürkan Gür and Fatih Alagoz et al presents Green Wireless Communications via Cognitive Dimension. The escalation of energy consumption in wireless networks directly results in the increase of greenhouse gas emission, which has been accepted as a major threat for environmental protection dramatically reduce energy consumption and carbon footprint. To achieve SUs specified SINR targets with minimum transmitted power in multiple antenna systems, Abraham and Popescu [18] and Nguyen and Le- Ngoc [19] studied the power control game in uplink and downlink communications respectively. Specifically, these two researches can be only applied to interweave CRNs, and to determine spectral holes in space, time, and frequency through perfect sensing [7].

      In [21], both PU and SUs joined the game simultaneously, wherever each SUs are to maximize its own EE by

      underlay OFDM-based CRNs, where the EE of SUs was maximized. In [24] Xie et al. have designed gradient-based iteration algorithm was proposed to achieve the equilibrium solution and both studies assume that there is only one SU that can be served in each time slot.

   3. SYSTEM MODEL

      Regard as an uplink OFDMA CRN, somewhere a resulting system coexists with a primary system. In the resulting system, there is N STs desire to transmit data to the general SR2.Total bandwidth B is divided into K orthogonal sub channel with the bandwidth of

      B0=B/K. (1)

      suppose that PT uses all K sub channel and that each sub waterway is completely assigned to at most one ST in each time to avoid intervention among similar STs. Taking only significant desertion into relation, the strait power expand beginning node i to j can be expressed as

      i

      i

      10 0 10 (2)

      10 0 10 (2)

      Pr dB = 10 log (L ) 10 log (dj )

      Pt d0

      Someplace L0 < 1 is the free-space gain at distance d0, is the path-loss exponent, di j is the distance between nodes i and j, and is a Gauss-distributed casual unpredictable with zero mean and variance 2 . It is assumed that g0 is the channel power gain from the PT to the PR, and gn, n = 1, 2.

      . . N, is the channel power gain of the interference link from ST n to the PR.

      Additionally, hn, n = 1, 2, . . . , N, presents the waterway power gain from ST n to the SR, and h0 presnts the gain of intervention link from the PT to the SR. Throughout this paper, we assume that these channel influence gains are unchanging for the duration of the primary prepared phase. Denote k as the amount of sub channel in a meeting by ST n, and the SINR for ST n on each sub channel, i.e., n, can be articulated as

      Pnh

      adjusting transmit power and the SINR requirement of each

      = kn n

      = Pnhn

      (3)

      PU cannot be always guaranteed in this work. In this researches mainly focus on the EE-oriented power control

      n B00+P0h0

      knB0n+P0h0kn

      k

      k

      k

      k

      strategy. However, our objective is to maximize each STs

      = Pnhn = HnPn

      (4)

      EE in underlay OFDMA CRNs, where both the spectrum resource and transmit power are taken into consideration. In OFDMA systems, there is more degree of freedom to manage radio resources; hence, the JSAPC problem is challenging. In [22], Gao et al. have devised a joint cell selection and JSAPC scheme in heterogeneous OFDMA systems from the throughput perspective. Recently, there have been more researches shifting their attention from capacity to EE in OFDMA systems [10][13]. In this paper, we consider the underlay OFDMA CRN, where STs attempt to maximize their individual EE without causing

      bn(0+P0h0) bn

      B

      B

      Wherever P0 and Pn are the put on the air power of the PT and ST n, respectively; n0/2 is the noise power spectrum compactness at the receiver; and bn = knB0, spontaneously, can be regarded as the corresponding bandwidth that is assigned to the ST.

      In the same way, on each sub conduit used by ST n, the SINR for the PT, i.e., n 0, can be expressed as

      00

      performance degradation to PT. In [23], Wang et al. have

      = = 00 = 00

      (5)

      0

      designed an optimal iterative power-allocation algorithm for

      0 0+

      0+

      0+

      Additionally, taking into account the transmit power budget of ST n, i.e., PB n , the allowed maximum transmit power for the ST can be expressed as

      n n n n

      n n n n

      Pmax = min{thb , PB} (6)

   4. PRICING BASED MULTI RESOURCE ALLOCATION

      Together PT and most imperative earpiece are PUs and with the intention of both STs and secondary headset (SR) are SUs. The PTs QoS prerequisite is described with its SINR doorstep, which has be widely used in underlay CRNs. First, for uplink transmission, each individual transmitter is powered by a battery with some degree of energy, and improving EE is a valid approach to prolong the equipments existence. Second, for underlay systems, there is no need for spectrum sensing procedures, and STs can obtain the program opportunities without resorting to sophisticated suggestion processing in addition to coding a linear pricing technique is employed to decouple these correlations, whereas this system is generally applied to improve the efficiency of Nash symmetry in wireless supply administration .Finally, a distributed algorithm is devise to harvest the multi resource and multiuser gains, and the energy-efficient JSAPC is transformed to 1-D pricing-factor profile searching.

      A.JOINT SUBCHANNEL ALLOCATION AND POWER

      is satisfied. The convergence rate slows down when the pricing-factor incremental step sizes become smaller.

2. JSPAC ALGORITHM FOR K FINITE

   Algorithm 2 can be divided into two parts. At first, STs use Algorithm 1. Then, each ST calculates its own marginal EE, decides whether one more sub channel is allowed, and updates the required number of sub channels. The second part of Algorithm 2, the convergence is self-evident because it is a non iterative process. Therefore, the convergence of Algorithm 2 can be also guaranteed. Each ST n should compare its own EE gain n with any other STs.

3. SOLUTION OF JSAPC

The set of available equivalent bandwidth for each ST is discrete. The equivalent bandwidth profile achieved by

1 2

1 2

= (, , . . ) (7) The corresponding sub channel profile

1 2

1 2

= (, , . . ) (8)

=( , , . , ) (9)

CONTROL (JSPAC)

1

0

2

0

A joint sub channel allocation and power control strategy to maximize each individual STs EE. Due to the scarceness of sub channels and the selfishness of STs, there is a competitive relation among the STs, which is referred to as inter-ST coupling. Meanwhile, to guarantee the PTs QoS requirement, for each ST, there also exists a coupling between the maximum permitted transmit power and assigned sub channels, which is referred to as intra- ST coupling. These coupled relationships significantly make the formulated JSAPC problem complex. In this complexity reduced using pricing based resource allocation scheme is used.

B. JSPAC ALGORITHM FOR K TENDS TO INFINITE

When K and B is fixed, for each ST, the set of available equivalent bandwidth is compact and convex, i.e., [0, B]. In this algorithm to deal with the couplings and to improve the efficiency of NE, we pay our attention to the linear pricing scheme during the initialization of the algorithm, SR announces pricing-factor incremental step sizes cn, n N, to all STs, and additionally, each ST n sets its initial pricing factor cn to c0 n and incremental step size n to cn. Then, each ST n updates its pricing factor cn

= cn +cn and notifies other STs its strategy b.

In this algorithm, each ST does not stop updating and notifying until the total bandwidth constraint N n=1 b n B

Where, [x] denotes the major integer no more than x.

=

=

= 1 0 (10)

1. PERFORMANCE MEASURES

   1].TDMA-FP: The overall transmission period (frame) is divided into N time slots, which are due to N STs in a round-robin method. In each slot, all sub channels are exclusively used by the corresponding ST, i.e., time division multiple access fixed power (TDMA-FP)

   2].TDMA-AP: The overall transmission period is divided into N time slots, which are allocated to N STs in a round- robin manner. In each slot, all sub channels are exclusively used by the corresponding ST, TDMA. When transmitting, each ST n adaptively adjusts its transmit power according to adaptive power (AP).

   3]. FDMA-FP: During the transmission period, all sub channels are equally assigned to N STs, FDMA. When transmitting, each ST N sets its transmit power to Pmax.

   4].FDMA-AP: During the transmission period, all sub channels are equally assigned to N STs, FDMA. When transmitting, each ST n adaptively adjusts its transmit power according to AP.

2. PRICING FACTOR AND PRIORITY

The priority of a class-i ST is inversely proportional to i, with 1 indicating the highest priority and Q indicating the lowest priority. In each ST, the larger pricing factor increment step size may result in larger pricing factor. The larger pricing factor will bring the ST smaller equivalent bandwidth. The STs with a higher priority can apply smaller increment step size to compete for more resource and achieve better performance. Where the STs having higher priority achieve both the higher EE and transmission rate

1. RESULTS AND DISSCUSION

   To design cognitive radio which is showned by fig. 2 and N STs are uniformly deployed in a circle area with radius rs and center is the location of SR. The fig. 3 and fig. 4 shows the JSPAC limits k is finite and JSPAC limits k is infinite

   Fig.2. Design of cognitive radio

   Joint sub channel allocation and power control (JSPAC) having higher energy efficiency compared to other frequency division multiple access fixed power (FDMA-FP) and frequency division multiple access adaptive power (FDMA-AP) are choosing optimal transmit power and time division multiple access fixed power (TDMA-FP) time division multiple access adaptive power (TDMA-A) are achieve higher EE.

   In addition, because both the subchannels and transmit power can be dynamic exploited by the STs and JSPAC can bring higher EE compared with other four strategies which is showned in fig .5(a) .

   .

   Fig.3.JSPAC k is finite

   Fig.4.JSPAC k is infinite

   Fig. 5(b) JSPAC does not bring the highest transmission rate and JSPAC has approximately 25% less transmission rate than FDMA-FP, it transmits about 1.6 times more data than FDMA-FP are fixed amount of energy to transmit the same amount of data, JSPAC saves around 60% energy.

   Fig.5 (a) EE versus total bandwidth

   Fig 6(a) and Fig 6(b) shows the total EE and transmission rate versus the SINR requirement of primary transmitter. JSPAC does not bring the highest energy efficiency. For each ST implementing FDMA-FP and TDMA-FP, when the

   n

   n

   max

   max

   SINR requirement of PT is increased, Pn becomes smaller and closer to P* therefore using these two schemes, the system EE may increased with the rise of SINR requirement of PT.

   Fig.5 (b) Transmission rate versus total bandwidth

   Fig. 6 (a) EE versus the SINR requirement of the PT

   Fig. 6 (b) Transmission rate versus the SINR requirement of the Primary Transmitter (PT).

   Fig. 7 (a) EE versus total bandwidth

   Fig.7 (b) Transmission rate versus total bandwidth.

   The secondary transmitter (ST) with higher priority can apply smaller increment step size to complete for more resource and achieve better performance. The ST has about 85% more energy efficiency and the transmission rate which is showned in fig.7 (a) EE versus total bandwidth and the fig 7.(b) Transmission rate versus total bandwidth

2. CONCLUSIONS

In this project we focus on the sensing order problem for multi-user and multi-channel cognitive radio networks. The energy-efficient resource allocation in OFDMA cognitive radio networks consisting of multiple STs. To maximize the energy efficiency and guarantee the primary transmitters quality-of service requirement using pricing factor and to maximize each individual STs EE, we formulated the JSAPC as a mixed-integer multi objective programming with fixed constraints. A linear pricing technique is employed to handle both inter ST coupling and intra ST coupling. A distributed algorithm is devised to harvest the multi resource and multiuser gains, and the energy-efficient JSAPC is transformed to 1-D pricing-factor profile searching. Additionally, by applying smaller pricing factor, the STs with higher priority can compete for more sub channels and achieve both higher energy efficiency and transmission rate.

REFERENCES

1. Y. Chen, S. Zhang, S. Xu, and G. Li, Fundamental tradeoffs on green wireless networks, IEEE Commun. Mag., vol. 49, no. 6, pp. 3037,Jun. 2011.

2. A. Ghosh, R. Ratasuk, B. Mondal, N. Mangalvedhe, and T. Thomas, Lte-advanced: Next-generation wireless broadband technology [invited paper], IEEE Wireless Commun., vol. 17, no. 3, pp. 1022, Jun. 2010.

3. D. Grace, J. Chen, T. Jiang, and P. Mitchell, Using cognitive radio to deliver Green communications, in Proc. Int. Conf. CROWNCOM, Hannover, German, Jun. 2009, pp. 16.

4. G. Gür and F. Alagöz, Green wireless communications via cognitive dimension: An overview, IEEE Netw., vol. 25, no. 2, pp. 5056, Mar./Apr. 2011.

5. C. Yang, J. Li, M. Sheng, and Q. Liu, Green heterogeneous networks: A cognitive radio idea, IET Commun., vol. 6, no. 13, pp. 19521959, Sep. 2012.

6. N. Devroye, M. Vu, and V. Tarokh, Cognitive radio networks,

   IEEESignal Process. Mag., vol. 25, no. 6, pp. 1223, Nov. 2008.

7. A. Goldsmith, S. Jafar, I. Maric, and S. Srinivasa, Breaking spectrum gridlock with cognitive radios: An information theoretic perspective, Proc. IEEE, vol. 97, no. 5, pp. 894914, May 2009.

8. Y.Xing, C. Mathur,M.Haleem,R.Chandramouli, andK. P. Subbalakshmi, Dynamic spectrum access with QoS and interference temperature constraints, IEEE Trans. Mobile Comput., vol. 6, no. 4, pp. 423433, Apr. 2007.

9. J.-S. Pang, G. Scutari, D. Palomar, and F. Facchinei, Design of cognitive radio systems under temperature-interference constraints: A variational inequality approach, IEEE Trans. Signal Process., vol. 58, no. 6, pp. 32513271, Jun. 2010.

10. G. Miao, N. Himayat, Y. Li, and D. Bormann, Energy efficient design in wireless OFDMA, in Proc. IEEE ICC, Beijing, China, May 2008, pp. 33073312.

11. G. Miao, N. Himayat, and G. Li, Energy-efficient link adaptation in frequency-selective channels, IEEE Trans. Commun., vol. 58, no. 2, pp. 545554, Feb. 2010.

12. C. Xiong, G. Li, S. Zhang, Y. Chen, and S. Xu, Energy- and spectralefficiency tradeoff in downlink OFDMA networks, IEEE Trans. Wireless Commun., vol. 10, no. 11, pp. 38743886, Nov. 2011.

13. S. Buzzi, G. Colavolpe, D. Saturnino, and A. Zappone, Potential games for energy-efficient power control and subcarrier allocation in uplink multicell OFDMA systems, IEEE J. Sel. Topics Signal Process., vol. 6, no. 2, pp. 89103, Apr. 2012.

14. S. Buzzi and D. Saturnino, A game-theoretic approach to energy- efficient power control and receiver design in cognitive CDMA wireless networks, IEEE J. Sel. Topics Signal Process., vol. 5, no. 1, pp. 137150, Feb. 2011.

15. P. Zhou, W. Yuan, W. Liu, and W. Cheng, Joint power and rate control in cognitive radio networks: A game-theoretical approach, in Proc. IEEE ICC, Beijing, China, May 2008, pp. 32963301.

16. C. Saraydar, N. B. Mandayam, and D. Goodman, Efficient power control via pricing in wireless data networks, IEEE Trans. Commun., vol. 50, no. 2, pp. 291303, Feb. 2002.

17. F. Wang, M. Krunz, and S. Cui, Price-based spectrum management in cognitive radio networks, IEEE J. Sel. Topics Signal Process., vol. 2, no. 1, pp. 7487, Feb. 2008.

18. S. Abraham and D. C. Popescu, Joint transmitter adaptation and power control for cognitive radio networks with target SIR requirements, Phys. Commun., Jun. 2012.

19. D. H. N. Nguyen and T. Le-Ngoc, Multiuser downlink beamforming in multicell wireless systems: A game theoretical approach, IEEE Trans. Signal Process., vol. 59, no. 7, pp. 3326 3338, Jul. 2011.

20. C. Yang and J. Li, A game-theoretic approach to adaptive utilitybased power control in cognitive radio networks, in Proc. IEEE VTC, Anchorage, AK, USA, Sep. 2009, pp. 16.

21. S. Jayaweera and T. Li, Dynamic spectrum leasing in cognitive radio networks via primary-secondary user power control games, IEEE Trans. Wireless Commun., vol. 8, no. 6, pp. 33003310, Jun. 2009.

22. L. Gao, X. Wang, G. Sun, and Y. Xu, A game approach for cell selection and resource allocation in heterogeneous wireless networks, in Proc. IEEE Commun. Soc. Conf. SECON, Salt Lake City, UT, USA, Jun. 2011, pp. 530538.

23. Y. Wang, W. Xu, K. Yang, and J. Lin, Optimal energy-efficient power allocation for OFDM-based cognitive radio networks, IEEE Commun. Lett., vol. 16, no. 9, pp. 14201423, Sep. 2012.

24. R. Xie, F. Yu, and H. Ji, Energy-efficient spectrum sharing and power allocation in cognitive radio femtocell networks, in Proc. IEEE INFOCOM, Orlando, FL, USA, Mar. 2012, pp. 16651673.

25. A. Akbari, R. Hoshyar, and R. Tafazolli, Energy-efficient resource allocation in wireless OFDMA systems, in Proc. IEEE PIMRC, Istanbul, Turkey, Sep. 2010, pp. 17311735.

26. C.-Y. Ho and C.-Y. Huang, Energy-saving massive access control and resource allocation schemes for M2M communications in OFDMA cellular networks, IEEE Wireless Commun. Lett., vol. 1, no. 3, pp. 209212, Jun. 2012.

27. A. Goldsmith, Wireless Communications. Cambridge, U.K.: Cambridge Univ. Press, 2004.

28. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.

29. Q. D. La, Y. Chew, and B.-H. oong, An interference- minimization potential game for OFDMA-based distributed spectrum sharing systems, IEEE Trans. Veh. Technol., vol. 60, no. 7, pp. 33743385, Sep. 2011.