Analysis of cellular mobile networks using fair throughput scheduling

Fernekes, Andreas; Klein, Anja; Wegmann, Bernhard; Dietrich, Karl

doi:10.1109/pimrc.2009.5450316

Cited by 3 publications

(5 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2) Conventional Equal Throughput (ET) Scheduling: Conventional ET scheduling is based on the idea that the long-term average throughput of all users can be made identical by scheduling in each time slot the user having the minimum moving average throughput [14]. At time slot t, the conventional ET scheduler schedules for information transmission the user n * that satisfies…”

Section: E Baseline Scheduling Schemesmentioning

confidence: 99%

“…To avoid this disadvantage, maximum normalized SNR (N-SNR) scheduling [12] schedules the user having the maximum N-SNR (normalized to its own average value) and thus maximizes the users' rates while ensuring that the rate of each user is proportional to the user's channel quality, providing proportional fairness. Another approach to providing fairness is to guarantee equal throughput (ET) to all users by scheduling in each time slot the user having the minimum moving average throughput [14]. To the best of the authors' knowledge, multi-user scheduling schemes that exploit MUD and provide long-term fairness among users have not been studied in the context of SWIPT so far.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Multiuser Scheduling Schemes for Simultaneous Wireless Information and Power Transfer Over Fading Channels

Morsi

Michalopoulos

Schober

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Radio frequency energy harvesting presents a viable solution for prolonging the lifetime of wireless communication devices. In this paper, we study downlink multi-user scheduling for a time-slotted system with simultaneous wireless information and power transfer. In particular, in each time slot, a single user is scheduled to receive information, while the remaining users opportunistically harvest the ambient radio frequency energy. We devise novel online scheduling schemes in which the tradeoff between the users' ergodic rates and their average amount of harvested energy can be controlled. In particular, we modify the well-known maximum signal-to-noise ratio (SNR) and maximum normalized-SNR (N-SNR) schedulers by scheduling the user whose SNR/N-SNR has a certain ascending order (selection order) rather than the maximum one. We refer to these new schemes as order-based SNR/N-SNR scheduling and show that the lower the selection order, the higher the average amount of harvested energy in the system at the expense of a reduced ergodic sum rate. The order-based N-SNR scheduling scheme provides proportional fairness among the users in terms of both the ergodic achievable rate and the average harvested energy. Furthermore, we propose an order-based equal throughput (ET) fair scheduler, which schedules the user having the minimum moving average throughput out of the users whose N-SNR orders fall into a given set of allowed orders. We show that this scheme provides the users with proportionally fair average harvested energies. In this context, we also derive feasibility conditions for achieving ET with the orderbased ET scheduler. Using the theory of order statistics, the average per-user harvested energy and ergodic achievable rate of all proposed scheduling schemes are analyzed and obtained in closed form for independent and non-identically distributed Rayleigh, Ricean, Nakagami-m, and Weibull fading channels.Our closed-form analytical results are corroborated by simulations. Index TermsWireless information and power transfer, RF energy harvesting, multi-user scheduling, fairness.

show abstract

Section: E Baseline Scheduling Schemesmentioning

confidence: 99%

mentioning

confidence: 99%

Multiuser Scheduling Schemes for Simultaneous Wireless Information and Power Transfer Over Fading Channels

Morsi

Michalopoulos

Schober

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…For the special case of j = N , the resulting average system capacity Conventionally, ET fairness can be achieved by scheduling the user having the minimum moving average throughput [9]. However, with such a scheduling rule, neither the resulting ET nor the amount of energy harvested by the users can be controlled.…”

Section: A Order-based Normalized-snr (N-snr) Schedulingmentioning

confidence: 99%

“…For example, scheduling the user having the maximum instantaneous normalized signalto-noise ratio (N-SNR) (normalized to its own average SNR) maximizes the users' capacities while ensuring that the capacity of each user is proportional to his channel quality. Another way to provide fairness is to guarantee equal throughput (ET) to all users by scheduling the user having the minimum moving average throughput [9]. In SWIPT systems, however, the scheduling rules should be modified to additionally control the amount of energy harvested by the users.…”

Section: Introductionmentioning

confidence: 99%

Multi-user scheduling schemes for simultaneous wireless information and power transfer

Morsi

Michalopoulos

Schober

2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

In this paper, we study the downlink multi-user scheduling problem for a time-slotted system with simultaneous wireless information and power transfer. In particular, in each time slot, a single user is scheduled to receive information, while the remaining users opportunistically harvest the ambient radio frequency (RF) energy. We devise novel scheduling schemes in which the tradeoff between the users' ergodic capacities and their average amount of harvested energy can be controlled. To this end, we modify two fair scheduling schemes used in informationonly transfer systems. First, proportionally fair maximum normalized signal-to-noise ratio (N-SNR) scheduling is modified by scheduling the user having the j th ascendingly ordered (rather than the maximum) N-SNR. We refer to this scheme as orderbased N-SNR scheduling. Second, conventional equal-throughput (ET) fair scheduling is modified by scheduling the user having the minimum moving average throughput among the set of users whose N-SNR orders fall into a certain set of allowed orders Sa (rather than the set of all users). We refer to this scheme as orderbased ET scheduling. The feasibility conditions required for the users to achieve ET with this scheme are also derived. We show that the smaller the selection order j for the order-based N-SNR scheme, and the lower the orders in Sa for the order-based ET scheme, the higher the average amount of energy harvested by the users at the expense of a reduction in their ergodic capacities. We analyze the performance of the considered scheduling schemes for independent and non-identically distributed (i.n.d.) Ricean fading channels, and provide closed-form results for the special case of i.n.d. Rayleigh fading.

show abstract

“…For a message-only transmission system, a multi-user scheduling mechanism is usually designed to adopt the independent and time-varying multipath fading characteristics so as to establish the multi-user diversity [ 12 , 13 ]. With this method, the user can transmit and receive messages in a good channel environment throughout the time slots.…”

Section: Introductionmentioning

confidence: 99%

Improved Scheduling Mechanisms for Synchronous Information and Energy Transmission

Qin

Yang

Zhang

et al. 2017

Sensors

View full text Add to dashboard Cite

Wireless energy collecting technology can effectively reduce the network time overhead and prolong the wireless sensor network (WSN) lifetime. However, the traditional energy collecting technology cannot achieve the balance between ergodic channel capacity and average collected energy. In order to solve the problem of the network transmission efficiency and the limited energy of wireless devices, three improved scheduling mechanisms are proposed: improved signal noise ratio (SNR) scheduling mechanism (IS2M), improved N-SNR scheduling mechanism (INS2M) and an improved Equal Throughput scheduling mechanism (IETSM) for different channel conditions to improve the whole network performance. Meanwhile, the average collected energy of single users and the ergodic channel capacity of three scheduling mechanisms can be obtained through the order statistical theory in Rayleig, Ricean, Nakagami-m and Weibull fading channels. It is concluded that the proposed scheduling mechanisms can achieve better balance between energy collection and data transmission, so as to provide a new solution to realize synchronous information and energy transmission for WSNs.

show abstract

Analysis of cellular mobile networks using fair throughput scheduling

Cited by 3 publications

References 20 publications

Multiuser Scheduling Schemes for Simultaneous Wireless Information and Power Transfer Over Fading Channels

Multiuser Scheduling Schemes for Simultaneous Wireless Information and Power Transfer Over Fading Channels

Multi-user scheduling schemes for simultaneous wireless information and power transfer

Improved Scheduling Mechanisms for Synchronous Information and Energy Transmission

Contact Info

Product

Resources

About