• 한국멀티미디어학회논문지
• /
• 제8권12호
• /
• pp.1613-1622
• /
• 2005

Broadcasting is fundamental and effective data dissemination mechanism for route discovery, address resolution, and many other network services in mobile ad hoc networks. Although many approaches for broadcasting have been proposed to minimize the number of retransmissions, none of them guarantee the best-suited bounds of retransmissions. Appropriate use of probabilistic method can lower the chance of contention and collision among neighboring nodes, so that it reduces the number of rebroadcasts. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability according to the distance between the sender and the receiver. While the rebroadcast probabilities of a mobile node close to sender will be set lower, the rebroadcast probabilities of a mobile node far away from sender wi1l be set to higher, The rebroadcast probability of a node wi1l be set according to the distance from sender. We evaluate the performance of proposed approach by comparing it with flooding as well as a fixed probabilistic broadcast approach. Simulation results showed that the performance of proposed scheme outperforms by about $70\%$ than flooding scheme and outperforms by about $20\%$ than fixed probabilistic scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1659-1673
• /
• 2019

Android platform provides In-app Billing service for purchasing valuable items inside mobile applications. However, it has become a major target for attackers to achieve valuable items without actual payment. Especially, application developers suffer from automated attacks targeting all the applications in the device, not a specific application. In this paper, we propose a novel scheme detecting automated attacks with probabilistic tests. The scheme tests the signature verification method in a non-deterministic way, and if the method was replaced by the automated attack, the scheme detects it with very high probability. Both the analysis and the experiment result show that the developers can prevent their applications from automated attacks securely and efficiently by using of the proposed scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.7-12
• /
• 2003

In this paper, S(stochastic)-eigenvalue concept and its S-eigenvector for linear continuous-time systems with probabilistic uncertainties are proposed. The proposed concept is concerned with the perturbation of eigenvalues due to the probabilistic variable parameters in the dynamic model of a plant. S-eigenstructure assignment scheme via the Sylvester equation approach based on the S-eigenvalue concept is also proposed. The proposed design scheme is applied to the longitudinal dynamics of open-loop-unstable aircraft with possible uncertainties in aerodynamic and thrust effects as well as separate dynamic pressure.

• 한국인터넷방송통신학회논문지
• /
• 제16권6호
• /
• pp.153-158
• /
• 2016

다중홉 무선센서네트워크에서 플러딩(또는 브로드캐스팅) 전송은 경로 탐색, 주소설정, 메시지 전송과 같은 기본 작업이다. 그러나 플러딩 기법은 'Broadcasting Storm' 현상을 발생시키며, 메시지 충돌, 혼잡, 불필요한 네트워크 자원을 소모하게 된다. 따라서 이러한 단순 플러딩 기법의 단점을 보완하기 위한 다양한 Flooding 기법이 제안되었다. 이러한 플러딩 기법은 확률기반, 카운터 기반, 거리기반, 이웃 기반 기법으로 분류할 수 있다. 본 논문에서는 이러한 대표적인 플러딩 기법의 장단점을 소개하고, 컴퓨터 시뮬레이션을 통하여 단순 플러딩 기법을 포함한 각 기법의 성능과 효율성을 비교 분석하였다.

• 한국산학기술학회논문지
• /
• 제13권1호
• /
• pp.382-389
• /
• 2012

위조된 보고서 공격은 무선 센서 네트워크에서 이벤트가 발생한 위치에 대한 송신 응답과 같은 거짓 경보를 야기하는 것뿐만 아니라 제한된 량의 에너지를 고갈시킨다. 본 논문에서는 위조된 보고서를 필터링하기 위해 확률적인 보안 필터링 기법(PFSS: Probabilistic Filtering method for Sensor network Security)을 제안한다. 제안 내용은 클러스터 헤드와 기지국과의 거리를 이용하여 기지국까지의 중간 클러스터 헤드가 검증 노드인지를 확률적으로 선택하여 보안 검증에 필요한 에너지를 줄이고, 보안 처리에 따른 핫 스팟 문제를 완화시킨다. 제안된 기법의 성능은 수식 분석과 실험을 통하여 분석하였으며, 이를 통하여 제안된 기법이 기존의 보안 검증 처리에 비해 효율적임을 알 수 있다.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2008년도 정기 학술대회
• /
• pp.27-32
• /
• 2008

