Robust Relay Selection for Large-Scale Energy-Harvesting IoT Networks

  • Hiroki Kawabata
    Advanced Wireless and Communication Research Center, University of Electro-Communications, Tokyo, Japan
  • Koji Ishibashi
    Advanced Wireless and Communication Research Center, University of Electro-Communications, Tokyo, Japan
  • Satyanarayana Vuppala
    School of Engineering, Institute for Digital Communications, University of Edinburgh, Edinburgh, U.K.
  • Giuseppe T. F. de Abreu
    School of Engineering and Sciences, Jacobs University Bremen, Bremen, Germany

書誌事項

公開日
2017-04
権利情報
  • https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
  • https://doi.org/10.15223/policy-029
  • https://doi.org/10.15223/policy-037
DOI
  • 10.1109/jiot.2016.2586581
公開者
Institute of Electrical and Electronics Engineers (IEEE)

説明

We consider the relay selection problem in large-scale energy harvesting (EH) networks. It is known that if channel state information (CSI) is available at EH relays, a diversity order equal to the number of relays can be obtained, however, at the penalty of a feedback overhead (necessary to obtain accurate CSI) which is not suitable for energy-limited devices intended, e.g., for Internet-of-Things applications. In this paper, we therefore propose a new EH relay selection scheme which is based on the residual energy at each relay’s battery, and on information on the distribution of the channels between relays and the destination. The method thus minimizes both the outage probability and the feedback cost. Where previous work relay selection based on channel distribution information consider only small-scale fading distribution, we employ a stochastic geometry approach to consider jointly the geometrical distribution (i.e., large-scale fading) and small-scale fading yielding a simple relay selection criterion that furthermore utilizes only rough information on the relay’s location, i.e., an ordinal number from the destination. The outage probability of the proposed relay selection scheme is analytically derived, and the achievable diversity order of the proposed approach is investigated. Computer simulations confirm our theoretical analyses and show that our approach is robust against errors in the estimation of the distances between nodes.

収録刊行物

被引用文献 (2)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