Loading...
Search for: secondary-users
0.003 seconds

    Multi-user opportunistic spectrum access with channel impairments [electronic resource]

    , Article AEU - International Journal of Electronics and Communications ; Volume 67, Issue 11, November 2013, Pages 955–966 Majd, A. (Sayyed Arash) ; Salehkalybar, S ; Pakravan, M. R ; Sharif University of Technology
    Abstract
    In this paper, we study the impact of sensing error and channel fading on the decision process of a multiple secondary user network in a primary network whose channel occupancy states are modelled as a Bernoulli process. We present a randomized access strategy to maximize total secondary network throughput. The proposed method guarantees that the probability of collision between primary and secondary users in each channel is less than the predefined value of Pc = ξ. To find the optimal access strategy, we formulate secondary network throughput as an optimization problem. Then, using the KKT method to find the solution, we break the original problem into multiple sub-problems. Then, we employ... 

    Distributed multiuser sequential channel sensing schemes in multichannel cognitive radio networks

    , Article IEEE Transactions on Wireless Communications ; Volume 12, Issue 5 , 2013 , Pages 2055-2067 ; 15361276 (ISSN) Shokri Ghadikolaei, H ; Sheikholeslami, F ; Nasiri Kenari, M ; Sharif University of Technology
    2013
    Abstract
    Effective spectrum sensing strategies enable cognitive radios (CRs) to identify and opportunistically transmit on under-utilized spectral resources. In this paper, sequential channel sensing problems for single and multiple secondary users (SUs) networks are effectively modeled through finite state Markovian processes. More specifically, a model for single user case is introduced and its performance is validated through analytical analysis. Then, in order to address multiple SUs case, this model is extended to include the modified p-persistent access (MPPA) protocol. Since the scheme utilized experiences a high level of collision among the SUs, to mitigate the problem appropriately,... 

    Stable throughput analysis for a cooperative WLAN with primary and secondary users

    , Article 2012 6th International Symposium on Telecommunications, IST 2012 ; 2012 , Pages 535-540 ; 9781467320733 (ISBN) Nazari, M. A ; Ashtiani, F ; Sharif University of Technology
    2012
    Abstract
    In this paper, we propose a new scenario in order to increase the total throughput of a WLAN. In this scenario, some secondary users (SUs) are considered in a primary WLAN such that SUs cooperate with primary users (PUs) in transmitting the primary packets. Each SU sends its packets as well as the primary packets collided at the access point, but overheard successfully at the SU, by random access the primary WLAN. We show that SUs cooperation is able to compensate their adverse effect in the WLAN, so total throughput in the WLAN increases without a significant degrading effect for the stability region of PUs. To this end, we use an analytical model based on open queueing networks. By solving... 

    Throughput Analysis of Secondary Users Cooperating with Primary Users in Wireless Networks

    , M.Sc. Thesis Sharif University of Technology Nazari, Mohammad Ali (Author) ; Ashtiani, Farid (Supervisor)
    Abstract
    Cooperative coexistence of two kinds of users with different priorities in random access wireless networks has been studied in this thesis. Source burstiness, a phenomenon in data communication networks, allows using silence periods of primary users (PUs) to have a better spectrum utilization. In this respect, new users, known as secondary users (SUs), are considered to exploit the resources opportunistically. In usual spectrum sharing systems, SUs have to act in a way to be transparent for the PUs. Therefore, they are allowed to access the common spectrum band only when PUs are silent. However, seeking such opportunities needs sensing capability of secondary nodes.In this thesis, sensing... 

    Multi-user opportunistic spectrum access with channel impairments

    , Article AEU - International Journal of Electronics and Communications ; Volume 67, Issue 11 , 2013 , Pages 955-966 ; 14348411 (ISSN) Majd, S. A ; Salehkaleybar, S ; Pakravan, M. R ; Sharif University of Technology
    2013
    Abstract
    In this paper, we study the impact of sensing error and channel fading on the decision process of a multiple secondary user network in a primary network whose channel occupancy states are modelled as a Bernoulli process. We present a randomized access strategy to maximize total secondary network throughput. The proposed method guarantees that the probability of collision between primary and secondary users in each channel is less than the predefined value of P c = ξ. To find the optimal access strategy, we formulate secondary network throughput as an optimization problem. Then, using the KKT method to find the solution, we break the original problem into multiple sub-problems. Then, we... 

    State-dependent Gaussian Z-interference channel: New results

    , Article Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014 ; 26- 29 October , 2014 , pp. 468-472 ; ISBN: 9784885522925 Ghasemi Goojani, S ; Behroozi, H ; Sharif University of Technology
    Abstract
    A class of Gaussian Z-interference channels with state is investigated in the regime of high state power in which two transmitters communicate two independent messages through a 'dirty' Z-interference channel. Transmitter 1 (primary user) interferes with receiver 2 while transmitter 2 (secondary user) does not interfere with receiver 1. In addition, receiver 2 suffers from a random state sequence which is non-causally known only at transmitter 1. For this setup, which is also investigated by Duan et al. in [1], first we characterize the capacity region for the deterministic case and then by the obtained insight from analyzing the deterministic case, we establish sufficient conditions under... 

    Spectrally encoded code-division multiple access for cognitive radio networks

    , Article IET Communications ; Vol. 8, Issue. 2 , 2014 , Pages 184-196 ; ISSN: 17518628 Najafi, S ; Shayesteh, M. G ; Sharif University of Technology
    Abstract
    Recent studies have revealed that spectrum congestion is due to the inefficient usage of spectrum against the availability. Cognitive radio is viewed as an approach for improving the utilisation of radio spectrum. The spectrally encoded (spread-time) code-division multiple access (SE-CDMA) technique (which is regarded as the dual of spread spectrum CDMA) is considered and its performance in cognitive radio networks is studied. In cognitive network spectrum, overlay and underlay techniques are employed to enable the primary and secondary users to coexist while improving the overall spectrum efficiency. It is shown that SE-CDMA provides considerable flexibility to design overlay and underlay... 

    Resource allocation using fragmented-spectrum synchronous OFDM-CDMA in cognitive radio networks

    , Article IWCIT 2014 - Iran Workshop on Communication and Information Theory ; May , 2014 ; ISBN: 9781479948772 Akhoondi, F ; Poursaeed, O ; Salehi, J. A ; Sharif University of Technology
    Abstract
    This paper presents a fragmented-spectrum synchronous OFDM-CDMA modulation and utilize it as secondary users modulation in a cognitive radio-based network to provide high data rate by efficiently exploiting available spectrum bands in a target spectral range while simultaneously offering multiple-access capability. In particular, given preexisting communications in the spectrum where the system is operating, a channel sensing and estimation method is used to obtain information of subcarrier availability. Given this information, some three-level codes are provided for emerging new cognitive radio users. Furthermore, analytical results of the system performance in a typical cognitive radio... 

    A periodic jump-based rendezvous algorithm in cognitive radio networks

    , Article Computer Communications ; Volume 79, 1 , April , 2016 , Pages 66–77 ; 01403664 (ISSN) Salehkaleybar, S ; Pakravan, M. R ; Sharif University of Technology
    Elsevier  2016
    Abstract
    An important issue in designing multichannel MAC protocols for Opportunistic Spectrum Access (OSA) is the synchronization between Secondary Users (SUs). Synchronization can be performed in two phases: the initial handshaking, and then the synchronous hopping across available channels. In this paper, we address the problem of initial handshaking through the approach called "blind rendezvous". We first introduce a role-based solution by constructing two channel hopping sequences. The secondary transmitter and receiver jump across channels according to these two sequences. The proposed algorithm guarantees rendezvous in at most (C+1)2 time slots (where C is the number of channels) and two SUs... 

    Resource allocation in cognitive radio inspired non-orthogonal multiple access

    , Article 2019 Iran Workshop on Communication and Information Theory, IWCIT 2019, 24 April 2019 through 25 April 2019 ; 2019 ; 9781728105840 (ISBN) Mokhtari, F ; Mirmohseni, M ; Ashtiani, F ; Nasiri Kenari, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    In this paper, we investigate the resource allocation in an underlay cognitive radio network when multiple primary and secondary users are served via multi-carrier non-orthogonal multiple access (MC-NOMA) scheme. Our main objective is to maximize the sum rate subject to a minimum guaranteed rate for the primary users. The performance of the system is highly affected by the power allocation and subchannel assignment for all users. Hence, our optimization problem is formulated as a nonconvex mixed integer non-linear program whose global optimum can be found through a computationally infeasible exhaustive search. To overcome this challenge, we propose an efficient iterative algorithm to jointly... 

    A novel low-complexity dynamic frequency selection algorithm for cognitive radios

    , Article 4th IEEE International Symposium on Wireless Communication Systems 2007, ISWCS'07, Trondheim, 16 October 2007 through 19 October 2007 ; 2007 , Pages 558-562 ; 1424409799 (ISBN); 9781424409792 (ISBN) Bahramian, S ; Khalaj, B. H ; Sharif University of Technology
    2007
    Abstract
    In this paper, a non-cooperative distributed frequency selection algorithm is proposed for cognitive radio networks in which in addition to interference minimization, the minimization of implementation complexity and probability of interruption of secondary users are also addressed. The convergence and interference reduction property of the algorithm is also demonstrated using game theoretic concepts. In order to evaluate the performance of the algorithm, the associated optimization problem is formulated into a variant of graph colouring problem, and a centralized algorithm is also proposed as an approximation of the optimal solution. Finally, simulation results demonstrate that the proposed...