• Journal of Korea Multimedia Society
• /
• v.8 no.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)
• /
• v.13 no.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.10a
• /
• 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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.153-158
• /
• 2016

Broadcasting in multi-hop wireless sensor networks is a basic operation that supports many applications such as route search, setting up addresses and sending messages from the sink to sensor nodes. The broadcasting using flooding causes problems that can be mentioned as a broadcasting storm such as redundancy, contention and collision. A variety of broadcasting schemes using wireless sensor networks have been proposed to achieve superior performance rather than simple flooding scheme. Broadcasting algorithms in wireless sensor networks can be classified into six subcategories: flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, location-based schemes, and neighbor knowledge-based scheme. This study analyzes a simple flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, and neighbor knowledge-based scheme, and compares the performance and efficiency of each scheme through network simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.1
• /
• pp.382-389
• /
• 2012

The fabricated report attack will not only cause false alarms that waste real-world response efforts such as sending response teams to the event location, but also drains the finite amount of energy in a wireless sensor network. In this paper, we propose a probabilistic filtering method for sensor network security (PFSS) to deal with filtering for the fabricated report. On the basis of filtering scheme, PFSS combines cluster-based organization and probabilistic verification node assignment using distance of from cluster head to base station for energy efficiency and hot spot problem. Through both analysis and simulation, we demonstrate that PFSS could achieve efficient protection against fabricated report attack while maintaining a sufficiently high filtering power.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• 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
• /
• v.10 no.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.

• Journal of Korea Water Resources Association
• /
• v.44 no.10
• /
• pp.843-851
• /
• 2011

In hydrology, it is appropriate to use probabilistic method for forecasting mid/long term streamflow due to the uncertainty of input data. Through this study, it is expanded mid/long term forecasting system more effectively adding priory process function based on PDF-ratio method to the RRFS-ESP system for Guem River Basin. For implementing this purpose, weight is estimated using probabilistic weather forecasting information from KMA. Based on these results, ESP probability is updated per scenario. Through the estimated result per method, the average forecast score using ESP method is higher than that of naive forecasting and it confirmed that ESP method results in appropriate score for RRFS-ESP system. It is also shown that the score of ESP method applying revised inflow scenario using probabilistic weather forecasting is higher than that of ESP method. As a results, it will be improved the accuracy of forecasting using probabilistic weather forecasting.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.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.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• 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.