• 제목/요약/키워드: Channel allocation

검색결과 699건 처리시간 0.026초

A Comparison of TDMA, Dirty Paper Coding, and Beamforming for Multiuser MIMO Relay Networks

  • Li, Jianing;Zhang, Jianhua;Zhang, Yu;Zhang, Ping
    • Journal of Communications and Networks
    • /
    • 제10권2호
    • /
    • pp.186-193
    • /
    • 2008
  • A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.

Coordinated Cognitive Tethering in Dense Wireless Areas

  • Tabrizi, Haleh;Farhadi, Golnaz;Cioffi, John Matthew;Aldabbagh, Ghadah
    • ETRI Journal
    • /
    • 제38권2호
    • /
    • pp.314-325
    • /
    • 2016
  • This paper examines the resource gain that can be obtained from the creation of clusters of nodes in densely populated areas. A single node within each such cluster is designated as a "hotspot"; all other nodes then communicate with a destination node, such as a base station, through such hotspots. We propose a semi-distributed algorithm, referred to as coordinated cognitive tethering (CCT), which clusters all nodes and coordinates hotspots to tether over locally available white spaces. CCT performs the following these steps: (a) groups nodes based on a modified k-means clustering algorithm; (b) assigns white-space spectrum to each cluster based on a distributed graph-coloring approach to maximize spectrum reuse, and (c) allocates physical-layer resources to individual users based on local channel information. Unlike small cells (for example, femtocells and WiFi), this approach does not require any additions to existing infrastructure. In addition to providing parallel service to more users than conventional direct communication in cellular networks, simulation results show that CCT can increase the average battery life of devices by 30%, on average.

Improving Voice-Service Support in Cognitive Radio Networks

  • Homayounzadeh, Alireza;Mahdavi, Mehdi
    • ETRI Journal
    • /
    • 제38권3호
    • /
    • pp.444-454
    • /
    • 2016
  • Voice service is very demanding in cognitive radio networks (CRNs). The available spectrum in a CRN for CR users varies owing to the presence of licensed users. On the other hand, voice packets are delay sensitive and can tolerate a limited amount of delay. This makes the support of voice traffic in a CRN a complicated task that can be achieved by devising necessary considerations regarding the various network functionalities. In this paper, the support of secondary voice users in a CRN is investigated. First, a novel packet scheduling scheme that can provide the required quality of service (QoS) to voice users is proposed. The proposed scheme utilizes the maximum packet transmission rate for secondary voice users by assigning each secondary user the channel with the best level of quality. Furthermore, an analytical framework developed for a performance analysis of the system, is described in which the effect of erroneous spectrum sensing on the performance of secondary voice users is also taken into account. The QoS parameters of secondary voice users, which were obtained analytically, are also detailed. The analytical results were verified through the simulation, and will provide helpful insight in supporting voice services in a CRN.

인지 무선 통신 시스템에서 에너지 제한적 개방 루프 협력 센싱 기법에 대한 연구 (A Study on Performance Evaluation of Energy-Constrained Open-Loop Cooperative Sensing in Cognitive Radios)

  • 노고산;임성묵;왕한호
    • 전기학회논문지P
    • /
    • 제63권1호
    • /
    • pp.34-39
    • /
    • 2014
  • In cognitive radios, secondary users can use the spectrum exclusively allocated to a primary wireless system if the secondary users detect the spectrum in idle states. Because the secondary users can utilize the idle state of the spectrum, the utilization rate of the spectrum can be improved. The idle states can be detected by using secondary users' sensing schemes. However, the wireless channel environment where secondary users perform the spectrum sensing is not very friendly to secondary users because the signal-to-noise ratio of the received primary signal is very low. Hence, cooperative sensing scheme where more than one secondary user take part in the spectrum sensing is generally used in cognitive radios. In this paper, we investigate the cooperative sensing performance for machine-to-machine communication devices operated by batteries with limited energy. In general, the energy consumed for the spectrum sensing increases as the length of the sensing period and the number of cooperative sensing nodes. Accordingly, even though the total amount of the consumed energy is the same, an energy allocation methodology how to distribute the energy to the sensing period and sensing nodes can achieve the optimum sensing performance, which is numerically analyzed.

부호화 정보에 기반한 라이브 비디오의 전송률 결정 (Transmission Rate Decision of Live Video Based on Coding Information)

  • 이명진
    • 한국멀티미디어학회논문지
    • /
    • 제8권9호
    • /
    • pp.1216-1226
    • /
    • 2005
  • 본 논문에서는 동적 대역 할당이 가능한 네트워크에서 라이브 비디오의 고화질 전송을 위한 예방형 전송률 결정 방식을 제안한다. 부호기 앞단의 화면 분석기에서 입력 화면의 분산과 장면전환 정도로부터 향후 화면의 비트율을 예측하고, 부호기와 복호기 버퍼의 제약조건에 의한 전송률 범위를 구한다. 이를 토대로 빈번한 전송률 재협상에 따른 비용 증가 문제를 해결하기 위해 최근 재협상 시점으로부터 경과 시간, 비디오 수신 품질 등을 고려한 예방형 전송률 결정 방식을 제안한다. 모의실험을 통해 제안 방식은 정규화된 Least Mean Square 기반 전송률 결정 방식과 비교되었고, 적은 재협상 비용으로도 지연 위반 화면 없이 높은 채널 이용률 달성이 가능함을 보였다.

  • PDF

