The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the problem of multicasting from a single source to a set of destinations. We assume that the source can either reach the destinations directly or forward its traffic through a set of relays. Due to the non-linear attenuation of the signal with distance, employing the relays can help to improve the signal quality at the destinations. Meanwhile, relays also consume energy for retransmission...
The problem of optimal scheduling of multicast traffic in time-varying wireless networks is studied in the framework of utility maximization. Since the wireless channel cannot be known exactly, only scheduling policies that take decisions based on a possibly inaccurate estimate of the wireless channel state are considered. A stationary, on-line, gradient-based scheduling and rate control policy is...
We consider the problem of multicasting from a single source to a set of destinations. We assume that the source cannot reach the destinations directly, but must forward its traffic through a set of relays. Under the performance objective of maximizing the common amount of information (number of bits) that the source sends to all destinations per Joule of the total energy spent, we wish to obtain...
We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all traffic, i.e., to obtain schedules of minimum length. We consider time-varying wireless networks with imperfect side information at the sources. We model the minimum-length scheduling problem through partially observable stochastic...
We study the problem of minimum-length scheduling in time-varying, single-hop wireless networks where each source of traffic has a finite amount of data to deliver to its corresponding destination. Our objective is to obtain a joint scheduling and rate control policy that minimizes the overall time required to deliver all the data to its intended destinations. We incorporate the physical layer into...
In this paper we study the problem of scheduling through rate and power control for multicast traffic. Our objective is to maximize the total user utility where user utilities are measured in terms of the long term average received rates. Considering the fact that accurate knowledge of the wireless channel conditions may not be always available, we focus on policies that take decisions based only...
We characterize the stability region of wireless, single-hop networks with time-varying imperfect channels. We define a joint scheduling and transmission rate control policy that maximizes the set of stable rates the network can support. Since obtaining the optimal policy is computationally complex, we confine our attention on the specific case of pure time division multiple access (TDMA) based scheduling...
In this paper, we study the problem of joint scheduling and rate control in wireless networks, when each transmitter has a finite amount of data traffic to deliver to its corresponding receiver. Our objective is to minimize the time required to deliver the total data traffic. The scheduling decisions take into account the constraints of the physical layer through the well-known physical interference...
We consider a system of multiple multicast transmitters with possibly overlapping receivers. We introduce a stationary policy that allocates the transmission rates and powers of every transmitter with the objective to maximize the overall user utility, which is measured in terms of the total average rate of each receiver. We show optimality of this policy by employing the theory of stochastic approximation...
In this paper we consider a K transmitter and K receiver single-hop wireless network. We obtain a rate control policy that provides proportional fair rate allocation to the transmitters when the outcome of a transmission depends on the signal to interference plus noise ratio (SINR) at the corresponding receiver. The policy selects at any time slot one action from a set of actions that are described...
We determine a joint link activation and routing policy that maximizes the stable throughput region of time-varying wireless ad-hoc networks with multiple commodities. In practice, the state of the channel process from the time it is observed till the time a transmission actually takes place can be significantly different. With this in mind, we introduce a stationary policy that takes scheduling and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.