Sciweavers

1144 search results - page 29 / 229
» Locally constructed algorithms for distributed computations ...
Sort
View
ICDCS
2006
IEEE
14 years 2 months ago
Analysis of Clustering and Routing Overhead for Clustered Mobile Ad Hoc Networks
This paper presents an analysis of the control overhead involved in clustering and routing for one-hop clustered mobile ad hoc networks. Previous work on the analysis of control o...
Mingqiang Xue, Inn Inn Er, Winston Khoon Guan Seah
MOBICOM
2003
ACM
14 years 2 months ago
Manycast: exploring the space between anycast and multicast in ad hoc networks
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...
Casey Carter, Seung Yi, Prashant Ratanchandani, Ro...
HASE
2008
IEEE
14 years 3 months ago
Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks
—In this paper, we investigate the transmission-power assignment problem for k-connected mobile ad hoc networks (MANETs), the problem of optimizing the lifetime of a MANET at a g...
Oliviero Riganelli, Radu Grosu, Samir R. Das, C. R...
ICDCSW
2005
IEEE
14 years 2 months ago
Increasing Attack Resiliency of Wireless Ad Hoc and Sensor Networks
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
Harald Vogt
MOBIHOC
2002
ACM
14 years 8 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman