• Title/Summary/Keyword: 커버 문제

Search Result 176, Processing Time 0.029 seconds

Multiuser Precoding and Power Allocation with Sum Rate Matching for Full-duplex MIMO Relay (전이중 MIMO 릴레이를 위한 다중 사용자 Precoding 및 Sum Rate 정합 기반 전력 할당 기법)

  • Lee, Jong-Ho;Shin, Oh-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12C
    • /
    • pp.1020-1028
    • /
    • 2010
  • Relay has attracted great attention due to its inherent capability to extend the service coverage and combat shadowing in next generation mobile communication systems. So far, most relay technologies have been developed under the half-duplex (HD) constraint that prevents relays from transmitting and receiving at the same time. Although half-duplex relay (HDR) is easy to implement, it requires partitioning of resource for transmission and reception, reducing the whole system capacity. In this paper, we propose a multinser precoding and power control scheme with sum rate matching for a full-duplex (FD) multiple-input multiple-output (MIMO) relay. Full-duplex relay (FDR) can overcome the drawback of HDR by transmitting and receiving on the same frequency at the same time, while it is crucial to reduce the effect of self-interference that is caused by its own transmitter to its own receiver. The proposed precoding scheme cancels the self-interference of the FDR as well as to support multiuser MIMO. Moreover, we suggest a power allocation scheme for FD MIMO relay with the constraint that the sum rate of the relay's received data streams is equal to that of the relay's transmit data streams.

Gaussian Kernel Smoothing of Explicit Transient Responses for Drop-Impact Analysis (낙하 충격 해석을 위한 명시법 과도응답의 가우스커널 평활화 기법)

  • Park, Moon-Shik;Kang, Bong-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.3
    • /
    • pp.289-297
    • /
    • 2011
  • The explicit finite element method is an essential tool for solving large problems with severe nonlinear characteristics, but its results can be difficult to interpret. In particular, it can be impossible to evaluate its acceleration responses because of severe discontinuity, extreme noise or aliasing. We suggest a new post-processing method for transient responses and their response spectra. We propose smoothing methods using a Gaussian kernel without in depth knowledge of the complex frequency characteristics; such methods are successfully used in the filtering of digital signals. This smoothing can be done by measuring the velocity results and monitoring the response spectra. Gaussian kernel smoothing gives a better smoothness and representation of the peak values than other approaches do. The floor response spectra can be derived using smoothed accelerations for the design.

Game Theoretic Cache Allocation Scheme in Wireless Networks (게임이론 기반 무선 통신에서의 캐시 할당 기법)

  • Le, Tra Huong Thi;Kim, Do Hyeon;Hong, Choong Seon
    • Journal of KIISE
    • /
    • v.44 no.8
    • /
    • pp.854-859
    • /
    • 2017
  • Caching popular videos in the storage of base stations is an efficient method to reduce the transmission latency. This paper proposes an incentive proactive cache mechanism in the wireless network to motivate the content providers (CPs) to participate in the caching procedure. The system consists of one/many Infrastructure Provider (InP) and many CPs. The InP aims to define the price it charges the CPs to maximize its revenue while the CPs compete to determine the number of files they cache at the InP's base stations (BSs). We conceive this system within the framework of Stackelberg game where InP is considered as the leader and CPs are the followers. By using backward induction, we show closed form of the amount of cache space that each CP renting on each base station and then solve the optimization problem to calculate the price that InP leases each CP. This is different from the existing works in that we consider the non-uniform pricing scheme. The numerical results show that InP's profit in the proposed scheme is higher than in the uniform pricing.

An Efficient Evolutionary Algorithm for Optimal Arrangement of RFID Reader Antenna (RFID 리더기 안테나의 최적 배치를 위한 효율적인 진화 연산 알고리즘)

  • Soon, Nam-Soon;Yeo, Myung-Ho;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.10
    • /
    • pp.40-50
    • /
    • 2009
  • Incorrect deployment of RFID readers occurs reader-to-reader interferences in many applications using RFID technologies. Reader-to-reader interference occurs when a reader transmits a signal that interferes with the operation of another reader, thus preventing the second reader from communicating with tags in its interrogation zone. Interference detected by one reader and caused by another reader is referred to as a reader collision. In RFID systems, the reader collision problem is considered to be the bottleneck for the system throughput and reading efficiency. In this paper, we propose a novel RFID reader anti-collision algorithm based on evolutionary algorithm(EA). First, we analyze characteristics of RFID antennas and build database. Also, we propose EA encoding algorithm, fitness algorithm and genetic operators to deploy antennas efficiently. To show superiority of our proposed algorithm, we simulated our proposed algorithm. In the result, our proposed algorithm obtains 95.45% coverage rate and 10.29% interference rate after about 100 generations.

A Simulation of Mobile Base Station Placement for HAP based Networks by Clustering of Mobile Ground Nodes (지상 이동 노드의 클러스터링을 이용한 HAP 기반 네트워크의 이동 기지국 배치 시뮬레이션)

  • Song, Ha-Yoon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.11
    • /
    • pp.1525-1535
    • /
    • 2008
  • High Altitude Platform (HAP) based networks deploy network infrastructures of Mobile Base Station (MBS) in a form of Unmanned Aerial Vehicle (UAV) at stratosphere in order to build network configuration. The ultimate goal of HAP based network is a wireless network service for wide area by deploying multiple MBS for such area. In this paper we assume multiple UAVs over designated area and solve the MBS placement and coverage problem by clustering the mobile ground nodes. For this study we assumed area around Cheju island and nearby naval area where multiple mobile and fixed nodes are deployed and requires HAP based networking service. By simulation, visual results of stratospheric MBS placement have been presented. These results include clustering, MBS placement and coverage as well as dynamic reclustering according to the movement of mobile ground nodes.

  • PDF