The laminated composite materials have been applied to various mechanical structures due to their high performance to weight ratios. In this study, we suggest a stochastic finite element scheme for the probabilistic analysis of the composite laminated plates. The composite materials consist of two different materials which constitute the matrix and fiber. The material properties in the major and minor directions are determined depending on the volume fraction of these two materials. In this study, the elastic modulus and shear modulus are considered as random and the effect of these random properties on the behavior of the composite plate is investigated. We adopt the weighted integral scheme in the formulation, which has been recognized as the most accurate method in the statistical methodologies. For verification of the proposed scheme, Monte Carlo analysis is also performed for the comparison with the proposed scheme.

• Journal of information and communication convergence engineering
• /
• 제10권4호
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.

• 한국수자원학회논문집
• /
• 제44권10호
• /
• pp.843-851
• /
• 2011

수문학 분야에서 중장기 유출량 예측은 입력변수의 불확실성 등으로 인하여 확률론적 방법을 사용하는 것이 바람직한 것으로 알려져 왔다. 본 연구에서는 금강유역을 대상으로 구성된 바 있는 RRFS-ESP 시스템에 PDF-ratio 방법을 기반으로한 사전처리기능을 장착하여 보다 효율적인 중장기 예측시스템으로의 확장을 시도하여 보았다. 이를 위하여 기상청에서 제공하는 확률기상정보를 이용하여 가중치를 산정하고 이를 기반으로 시나리오별 예측확률을 갱신하였다. 예측결과에 대하여 각 기법별 예측점수를 산정하여 본 결과 우선 ESP 기법에 의한 예측점수의 평균이 초보예측 점수를 상회하여 본 연구에서 구성한 RRFS-ESP 시스템의 적용성을 확인할 수 있었다. 또한 확률기상전망을 이용하여 갱신한 유입량 시나리오의 예측점수가 ESP 기법에 의한 예측점수를 상회하고 있음을 확인할 수 있어 ESP 기법에 의한 예측결과를 확률기상전망을 이용하여 갱신할 경우 예측 정확도를 보다 개선시킬 수 있음을 확인할 수 있었다.

• 제어로봇시스템학회논문지
• /
• 제20권11호
• /
• pp.1131-1135
• /
• 2014

This paper proposes the enhanced faulty node detection scheme with hybrid algorithm using Markov-chain model on BCH (Bose-Chaudhuri-Hocquenghem) code in naval distributed control networked systems. The probabilistic model-driven approach, on Markov-chain model, in this paper uses the faulty weighting interval factors, which are based on the BCH code. In this scheme, the master node examines each slave-nodes continuously using three defined states : Good, Warning, Bad-state. These states change using the probabilistic calculation method. This method can improve the performance of detecting the faulty state node more efficiently. Simulation results show that the proposed method can improve the accuracy in faulty node detection scheme for real-time naval distributed control networked systems.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.445-448
• /
• 2008

The key establishment between nodes is one of the most important issues to secure the communication in wireless sensor networks. Some researcher used the probabilistic key sharing scheme with a pre-shared key pool to reduce the number of keys and the key disclosure possibility. However, there is a potential possibility that some nodes do not have a common share in the key pool. The purpose of this paper is to devise a peer to peer key sharing protocol (PPKP) based on Quorum system and Diffie-Hellman key exchange scheme (DHS). The PPKP establishes a session key by creating a shared key using the DHS and then scrambles it based on Quorum system to secure that. The protocol reduces the number of necessary keys than the previous schemes and could solve the non-common key sharing possibility problem in the probabilistic schemes.