Deterministic access protocols for packet radio networks

In this paper, multiple-phase deterministic protocols for packet radio networks are introduced and analysed. Two modes of information transfer are considered, namely (a) broadcasting and (b) point-to-point transmission. We explore systematic ways of designing multiple-phase protocols and apply them on Manhattan networks. The proposed protocols are studied primarily from the point of view of throughput efficiency. Delay analysis is also presented.     

Effect of bit-to-bit dependence on packet error rate using asynchronous DS-CDMA for mobile packet radio networks

The probability of packet success for asynchronous direct sequence code division multiple access (DS-CDMA) over the multipath fading channel is investigated under different fading conditions and for different cases. We studied the bit-to-bit dependence caused by the multipath fading and by the multiple access interference (MAI) originating from the chip and phase offsets between the desired and interfering signals. We investigated the effect of using the Gaussian versus the improved Gaussian process on the computation of probability of packet success as well as the effect of the bit-to-bit dependence within a packet. The improved Gaussian approximation provides more accurate values for the probability of bit error for any number of simultaneous users, while it also allows us to incorporate the effects of bit-to-bit dependence into the calculations of the probability of packet success.This paper was presented in part at the 17th Biennial Symposium on Communiations, Kingston, June 1994. This work was supported by a strategic grant (STR-0100720) from the Natural Sciences and Engineering Research Council (NSERC) of Canada.     

Staggered multicast protocol with collision-free acknowledgement in multihop spread spectrum packet radio networks

The staggered multicast protocol for multihop spread spectrum packet radio networks is suitable for unicasting and broadcasting as well as multicasting. The common-header/transmitter-based spreading code is used for data packet transmission and the receiver-based code is used for acknowledgement packet transmission. By staggering packet transmission the protocol can significantly reduce broadcasting delay. A special addressing method and packet format are also designed to achieve collision-free acknowledgement and multicast capability. Simulation results show that the protocol provides better throughput-delay performance than the common-header/transmitter-based slotted ALOHA protocol.     

Multiple-packet forwarding protocols for frequency-hop packet radio networks

Reliable data distribution within multiple-hop spread-spectrum packet radio networks requires high performance from the network protocols. The high variability in quality among the links and the unique characteristics of frequency-hop spread-spectrum signaling impose special requirements for network protocols that are to be employed in frequency-hop packet radio networks. These features can be exploited in the forwarding protocols by allowing multiple packets to be included in each forwarding attempt. The use of multiple-packet transmissions exploits the capture property of frequency-hop signaling, and it reduces the overhead required for acknowledgments. A potential trade-off arises because the use of multiple-packet transmissions increases the throughput, but in some situations it can also increase the delay. Two new transmission protocols that employ multiple-packet transmissions are described, and their performance is evaluated.     

A distributed link scheduling algorithm for CDMA packet radio networks

A distributed algorithm for the conflict-free channel allocation in CDMA (code division multiple access) networks is presented. Dynamic adjustment to topological changes is also considered. Though the schedules produced by our algorithm are not optimal with respect to link schedule length, the algorithm is simple and practical. The link schedule length minimization problem is NP-complete. Here the length of a link schedule is the number of time slots it uses. The algorithm guarantees a bound 2 — 1 time slots on the TDMA cycle length, where is the maximum degree of a station (i.e., maximum number of stations that a station can reach by radio links) in the network. The message complexity of a station isO().     

Modeling and performance analysis of multihop packet radio networks

The design of packet radio networks involves a large number of issues which interact in a very complex fashion. Many of these pertain to the RF channel and its use, others pertain to the operational protocols. Clearly, no single model can be formulated which incorporates all the necessary parameters and leads to the optimum solution. The one essential element which complicates matters is that, contrary to point-to-point networks in which each channel is utilized by a single pair of nodes, the radio channel in packet radio networks is a multiaccess broadcast resource: i) in a given locality determined by radio connectivity, the channel is shared by many contending users, hence the need for channel access protocols; ii) radio is a broadcast medium and thus the action taken by a node has an effect on the actions taken by neighboring nodes and their outcome. Despite the complexity of the problem, there has been significant progress worth reporting on. The work accomplished so far has been either the analysis of specific examples of networks or an attempt to create models that would be useful in the design of general networks. The purpose of this paper is to survey the various modeling techniques that have been used for the performance analysis of packet radio networks, and to discuss the assumptions underlying these models, their scope of applicability, and some of the results obtained.     

Location based spectrum sensing performance analysis over fading channels in cognitive radio networks

