Sciweavers

460 search results - page 86 / 92
» Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
Sort
View
MOBICOM
2006
ACM
14 years 1 months ago
Coverage and connectivity in three-dimensional networks
Although most wireless terrestrial networks are based on twodimensional (2D) design, in reality, such networks operate in threedimensions (3D). Since most often the size (i.e., th...
S. M. Nazrul Alam, Zygmunt J. Haas
WIOPT
2005
IEEE
14 years 1 months ago
Iterated Local Optimization for Minimum Energy Broadcast
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
Intae Kang, Radha Poovendran
DC
2010
13 years 7 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
WIMOB
2008
IEEE
14 years 2 months ago
Exploiting Self-Reported Social Networks for Routing in Ubiquitous Computing Environments
— Mobile, delay-tolerant, ad hoc and pocket-switched networks may form an important part of future ubiquitous computing environments. Understanding how to efficiently and effect...
Greg Bigwood, D. Rehunathan, Martin Bateman, Trist...
INFOCOM
2000
IEEE
14 years 4 days ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas