Sciweavers

344 search results - page 50 / 69
» Maximal Group Membership in Ad Hoc Networks
Sort
View
PERCOM
2005
ACM
14 years 8 months ago
Enabling Reliable Many-to-Many Communication in Ad-Hoc Pervasive Environments
In order for pervasive computing to realize its full potential, pervasive applications have to be able to operate without support from fixed communication infrastructure at least ...
Einar Vollset, Paul D. Ezhilchelvan
IPPS
2005
IEEE
14 years 2 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
DEXA
2008
Springer
98views Database» more  DEXA 2008»
13 years 11 months ago
REALM: Replication of Data for a Logical Group Based MANET Database
Abstract. Mobile Ad-Hoc Networks, or MANETs, provide communication between free-roaming mobile hosts without a fixed infrastructure. These MANETs operate under conditions of limite...
Anita Vallur, Le Gruenwald, Nick Hunter
JNW
2006
149views more  JNW 2006»
13 years 9 months ago
Authenticated AODV Routing Protocol Using One-Time Signature and Transitive Signature Schemes
Mobile ad hoc network (MANET) has been generally regarded as an ideal network model for group communications because of its specialty of instant establishment. However, the securit...
Shidi Xu, Yi Mu, Willy Susilo
DC
2010
13 years 9 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer