RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 등재정보
        • 학술지명
        • 주제분류
        • 발행연도
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        Device-to-Device assisted user clustering for Multiple Access in MIMO WLAN

        ( Zhao Hongyi ),( Wu Weimin ),( Lu Li ),( Liu Yingzhuang ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.7

        WLAN is the best choice in the place where complex network is hard to set up. Intelligent terminals are more and more assembled in some areas now. However, according to IEEE 802.11n/802.11ac, the access-point (AP) can only serve one user at a single frequency channel. The spectrum efficiency urgently needs to be improved. In theory, AP with multi-antenna can serve multiple users if these users do not interfere with each other. In this paper, we propose a user clustering scheme that could achieve multi-user selection through the mutual cooperation among users. We focus on two points, one is to achieve multi-user communication with multiple antennas technique at a single frequency channel, and the other one is to use a way of distributed users` collaboration to determine the multi-user selection for user clustering. Firstly, we use the CSMA/CA protocol to select the first user, and then we set this user as a source node using users` cooperation to search other proper users. With the help of the users` broadcast cooperation, we can search and select other appropriate user (while the number of access users is limited by the number of antennas in AP) to access AP with the first user simultaneously. In the network node searching, we propose a maximum degree energy routing searching algorithm, which uses the shortest time and traverses as many users as possible. We carried out the necessary analysis and simulation to prove the feasibility of the scheme. We hope this work may provide a new idea for the solution of the multiple access problem.

      • KCI등재

        Interference Cancellation for Relay-Assisted D2D Communication

        ( Hongyi Zhao ),( Yang Cao ),( Yingzhuang Liu ) 한국인터넷정보학회 2015 KSII Transactions on Internet and Information Syst Vol.9 No.9

        Relay-assisted D2D communication extends the communication range of the D2D pairs and helps users to form D2D pairs effectively. However, due to the introduction of the multi-hop relaying, the D2D communication has to occupy extra transmission time, which may decrease the efficiency of the communication system. In this paper, we propose a scheme to make node receive D2D signal and BS signal at overlapping time to improve the spectrum efficiency according to ZigZag decoding and successive-interference-cancellation (SIC). In this way, more data can be delivered during the same duration, thus the network throughput can be further improved. Numerical results verify the performance improvement of the proposed scheme when compared with a baseline scheme. Moreover, we expand the proposed scheme from one-hop relay scenario to multi-hop relay scenario.

      • KCI등재

        Small Base Station Association and Cooperative Receiver Design for HetNets via Distributed SOCP

        ( Li Lu ),( Desheng Wang ),( Hongyi Zhao ),( Yingzhuang Liu ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.12

        How to determine the right number of small base stations to activate in multi-cell uplinks to match traffic from a fixed quantity of K users is an open question. This paper analyses the uplink cooperative that jointly receives base stations activation to explore this question. This paper is different from existing works only consider transmitting power as optimization objective function. The global objective function is formulated as a summation of two terms: transmitting power for data and coordinated overhead for control. Then, the joint base stations activation and beamforming problem is formulated as a mixed integer second order cone optimization. To solve this problem, we develop two polynomial-time distributed methods. Method one is a two-stage solution which activates no more than K small base stations (SBSs). Method two is a heuristic algorithm by dual decomposition to MI-SOCP that activates more SBSs to obtain multiple-antennae diversity gains. Thanks to the parallel computation for each node, our methods are more computationally efficient. The strengths and weaknesses of these two proposed two algorithms are also compared using numerical results.

      • SCIESCOPUSKCI등재

        Small Base Station Association and Cooperative Receiver Design for HetNets via Distributed SOCP

        Lu, Li,Wang, Desheng,Zhao, Hongyi,Liu, Yingzhuang Korean Society for Internet Information 2016 KSII Transactions on Internet and Information Syst Vol.10 No.12

        How to determine the right number of small base stations to activate in multi-cell uplinks to match traffic from a fixed quantity of K users is an open question. This paper analyses the uplink cooperative that jointly receives base stations activation to explore this question. This paper is different from existing works only consider transmitting power as optimization objective function. The global objective function is formulated as a summation of two terms: transmitting power for data and coordinated overhead for control. Then, the joint base stations activation and beamforming problem is formulated as a mixed integer second order cone optimization. To solve this problem, we develop two polynomial-time distributed methods. Method one is a two-stage solution which activates no more than K small base stations (SBSs). Method two is a heuristic algorithm by dual decomposition to MI-SOCP that activates more SBSs to obtain multiple-antennae diversity gains. Thanks to the parallel computation for each node, our methods are more computationally efficient. The strengths and weaknesses of these two proposed two algorithms are also compared using numerical results.

      • SCISCIE

        Continuous-Time Deadbeat <tex> $H_{2}$</tex> FIR Filter

        Ahn, Choon Ki,Shmaliy, Yuriy S.,Zhao, Shunyi,Li, Hongyi IEEE 2017 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS PART 2 E Vol.64 No.8

        <P>This brief proposes a new continuous-time state-space H-2 finite impulse response (FIR) filter with the embedded deadbeat property for linear systems undergoing external disturbances. The new filter is called the continuous-time deadbeat H-2 FIR filter (CTDH2FF). The proposed filter demonstrates H-2 performance under disturbances and the dead-beat property otherwise. The CTDH2FF can be implemented by solving two matrix differential equations for given boundary conditions. A new formula for the minimum H-2 norm of the CTDH2FF is also discussed. Numerical simulations show that the proposed filter has much better robustness against unexpected short-term model changes than the existing filters.</P>

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