RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

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

        Energy-harvesting Q-learning secure routing algorithm with authenticated-encryption for WSN

        Li Cuiran,Wu Jixuan,Zhang Zepeng,Lv Anqi 한국통신학회 2023 ICT Express Vol.9 No.6

        Wireless sensor networks are susceptible to a variety of network attacks. Due to the limited energy of nodes and selfish nodes in the network, the packet delivery rate is lower. To address these issues, we innovatively propose an energy-harvesting Q-learning secure routing algorithm with authenticated-encryption. The algorithm uses physical unclonable functions and optimized Q-learning to ensure that the transmission path is reliable. Meanwhile, we combine the LSTM-based prediction model to predict the energy value that the nodes replenish. In addition, simulations are performed to compare the performances of the proposed algorithm with other algorithms under different attacks. The proposed algorithm has greater improvements in the packet delivery rate, filtering selfish nodes, and reducing node energy consumption.

      • Dynamic Entropy Based Combination Weighted Clustering Approach for High-Speed Ad hoc Network

        Jianli Xie,Cuiran Li,Hui Zhou 보안공학연구지원센터 2015 International Journal of Future Generation Communi Vol.8 No.3

        Weight based clustering has become the mainstream clustering algorithm in low-speed Ad hoc networks because of its excellent cluster stability. However, due to the dynamic topology changing in high-speed Ad hoc network, the cluster stability (network stability) decreased and the cluster maintenance costs increased sharply. To solve the problem, we propose a dynamic entropy based combination weighted clustering approach (DECW). First, according to the history messages of an evaluation node in the network, the upper bound and the lower bound value of each clustering index will be recorded, so the information entropy deviation of the indexes and dynamic entropy weight of each node can be obtained. After, the linear combination weights set of evaluation nodes is modeled as the second-order norm game , and the weight vector deviation is minimized as the optimization goal to get the multi-node dynamic entropy weights. In the cluster maintenance, a new Monte Carlo optimization is proposed to avoid the frequent cluster-heads (CHs) replacement induced of high node mobility of. Simulation results reveal that the proposed approach has the better adaptability in high-speed mobile environment.

      • The Scheme of Power Allocation for Decode-and-Forward Relay Channel in Energy Harvesting WSNs

        Jianli Xie,Cuiran Li 보안공학연구지원센터 2016 International Journal of Future Generation Communi Vol.9 No.12

        Recently, the issue of excessive energy consumption in wireless communications has become increasing critical, and the energy harvesting as a renewable energy resource, has received extensive attractions. In this paper, a wireless sensor network (WSN) is considered, where the source-destination pair communicates via an energy harvesting relay links. We study the problem of the harvested energy distribution among the source, relay and destination nodes. An effective power allocation scheme is developed which exploits the decode-and-forward (DF) relaying strategy and channel state information. The outage probability is analyzed and simulation results show that the outage performance for two sub-channels is always performs well in the cases of different threshold target data rate. Moreover, the effect of the different radio of the optimal sub-channel gain and Rayleigh channel gain on the outage performance is evaluated.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