SAnoVs: Secure Anonymous Voting Scheme for clustered ad hoc networks

In this paper we propose a secure anonymous voting scheme (SAnoVS) for re-clustering in the ad-hoc network. SAnoVS extends our previous work of degree-based clustering algorithms by achieving anonymity and confidentiality of the voting procedure applied to select new cluster heads. The security of SAnoVS is based on the difficulty of computing discrete logarithms over elliptic curves, the intractability of inverting a one-way hash function and the fact that only neighboring nodes contribute to the generation of a shared secret. Furthermore, we achieve anonymity since our scheme does not require any identification information as we make use of a polynomial equation system combined with pseudo-random coordinates. The security analysis of our scheme is demonstrated with several attacks scenarios.examined with several attack scenarios and experimental results

Degree-Based Clustering Algorithms for Wireless Ad Hoc Networks Under Attack

In this paper we investigate the behavior of degree-based clustering algorithms with respect to their stability and attack-resistance. Our attack scenario tries to bias the clustering head selection procedure by sending faulty degree claims. We propose a randomized variant of the highest degree algorithm which is proved, through experimental results, attack-resistant without imposing significant overhead to the clustering performance. In addition, we extend our proposal with a cooperative consistent clustering algorithm which integrates security into the clustering decision achieving attacker identification and classification

Adaptation of a Conference Key Distribution System for the Wireless Ad Hoc Network

In this paper we review previous works done with respect to Conference Key Distribution Systems (CKDS). We focus on the system proposed by Kim et al. and we propose improvements on that scheme a) from the perspective of security and anonymity, b) from the perspective of efficient calculation of the Lagrange polynomial coefficients, and c) from the perspective of adaptation into the dynamic wireless ad hoc network. The security of the proposed scheme is based on the difficulty of computing discrete logarithms over elliptic curves, the intractability of inverting a one-way hash function and the pseudo-randomness of user coordinates. We demonstrate the effectiveness of the proposed scheme through the analysis of characteristic attack scenarios

Helpmates of man : middle-class women and gender ideology in nineteenth-century Ontario

In this paper we revisit some considerations relative to the performance of re-clustering algorithms in MANET. We recommend that for a secure MANET the design of re-clustering algorithms should not only provide for clustering stability, but also for network robustness in terms of network connectivity, of message reliability, of tolerance against the attacks that target the cluster head nodes and of tolerance to random node failures due to energy drains. We also take into account the possibility of malicious users that might thwart the network protocol by advertising false topology information. We propose a distributed mechanism that for unbiased cluster head election first demands certain levels of consistency to be reached among the nodes

"sich / den Schöpfer des Universums / als einen Gaukler denken" (Michael Krüger): Annäherungen an Gott in der Gegenwartslyrik

In this study we evaluate with experiments three generic clustering algorithms, namely the Lowest-ID, the Highest Degree and the Extended Robust Re-clustering Algorithm which is the one proposed. The aim is to investigate which are the factors that have significant effect on the re-clustering performance. We isolate those performance factors as being network conditions that we simulate with a particular focus on the node deployment pattern, the mobility pattern, the radio transmission range and the energy of the ad hoc nodes. For the evaluation of the re-clustering efficiency and for the comparison of the three algorithms we examined conventional re-clustering performance metrics, such as the cluster head modification rate and the number of the generated clusters but also reliability metrics, such as the cluster head availability probability and the end to end message delivery ratio. We draw generic outcomes that hold for the three algorithms and we also discuss the behavior of the proposed algorithm

Evaluating Transport Protocols for Real-time Event Stream Processing Middleware and Applications ⋆

www.dre.vanderbilt.edu Abstract. Real-time event stream processing (RT-ESP) applications must synchronize continuous data streams despite fluctuations in resource availability. Satisfying these needs of RT-ESP applications requires predictable QoS from the underlying publish/subscribe (pub/sub) middleware. If a transport protocol is not capable of meeting the QoS requirements within a dynamic environment, the middleware must be flexible enough to tune the existing transport protocol or switch to a transport protocol better suited to the changing operating conditions. Realizing such adaptive RT-ESP pub/sub middleware requires a thorough understanding of how different transport protocols behave under different operating conditions. This paper makes three contributions to work on achieving that understanding. First, we define ReLate2, which is an evaluation metric that combines packet latency and reliability to evaluate transport protocol performance. Second, we use the ReLate2 metric to quantify the performance of various transport protocols integrated with the OMG’s Data Distribution Service (DDS) QoS-enabled pub/sub middleware standard using our FLEXible Middleware And Transports (FLEX-MAT) prototype for experiments that capture performance data. Third, we use ReLate2 to pinpoint configurations involving sending rate, network loss, and number of receivers that show the pros and cons of the protocols