• 제목/요약/키워드: Node reliability

검색결과 373건 처리시간 0.025초

장기 동작 신뢰성을 고려한 수중 복합 탐지 시스템 설계 (A design of hybrid detection system with long term operating reliability in underwater)

  • 정현주
    • 센서학회지
    • /
    • 제14권3호
    • /
    • pp.198-205
    • /
    • 2005
  • Recently, the systems using multiple sensors such as magnetic, acoustic and pressure sensor are used for detection of underwater objects or vehicles. Those systems have difficulty of maintenance and repair because they operate underwater. Thus, this paper describes a hybrid detection system with long term operating reliability. This has a multi-signal transmission structure to have a high reliability. First, a signal transmission & receiving part, which transfers data from underwater sensors to land and receive control message from land through optical cable, has 4 multi-path. Second, the nodes for signal transmission are connected dually each other with single-hop construction and sensors are connected to a couple of neighboring nodes. This enables the output signal to transmit from a node to the next node and the next but one node together. Also, the signal from a sensor can be transmitted to two nodes at the same time. Therefore, the system with this construction has high reliability in long term operation because it makes possible to transmit sensor data to another node which works normally although a transmission node or cable in system have some faults.

A Heuristic Algorithm for the Reliability Optimization of a Distributed Communication Network

  • Hung, Chih-Young;Yang, Jia-Ren;Park, Dong-Ho;Liu, Yi-Hsin
    • International Journal of Reliability and Applications
    • /
    • 제9권1호
    • /
    • pp.1-5
    • /
    • 2008
  • A heuristic algorithm for reliability optimization of a distributed network system is developed so that the reliability of a large system can be determined efficiently. This heuristic bases on the determination of maximal reliability set of maximum node capacity, maximal link reliability and maximal node degree.

  • PDF

회선교환망에서의 고장모델에 대한 신뢰도 분석 (Reliability analysis of failure models in circuit-switched networks)

  • 김재현;이종규
    • 전자공학회논문지A
    • /
    • 제32A권8호
    • /
    • pp.1-10
    • /
    • 1995
  • We have analyzed the reliability of failure models in circuit-switched networks. These models are grid topology circuit-switched networks, and each node transmits a packet to a destination node using a Flooding routing method. We have assumed that the failure of each link and node is independent. We have considered two method to analyze reliability in these models : The Karnaugh Map method and joint probability method. In this two method, we have analyzed the reliability in a small grid topology circuit switched network by a joint probability method, and comared analytic results with simulated ones. For a large grid enormous. So, we have evaluated the reliability of the network by computer simulation techniques. As results, we have found that the analytic results are very close to simulated ones in a small grid topology circuit switched network. And, we have found that network reliability decreases exponentially, according to increment of link or node failure, and network reliability is almost linearly decreased according to increment of the number of links, by which call has passed. Finally, we have found an interesting result that nodes in a center of the network are superior to the other nodes from the reliability point of view.

  • PDF

방향성 통신망의 신뢰도 계정에 관한 에지제거 알고리즘 (An Edge Removal Algorithm for the Reliability Evaluation of Directed Communication Networks)

  • 임윤구;오영환
    • 한국통신학회논문지
    • /
    • 제13권1호
    • /
    • pp.63-73
    • /
    • 1988
  • 본 논문에서는 확률적 방향성 그래프에서 시점(source node)과 종점(terminal node) 간의 통신할 수 있는 확률인 단점간 신뢰도를 계정하는 알고리즘을 제시하였다. Satyanarayana의 factoring $theorem^{(7)}$을 이용하여 확률적 방향성 그래프에서 시점에 연결되어 있는 에지(edge)를 개방(open)과 단락(short)상태로 감축하여 원래의 그래프를 2개의 감축된 그래프로 분리한 후, 본 논문이 제시한 에지제거법과 일반적인 직, 병렬 감축법을 분리된 그래프에 적용한다. 이 에지 감축(edge reduction)을 source node와 terminal node가 단일 에지로 연결될때까지 반복한다. 또한 복잡하고 규모가 큰 망에 대한 단점간 신뢰도를 계정하기 위해서 전산기 프로그램을 제시하였다.

  • PDF

