Search

In the scenario of frequency coexistence between the geostationary (GEO) and non-geostationary (NGEO) satellite networks, the NGEO system should not incur harmful interference to the GEO system according to the policy of the Radio Regulations. Therefore, spectrum sensing as a promising solution is applied widely in this scenario. With the increasing number of NGEO satellites in the space, one NGEO system could be affected by other NGEO systems while sensing the signal from the GEO system. Given these preconditions, the cognitive radio scenario considered in this paper is that: the GEO system is regarded as the primary user, one NGEO system is regarded as the secondary user, and another NGEO system is regarded as the interfering user. Meanwhile, all the satellite systems are supposed to operate with more than one discrete transmit power levels, which is practical and fits the concept of adaptive power control. In our context, we propose a spectrum strategy using hypothesis testing as well as maximum a posteriori to differentiate the GEO signal from the interfering NGEO and noise, and then identify the specific power level utilized by the GEO system. Moreover, we derive the closed-form expressions for threshold of verifying the status of the GEO and for decision regions to determine its power level. Finally, extensive simulations are provided to verify the proposed studies. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel adaptive scheme for full-duplex communication of secondary users (SUs) in a cognitive radio network. The secondary network operates adaptively in three modes; cooperative sensing (CS), full duplex transmit and sensing (FDTS), and in-band bidirectional full duplex transmit and receive (FDTR). In the CS mode, the secondary nodes will detect the signal of a primary user (PU) through a novel cooperative medium access control (MAC) protocol and will decide the system's mode of operation in the subsequent spectrum hole. This adaptive decision is based on dual-threshold detection introduced for the first time. When the PU's signal at SU's receivers is weak, the system switches to the FDTS mode to avoid higher collisions probability and long or endless collision durations. In the FDTS mode, one of SUs senses the PU activity continuously while transmitting to another node. When the channel conditions allow, the system switches to the FDTR mode, in which the SUs would communicate bidirectionally in an asynchronous full duplex manner. The novel idea of asynchronous transmission in this mode will result in decreased maximum and average collision durations. Analytical closed forms for probability of collision, average collision duration, and cumulative collision duration, as well as throughput of the SU network are derived, and performance of the proposed scheme in terms of the above-mentioned metrics, effectiveness, and advantages over conventional methods of sensing and transmission are verified via simulations. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the secure relay beamforming problem for simultaneous wireless information and power transfer (SWIPT) in an amplify-and-forward (AF) two-way relay network. We consider scenarios that the eavesdropper's channel state information (CSI) is and is not available. When the eavesdropper's CSI is available, our objective is to maximize the achievable secrecy sum rate under transmit power constraint and energy harvesting constraint. Since the optimization problem is nonconvex, we derive its performance upper bound, which requires 2-D search, where a semidefinite programming is solved in each step. We also propose an upper bound-based rank-one solution by employing the Gaussian randomization method. To reduce computational complexity, we transform the optimization problem into a difference-of-convex programming and propose a sequential parametric convex approximation (SPCA)-based iterative algorithm to find a locally optimal solution. Furthermore, we also propose a zero-forcing (ZF)-based suboptimal solution. Simulation results demonstrate that the upper bound-based rank-one solution archives the performance almost the same as the upper bound that has high computational complexity. The low-complexity SPCA-based locally optimal solution performs close to the upper bound. The ZF-based suboptimal solution has the lowest computational complexity among the proposed solutions. When the eavesdropper's CSI is not available, we propose an artificial noise-aided secure relay beamforming scheme. [ABSTRACT FROM AUTHOR]

It is known that the achievement of the decode-and-forward (DF) protocol for cooperative communications is critically based on the prerequisite that the relay forwards the source transmitted signals as faithfully as possible. This implies that the relay can mostly know the correctness of its decoded results. In this paper, we employ the idea of detection with erasure in relay to approach this prerequisite. An erasure region is set to minimize the cost function that is formulated based on a specially designed bit-error-rate (BER) expression for the cooperation network. Whenever the received signals fall into this region, the relay will not perform DF. Power allocation can be simultaneously optimized as well. Simulations show that its resultant BER can be quite close to that of the perfect DF scenario and better than the BER of most previously presented signal-to-noise ratio (SNR) threshold-based relaying schemes. [ABSTRACT FROM PUBLISHER]

