Academic literature on the topic 'Probabilistic Voting-based Filtering Scheme'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Probabilistic Voting-based Filtering Scheme.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Probabilistic Voting-based Filtering Scheme"

1

Nam, Su Man, and Tae Ho Cho. "Discrete event simulation–based energy efficient path determination scheme for probabilistic voting–based filtering scheme in sensor networks." International Journal of Distributed Sensor Networks 16, no. 8 (2020): 155014772094913. http://dx.doi.org/10.1177/1550147720949134.

Full text
Abstract:
In wireless sensor networks, sensors are extremely vulnerable to false positive and false negative attacks due to their stringent energy and computational constraints. Several en-route filtering schemes mainly focus on saving energy through early detection of false data within a short distance against these attacks; however, they cannot immediately block the false data injected by compromised nodes. A security scheme uses context-aware architecture for a probabilistic voting–based filtering scheme to detect the compromised nodes and block the injection of false data, unlike security protocols. Although these schemes effectively obstruct the false data forwarding, they cannot make any detour around the compromised node to avoid it during data forwarding. In this article, we propose a discrete event simulation–based energy efficient path determination scheme that takes a detour around the compromised node against the attacks. Our proposed scheme extracts candidate paths considering the network status and selects a path with the highest energy efficiency from among the candidates using discrete event simulation. Simulation results indicate that the proposed scheme provides energy savings of up to 12% while maintaining the security strength against the two attacks compared to the existing schemes.
APA, Harvard, Vancouver, ISO, and other styles
2

KIM, MUN SU, and TAE HO CHO. "AN EN-ROUTE FILTERING METHOD IN SENSOR NETWORKS USING DECISION FUNCTION." International Journal of Information Acquisition 04, no. 04 (2007): 357–64. http://dx.doi.org/10.1142/s0219878907001411.

Full text
Abstract:
Security in sensor networks is a major issue. Sensor networks use symmetric cryptography protocol since sensor nodes have resource constrained hardware. Such netowrks are also deployed in hostile environments. Therefore, an attacker can get all information after any nodes get compromised. The adversary can inject false sensing reports or false Message Authentication Codes into real reports. A probabilistic voting-based filtering scheme is proposed but in several cases it is inefficient in terms of energy consumption and filtering effectiveness. We proposed a new method that uses a decision function regardless of whether each forwarding node executes a verification process. Through performance analysis and simulation, our result shows that the proposed method is much more efficient than the probabilistic voting-based scheme in many cases.
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Feng, Avinash Srinivasan, and Jie Wu. "PVFS: A Probabilistic Voting-based Filtering Scheme in Wireless Sensor Networks." International Journal of Security and Networks 3, no. 3 (2008): 173. http://dx.doi.org/10.1504/ijsn.2008.020091.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cho, Tae Ho, Su Man Nam, and Shahzad Muhammad K. "GAFS: GENETIC ALGORITHM-BASED FILTERING SCHEME FOR IMPROVING DETECTION POWER IN SENSOR NETWORKS." International Journal of Research -GRANTHAALAYAH 3, no. 12 (2015): 100–116. http://dx.doi.org/10.29121/granthaalayah.v3.i12.2015.2894.

Full text
Abstract:
Wireless sensor networks (WSNs) have stringent energy and computational requirements. Security has become very crucial issue with the widespread acceptance of the WSNs in numerous decision-critical and hostile environments. Since sensor nodes are left unattended, they can be compromised by adversaries to launch various application layer attacks. Effective countermeasures against these attacks can lead to improved security. A probabilistic voting-based filtering scheme (PVFS) uses probabilistic filtering based on the distance to counter attacks of fabricated reports with false votes and real reports with false votes. Genetic algorithm-based filtering scheme (GAFS) uses a genetic algorithm with a fuzzy rule-based system that considers remaining energy and number of filtered votes in addition to the distance. The analysis results of the current study demonstrate the effectiveness of our scheme against these attacks in comparison with PVFS. The results show increased detection power achieved through effective verification while maintaining energy consumption.
APA, Harvard, Vancouver, ISO, and other styles
5

Nam, Su Man, and Tae Ho Cho. "Context-Aware Architecture for Probabilistic Voting-based Filtering Scheme in Sensor Networks." IEEE Transactions on Mobile Computing 16, no. 10 (2017): 2751–63. http://dx.doi.org/10.1109/tmc.2016.2641219.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tae, Ho Cho, Man Nam Su, and K. Shahzad Muhammad. "GAFS: GENETIC ALGORITHM-BASED FILTERING SCHEME FOR IMPROVING DETECTION POWER IN SENSOR NETWORKS." International Journal of Research – Granthaalayah 3, no. 12 (2017): 100–116. https://doi.org/10.5281/zenodo.848950.