Multiple Node Flip Fast-SSC Decoding Algorithm for Polar Codes Based on Node Reliability

  • Rui, Guo;Pei, Yang;Na, Ying;Lixin, Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권2호
    • /
    • pp.658-675
    • /
    • 2022
  • This paper presents a fast-simplified successive cancellation (SC) flipping (Fast-SSC-Flip) decoding algorithm for polar code. Firstly, by researching the probability distribution of the number of error bits in a node caused by channel noise in simplified-SC (SSC) decoder, a measurement criterion of node reliability is proposed. Under the guidance of the criterion, the most unreliable nodes are firstly located, then the unreliable bits are selected for flipping, so as to realize Fast-SSC-Flip decoding algorithm based on node reliability (NR-Fast-SSC-Flip). Secondly, we extended the proposed NR-Fast-SSC-Flip to multiple node (NR-Fast-SSC-Flip-ω) by considering dynamic update to measure node reliability, where ω is the order of flip-nodes set. The extended algorithm can correct the error bits in multiple nodes, and get good performance at medium and high signal-to-noise (SNR) region. Simulation results show that the proposed NR-Fast-SSC-Flip decoder can obtain 0.27dB and 0.17dB gains, respectively, compared with the traditional Fast-SSC-Flip [14] and the newly proposed two-bit-flipping Fast-SSC (Fast-SSC-2Flip-E2) [18] under the same conditions. Compared with the newly proposed partitioned Fast-SSC-Flip (PA-Fast-SSC-Flip) (s=4) [18], the proposed NR-Fast-SSC-Flip-ω (ω=2) decoder can obtain about 0.21dB gain, and the FER performance exceeds the cyclic-redundancy-check (CRC) aided SC-list (CRC-SCL) decoder (L=4).

A Novel Multi-link Integrated Factor Algorithm Considering Node Trust Degree for Blockchain-based Communication

  • Li, Jiao;Liang, Gongqian;Liu, Tianshi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권8호
    • /
    • pp.3766-3788
    • /
    • 2017
  • A blockchain is an underlying technology and basic infrastructure of the Bitcoin system. At present, blockchains and their applications are developing rapidly. However, the basic research of blockchain technology is still in the early stages. The efficiency and reliability of blockchain communication is one of the research problems that urgently need to be studied and addressed. Existing algorithms may be less feasible for blockchain-based communication because they only consider a single communication factor (node communication capability or node trust degree) and only focus on a single communication performance parameter(communication time or communication reliability). In this paper, to shorten the validation time of blockchain transactions and improve the reliability of blockchain-based communication, we first establish a multi-link concurrent communication model based on trust degree, and then we propose a novel integrated factor communication tree algorithm (IFT). This algorithm comprehensively considers the node communication link number and the node trust degree and selects several nodes with powerful communication capacity and high trust as the communication sources to improve the concurrency and communication efficiency. Simulation results indicate that the IFT algorithm outperforms existing algorithms. A blockchain communication routing scheme based on the IFT algorithm can increase communication efficiency by ensuring communication reliability.

MANET에서 보안 경로와 안전한 데이터 전송을 위한 신뢰 기반 라우팅 기법에 관한 연구 (A Study on Trusted Routing Scheme for Secure Path and Secure Data Transmission in MANET)

  • 양환석
    • 디지털산업정보학회논문지
    • /
    • 제13권2호
    • /
    • pp.43-51
    • /
    • 2017
  • Recently, MANET has been used in many fields as the range of applications increases. However, the dynamic topology that MANET has makes it difficult to route and provides the cause of exposure to security vulnerabilities. Therefore, the security features that can be robust to many attacks must have been applied in the routing technique provided in the MANET. In this paper, we propose a secure routing method that secure route is established by reliability evaluation of nodes and secure data communication has applied through key exchange mechanism. The proposed technique used hierarchical structure for efficiency of reliability evaluation of nodes. The reliability of nodes is performed by trust management node and reliability of nodes managed periodically is broadcasted. And the key exchange for secure data transmission is dene without CA as the certificate issuing organization. This allows fast key exchange and the integrity of data transmission improved. The proposed technique improves the security of the data transmission because a secure route to the destination node is established by the reliability evaluation and the data transmission is performed after the key between the source node and the destination node is exchanged through the established route.

