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 address the challenge of energy efficiency in hierarchical spectrum sharing networks with dynamic traffic. We consider a primary and a cognitive secondary transmitter–receiver pair, where the secondary transmitter can utilize cooperative transmission to relay primary traffic while superimposing its own information. The secondary user meets a dilemma in this scenario. By choosing cooperation, it...
Cooperative communication has been proposed as a means to increase the capacity of a wireless link by mitigating the path-loss, fading and shadowing effects of radio propagation. In this paper, we evaluate the efficiency of cooperative communication in large scale wireless networks under interference from simultaneous transmissions. Specifically, we consider tunable spatial reuse time division multiplexing...
MIMO, OFDMA and cooperative relaying are the key technologies in future wireless communication systems. However, under the usage of these technologies, resource allocation becomes a more crucial and challenging task. In multi-user MIMO-OFDMA relay-enhanced cellular networks, we formulate the optimal instantaneous resource allocation problem including user group selection, path selection, power allocation,...
We propose cooperative geographic routing (cGeo-routing) for wireless mesh networks by combining cooperative transmission with traditional geographic routing. We model and evaluate two cGeo-routing schemes including Cooperative-Random Progress Forwarding (C-RPF) and Cooperative-Nearest with Forward Progress (C-NFP). We show that cGeo-routing significantly increases the average transport capacity for...
The deployment of relay stations in OFDMA cellular networks is a promising solution to provide ubiquitous high-data-rate coverage. However, it makes the resource allocation a more crucial and challenging task. In OFDMA relay-enhanced cellular networks, we formulate the optimal instantaneous resource allocation problem including path selection, power allocation and subchannel scheduling to achieve...
The cooperative selection diversity (CSD) scheme which dynamically selects the best transmission scheme between decode-and-forward relaying and direct transmission outperforms the other complex cooperative diversity schemes in terms of throughput and implementation complexity. In this paper, we formulate the optimal resource allocation problem with a fairness constraint in the downlink of OFDMA relay-enhanced...
We propose a efficient semi-distributed resource allocation scheme for OFDMA relay-enhanced downlink systems. Firstly, an adaptive subframe partitioning (ASP) algorithm that considers user's queue length and achievable data rate is used by base station to assign resources to relay stations. Regarding the slot allocation, we suggest two ways to extend conventional single-hop scheduling algorithms into...
OFDMA-based relay-enhanced cellular systems have been proposed as a promising solution for the next-generation wireless communications. The deployment of relay stations (RS) in cellular networks makes resource scheduling a more crucial and challenging task. In this paper, a novel centralized scheduling scheme called centralized scheduling with void filling (CS-VF) is proposed for two-hop relay-enhanced...
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.