1257 search results - page 105 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
135
click to vote
JSAC
2008
15 years 1 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
109
click to vote
SECON
2007
IEEE
15 years 8 months ago
2007
IEEE
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
111
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
ESA
2004
Springer
15 years 7 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
107
click to vote
HPDC
1999
IEEE
15 years 6 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...