714 search results - page 133 / 143 » Time and energy complexity of distributed computation in wir... |
PERCOM
2005
ACM
14 years 7 months ago
2005
ACM
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
ICPADS
2007
IEEE
14 years 1 months ago
2007
IEEE
- Due to the increasing complexity of scientific models, large-scale simulation tools often require a critical amount of computational power to produce results in a reasonable amou...
MOBISYS
2008
ACM
14 years 7 months ago
2008
ACM
Recent years have witnessed the impacts of distributed content sharing (Wikipedia, Blogger), social networks (Facebook, MySpace), sensor networks, and pervasive computing. We beli...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...