DiVote: A Distributed Voting Protocol for Mobile Device-to-Device Communication

  title={DiVote: A Distributed Voting Protocol for Mobile Device-to-Device Communication},
  author={Peter Danielis and Sylvia T. Kouyoumdjieva and Gunnar Karlsson},
  journal={2016 28th International Teletraffic Congress (ITC 28)},
Distributed aggregation algorithms have traditionally been applied to environments with no or rather low rates of node churn. The proliferation of mobile devices in recent years introduces high mobility and node churn to these environments, thus imposing a new dimension on the problem of distributed aggregation in terms of scalability and convergence speed. To address this, we present DiVote, a distributed voting protocol for mobile device-to-device communication. We investigate a particular… 

UrbanCount: Mobile crowd counting in urban environments

The objective of UrbanCount is to produce a precise mapping of the local estimate to the anticipated global result while preserving node privacy, and the proposed protocol is evaluated via extensive trace-driven simulations of synthetic and realistic mobility models.

KuVS-Fachgespräch Fog Computing 2018

The research objectives are to investigate how the modeling can be carried out for a scenario such as UrbanCount and for which other use cases opportunistic networks for data dissemination and processing are suitable.

Internet Voting Protocols: An Analysis of the Cryptographic Operations per Phase

This paper determines the number of cryptographic operations per phase of four e-voting protocols: one based on blind signatures (Li, Hwang and Lai protocol), onebased on mix nets (Meng protocol),One based on homomorphic encryption (EVIV protocol) and one used in real electoral processes (I-Voting for Estonian Elections).

TableVisor 2 . 0 : Hardware-independent Multi Table Processing

Current research efforts in fog computing are summarized, applications where fog computing is beneficial are described and future challenges that remain open are identified to bring fog computing to a breakthrough.



A Distributed Polling with Probabilistic Privacy

PD is an overlay-based protocol where a subset of participants may use a simple sharing scheme to express their votes, and bounds the impact of dishonest participants on the global outcome by 2(kα + BN), where represents the number of dishonest nodes using the sharing scheme.

Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis

This paper presents and analyze a suite of randomized distributed algorithms to efficiently and robustly compute aggregates and uses the eigen-structure of the underlying graph in a novel way to show convergence and to bound the running time of the algorithms.

Opportunistic Communication and Human Mobility

The results suggest that it is important to capture the scenario and space in which mobility occurs since these may affect performance significantly and it is not very sensitive to accurate estimation of the probability distributions of mobility parameters such as speed and arrival process.

Gossip-based aggregation in large dynamic networks

This work proposes a gossip-based protocol for computing aggregate values over network components in a fully decentralized fashion and demonstrates the efficiency and robustness of the protocol both theoretically and experimentally under a variety of scenarios including node and communication failures.

Scalable and Secure Polling in Dynamic Distributed Networks

SPP (Secure and Private Polling), the first distributed polling protocol requiring only a communication complexity of O(n log3 n), is presented, which is proved is near-optimal and ensures perfect security against a computationally-bounded adversary.

A mobile peer-to-peer system for opportunistic content-centric networking

This work presents a middleware architecture for a mobile peer-to-peer content distribution system that allows wireless content dissemination between mobile nodes without relying on infrastructure support and describes the design and implementation of the architecture.

Gossip-based computation of aggregate information

  • D. KempeA. DobraJ. Gehrke
  • Computer Science
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
This paper analyzes the diffusion speed of uniform gossip in the presence of node and link failures, as well as for flooding-based mechanisms, and shows that this diffusion speed is at the heart of the approximation guarantees for all of the above problems.

Flow updating: Fault-tolerant aggregation for dynamic networks

Gossip-based distribution estimation in peer-to-peer networks

It is observed that the presence of duplicate values does not significantly affect the distribution of values in samples collected through gossip, and based on that different data synopsis techniques that optimize space and time while allowing nodes to accumulate information are explored.

Spectra: Robust Estimation of Distribution Functions in Networks

Spectra is presented, a distributed algorithm for the estimation of distribution functions over large scale networks and depicts important properties: robustness when exposed to high levels of message loss, fast convergence speed and fine precision in the estimate.