3130 search results - page 353 / 626 » Collusion without communication |
175
click to vote
IPSN
2004
Springer
16 years 3 days ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
205
click to vote
IPPS
2003
IEEE
16 years 1 days ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
206
click to vote
MOBICOM
2003
ACM
16 years 3 hour ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
192
click to vote
MOBIHOC
2003
ACM
16 years 3 hour ago
2003
ACM
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
172
click to vote
WS
2003
ACM
15 years 12 months ago
2003
ACM
Recent results indicate scalability problems for flat ad hoc networks. To address the issue of scalability, self-organizing hierarchical ad hoc architectures are being investigat...