Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this study, the authors study the self-organising user assignment problem for the multi-user cooperation network. In the cellular network with user cooperation, idle users near the base station are seen as potential relay nodes, which can assist cell edge users to transmit data. Practically, the selfish nature of users is considered in the authors’ model. They design a score-based system, where...
Consider the diversity of users' traffic types, we investigate the problem of distributed carrier aggregation in cognitive small cell networks. In most existing carrier aggregation (CA) researches, they aimed to optimize the throughput or to mitigate the interference. However, in practical wireless communication users' quality of experience (QoE) is the ultimate concerning. Different QoE functions...
This paper investigates the problem of relay selection in dynamic networks where the active source node set is randomly changing from slot to slot. Furthermore, each source node only has its individual information and there is no information exchange among source nodes. The goal of the source nodes is to determine their relay selections. This optimization problem is hard to solve, even in a centralized...
In this paper, we study the problem of distributed relay selection in wireless networks using a game theoretic approach. Specifically, we consider a system model where one relay node can be shared by multiple source-destination pairs. Our objective is to find the relay selections of source nodes to optimize the total capacity. The relay selection problem is formulated as a congestion game with player-specific...
This article investigates the issue of joint relay selection and channel allocation in LTE relay networks, where the available channels of each node are restricted and heterogeneous. We decompose the issue into two subproblems: one is the channel selection of relay to mitigate the interference among relay nodes and another is joint relay and channel selection of source node to maximize the total capacity...
In this paper, we consider the self-organizing relay assignment schemes for cooperative communications designed with both complete and incomplete network information. With complete network information, we propose an evolutionary self-organizing relay assignment (ESRA) scheme and show that the scheme achieves a globally stable state. With incomplete network information, we propose a distributed learning...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.