An Efficient Evolutionary Algorithm for Optimal Arrangement of RFID Reader Antenna (RFID 리더기 안테나의 최적 배치를 위한 효율적인 진화연산 알고리즘)

  • Soon, Nam-Soon;Yeo, Myung-Ho;Yoo, Jae-Soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.715-719
    • /
    • 2009
  • Incorrect deployment of RFID readers occurs reader-to-reader interferences in many applications using RFID technologies. Reader-to-reader interference occurs when a reader transmits a signal that interferes with the operation of another reader, thus preventing the second reader from communicating with tags in its interrogation zone. Interference detected by one reader and caused by another reader is referred to as a reader collision. In RFID systems, the reader collision problem is considered to be the bottleneck for the system throughput and reading efficiency. In this paper, we propose a novel RFID reader anti-collision algorithm based on evolutionary algorithm(EA). First, we analyze characteristics of RFID antennas and build database. Also, we propose EA encoding algorithm, fitness algorithm and genetic operators to deploy antennas efficiently. To show superiority of our proposed algorithm, we simulated our proposed algorithm. In the result, our proposed algorithm obtains 95.45% coverage rate and 10.29% interference rate after about 100 generations.

  • PDF

Farthest-k relay selection algorithm for efficient D2D message dissemination (효율적인 D2D 메시지 확산을 위한 최외곽 k개의 릴레이 선택 알고리즘)

  • Han, Seho;Lee, Howon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.3
    • /
    • pp.543-548
    • /
    • 2017
  • In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

Electromagnetic Field Characteristics of the Slotted Coaxial Clables (동축 슬롯케이블의 전자파 특성)

  • 이애경;김두경;김정기
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.2 no.4
    • /
    • pp.17-25
    • /
    • 1991
  • Slotted coaxial cables are used for a wide variety of radio communications and control applications within buildings, subways, tunnels and outdoors. They function as continuous antennas to solve RF coverage problems in difficult or confined areas. In this paper the electric and magnetic field distributions inside and outside of axially slotted coaxial cables are analyzed numerically. This paper gets the fields from the equivalent potentials which are obtained by grid relaxation method. The slot electric field configurations are consistent with Essam E. Hassan's results. The field distributions in the slotted coaxial cables show that the TEM mode doesn't propagate any longer in them. But the fields don't variate with the frequencies that are under the first higher order mode cutoff frequency of shielded coaxial cable of the same dimension The fields inside of the tunnel ($3\times4$) including the slotted coaxial cable axially are similar to those of $TE_{10}$ mode at 38.75 MHz. This method offers the basis for theoretical analysis of coaxial cables with nonuniform slots as well as coaxial cables in tunnels and buildings.

  • PDF

A Learning Content System which is Objectified with the Reusable Unit of Pedagogical Designs for Distributed Environments (분산환경을 위한 교수법적 설계의 재사용 단위를 객체화한 강의 컨텐츠 시스템)

  • Shin, Haeng-Ja;Park, Kyung-Hwan
    • The KIPS Transactions:PartA
    • /
    • v.10A no.5
    • /
    • pp.559-570
    • /
    • 2003
  • In this paper, we investigate a problem with Web-based learing contents and introduce the solving method of the problem. To be more accurate, existing Web-based learning contents were one fixd and uniformed courseware file with a large size and HTML format. Also, They were written files with authoring tools of which depended upon providing a multimedia vender. These learning contents were difficult to reuse among cyber education systems and change the applicable contents to the learner for learning experiences in time. So in this paper, we produced reusable and interopreable learning contents among instruction designers and education systems. They were deconstructed into smaller chunks and added to its properties. For the purpose of this producing method, we used the pedagogical designs for units of reuse. These are just turorial link-more and tell-more and was implemented with CBD method. As a result, The problem of existing Web-based learning contents system was resolved and then the power of understanding about objectified learning content was increased for the learner and instruction designers.

Power Allocation and Performance Analysis for the Secondary User under Primary Outage Constraint in Cognitive Relay Network (Cognitive Relay 네트워크에서 일차 사용자의 Outage 제약 조건 하에서의 이차 사용자의 파워 할당 기법 및 성능 분석)

  • Kim, Hyung-Jong;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.8
    • /
    • pp.46-51
    • /
    • 2012
  • In this paper, we investigate the power allocation for cognitive relay networks. Cognitive relay networks offer not only increasing spectral efficiency by spectrum sharing but also extending the coverage through the use of relays. For spectrum sharing, conventional works have assumed that secondary users know perfect channel information between the secondary and primary users. However, this channel information may be outdated at the secondary user because of the time-varying properties or feedback latency from the primary user. This causes the violation for interference constraint, and the secondary user cannot share the spectrum of the primary after all. To overcome this problem, we propose the power allocation scheme for the secondary user under the allowable primary user's outage probability constraint. Since the proposed power allocation scheme does not use the instantaneous channel information, the secondary users have lower feedback burden. In addition, the proposed scheme is also robust to the outdated channel environment.