Designing of Dynamic Sensor Networks based on Meter-range Swarming Flight Type Air Nodes

  • Kang, Chul-Gyu;Kim, Dae-Hwan
    • Journal of information and communication convergence engineering
    • /
    • 제9권6호
    • /
    • pp.625-628
    • /
    • 2011
  • Dynamic sensor network(DSN) technology which is based on swarming flight type air node offers analyzed and acquired information on target data gathered by air nodes in rotation flight or 3 dimension array flight. Efficient operation of dynamic sensor network based on air node is possible when problems of processing time, data transmission reliability, power consumption and intermittent connectivity are solved. Delay tolerant network (DTN) can be a desirable alternative to solve those problems. DTN using store-and-forward message switching technology is a solution to intermittent network connectivity, long and variable delay time, asymmetric data rates, and high error rates. However, all processes are performed at the bundle layer, so high power consumption, long processing time, and repeated reliability technique occur. DSN based on swarming flight type air node need to adopt store-and-forward message switching technique of DTN, the cancelation scheme of repeated reliability technique, fast processing time with simplified layer composition.

신뢰도와 키를 이용한 보안 라우팅 기법에 관한 연구 (A Study on Secure Routing Technique using Trust Value and Key in MANET)

  • 양환석
    • 디지털산업정보학회논문지
    • /
    • 제11권3호
    • /
    • pp.69-77
    • /
    • 2015
  • MANET is composed of only the mobile nodes have a limited transmission range. The dynamic topology by the frequent movement of nodes makes routing difficult and is also cause exposed to security vulnerabilities. In this paper, we propose the security routing technique consisted of mechanism of two steps in order to respond effectively to attack by the modification of the routing information and transmit secure data. The hierarchical structure is used and the authentication node that issues the key of the nodes within each cluster is elected in this proposed method. The authentication node manages key issues and issued information for encrypting the routing information from the source node. The reliability value for each node is managed to routing trust table in order to secure data transmission. In the first step, the route discovery is performed using this after the routing information is encrypted using the key issued by the authentication node. In the second step, the average reliability value of the node in the found path is calculated. And the safety of the data transmission is improved after the average reliability value selects the highest path. The improved performance of the proposed method in this paper was confirmed through comparative experiments with CBSR and SEER. It was confirmed a better performance in the transmission delay, the amount of the control packet, and the packet transmission success ratio.

SCI에 근거한 ICR 네트워크의 신뢰도와 비교 (The Reliability and Comparison of ICR Network Based on SCI)

  • 김동철
    • 디지털콘텐츠학회 논문지
    • /
    • 제6권1호
    • /
    • pp.7-12
    • /
    • 2005
  • 논문은 IEEE 표준인 SCI(Scalable Coherent Interface)에 근거한 degree 2의 ICR(Interleaved Cyclic Ring) 네트워크의 신뢰도를 연구하였고 대표적인 링 네트워크들과 비교하였다. ICR 네트워크의 신뢰도 연구에 있어서 두 노드가 동시에 통신 할 수 있는 신뢰도를 계산하였다. ICR 네트워크의 신뢰도 연구에서 실패율(failure rate)의 변화에 신뢰도의 반응을 연구하였고 적은 노드에 대하여 정확한 신뢰도를 구하고 노드 수가 증가한 경우에는 최대 최소 경계를 계산하여 평균치 일반식을 구하였다. ICR 네트워크의 사이클의 변화에 따라 ICR 네트워크의 신뢰도를 다른 링 네트워크와 비교하였다.

  • PDF