RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Column Generation Algorithm-Based DTN Routing Strategy in Complex Data Transmission Scenario

        Qun Wang,Huanyan Qian,Chenchen Ni,Qianmu Li 보안공학연구지원센터 2015 International Journal of Future Generation Communi Vol.8 No.6

        An ideal routing strategy shall be able to help the delay tolerant network (DTN) achieve an optimal transmission performance under the premise of lower energy consumption. However, due to the diverse of the application scenarios, it is hard to use one or more types of routing strategies as a universal optimum solution. There is a need to establish a routing strategy model of the corresponding DTN network for different application scenarios, analyze and evaluate the strategy model in combination of the knowledge of the operational research and statistics. For a complex data transmission DTN network scenario, with the introducing of a line programming method, the big-data and multi-node network transmission problem can be abstracted to a large-scale line programming problem. In this paper, the feasibility of solving the large-scale line programming problem by the column generation algorithm has been analyzed, and a column generation algorithm-based DTN routing strategy under the complex data transmission scenario has been designed. This routing strategy can realize the quantization of the routing strategy performance by the column generation algorithm. Also, by the simulation experiments, the performance of complex data transmission DTN routing strategy under different factors has been analyzed, and the performance of the column generation algorithm-based DTN routing strategy has been compared with the performance of the traditional jet waiting routing strategy

      • An Improved DV-Hop Localization Algorithm Against Wormhole Attack in WSN

        Jiuhu Zheng,Huanyan Qian 보안공학연구지원센터 2015 International Journal of Smart Home Vol.9 No.12

        Wormhole attack is one of the most serious attacks on DV-Hop localization algorithm. Previous solutions usually require hardware support, or a higher ratio of beacon nodes and very complex mathematical operations. In this paper, we analyze the effect of the wormhole attack on DV-Hop algorithm, which mainly destroys the network topological structure and shrinks hop count between nodes and expands the localization error. We propose a modified DV-Hop method without additional hardware support against wormhole attacks. Through analyzing the characteristics of the neighboring nodes set of nodes attacked, this method detects wormhole attack, then locates nodes by using an improved DV-Hop algorithm. We show that the scheme can detect wormhole attacker adequately, and the obtained localization accuracy is even better than that of the DV-Hop method without wormhole attacks in most cases.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