This paper analyzes the spectrum sensing performance over fading channel,in which a licensee and multiple unlicensed users coexist and operate in the licensed channel in a local area. The overall average probabilities of detection and false alarm by jointly taking the fading and the locations of all secondary users into account are derived,and a statistical model of cumulate interference is constructed. Based on the cumulate interference,a closed-form expression of outage probability at the primary user's receiver according to a specific distribution of the fading is obtained. Finally,the sensing parameters so as to minimize the total spectrum sensing error and maximize the average opportunistic throughput are obtained. It is noted that the overall average performance analysis and results here enable to benchmark the design of specific spectrum sensing algorithms.     

A survey of overlay and underlay paradigms in cognitive radio networks

In the recent years, wireless applications and services have grown tremendously, resulting to a shortage of radio spectrum. On one hand, most of the available radio spectrum has already been allocated to different users and service providers. On another hand, research and statistics have revealed that the spectrum utilization usability is very limited. To address this dilemma, the concept of cognitive radio has emerged, which promotes the use of overlay and underlay transmission techniques to boost the utilization of radio spectrum resources. This paper provides a comprehensive survey of these 2 techniques and compares them qualitatively based on several network parameters. Next, this paper simulates overlay and underlay transmission techniques in OMNeT++ simulator on different network parameters, namely, Primary user arrival rate, throughput, sensing duration, and energy consumption. Our findings reveal that neither the overlay nor the underlay technique is sufficient itself to fulfill the demands for future wireless systems, and adopting a hybrid access technique consisting of a joint utilization of overlay and underlay approaches is desirable. Furthermore, the key challenges and open research issues in radio spectrum resources utilization are discussed.     

Collision avoidance in TV white spaces: a cross-layer design approach for cognitive radio networks

One of the most promising applications of cognitive radio networks (CRNs) is the efficient exploitation of TV white spaces (TVWSs) for enhancing the performance of wireless networks. In this paper, we propose a cross-layer design (CLD) of carrier sense multiple access with collision avoidance (CSMA/CA) mechanism at the medium access control (MAC) layer with spectrum sensing (SpSe) at the physical layer, for identifying the occupancy status of TV bands. The proposed CLD relies on a Markov chain model with a state pair containing both the SpSe and the CSMA/CA from which we derive the collision probability and the achievable throughput. Analytical and simulation results are obtained for different collision avoidance and SpSe implementation scenarios by varying the contention window, back off stage and probability of detection. The obtained results depict the achievable throughput under different collision avoidance and SpSe implementation scenarios indicating thereby the performance of collision avoidance in TVWSs-based CRNs.     

Non-orthogonal multiple access protocol for overlay cognitive radio networks using spatial modulation and antenna selection

In this paper we propose a novel spectrum sharing protocol for overlay cognitive radio networks using non-orthogonal multiple access (NOMA), spatial modulation (SM) and antenna selection (AS). The proposed protocol allows a secondary transmitter (ST) to transmit simultaneously to both a primary receiver (PR) and a secondary receiver (SR) using SM. The usage of NOMA and SM will increase the spectral efficiency for both PR and SR with reduced detection complexity than the case without NOMA in which the detectors are required to jointly detect both SM symbols at each receiver. The application of AS at ST with regards to PR provides higher quality transmission for PR without affecting the performance of SR. The performance of the proposed protocol is investigated by derivations of upper bounds on the average symbol error probabilities at PR and SR and by Monte Carlo simulations. Analytical and simulation results show that the proposed protocol offers efficient spectrum utilization over spectrum sharing protocols proposed recently that uses SM – to convey the primary data to PR through the amplitude phase modulation technique and the secondary data to SR through the index of the active antenna.     

A distributed media access protocol for packet radio networks and performance analysis. Part 1: Network capacity

A distributed time-slot assignment protocol is developed for a mobile multi-hop broadcast packet radio network, using time division multiple access channel access and virtual circuit switching. The protocol eliminates the single point failure mode of centralized network management and the delays of centralized processing. It is applicable to the user-to-user communications functions of such systems as the U. S. Army's enhanced position location and reporting system (EPLRS). The important functions of the distributed protocol, including time-slot assignment, virtual circuit set-up, and network synthesis, are identified, and implementing algorithms are presented and verified. The performance analysis of the protocol is divided into two parts. In this paper, Part 1 of the performance analysis, the capacity of a network using this protocol is studied and a tool is developed to design the network capacity by trading off among the network area, the transmission range, and the number of packet radio units. Since these results are not in closed form, numerical results provide insight into these parameters. In Part 2 the network set-up time and network data rate are analysed and a hierarchical architecture for the distributed protocol is proposed and analysed.     

Interference analysis of cognitive radio networks

In spite of spectrum sensing, aggregate interference from cognitive radios (CRs) remains as a deterring factor to the realization of spectrum sharing. We provide a systematic approach of evaluating the aggregate interference (I _aggr) experienced at a victim primary receiver. In our approach, we model the received power versus propagation distance relations between a primary transmitter, primary receiver, and CRs. Our analytical framework differs from the previous works in that we have formulated the relationship between I _aggr and the sensing inaccuracy of CRs. Energy detector is assumed for the purpose of spectrum sensing. I _aggr is expressed explicitly as a function of the number of energy samples collected (N ) and the threshold signal‐to‐noise ratio level used for comparison (SNR_ε ). The theoretical analysis is then applied to a practical scenario of spectrum sharing between digital TV broadcast and the IEEE 802.22 wireless regional area network systems. The impact on digital TV reception is evaluated in terms of signal‐to‐interference ratio. The proposed method allows us to determine the appropriate wireless regional area network operating conditions that fulfill the signal‐to‐interference ratio requirement imposed by regulator. Copyright © 2016 John Wiley & Sons, Ltd.     

A new practical interference mitigation scheme for interference cognitive radio networks

In this paper, a new practical dirty paper coding scheme and its extension is proposed for interference mitigation of a single TV broadcast station in uplink and downlink of a cognitive radio network using both a single secondary user (SU) and multiple SU scenarios. In the single SU scenario, which is called interference cognitive radio channel, derived simulation results show that the transmission rate of the SU archives the capacity of an AWGN channel with the cost of a 2.5 dB extra signal‐to‐noise ratio. In the sequel, the proposed scheme is extended to a multiple SU scenario using direct sequence spread spectrum technique in both uplink and downlink considering a TV band. Derived simulation results show that the number of supportable SUs in our proposed scheme increases to a fully loaded scenario of the same multiuser direct sequence spread spectrum system. Copyright © 2012 John Wiley & Sons, Ltd.     

An efficient and adaptive channel handover procedure for cognitive radio networks

In designing cognitive radio systems, one of the most critical issues is handling the channel handover process (CHP). The CHP consists of spectrum sensing, spectrum decision, negotiation on the common control channel, and adjustment of frequency and modulation settings, and such, it can be a time‐consuming process. Consequently, initiating the CHP after each detected user activity (UA) can decrease the aggregate spectrum utilization. To alleviate this problem, we introduce a novel handover strategy to find the optimal trade‐off between the durations of the CHP and UAs. With the use this model, secondary users (SUs) track only local information on their current data channel to make the decision to initiate the CHP or to wait for the termination of the ongoing UA. The system adapts to the dynamic conditions of the data channels and reduces the frequency of handovers to increase throughput and decrease access delay. We give analytical utilization bounds for SUs and also compare the performance of our model to those of other channel handover strategies by using extensive simulations. Our results for channels with heterogeneous loads and dynamic environments show that this model can clearly decrease the frequency of handover and consequently increase the aggregate SU utilization. Copyright © 2013 John Wiley & Sons, Ltd.     

On co-channel and adjacent channel interference mitigation in cognitive radio networks

Cognitive radio (CR) is an emerging wireless communications paradigm of sharing spectrum among licensed (or, primary) and unlicensed (or, CR) users. In CR networks, interference mitigation is crucial not only for primary user protection, but also for the quality of service of CR user themselves. In this paper, we consider the problem of interference mitigation via channel assignment and power allocation for CR users. A cross-layer optimization framework for minimizing both co-channel and adjacent channel interference is developed; the latter has been shown to have considerable impact in practical systems. Cooperative spectrum sensing, opportunistic spectrum access, channel assignment, and power allocation are considered in the problem formulation. We propose a reformulation–linearization technique (RLT) based centralized algorithm, as well as a distributed greedy algorithm that uses local information for near-optimal solutions. Both algorithms are evaluated with simulations and are shown quite effective for mitigating both types of interference and achieving high CR network capacity.     

Spectrum sensing and power/rate control in CDMA cognitive radio networks

