Abstract

Even though system energy and spectral efficiency are major issues in wireless network, reaching these objectives conjointly seems very difficult and requires the usage of tradeoffs. Moreover, depending on the context, the importance of either varies. In underloaded context, guaranteeing high Quality of Service (QoS) is easily achievable due to large surplus of available radio resources and focus should be put on energy rather than system throughput. On the contrary, in an overloaded context, the lack of available radio resources required that resources allocation algorithms focus on system capacity in order to preserve QoS. Since the major issue of the network is to satisfy users, in this specific case, energy consumption must become lesser important. Many specialized solutions have been proposed that focus either on energy saving or on throughput maximization. They provide high performances, respectively, on their specific network traffic load context, previously described, but are not optimized outside. Other solutions that proposed static tradeoffs provide average performances but can not be fully efficient in all scenarios. In this paper, we propose a Dynamic Tradeoff between energy and throughput efficiency that adapts the scheduler priorities to the network context and particularly to the traffic load. Considering the context, the scheduler is able to adjust its behavior in order to maintain high QoS while reducing as much energy as possible. Performance evaluation will show that the proposed solution succeeds to minimize energy consumption better than energy focused scheduler in underloaded context while being able to reach the same spectral efficiency as throughput oriented scheduler in highly loaded context.

Highlights

  • The constant growing number of users which each are more and more demanding in term of throughput and delay constraints lead us to develop new resource allocation algorithms that increase spectral efficiency while guaranteeing high fairness

  • Thanks to its dynamic MD parameter based on the bandwidth usage ratio, Dynamic Tradeoff scheduler (DT) has lesser spectral efficiency in low traffic load context using a moderate usage of the multiuser diversity focusing its efforts on energy

  • We underline that the network objectives must be dependant of the context and to the traffic load

Read more

Summary

INTRODUCTION

The constant growing number of users which each are more and more demanding in term of throughput and delay constraints lead us to develop new resource allocation algorithms that increase spectral efficiency while guaranteeing high fairness. The Power-based Proportional Fairness (PPF) [9] proposes PF-based scheduler that avoids the inefficient allocations (with low SNR) and delays flows that have high average energy consumption This slightly increase energy efficiency since this gives access to the medium only to users with good SNR, allows to always use higher modulation orders that are the most profitable, but potentially could segregate users with high traffic load (that will use more radio resources and use more energy). A correction factor on the distance is adequately integrated in the algorithm in order to offer the same high fairness considering far and close users like PF This scheduler is built to compress the transmission time but, contrary to the OEA, FETOT is able to take a full benefit on the multiuser diversity thanks to a new trade-off parameter. This paper is construct as follow: section II presents the system description, section III describes the Dynamic Tradeoff algorithm, section IV shows performances evaluations and section V is the conclusion

SYSTEM DESCRIPTION
DYNAMIC TRADE-OFF SCHEDULER
System Throughput Maximization
Fairness guarantee
Energy consumption minimization
Study of the Multi-user Diversity factor
Context and simulation setup
Simulation results
30 MaxSNR
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call