By Topic

Distributed Leader Election in P2P Systems for Dynamic Sets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Heutelbeck, D. ; University of Hagen, Germany ; Hemmje, M.

The collection of and search for location information is a core component in many pervasive and mobile computing applications. In distributed collaboration scenarios this location data is collected by different entities, e.g., users with GPS enabled mobile phones. Instead of using a centralized service for managing this distributed dynamic location data, we use a peer-to-peer data structure, the so-called distributed space partitioning tree (DSPT). A DSPT is a general use peer-to-peer data structure, similar to distributed hash tables (DHTs), that allows publishing, updating of, and searching for dynamic sets. In this paper we present an efficient distributed leader election algorithm that can be used in DSPTs to eliminate redundant network traffic.

Published in:

Mobile Data Management, 2006. MDM 2006. 7th International Conference on

Date of Conference:

10-12 May 2006