In this paper, a two‐phase algorithm for the spectrum sensing and power/rate control of a secondary user (S‐user) or cognitive radio is proposed. In the first phase, the primary base station (P‐BS), which is conscious of both the number and the data rate of primary active users (P‐user), broadcasts theitusage capacity percentage (UCP) of its cell. Since knowing only the UCP is not enough to guarantee that the total load (of P‐users and S‐users) is less than a maximum permissible load, the S‐user must measure the total interference received from both the P‐users and other S‐users. In this direction, using both the UCP and measurement of the interference received from the P‐users and the S‐users by the S‐user or secondary base station (S‐BS), we mathematically derive an equation for issuing data transmission permission, which if it is held then the second phase of the algorithm: the transmit power/rate control starts. In this phase, the S‐user and the S‐BS look for feasible values for the transmit power level and transmission rate. If there are feasible values, it starts its transmission at these feasible transmit power and rate. Since both the location of the S‐user and the channel condition vary in time, the whole algorithm is iterated periodically with a period faster than the coherence time of the channel. Furthermore, we consider the down link of the above system with cooperation among neighboring S‐users to overcome fading channels and we investigate the amount of improvement in the reliability of the issuing data transmission permission. As well, we consider the uplink of the system with multiple antennas in the S‐BS to investigate the improvement in the same parameter over spatially correlated and independent fading channels. Theoretical analysis is validated using computer simulations. Both theoretical analysis and computer simulations show that the proposed cooperative spectrum sensing algorithm performs properly at SNR = ?5dB in flat Nakagami‐m fading channels with m = 1 even in correlated fading channels. We also address the improvement of the reliability of the issuing data transmission permission in the uplink in case of using multiple antennas only in the S‐BS. Copyright © 2011 John Wiley & Sons, Ltd.     

A game approach for cooperative spectrum sharing in cognitive radio networks

We consider the problem of cooperative spectrum sharing among primary users (PUs) and secondary users (SUs) in cognitive radio networks. In our system, each PU selects a proper set of SUs to serve as the cooperative relays for its transmission and in return, leases portion of channel access time to the selected SUs for their own transmission. PU decides how to select SUs and how much time it would lease to SUs, and the cooperative SUs decide their respective power levels in helping PU's transmission, which are proportional to their access times. We assume that both PUs and SUs are rational and selfish. In single‐PU scenario, we formulate the problem as a noncooperative game and prove that it converges to a unique Stackelberg equilibrium. We also propose an iterative algorithm to achieve the unique equilibrium point. We then extend the proposed cooperative mechanism to a multiple‐PU scenario and develop a heuristic algorithm to assign proper SUs to each PU considering both performance and fairness. The simulation results show that when the competition among SUs is fierce, the performance gap between our heuristic algorithm and the optimal one is smaller than 3%. Copyright © 2013 John Wiley & Sons, Ltd.     

一种基于捕获的扩频分组无线网MAC层协议及其性能分析

在分组接入过程中,当每个用户终端以随机竞争的方式获得所需的频谱资源时,会引起用户间的冲突和资源的浪费,造成系统性能的降低。本文引入了一种基于捕获的接入方法,当一个时隙中存在多个干扰分组时,该方法仍有捕获到某个分组的可能,该方法在系统高负载的情况下能有效地利用资源。性能分析和计算结果表明,基于捕获的方法改善了系统的性能。     

Outage performance of cognitive radio networks with multiple decode‐and‐forward relays

This paper considers the cognitive radio network with one primary user (PU), one secondary user (SU), and multiple decode‐and‐forward relays. We propose a relaying scheme to ensure the priority of primary transmission, where the relays are used to forward PU's message and sometimes also SU's message. First, SU is allowed to use the spectrum to transmit only when its transmission would not affect the decoding status of PU's message at all relays. Second, once the secondary transmission happens, the relays that successively decode SU's message are allowed to retransmit this message when it would not affect the decoding status of PU's message at primary receiver. The interference from PU to SU and the interference from SU to PU are both considered. By analyzing the decoding status of primary message and secondary message at different relays, we formulate the outage probabilities of both primary transmission and secondary transmission. When all channels follow Rayleigh distributions, we derive the analytical expressions for the general case of any number of relays, which are validated by means of Monte Carlo simulations. Copyright © 2016 John Wiley & Sons, Ltd.     

A new approach for medium-access control for data traffic and itsadaptation to the GSM general packet radio services

The inhibit sense multiple access with polling (ISMA/P) is a packet-based medium-access control scheme for statistical multiplexing of data users over a single slotted channel of a time-division multiple-access (TDMA) cellular system. In ISMA/P, the central base station (BS) asserts control over the users by polling data in smaller blocks. This enables ISMA/P to attain a near ideal, steady, and high throughput and low-mean delay performance, which is not usually achievable by contention-reservation-based MAC schemes. In this paper, we describe the ISMA/P algorithm and provide a detailed simulation study of it over a global system for mobile communications (GSM)-like slotted channel for a traffic model adopted from European Railways applications. This study shows that ISMA/P can achieve a steady throughput of 90% over a large range of load. A number of practical advantages of ISMA/P, such as elimination of channel hogging, incorrect channel sensing, battery saving, etc., are also elaborated