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.
Location information of nodes is the basis for many applications in wireless sensor networks (WSNs). However, most previous localization methods make the unrealistic assumption: (i) all nodes in WSN are always awake and (ii) the radio range of nodes is an ideal circle. This overlooks the common scenario that sensor nodes are duty-cycled to save energy and the radio range of nodes is irregular. In...
Carrier aggregation (CA) is one of the key features for LTE-Advanced. By means of CA, two or more component carriers (CCs) can be aggregated to form a much wider transmission bandwidth up to 100 MHz in order to meet the IMT-Advanced requirements. With CA, it is possible to schedule a user equipment (UE) on multiple component carriers simultaneously. From radio resource management (RRM) perspective,...
This paper proposes a dynamic primal-dual type scheduling algorithm in wireless networks, which achieves optimal throughput even with uncertain parameters. In wireless networks, such uncertain parameters are generated by complicated stochastic dynamics, such as random packet arrivals, channel fading, and node mobilities. The algorithm is a generalization of the well-known max-weight scheduling algorithm...
Due to the massive use of parallel and distributed operations of inputs and outputs, iterative scheduling algorithms are attractive in finding a maximal size matching for an input-queued switch. For constructing a large high-speed switch, a distributed multi-chip implementation of an iterative scheduling algorithm should be followed. Since different chips may locate on different switch linecards and...
Multicast is emerging as an important means of transmitting the same content to multiple receivers so as to efficiently utilize the overall network resource. We propose an opportunistic multicast scheduling algorithm that exploits time-varying channel conditions in time division multiplexing (TDM) cellular networks and maximizes the overall network throughput under certain resource fairness constraints...
Virtual Output Queuing (VOQ) is widely used by input-queued (IQ) packet switches to eliminate the head-of-line (HoL) blocking problem. A lot of research has been devoted to design iterative arbitration algorithms to maximize the throughput of this architecture. Nevertheless, these approaches require either a high computation complexity or large contention resolution times for high-speed switches....
In this paper, we consider the Request Routing (RR) strategy in the CDN live streaming application. We show that to find an optimal RR strategy is correspond to a static optimization problem if the total number of clients is known in advance. However, this static approach is ineffective due to the difficulty in precisely estimating the number of clients off-line. We then develop the MPS scheduling...
In this paper, we propose a distributed throughput-optimal ad hoc wireless network scheduling algorithm, which is motivated by the celebrated simplex algorithm for solving linear programming (LP) problems. The scheduler stores a sparse set of basic schedules, and chooses the max-weight basic schedule for transmission in each time slot. At the same time, the scheduler tries to update the set of basic...
The relay-assisted Orthogonal Frequency-Division Multiple Access (OFDMA) cellular system is one of the most promising technology thanks to the enhancements of the system capacity and coverage it provides. However, some special features may lower its positive aspects. In multiple relay case, the asymmetric link problem in the two stages forming the relaying process may result in important resource...
3GPP's Long Term Evolution is defined by the standardization body's Release 8 and 9, and provides more than a substrate for 3GPP's IMT-Advanced candidate, namely LTE-Advanced, which is due to be defined in Release 10. Both LTE and LTE-Advanced have SC-FDMA in their uplink, a multi-carrier access technique requiring contiguous subcarriers allocations for each UE. No scheduling algorithm, however, is...
The new DVB-S2 standard, introduced by ETSI, is mainly based on three key concepts: best transmission performance, total flexibility and reasonable receiver complexity. The Adaptive Coding and Modulation (ACM) scheme is the tecnique allowing to achieve these main goals. In particular, this tecnique allows to adapt the modulation and code levels, performed at the physical layer, at channel variations...
Wireless Sensor Networks (WSN) consist of sensors that may serve a single application or multiple applications. Effective resource management is important when multiple applications share a WSN. In this research, a number of scheduling algorithms that use varying degrees of knowledge about system and application characteristics are proposed. Simulation results show how scheduling can be made more...
Uplink resource allocation with intercell interference mitigation in LTE networks is investigated. A non-cooperative probabilistic interference avoidance scheme and a pricing-based cooperative power control scheme are proposed. A scheduling algorithm is presented and used with the proposed interference mitigation schemes. In the absence of power control, scheduling with the probabilistic interference...
In this paper, we propose a multi-level round-robin multicast scheduling (MLRRMS) algorithm with look-ahead (LA) mechanism for N×N input-queued switches. Fan-out splitting is applied, where a multicast cell can be transferred to all its destinations over any number of cell times. The scheduler constructs the Traffic Matrix before each cell transmission based on the fan-out vectors of the cells in...
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.