A cooperative spectrum-sensing technique in cognitive radio (CR) networks based on the data fusion of various chaotic stochastic resonance (CSR) energy detectors is proposed in this paper. Due to noisy uncertainty in unpredictable wireless communication environments, detection performance of conventional energy detection cannot be guaranteed. By introducing the CSR system with various CSR noise types, and with the data fusion on these CSR-based energy detectors, the detection probability can be improved under the same constant false-alarm rate (CFAR), particularly under low signal-to-noise ratio (SNR) circumstances. Theoretical analyses and computer simulation results verify the effectiveness of the proposed novel cooperative spectrum-sensing approach under serious wireless conditions. [ABSTRACT FROM PUBLISHER]

Recently, an adaptive intercell interference (ICI) mitigation technique has been proposed for downlink cellular systems as a means to increase throughput with low system complexity. However, in the prior work, the issue of intercell user scheduling has not been considered. In this paper, we study multiple-input–single-output (MISO) downlink cellular systems that jointly design adaptive ICI cancelation (ICIC) and intercell user scheduling assuming that partial channel state information (CSI) is shared among base stations (BSs). Since the optimal solution would require high complexity, we investigate a new low-complexity algorithm that selects the best users and their beamforming strategies in terms of maximizing the weighted sum rate (WSR). To this end, we first develop a simple threshold criterion for each user to decide the preferred beamforming strategy based on the derivation of the expected signal-to-interference-plus-noise ratio (SINR). Then, according to users' feedback about their decisions, a successive user and beamforming selection algorithm is performed at the BSs. From simulation results, we show that, combined with proportional fair scheduling, the proposed scheme provides excellent throughput performance with very low computational complexity and the amount of inter-BS CSI exchange. Furthermore, we discuss an extension of the proposed scheme to limited feedback systems and observe that our algorithm also provides similar advantages over conventional schemes with quantized feedback. [ABSTRACT FROM PUBLISHER]

In this paper, we present a novel and rather simple method for calculating reverse-link outage probability in signal-to-interference ratio (SIR)-based power-controlled direct-sequence code-division multiple access (DS-CDMA) systems. We obtain outage probability for a single-service system using the interference-to-received-signal-power ratio. We extend our method to the multiservice case using the uplink load factor, which is the ratio of the interference to the interference plus noise. Unlike most of the previous works, we employ the 2-D Poisson point process to model the spatial distribution of mobile users in the network coverage area. We approximate the intercell-interference-to-received-signal-power ratio and uplink load factor using their cumulants and obtain the outage probabilities for single- and multiservice cases. Our approximations are verified using simulations. [ABSTRACT FROM AUTHOR]

This paper presents an adaptive digital signal processing technique that cancels self-image interference due to frequency-independent, in-phase/quadrature-phase (I/Q) mismatch in zero-intermediate frequency (IF) direct-conversion receivers. The proposed technique, which is referred to as the normalized least-mean square adaptive self-image cancellation (NLMS-ASIC) algorithm, is an ASIC technique that controls the filter weight to minimize the power of the filter output signal using an NLMS type of weight-control mechanism. Some closed-form equations are derived for the mean-squared error (MSE), as well as the mean image-rejection ratio (IRR) of the proposed NLMS-ASIC algorithm. In particular, a step-size determination method is explained so that the requirements on the image-rejection performance and convergence time can be satisfied. The advantages of the proposed technique are demonstrated through computer simulations. [ABSTRACT FROM AUTHOR]

In this paper, we consider an M-ary quadrature amplitude modulation (M-QAM) scheme combined with multiuser diversity over Nakagami-m fading channels. Assuming that delayed but error-free signal-to-noise ratio (SNR) feedback is available, we derive closed-form formulas for the average transmission rate and the average bit error rate (BER), which are also shown to be generalizations of many previous results. Through numerical studies and simulations, we check the validity of our analysis. In addition, we investigate the impact of the Nakagami fading parameter m and feedback delay on system performance. [ABSTRACT FROM AUTHOR]

In this paper, we investigate efficient wireless data access algorithms in mobile hotspots. We introduce a proxy cache (PC) and propose PC-based poll-each-read (P-PER) and PC-based callback (P-CB) data access algorithms to reduce the transmission cost over wireless links in mobile hotspots. An analytical model is developed, and extensive simulations are conducted to demonstrate the performance of P-PER and P-CB. It is shown that P-PER and P-CB can improve cache hit performance and significantly reduce transmission cost. A tradeoff between P-PER and P-CB suggests the need to use a hybrid proxy-based approach to attain optimal performance of wireless data access in mobile hotspots. [ABSTRACT FROM AUTHOR]