IEEE 802.15.4 기반의 무선 센서네트워크에서 숨은노드 충돌 방지와 성능향상 기법 (Mitigating Hidden Nodes Collision and Performance Enhancement in IEEE 802.15.4 Wireless Sensor Networks)

  • 안광훈;김태준
    • 정보처리학회논문지:컴퓨터 및 통신 시스템
    • /
    • 제4권7호
    • /
    • pp.235-238
    • /
    • 2015
  • IEEE 802.15.4는 무선 센서노드들 사이의 연결을 가능하게 하는 대표적인 표준이다. 그러나 이 IEEE 802.15.4를 기반으로 하는 무선 센서네트워크는 기본적으로 숨은노드 충돌에 매우 취약하다는 약점을 갖고 있는데 이는 무선 센서네트워크 자체가 제한된 통신 반경과 짧은 배터리 수명을 갖고 있기 때문이다. 본 논문에서는 IEEE 802.15.4 기반의 무선 센서네트워크에서 노드들의 클러스터링을 통한 숨은노드 충돌 회피 및 성능향상 기법을 제안하다. 이 방법에서 사용되는 클러스트링은 각각의 무선 센서노드들이 갖고 있는 채널 품질 정보를 바탕으로 수행된다. 그리고 클러스터에 어느 정도의 무선자원을 할당해야 하는 문제도 다룬다.

내부 영상 슬라이스 구조를 이용한 관심 영역 부호화 (Region-of-Interest Coding using Sub-Picture Slice Structure)

  • 김우식
    • 방송공학회논문지
    • /
    • 제7권4호
    • /
    • pp.335-344
    • /
    • 2002
  • 관심 영역 부호화 방법은 관심 영역을 고화질로 부호화하고 배경 영역을 많이 압축함으로써 주관적 화질을 향상시키는 방법이다. 본 논문에서는 관심 영역 부호화를 효율적으로 수행할 수 있는 새로운 슬라이스 구조인 내부 영상 슬라이스 구조를 제안한다. 또한 제안한 내부 영상 슬라이스 구조를 사용할 때에 관심 영역과 배경 영역에 비트율을 할당하는 방법에 대해 다루었다. 비트율을 할당할 때 관심 영역과 배경 영역의 양자화 파라메터의 간격을 고정시켜 빠르게 양자화 파라메터를 결정하도록 하고, 특히 각 영역간에 경계가 드러나지 않도록 화질이 점차적으로 변하도록 양자화 파라메터를 설정하였다. 또한 오류가 있는 전송 환경에서 관심 영역을 배경 영역보다 오류로부터 더 많이 보호하여 주관적 화질을 향상시켰다.

An Oligopoly Spectrum Pricing with Behavior of Primary Users for Cognitive Radio Networks

  • Lee, Suchul;Lim, Sangsoon;Lee, Jun-Rak
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권4호
    • /
    • pp.1192-1207
    • /
    • 2014
  • Dynamic spectrum sharing is a key technology to improve spectrum utilization in wireless networks. The elastic spectrum management provides a new opportunity for licensed primary users and unlicensed secondary users to efficiently utilize the scarce wireless resource. In this paper, we present a game-theoretic framework for dynamic spectrum allocation where the primary users rent the unutilized spectrum to the secondary users for a monetary profit. In reality, due to the ON-OFF behavior of the primary user, the quantity of spectrum that can be opportunistically shared by the secondary users is limited. We model this situation with the renewal theory and formulate the spectrum pricing scheme with the Bertrand game, taking into account the scarcity of the spectrum. By the Nash-equilibrium pricing scheme, each player in the game continually converges to a strategy that maximizes its own profit. We also investigate the impact of several properties, including channel quality and spectrum substitutability. Based on the equilibrium analysis, we finally propose a decentralized algorithm that leads the primary users to the Nash-equilibrium, called DST. The stability of the proposed algorithm in terms of convergence to the Nash equilibrium is also studied.

Coalition Formation Game Based Relay Selection and Frequency Sharing for Cooperative Relay Assisted Wireless D2D Networks with QoS Constraints

  • Niu, Jinxin;Tang, Wei;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권11호
    • /
    • pp.5253-5270
    • /
    • 2016
  • With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

OPNET을 이용한 Ethernet-PON 시스템 구현 및 성능 평가 (Implementation and Performance Evaluation of Ethernet-PON System using OPNET)

  • 안계현;한경은;박혁규;노선식;김영천
    • 한국통신학회논문지
    • /
    • 제28권5B호
    • /
    • pp.466-474
    • /
    • 2003
  • 본 논문에서는 최근 효율적이고 경제적인 초고속 광가입자망 기술로서 부각된 Ethernet-PON 시스템을 위한 시뮬레이션 모델을 OPNET을 이용하여 구현한다. 설계한 Ethernet-PON 시스템은 IEEE 802.3ah EFM을 기반으로 요청/허가 TDMA MAC 프로토콜을 사용하며 제어 패킷들의 교환을 통해 등록, 레인징, 동적 대역 할당 등의 기능을 수행한다. 시뮬레이션 모델을 사용하여 초기 등록 절차에서의 성공률과 나중 등록을 위한 지연에 관한 결과를 분석하였다. 또한 사용자의 요구 대역 정보를 기반으로 대역을 동적으로 할당하는 Dynamic TDMA 프로토콜과 사용자의 요구에 관계없이 동등한 대역을 할당하는 Static TDMA 프로토콜의 성능을 채널 이용률 및 큐잉 지연 관점에서 비교하였다. 본 논문에서 구현한 시뮬레이터는 Ethernet-PON 시스템의 설계 과정에서 논의될 수 있는 여러 기술 사항들에 대한 적절한 선택 기준을 모의 실험을 통해 제시할 수 있을 것으로 기대된다.