Sciweavers

1677 search results - page 157 / 336
» A distributed security scheme for ad hoc networks
Sort
View
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 7 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
DCOSS
2011
Springer
14 years 6 months ago
Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Stefan Unterschutz, Volker Turau
SPAA
2010
ACM
15 years 6 months ago
Best-effort group service in dynamic networks
d Abstract) Bertrand Ducourthial Sofiane Khalfallah Franck Petit We propose a group membership service for asynchronous wireless dynamic ad hoc networks. It maintains as long as p...
Bertrand Ducourthial, Sofiane Khalfallah, Franck P...
MOBIHOC
2003
ACM
16 years 6 months ago
Topology management in ad hoc networks
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that construc...
Lichun Bao, J. J. Garcia-Luna-Aceves
LCN
2003
IEEE
15 years 11 months ago
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...
Jamil A. Shaikh, Julio Solano-González, Iva...