Full text
Abstract:
Wireless sensor networks (WSNs) have stringent energy and computational requirements. Security has become very crucial issue with the widespread acceptance of the WSNs in numerous decision-critical and hostile environments. Since sensor nodes are left unattended, they can be compromised by adversaries to launch various application layer attacks. Effective countermeasures against these attacks can lead to improved security. A probabilistic votingbased filtering scheme (PVFS) uses probabilistic filtering based on the distance to counter attacks of fabricated reports with false votes and real reports with false votes. Genetic algorithm-based filtering scheme (GAFS) uses a genetic algorithm with a fuzzy rule-based system that considers remaining energy and number of filtered votes in addition to the distance. The analysis results of the current study demonstrate the effectiveness of our scheme against these attacks in comparison with PVFS. The results show increased detection power achieved through effective verification while maintaining energy consumption.
APA, Harvard, Vancouver, ISO, and other styles
7

Jae, Kwan Lee1 Su Man Nam2 and Tae Ho Cho3. "ENSP: ENERGY EFFICIENT NEXT HOP SELECTION IN A PROBABILISTIC VOTING-BASED FILTERING SCHEME USING FUZZY LOGIC." Informatics Engineering, an International Journal (IEIJ) 02, dec (2014): 01–12. https://doi.org/10.5121/ieij.2014.2401.

Full text
Abstract:
In wireless sensor networks, sensor nodes are easily compromised due to their restricted hardware resources. These compromised nodes inject fabricated votes into legitimate reports, and generate false report and false vote injection attacks. These attacks deplete energy resources and block report transmission. A probabilistic voting-based filtering scheme was proposed to detect the bogus votes in reports en-route to protect against attacks. Although this method detects false votes in intermediate nodes, the sensor network needs to be effectively operated in consideration of a node's conditions. In this paper, the proposed method selects effective verification nodes by considering the condition of nodes based on a fuzzy logic system. In the proposed method, the intermediate node selects between two next hop nodes in its range through a fuzzy logic system before forwarding the report. Experimental results suggest that, compared to the original method, the proposed method improves energy savings up to 11% while maintaining a high security level.
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Jae Kwan, Su Man Nam, and Tae Ho Cho. "ENSP: Energy Efficient Next Hop Selection in A Probabilistic Voting-Based Filtering Scheme Using Fuzzy Logic." Informatics Engineering, an International Journal 2, no. 4 (2014): 1–12. http://dx.doi.org/10.5121/ieij.2014.2401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, Jae Kwan, and Tae Ho Cho. "Ensf: Energy-Efficient Next-Hop Selection Method Using Fuzzy Logic In Probabilistic Voting-Based Filtering Scheme." International Journal of Ambient Systems and Applications 2, no. 4 (2014): 19–32. http://dx.doi.org/10.5121/ijasa.2014.2403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lim, Sang-hyeok, and Tae-ho Cho. "Report Verification Technique for Improvement of the Energy Efficiency in a Probabilistic Voting-based Filtering Scheme of WSNs." International Journal of Computer Applications 171, no. 3 (2017): 21–25. http://dx.doi.org/10.5120/ijca2017914992.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Probabilistic Voting-based Filtering Scheme"

1

Backenköhler, Michael, Luca Bortolussi, Gerrit Großmann, and Verena Wolf. "Analysis of Markov Jump Processes under Terminal Constraints." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_12.

Full text
Abstract:
AbstractMany probabilistic inference problems such as stochastic filtering or the computation of rare event probabilities require model analysis under initial and terminal constraints. We propose a solution to this bridging problem for the widely used class of population-structured Markov jump processes. The method is based on a state-space lumping scheme that aggregates states in a grid structure. The resulting approximate bridging distribution is used to iteratively refine relevant and truncate irrelevant parts of the state-space. This way, the algorithm learns a well-justified finite-state projection yielding guaranteed lower bounds for the system behavior under endpoint constraints. We demonstrate the method’s applicability to a wide range of problems such as Bayesian inference and the analysis of rare events.
APA, Harvard, Vancouver, ISO, and other styles
2

