• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.2
• /
• pp.187-194
• /
• 2014

In this paper, we analyze the outage probability of macro diversity combining in cellular networks in consideration of aggregate interference from other mobile stations (MSs). Different from existing works analyzing the outage probability of macro diversity combining, we focus on a diversity gain attained by selecting a base station (BS) subject to relatively low aggregate interference. In our model, MSs are randomly located according to a Poisson point process. The outage probability is analyzed by approximating the multivariate distribution of aggregate interferences on multiple BSs by a multivariate lognormal distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2338-2353
• /
• 2015

In this paper, the optimal power allocation algorithm that minimizes the aggregate bit error rate (BER) of the secondary user (SU) in a downlink orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) system, while subjecting to the interference power constraint and the transmit power constraint, is investigated under the assumption that the instantaneous channel state information (CSI) of the interference links between the secondary transmitter and the primary receiver, and between the primary transmitter and the secondary receiver is perfectly known. Besides, a suboptimal algorithm with less complexity is also proposed. In order to deal with more practical situations, we further assume that only the channel distribution information (CDI) of the interference links is available and propose heuristic power allocation algorithms based on bisection search method to minimize the aggregate BER under the interference outage constraint and the transmit power constraint. Simulation results are presented to verify the effectiveness of the proposed algorithms.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.195-199
• /
• 2003

BEE 802.11 Wireless LAN protocol uses fixed transmission power. It does not consider a power control mechanism based on the distance between the transmitter and the receiver in order to improve overall channel utilization. In home environment, where stations generally lie around an AP, the AP is subject to use transmission power more than it needs. And wireless LAN stations may require different minimal desired received power. If there are many adjacent BSSs in densely populated WLAN area, they might cause RF interference to one another. In this paper we focus on the improvement of aggregate utilization by mitigating RF interference among BSSs. We show that RF interference by APs can be reduced by controlling transmission power using Link Margin information. The reduced interference will then lead to the increased aggregate throughput which is efficient resource utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.1006-1014
• /
• 2011

Recently, as CSMA technique has been increasingly adopted in various wireless networks, extensive researches to analyze the statistical characteristics of CSMA-based wireless networks have been done. Despite the ongoing efforts, there still remain many difficulties in the analysis because of unexpectable operational behavior of CSMA. Previous literature studying CSMA networks used the concept of the carrier sensing radius to reflect the carrier sensing function. However, since the carrier sensing radius based on the protocol model is not affected by the aggregate interference from other nodes, the derived statistical models cannot avoid approximation errors especially if the network is under high interference. In this paper, we propose an algorithm to derive the carrier sensing radius considering the physical model, where the carrier sensing radius reflecting the aggregate interference is found. For the purpose of this, we analyze the aggregate interference model and the behavior of CSMA function. Based on the analysis, we propose an iterative approximation algorithm for the physical carrier sensing radius. Extensive simulations and results show that the proposed algorithm can contribute to considerably reduce the statistical modeling error of a CSMA network under various channel conditions.

• International Journal of Computer Science & Network Security
• /
• v.23 no.4
• /
• pp.55-68
• /
• 2023

In recent years, the Television White Space (TVWS) has attracted the interest of many researchers due to its propagation characteristics obtainable between 470MHz and 790MHz spectrum bands. The plenty of unused channels in the TV spectrum allows the secondary users (SUs) to use the channels for broadband services especially in rural areas. However, when the number of SUs increases in the TVWS wireless network the aggregate interference also increases. Aggregate interferences are the combined harmful interferences that can include both co-channel and adjacent interferences. The aggregate interference on the side of Primary Users (PUs) has been extensively scrutinized. Therefore, resource allocation (power and spectrum) is crucial when designing the TVWS network to avoid interferences from Secondary Users (SUs) to PUs and among SUs themselves. This paper proposes a model to improve the resource allocation for reducing the aggregate interface among SUs for broadband services in rural areas. The proposed model uses joint power and spectrum hybrid Firefly algorithm (FA), Genetic algorithm (GA), and Particle Swarm Optimization algorithm (PSO) which is considered the Co-channel interference (CCI) and Adjacent Channel Interference (ACI). The algorithm is integrated with the admission control algorithm so that; there is a possibility to remove some of the SUs in the TVWS network whenever the SINR threshold for SUs and PU are not met. We considered the infeasible system whereby all SUs and PU may not be supported simultaneously. Therefore, we proposed a joint spectrum and power allocation with an admission control algorithm whose better complexity and performance than the ones which have been proposed in the existing algorithms in the literature. The performance of the proposed algorithm is compared using the metrics such as sum throughput, PU SINR, algorithm running time and SU SINR less than threshold and the results show that the PSOFAGA with ELGR admission control algorithm has best performance compared to GA, PSO, FA, and FAGAPSO algorithms.

