• 한국컴퓨터정보학회논문지
• /
• 제1권1호
• /
• pp.25-36
• /
• 1996

본 논문은 격자 구조 회선 교환 망에서 발생할 수 있는 호 차단 확률 및 failure model을 설정하여 신뢰도를 분석하였다 특히 failure model에서는 link failure 모델을 고려하였다. 대상 모델은.flooding search routing 방식을 사용하여 패킷을 통화 대상자 노드에 전송하였다. 이때. 각 링크failure는 독립적이라고 가정하였다. 이와 같은 failure모델의 성능을 평가하기 위한 방법으로서 joint probability를 이용하여 소규모 격자 구조 회선 교환망의 신뢰도를 분석해 보았으며. 이를 시뮬레이션 한 값과 비교해 보았다 또한. 통신망에서 주요한 성능 지표중 하나8! 호 차단 확률을 구하여 회선망의 신뢰도를 평가하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권2호
• /
• pp.82-102
• /
• 2008

Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.

• 전기학회논문지
• /
• 제59권7호
• /
• pp.1302-1308
• /
• 2010

In this study, Zigbee Sensor Node to transmit harmful gases CO and $CO_2$ information using wireless communication within the ground and underground structures were developed. Wireless communication protocol was used Zigbee Stack included IEEE 802. 15.4 MAC protocol. For wireless transmission of detected harmful gas signal from ADC of MCU was implemented Zigbee Sensor Node that was developed protocol using Serial-Port-Profile(SPP) here. The proposed Zigbee Sensor Node was verified transmission distance from experiments. Transmission distance was into 90m in experiments. Distance experiments were measured at 10m intervals using sine & pulse wave input signal at indoors. The proposed Route Sensor Node was applied mesh routing protocol. When built up USN(Ubiquitous Sensor Network)using Route Sensor Node, transmission distance was not limited. On the experimental results, harmful gas values between direct measurements and USN measurements were consistent. The semiconductor CO sensor and N-DIR $CO_2$ sensor module as a harmful sensor was used. Therefore, the proposed Zigbee Sensor Node was verified about reliability and validity to build USN for transmission of harmful gas information.

• 한국콘텐츠학회논문지
• /
• 제9권9호
• /
• pp.31-40
• /
• 2009

센서 네트워크에서는 신뢰성 있는 데이터 전송, 각 노드의 에너지 효율성 그리고 노드의 부하 분산을 통한 네트워크 수명의 최대화가 중요하다. 본 논문에서는 무선 센서 네트워크에서 동적 단일 경로를 이용하여 이러한 내용을 고려한 동적 단일경로 설정기법(DSPR : Dynamic Single Path Routing)을 제안한다. 각 노드는 싱크까지의 홉 카운트와 평균 잔존 에너지로 계산된 최소 비용을 가지는 동적 단일 경로로 데이터를 전송한다. 이 때, 각 노드들은 자신의 전송 과정을 감시하고 경로 손상을 탐지한 노드는 코스트 테이블을 참조하여 손상된 경로를 동적으로 변경함으로써 네트워크의 신뢰성을 높이고 노드들의 에너지 소모를 균등하게 분산시킨다. 또한 네트워크 토폴로지 변화 발생시 전체 네트워크를 재구성하는 대신에 변화에 관련된 부분만을 동적으로 재구성하여 각 노드에서의 불필요한 에너지 소모를 최대한 억제함으로써 네트워크 수명을 증가시킨다. 실험결과 본 논문에서 제안하는 DSPR이 각 노드의 에너지 소모를 최소화하여 네트워크 수명을 증가시키고 신뢰성과 에너지 효율성에서 우수함을 보였다.

• 정보통신설비학회논문지
• /
• 제8권3호
• /
• pp.116-121
• /
• 2009

A novel method for improving the reliability of sensing data using multi-sensors in wireless sensor network systems is presented in this paper. This method is successfully applied a fog monitoring system in the mountain area.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.473-476
• /
• 2000

The network reliability is to be computed in terms of the terminal reliability. The computation of a termini reliability is started with a Boolean sum of products expression corresponding to simple paths of the pair of nodes. This expression is then transformed into another equivalent expression to be a Disjoint Sum of Products form. But this computaion of the terminal reliability obviously does not consider the communication between any other nodes but for the source and the sink. In this paper, we derive the overall network reliability which is the probability of communication that each node in the network communicates with all other remaining nodes. For this, we propose a method to make the SOP disjoint for deriving the network reliability expression from the system success expression using the modified Sheinman's method and modified BDD method.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1991년도 추계종합학술발표회논문집
• /
• pp.145-149
• /
• 1991

In this paper, an algorithm is proposed to analyze the approximating reliability of the capacity considered communication networks. In the case ofthe former methods to evaluate the source-to-termianl node reliability, it is very difficult to contract and delete the jointed terms in the simple path group. Therefore, the reliability bounds are used and compared to the exact reliability by TURBO PROLOG, the natural lanquage of artficial intelligence. In the reliability bounds, the upper bound used the valid cutset that isthe group of simple path and the lower bound used the minimal cutset by complement operation and the esact reiability is compared to this reliability bounds.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제6권2호
• /
• pp.187-194
• /
• 2006

In this paper, We presented the algorithm for estimating a reliability between nodes in wireless communication network such as RBN and MANET To estimate the reliability between nodes, we first modeled RNB and MANET as probability graph. Branches of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp arithmetic to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제6권4호
• /
• pp.297-306
• /
• 2006

In this paper, We presented the algorithm for estimating a reliability between nodes in wireless distributed sensor networks (DSN). To estimate the reliability between nodes, we first modeled DSN as probability graph. Links of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp operation to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

• ETRI Journal
• /
• 제31권5호
• /
• pp.534-544
• /
• 2009

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.