• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.195-196
• /
• 2007

The purpose of this paper is to analyze the resource allocation problem in a self organizing network from the viewpoint of game theory. The main focus is to suggest the model and analyze a power control algorithm in wireless ad-hoc networks using non cooperative games. Our approach is based on a model for the level of satisfaction and utility a wireless user in a self organizing network derives from using the system. Using this model, we show a distributed power control scheme that maximizes utility of each user in the network. Formulating this as a non-cooperative game we will show the feasibility of such power control as well as existence of the Nash Equilibrium achieved by the non-cooperative game.

• 한국통신학회논문지
• /
• 제36권7B호
• /
• pp.771-779
• /
• 2011

It is expected that many heterogeneous wireless systems, such as 3GPP LTE systems, WiMAX systems and WLAN systems, will coexist in the next generation wireless communication environments. Integrated radio resource management and seamless vertical handoff (VHO) should be supported to provide integrated communication services over multi-radio access networks. A new class of adaptive VHO system that views the handoff problem as a pattern recognition problem is proposed. In this paper, we propose a unified radio resource management (URRM) architecture and Support Vector Machine (SVM) based vertical handoff decision system. Extensive simulation studies show the proposed VHO algorithm outperforms RSS based VHO algorithms in terms of throughput and service cost.

• International Journal of Computer Science & Network Security
• /
• 제22권4호
• /
• pp.394-400
• /
• 2022

The radio resources available in a wireless network system are limited. Therefor, job of managing resources is not easy task. Because the resources are shared among the UEs that are connected, the process of assigning resources must be carefully controlled. The packet scheduler in an LTE network is in charge of allocating resources to the user equipment (UE). Femtocells networks are being considered as a promising solution for poor channel performance for mulitple environments. The implementation of femtocells into a macrocell (traditional base station) would boost the capacities of the cellular network. To increase femtocells network capacity, a reliable Packet Scheduler mechanism should be implemented. The Packet Scheduler technique is introduced in this paper to maximize capacity of the network while maintaining fairness among UEs. The proposed solution operates in a manner consistent with this principle. An analysis of the proposed scheme's performance is conducted using a computer simulation. The results reveal that it outperforms the well-known PF scheduler in terms of cell throughput and average throughput of UEs.

• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.157-165
• /
• 2009

In this paper, we investigate a dynamic spectrum sharing problem for the centralized uplink cognitive radio networks using orthogonal frequency division multiple access. We formulate a large-scale joint rate and power allocation as an optimization problem under quality of service constraint for secondary users and interference constraint for primary users. We also suggest admission control to nd a feasible solution to the optimization problem. To implement the resource allocation on a large-scale, we introduce a notion of using the conservative factors $\alpha$ and $\beta$ depending on the outage and violation probabilities. Since estimating instantaneous channel gains is costly and requires high complexity, the proposed algorithm pursues a practical and implementation-friendly resource allocation. Simulation results demonstrate that the large-scale joint rate and power allocation incurs a slight loss in system throughput over the instantaneous one, but it achieves lower complexity with less sensitivity to variations in shadowing statistics.

• 한국콘텐츠학회논문지
• /
• 제8권1호
• /
• pp.169-176
• /
• 2008

본 논문에서는 접속 (connection)과 패킷의 두 레벨 (level)을 함께 고려하는 IEEE 802.16 망에서의 무선 자원 관리 큐잉 모델을 개발한다. 상위 레벨인 접속 레벨에서는 대역폭 가용여부와 서비스 클래스별 우선순위 큐를 사용하여 접속 수락제어를 모델링하고 하위 레벨인 패킷 전송은 서비스 클래스별 임계치와 현재 가용한 대역폭의 두 항목을 동시에 고려한 동적 대역폭 할당 방법을 모델링 한다. 계층 모델은 페트리 네트의 확장형인 SRN (Stochastic Reward Nets)을 이용하여 개발되며 802.16서비스 클래스별 트래픽에 대한 대역폭 활용률과 처리율을 성능지표로 모델에 대한 수치결과를 구한다.

• 한국전자파학회논문지
• /
• 제21권11호
• /
• pp.1311-1317
• /
• 2010