In this paper, we consider wireless networks with directional antennas using slotted ALOHA medium access control. The channel model incorporates the effects of propagation loss and shadowing with Rayleigh fading. By deriving the cumulative distribution function of the signal-to-interference-and-noise ratio (SINR) of a certain link in the network, the outage probability of the link is analyzed. In particular, the analysis works for the arbitrary beam patterns of the directional antennas used in the networks. Moreover, we propose a new parameter, i.e., the array interference factor, which can characterize the average performance of an arbitrary beam pattern in random wireless networks. This provides an efficient way for designers to evaluate the system performance under different beam patterns. The network throughput and the transport capacity of a random wireless net- work with directional antennas are also analyzed. It is shown that the network transport capacity is of the same order as the square root of the node density, which conforms with the well-known capacity of wireless networks. The analysis is useful for designers to optimize the system performance of wireless networks with directional antennas. [ABSTRACT FROM AUTHOR]

A typical multicast network consists of a single tree, in which only a few internal nodes contribute most resources and are involved in performing the multicast functionality. This leads to an uneven and inefficient utilization of network resources. The problem is more pronounced in mobile ad hoc networks (MANET5), where network resources are limited. One solution is to split the multicast content over a number of trees. This provides several paths for the multicast content and would involve more nodes in implementing multicast functionality. Although this approach improves network utilization, overall multicast latency increases. This paper presents a distributed algorithm to construct multiple edge, sharing trees (MESTs) for small group multicast. MESTs balance the resource allocation and delay constraints by choosing to overlap certain edges that have low weight. Simulation results show that MESTs can generate multicast networks that have low delays and fair resource utilization. MESTs are designed to work with any form of multicast in both wired and wireless networks. [ABSTRACT FROM AUTHOR]

This paper proposes a distributed location management strategy for wireless mobile networks. In the proposed strategy, a number of consecutively numbered location information databases (LIDs) are arranged into a frame. A frame of LIDs overlaps with the next frame except one database. The location information of a mobile host is replicated and stored in the databases in the same frame. When the location area of a mobile host changes, the new location information is stored in the next frame of databases. Thus, the proposed strategy is referred to as the sliding-frame strategy. The average communication cost and average database response time of the proposed sliding-frame strategy are analyzed and shown to be always lower than or equal to those of the strategy proposed by Krishnamurthi et al. [ABSTRACT FROM AUTHOR]

In this paper, a blind space-time (ST) multiuser detector, called ST constrained minimum output energy (ST-CMOE) detector, is proposed. It can be viewed as an extension of the CMOE method (Proc. Globecom, p. 379, 1994), and therefore it is immune to near-far effect. It processes the antenna array output jointly in spatial and temporal domain. Simulation results show that the proposed algorithm can outperform the space-CMOE detector proposed by Wang and Poor (IEEE Trans. Signal Process. vol. 47, p. 2356, 1999) which process the received signal in spatial and temporal domain separately. It can also outperform the ST subspace detector proposed by Chkeif et al. (IEEE Trans. Commun. vol. 48, p. 729, 2000), which, although processes the received signal jointly in spatial and temporal domains, suffers from the mismatch problem in the multipath environment. The simulation results also show that the proposed ST-CMOE detector can achieve the same performance as the training-based ST minimum-mean-square-error detector. In order to reduce the computational load and adapt to dynamic multiple-access channels, an adaptive algorithm is presented. The computational load of this adaptive detector is comparable to Hu's method (IEEE Trans. Signal Process. vol. 52, p. 1862, 2004), while it does not require any initial training or channel estimation in the multipath environment. Simulation results show that the proposed adaptive ST-CMOE detector can work well in a dynamic multiple-access channel, where interferences may enter or leave the channel at any time. [ABSTRACT FROM AUTHOR]

The linear amplification using nonlinear components (LINC) technique is a well-known power amplifier linearization method. to reduce adjacent channel interference in a nonconstant envelope modulation system. Its major drawback is the inherent sensitivity to gain and phase imbalances between the two amplifier branches. In this paper, a novel full-digital base band method is described which corrects any gain and phase imbalances in LINC transmitters mainly due to the unmatching of the two amplifier paths. Amplifiers are characterized by a level-dependent complex gain using a memoryless model. The method uses adaptive signal processing techniques to obtain the optimal complex coefficient to adjust gain and phase imbalances. Its main advantage is the ability to track the input signal variations and adapt to the changes of amplifier nonlinear characteristics. Other effects are included in the analysis such as quadrature modulator and demodulator imbalances and loop delay. A computer simulation has been carried out to verify the method functionality. [ABSTRACT FROM AUTHOR]