3 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 3 / 3
Yayın On the extraction of the channel allocation information in spectrum pooling systems(IEEE, 2007-04) Öner, Mustafa Mengüç; Jondral, Friedrich K.The spectrum pooling strategy allows a license owner to share a part of his licensed spectrum with a secondary wireless system (the rental system, RS) during its idle times. The coexistence of two mobile systems on the same frequency band poses many new challenges, one of which is the reliable extraction of the channel allocation information (CAI), i.e. the channel occupation of the licensed system (LS). This paper presents a strategy for the extraction of the CAI based on exploiting the distinct cyclostationary characteristics of the LS and RS signals and demonstrates, via simulations, its application on a specific spectrum pooling scenario, where the LS is a GSM network and the RS is an OFDM based WLAN system.Yayın Cooperative strategies and achievable rates for two user OFDMA channels(IEEE-INST Electrical Electronics Engineers Inc, 2011-12) Bakım, İsmail Sezi; Kaya, OnurWe propose three encoding strategies for a two user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) system, based on block Markov superposition encoding (BMSE). We obtain the expressions for the resulting achievable rate regions for all three encoding strategies. We show that, by allowing for re-partitioning and re-encoding of the cooperative messages across subchannels, it is possible to better exploit the diversity created by OFDMA, and higher rates can be achieved. We demonstrate potential rate gains attained by cooperative OFDMA, through simulations.Yayın Distribution games: a new class of games with application to user provided networks(Institute of Electrical and Electronics Engineers Inc., 2022-11-29) Taşçı, Sinan Emre; Shalom, Mordechai; Korçak, ÖmerUser Provided Network (UPN) is a promising solution for sharing the limited network resources by utilizing user capabilities as a part of the communication infrastructure. In UPNs, it is an important problem to decide how to share the resources among multiple clients in decentralized manner. Motivated by this problem, we introduce a new class of games termed distribution games that can be used to distribute efficiently and fairly the bandwidth capacity among users. We show that every distribution game has at least one pure strategy Nash equilibrium (NE) and any best response dynamics always converges to such an equilibrium. We consider social welfare functions that are weighted sums of bandwidths allocated to clients. We present tight upper bounds for the price of anarchy and price of stability of these games provided that they satisfy some reasonable assumptions. We define two specific practical instances of distribution games that fit these assumptions. We conduct experiments on one of these instances and demonstrate that in most of the settings the social welfare obtained by the best response dynamics is very close to the optimum. Simulations show that this game also leads to a fair distribution of the bandwidth.