본 논문에서는 셀 간 협동을 수행하는 cooperative spatial multiplexing(CSM)의 상향 링크 용량을 개선하기 위한 무선 자원 관리 알고리즘을 제안한다. 인접 기지국에 대한 상향 링크 간섭을 억제하기 위해 각 이동국에서 독립적으로 수행되는 최대 송신 전력 제한 알고리즘을 제안한다. 또한 서비스 기지국과 간섭 기지국이 서로 상향 링크 채널 정보를 공유하는 coordinated CSM 시스템에서 셀 간 상향 링크 간섭 억제를 통해 용량을 개선하는 협동 스케줄링 알고리즘을 제안한다. 제안하는 알고리즘들은 낮은 복잡도로 동작하지만 인접 기지국의 상향 링크 간섭을 효과적으로 억제하여 상향 링크 시스템 용량을 증가시킬 수 있다.

• 한국컴퓨터정보학회논문지
• /
• 제17권12호
• /
• pp.131-136
• /
• 2012

최근 스마트 이동 단말기기의 급속한 보급과 더불어 많은 수의WiFi Access Point (AP)가 설치되어 사용되고 있으며, WiFi AP의 증가는 AP 간의 상호 간섭에 의한 트래픽 처리 성능의 저하를 발생시킨다. 이런 현상은 기존 WiFi 망에 활용할 수 있는 트래픽 성능을 향상시키기 위한 방법을 요구한다. 본 연구에서는 트래픽 성능을 향상시키기 위하여 AP의 무선 자원 관리 (RRM : Radio Resource Management)를 최적화하기 위한 채널 할당 방법과 분산형 Wireless LAN (WLAN) 에서의 트래픽 성능 향상 방법에 대하여 연구하였다. 그 결과, AP 단독으로 실행되어 기존방식의 할당 오류를 개선하고 실행속도를 증가시킬 수 있었다.

• ETRI Journal
• /
• 제44권3호
• /
• pp.400-412
• /
• 2022

In cognitive radio networks (CRNs), the computational complexity of resource allocation algorithms is a significant problem that must be addressed. However, the high computational complexity of the optimal solution for tackling resource allocation in CRNs makes it inappropriate for use in practical applications. Therefore, this study proposes a power-based pricing algorithm (PPA) primarily to reduce the computational complexity in downlink CRN scenarios while restricting the interference to primary users to permissible levels. A two-stage approach reduces the computational complexity of the proposed mathematical model. Stage 1 assigns subcarriers to the CRN's users, while the utility function in Stage 2 incorporates a pricing method to provide a power algorithm with enhanced reliability. The PPA's performance is simulated and tested for orthogonal frequency-division multiplexing-based CRNs. The results confirm that the proposed algorithm's performance is close to that of the optimal algorithm, albeit with lower computational complexity of O(M log(M)).

• 전자공학회논문지 IE
• /
• 제46권3호
• /
• pp.42-47
• /
• 2009

본 연구에서는 CDMA 시스템에서 신규 호의 차단률 및 핸드오프 호의 절단률에 따라 각 셀의 대역폭을 가변시켜 신규 호와 핸드오프 호를 처리하는 가변등가대역 개념을 이용한 호 수락 제어 방법을 사용하였다. 핸드오프 호를 위해서는 무선자원을 예약해 두며, 자원이 부족할 경우 신규 호와 핸드오프 호를 일정한 시간 동안 버퍼에 대기하도록 하여 가용자원이 발생하였을 때 대기 중인 호부터 처리하도록 하였다. 버퍼의 사용유무에 따른 시스템의 성능을 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권7호
• /
• pp.1533-1546
• /
• 2013

Wireless multicast is considered as an effective transmission mode for the future mobile social contact services supported by Long Time Evolution (LTE). Though wireless multicast has an excellent resource efficiency, its performance suffers deterioration from the channel condition and wireless resource availability. Cognitive Radio (CR) and Device to Device (D2D) are two solutions to provide potential resource. However, resource allocation for cognitive wireless multicast based on D2D is still a great challenge for LTE social networks. In this paper, a joint sub-carriers and power allocation model based on D2D for general cognitive radio multicast (CR-D2D-MC) is proposed for Orthogonal Frequency-Division Multiplexing (OFDM) LTE systems. By opportunistically accessing the licensed spectrum, the maximized capacity for multiple cognitive multicast groups is achieved with the condition of the general scenario of imperfect spectrum sensing, the constrains of interference to primary users (PUs) and an upper-bound power of secondary users (SUs) acting as multicast source nodes. Furthermore, the fairness for multicast groups or unicast terminals is guaranteed by setting a lower-bound number of the subcarriers allocated to cognitive multicast groups. Lagrange duality algorithm is adopted to obtain the optimal solution to the proposed CR-D2D-MC model. The simulation results show that the proposed algorithm improves the performance of cognitive multicast groups and achieves a good balance between capacity and fairness.