Gächter Stefan, Harati Ahad, and Siegwart Roland. "Structure Verification toward Object Classification using a Range Camera." In Intelligent Autonomous Systems 10. IOS Press, 2008. https://doi.org/10.3233/978-1-58603-887-8-356.

Full text
Abstract:
This paper proposes an incremental object classification based on parts detected in a sequence of noisy range images. Primitive parts are jointly tracked and detected as probabilistic bounding-boxes using a particle filter which accumulates the information of the local structure over time. A voting scheme is presented as a procedure to verify structure of the object, i.e. the desired geometrical relations between the parts. This verification is necessary to disambiguate object parts from potential irrelevant parts which are structurally similar. The experimental results obtained using a mobile robot in a real indoor environment show that the presented approach is able to successfully detect chairs in the range images.
APA, Harvard, Vancouver, ISO, and other styles
3

Sluban Borut, Gamberger Dragan, and Lavrač Nada. "Performance Analysis of Class Noise Detection Algorithms." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2010. https://doi.org/10.3233/978-1-60750-676-8-303.

Full text
Abstract:
In real-world datasets noisy instances and outliers require special attention of domain experts. While noise filtering algorithms are usually used to improve the accuracy of induced classification models, our aim is to detect noisy instances to be inspected by human experts in the phase of data understanding, data cleaning and outlier detection. As a result, new algorithms for explicit noise detection have been developed aiming at highest possible precision of noise detection within a reasonable recall threshold. The best performing noise detection algorithms are therefore selected based on a variant of the F-measure combining precision and recall. We use the F0.5-score, which weights precision twice as much as recall. New variants of ensemble noise filtering approaches to noise detection, using a consensus voting scheme, have been developed. They proved to be significantly better than elementary noise filters in supporting the domain expert at identifying potential outliers and/or erroneous data instances.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Probabilistic Voting-based Filtering Scheme"

1

Li, Feng, and Jie Wu. "A probabilistic voting-based filtering scheme in wireless sensor networks." In Proceeding of the 2006 international conference. ACM Press, 2006. http://dx.doi.org/10.1145/1143549.1143557.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Akram, Muhammad, Muhammad Ashraf, and Tae Ho Cho. "Fuzzy-based determination of number of MACs in probabilistic filtering scheme in WSNS." In 2017 2nd Workshop on Recent Trends in Telecommunications Research (RTTR). IEEE, 2017. http://dx.doi.org/10.1109/rttr.2017.7887869.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lin, TsungPo, Eduardo Mendoza, and Brian K. Kestner. "Model-Based Data Reconciliation and Bias Detection for Heavy-Duty Industrial Gas Turbines Performance Diagnosis." In ASME 2011 Turbo Expo: Turbine Technical Conference and Exposition. ASMEDC, 2011. http://dx.doi.org/10.1115/gt2011-45943.

Full text
Abstract:
Performance diagnoses of heavy-duty industrial gas turbines often rely on measured data from on-site monitoring systems (OSM), subjected to larger uncertainties and possible biases. The measured data are used to analyze gas turbine heat balance and estimate immeasurable performance characteristics such as firing temperature and component health parameters. Traditional heat balance techniques are deterministic, and, thus, calibration uncertainty is not mitigated. In this paper, a method of model-based data reconciliation (MBDR) and bias detection was developed, serving as a probabilistic process of reducing calibration uncertainty while eliminating contamination effects caused by measurement biases. This method utilizes physics-based gas turbine models to reconcile multiple data sets while the model health parameters are inferred simultaneously. Levenberg–Marquardt algorithm was utilized to solve the maximum-likelihood problem, i.e., minimizing Least Squares. A hypothesis test scheme using sequential bias compensation was utilized for bias detection and neutralizing smearing effects. To reduce the computation time in MBDR and bias detection, the Response Surface Methodology (RSM) was applied to generate surrogate model. A systematic way of data selection using Multiscale Principal Component Analysis was also employed, serving as an efficient way of filtering large data sets for the use of MBDR. This proposed methodology was demonstrated by application to GE 7FA gas turbines. Results showed significant reduction in calibration uncertainty and smearing effects.
APA, Harvard, Vancouver, ISO, and other styles
4

"Context Aware Architecture Based WSN Security for Detecting Compromised Nodes in Probabilistic Voting-Based Filtering." In 2016 the 6th International Workshop on Computer Science and Engineering. WCSE, 2016. http://dx.doi.org/10.18178/wcse.2016.06.027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!