Sciweavers

41 search results - page 5 / 9
» A Self-Stabilizing Distributed Approximation Algorithm for t...
Sort
View
CIAC
2006
Springer
100views Algorithms» more  CIAC 2006»
13 years 11 months ago
Distributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
JPDC
2007
191views more  JPDC 2007»
13 years 7 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
SNPD
2007
13 years 8 months ago
Localized Flooding Backbone Construction for Location Privacy in Sensor Networks
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
Yingchang Xiang, Dechang Chen, Xiuzhen Cheng, Kai ...
ICC
2009
IEEE
135views Communications» more  ICC 2009»
13 years 5 months ago
Load Aware Broadcast in Mobile Ad Hoc Networks
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
Md. Tanvir Al Amin, Sukarna Barua, Sudip Vhaduri, ...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...