• Current Optics and Photonics
• /
• v.2 no.1
• /
• pp.39-46
• /
• 2018

Visible-light communication (VLC) combined with advanced illumination can be expected to become an integral part of next-generation communication networks. One of the major concerns in VLC implementation is developing resource-allocation schemes in a multi-user scenario. However, the scheduling for heterogeneous quality of service (QoS) traffic has not been studied so far, for the indoor VLC downlink system. In this paper, we creatively introduce effective-bandwidth and effective-capacity theory into the multi-user scheduling (MUS) problem, to guarantee the user's statistical delay QoS. We also take account of the aggregate interference (AI) in the indoor VLC downlink system, and analyze its impact on the user-centric MUS problem for the first time. Simulations show that the AI has a nonnegligible influence on the scheduling result, and that the proposed scheduling scheme could guarantee the user's QoS requirement under the premise of ensuring sum capacity.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.411-419
• /
• 2016

This article investigates the problem of distributed channel selection in opportunistic spectrum access networks from a perspective of interference minimization. The traditional physical (PHY)-layer interference model is for information theoretic analysis. When practical multiple access mechanisms are considered, the recently developed binary medium access control (MAC)-layer interference model in the previous work is more useful, in which the experienced interference of a user is defined as the number of competing users. However, the binary model is not accurate in mathematics analysis with poor achievable performance. Therefore, we propose a real-valued one called stochastic MAC-layer interference model, where the utility of a player is defined as a function of the aggregate weight of the stochastic interference of competing neighbors. Then, the distributed channel selection problem in the stochastic MAC-layer interference model is formulated as a weighted stochastic MAC-layer interference minimization game and we proved that the game is an exact potential game which exists one pure strategy Nash equilibrium point at least. By using the proposed stochastic learning-automata based uncoupled algorithm with heterogeneous learning parameter (SLA-H), we can achieve suboptimal convergence averagely and this result can be verified in the simulation. Moreover, the simulated results also prove that the proposed stochastic model can achieve higher throughput performance and faster convergence behavior than the binary one.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.43-52
• /
• 2011

Whether it is crosstalk, harmonics, or in-band operation of wireless technologies, interference between a reference system and a host of offenders is virtually unavoidable. In past contributions, a benchmark has been established and considered for coexistence analysis with a number of technologies including FWA, UMTS, and WiMAX. However, the previously presented model does not take into account the mobility factor of the reference node in addition to a number of interdependent requirements regarding the link direction, channel state, data rate and system factors; hence limiting its applicability for the MBWA (IEEE 802.20) standard. Thus, over diverse modes, in this correspondence we analytically derived the greatest aggregate interference level tolerated for high-fidelity transmission tailored specifically for the MBWA standard. Our results, in the form of benchmark indicators, should be of particular interest to peers analyzing and researching RF coexistence scenarios with this new protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.424-442
• /
• 2014

Most recent research on iterative solutions for interference alignment (IA) presents solutions assuming channel reciprocity based on the suppression of interference from undesired sources by using an appropriate decoding matrix also known as a receiver combining matrix for multiple input multiple output (MIMO) interference channel networks and reciprocal networks. In this paper, we present an alternative solution for IA by designing precoding and decoding matrices based on the concept of signal leakage (the measure of signal power that leaks to unintended users) on each transmit side. We propose an iterative algorithm for an IA solution based on maximization of the signal-to-leakage-and-noise ratio (SLNR) of the transmitted signal from each transmitter. In order to make an algorithm removing the requirement of channel reciprocity, we deploy maximization of the signal-to-interference-and-noise ratio (SINR) in the design of the decoding matrices. We show through simulation that minimizing the leakage in each transmission can help achieve enhanced performance in terms of aggregate sum capacity in the system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.1976-1997
• /
• 2016

This paper investigates the problem of co-tier interference mitigation for dynamic small- cell networks, in which the load of each small-cell varies with the number of active associated small-cell users (SUs). Due to the fact that most small-cell base stations (SBSs) are deployed in an ad-hoc manner, the problem of reducing co-tier interference caused by dynamic loads in a distributed fashion is quite challenging. First, we propose a new distributed channel allocation method for small-cells with dynamic loads and define a dynamic interference graph. Based on this approach, we formulate the problem as a dynamic interference graph game and prove that the game is a potential game and has at least one pure strategy Nash equilibrium (NE) point. Moreover, we show that the best pure strategy NE point minimizes the expectation of the aggregate dynamic co-tier interference in the small-cell network. A distributed dynamic learning algorithm is then designed to achieve NE of the game, in which each SBS is unaware of the probability distributions of its own and other SBSs' dynamic loads. Simulation results show that the proposed approach can mitigate dynamic co-tier interference effectively and significantly outperform random channel selection.