A Method of Improving Energy Efficiency Through Geofencing and False Data Blocking In Context-Aware Architecture for Probabilistic Voting-Based Filtering Scheme of WSNs

In wireless sensor networks, sensor nodes have the disadvantage of being vulnerable to several attacks due to the use of wireless communication and constrained energy. Adversaries exploit vulnerable characteristics of these nodes to capture them and generate false positive and false negative attacks. These attacks result in false alarms in a base station and information loss in intermediate nodes. A context-aware architecture for a probabilistic voting-based filtering scheme (CAA-PVFS) identifies compromised nodes that cause the damage. Although this method immediately detects the compromised nodes using its CAA, its additional network use consumes unnecessary energy. In this paper, our proposed method configures geofencing for the compromised nodes and blocks the nodes using false data injection. The proposed method reduces the unnecessary energy of the additional network while maintaining security strength. Experimental results indicate that the proposed method offers energy savings of up to 17% while maintaining the security strength against the two attacks as compared to the existing method.

Electoral Systems and Inequalities in Government Interventions

This paper studies the political determinants of inequalities in government interventions under majoritarian (MAJ) and proportional representation (PR) systems. We propose a probabilistic voting model of electoral competition with highly targetable government interventions and heterogeneous localities. We uncover a novel relative electoral sensitivity effect that affects government interventions only under MAJ systems. This effect tends to reduce inequality in government interventions under MAJ systems when districts are composed of sufficiently homogeneous localities. This effect goes against the conventional wisdom that MAJ systems are necessarily more conducive to inequality than PR systems. We illustrate the empirical relevance of our results with numerical simulations on possible reforms of the U.S. Electoral College.

On the political economy of compulsory education

We consider an economy with two categories of agents: entrepreneurs and workers. In laissez-faire, the former gain from having their children educated, while the latter, although they may profit from their own education, have no interest in sending their children to school. We first characterise the preferred education policy-cum-redistributive taxation for the two groups, and find that entrepreneurs favour a compulsory education policy while workers prefer a purely redistributive taxation. Each group would like the policy to be entirely financed by the other group. Then, we introduce a political process with probabilistic voting and verify that an equilibrium with both a compulsory education policy and some redistribution may exist in which the workers are constrained but the entrepreneurs, who benefit from hiring educated workers, are not. The redistribution compensates the workers for being constrained by the education policy.

Discrete event simulation–based energy efficient path determination scheme for probabilistic voting–based filtering scheme in sensor networks

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.

Strategic Ambiguity with Probabilistic Voting

Political parties and candidates usually prefer making ambiguous promises. This study identifies the conditions under which candidates choose ambiguous promises in equilibrium, given convex utility functions of voters. The results show that in a deterministic model, no equilibrium exists when voters have convex utility functions. However, in a probabilistic voting model, candidates make ambiguous promises in equilibrium when (i) voters have convex utility functions, and (ii) the distribution of voters’ most preferred policies is polarized. JEL Classification: D71, D72

Modeling and Simulation of Vote Length Analysis for Probabilistic Voting-based Filtering in Wireless Sensor Networks: Against False report and vote injection attacks

In large-scale wireless sensor networks, sensors are vulnerable to false report and false vote injection attacks since they are deployed in hostile environments. These attacks drain their limited energy resources of forwarding nodes and drops important data. Probabilistic voting-based filtering scheme simultaneously detects both the attacks through vote verification. To effectively detect them, it is important to define the vote length of the reports since the vote length is fixed at the initial phase. We find the effective vote length using a simulation model since it is nearly impossible to evaluate the security protocol performance on the real nodes. We demonstrate that the security protocol, in which the vote length is five, achieves better detection ratio against the two attacks.