Distributed voting application for handheld devices

Slides:

Advertisements

Similar presentations

Low Overhead With Speed Aware Routing (LOWSAR) in VANETs By Kannikar Siriwong Na Ayutaya.

Advertisements

1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.

Alex Cheung and Hans-Arno Jacobsen August, 14 th 2009 MIDDLEWARE SYSTEMS RESEARCH GROUP.

Cognitive Publish/Subscribe for Heterogeneous Clouds Šarūnas Girdzijauskas, Swedish Institute of Computer Science (SICS) Joint work with:

SOCELLBOT: A New Botnet Design to Infect Smartphones via Online Social Networking th IEEE Canadian Conference on Electrical and Computer Engineering(CCECE)

Expediting Searching Processes via Long Paths in P2P Systems 05/30 IDEA Lab.

What is “Routing”? Routing algorithm that part of the network layer responsible for deciding on which output line to transmit an incoming packet Adaptive.

What is “Routing”? Routing algorithm that part of the network layer responsible for deciding on which output line to transmit an incoming packet Adaptive.

Are You moved by Your Social Network Application? Abderrahmen Mtibaa, Augustin Chaintreau, Jason LeBrun, Earl Oliver, Anna-Kaisa Pietilainen, Christophe.

More routing protocols Alec Woo June 18 th, 2002.

1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.

Given Connections Solution

NETWORK TOPOLOGY.

Factor Graphs Young Ki Baik Computer Vision Lab. Seoul National University.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.

1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.

Distributed Asynchronous Bellman-Ford Algorithm

Multi-dimensional Queries in P2P Systems. Applications Photo-sharing (photographs tagged with metadata) Multi-player online games (locate objects and.

A Delaunay Triangulation Architecture Supporting Churn and User Mobility in MMVEs Mohsen Ghaffari, Behnoosh Hariri and Shervin Shirmohammadi Advanced Communications.

Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random Walks Bo Han, Aravind Srinivasan University of Maryland.

Information Flow using Edge Stress Factor Communities Extraction from Graphs Implied by an Instant Messages Corpus Franco Salvetti University of Colorado.

A Graph-based Friend Recommendation System Using Genetic Algorithm

Association Rule Mining in Peer-to-Peer Systems Ran Wolff Assaf Shcuster Department of Computer Science Technion I.I.T. Haifa 32000,Isreal.

Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.

1 Broadcast. 2 3 Use a spanning tree Root 4 synchronous It takes the same time at link to send a message It takes the same time at each node to process.

Communication Support for Location- Centric Collaborative Signal Processing in Sensor Networks Parmesh Ramanathan University of Wisconsin, Madison Acknowledgements:K.-C.

Bounded relay hop mobile data gathering in wireless sensor networks

The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)

By Fernando Martincic, Loren Schwiebert.  Sensors periodically send data to BS.  Sensors send data to BS when threshold is exceeded. (reactive method)

Stefanos Antaris A Socio-Aware Decentralized Topology Construction Protocol Stefanos Antaris *, Despina Stasi *, Mikael Högqvist † George Pallis *, Marios.

Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.

Data Structures and Algorithms in Parallel Computing

1 Planning Base Station and Relay Station Locations in IEEE j Multi-hop Relay Networks Yang Yu, Seán Murphy, Liam Murphy Department of Computer Science.

Reorganization in Network Regions for Optimality and Fairness Robert E. Beverly IV, MSc Thesis.

Sebastian Ortiz 10th Omega. What is a network topology? In communication networks, a topology is a usually schematic description of the arrangement of.

Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.

Stefanos Antaris Distributed Publish/Subscribe Notification System for Online Social Networks Stefanos Antaris *, Sarunas Girdzijauskas † George Pallis.

03/19/02Scalab Seminar Series1 Finding Good Peers in Peer-to-Peer Networks Ramaswamy N.Vadivelu Scalab, ASU.

March 9, Broadcasting with Bounded Number of Redundant Transmissions Majid Khabbazian.

Importance Measures on Nodes Lecture 2 Srinivasan Parthasarathy 1.

Simulation of K-Clustering in a Wireless Ad-Hoc Network using a decentralized Local Search Supervised by: Dr. Rachel Ben- Eliyahu Kirill Kazatsker Daniel.

Time Synchronization in Ad Hoc Networks Kay R¨omer MobiHOC 2001 Speaker : hsiwei.

SYNERGY: A Game-Theoretical Approach for Cooperative Key Generation in Wireless Networks Jingchao Sun, Xu Chen, Jinxue Zhang, Yanchao Zhang, and Junshan.

GUILLOU Frederic. Outline Introduction Motivations The basic recommendation system First phase : semantic similarities Second phase : communities Application.

Minimum spanning tree diameter estimation in random sensor networks in fractal dimension Students: Arthur Romm Daniel Kozlov Supervisor: Dr.Zvi Lotker.

Centralized vs Distributed Routing

Copyright notice © 2008 Raul Jimenez - -

Peer-to-peer networking

Link-Based Ranking Seminar Social Media Mining University UC3M

FAR: A Fault-avoidance Routing Method for Data Center Networks with Regular Topology Please send.

Privacy and Fault-Tolerance in Distributed Optimization Nitin Vaidya University of Illinois at Urbana-Champaign.

Community detection in graphs

Introduction Secondary Users (SUs) Primary Users (PUs)

Systems of Inequalities

Routing in Packet Networks Shortest Path Routing

The connected word recognition problem Problem definition: Given a fluently spoken sequence of words, how can we determine the optimum match in terms.

Methodology & Current Results

Closeness Centrality.

Distributed systems II A polynomial local solution to Mutual Exclusion

Department of Computer Science University of York

Closeness Centrality.

MEgo2Vec: Embedding Matched Ego Networks for User Alignment Across Social Networks Jing Zhang+, Bo Chen+, Xianming Wang+, Fengmei Jin+, Hong Chen+, Cuiping.

A graphing calculator is required for some problems or parts of problems 2000.

Connected Word Recognition

Korea University of Technology and Education

Social Network Analysis with Apache Spark and Neo4J

Peer-to-peer networking

Proper use of the Internet

Presentation transcript:

Distributed voting application for handheld devices Presenter: Pham Dung The ptdung@oslab.khu.ac.kr Oct. 2008

In stadium, e.g a football match, some friends invite you to participate in voting for best player of the match.

Motivation and requisites A group of connected handheld device users wants to vote for a certain event: best player, best favorite song,… based on a given list of candidates. There’s no centralized device to calculate voting results. All is totally distributed computing. After a while of iterations, each device has the similar voting results. Requisites: Devices participating in voting form a connected graph. Disconnected sub-network will only have local voting results based on votings of its nodes. Device only exchanges messages with its one-hop neighbors. Old voting applications: Online voting, voting by SMS message.

Solution proposal Using: Message passing mechanism. Asynchronous Distributed Averaging algorithm.

Thank you!