نتایج جستجو برای: filling station
تعداد نتایج: 83042 فیلتر نتایج به سال:
In this paper subcarrier and power allocation to each user at base-station maximize the user data rates, subject to constraints on total power and bit error rate. First, each sub-channel is assigned to the user with best channel-to-noise ratio for the channel, with random power distributed by water filling algorithm. The proposed genetic search helps fast convergence and can handle large alloca...
This paper investigates a cross layer scheduling scheme for OFDMA wireless system with heterogeneous delay requirements. Unlike most existing cross layer designs which take a decoupling approach, our design considers both queueing theory and information theory in modeling the system dynamics. The cross layer design is formulated as an optimization of total system throughput, subject to individu...
In this paper subcarrier and power allocation to each user at base-station maximize the user data rates, subject to constraints on total power and bit error rate. First, each sub-channel is assigned to the user with best channel-to-noise ratio for the channel, with random power distributed by water filling algorithm. The proposed genetic search helps fast convergence and can handle large alloca...
malaria, identified the anophelines responsible and incriminated the Mora-Lalli to be their breeding place. He recommended, among other measures, oiling the stream, clearing the station of jungle from the Dihang to the MoraLalli. filling in of puddles and pools and the prophylactic issue of mosquito-nets and quinine where practicable. The anophelines identified by him were the following:?A. mac...
In this paper subcarrier and power allocation to each user at base-station maximize the user data rates, subject to constraints on total power and bit error rate. First, each sub-channel is assigned to the user with best channel-to-noise ratio for the channel, with random power distributed by water filling algorithm. The proposed genetic search helps fast convergence and can handle large alloca...
This paper investigates the problem of dynamic multiuser subchannel allocation in the downlink of OFDM systems. The assumptions are that the channel model is quasi-static and that the base station has perfect channel information. In traditional TDMA or FDMA systems, resource allocation for each user is nonadaptively fixed, and the water-filling power spectrum is known to be optimal. Since the s...
Base station cooperation (BSC) has recently arisen as a promising way to increase the capacity of a wireless network. Implementing BSC adds a new design dimension to the classical wireless network design problem: how to define the subset of base stations (clusters) that coordinate to serve a user. Though the problem of forming clusters has been extensively discussed from a technical point of vi...
In this paper subcarrier and power allocation to each user at base-station maximize the user data rates, subject to constraints on total power and bit error rate. First, each sub-channel is assigned to the user with best channel-to-noise ratio for the channel, with random power distributed by water filling algorithm. The proposed genetic search helps fast convergence and can handle large alloca...
We develop a multi-period capacitated flow refueling location problem for electric vehicles (EVs) as the EV market responds to the charging infrastructure. The optimization model will help us determine the optimal location of level 3 chargers as well as the number of charging modules at each station over multiple time periods. Our model can also be applied to fast-filling gaseous alternative fu...
In this paper subcarrier and power allocation to each user at base-station maximize the user data rates, subject to constraints on total power and bit error rate. First, each sub-channel is assigned to the user with best channel-to-noise ratio for the channel, with random power distributed by water filling algorithm. The proposed genetic search helps fast convergence and can handle large alloca...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید