2497 search results - page 281 / 500 » Requirements for models of achievable routing |
185
click to vote
ICDCS
2006
IEEE
16 years 23 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
177
click to vote
ADBIS
2006
Springer
15 years 8 months ago
2006
Springer
Because of information ubiquity, one observes an important trend towards transferring information management tasks from database systems to networks. We introduce the notion of Da...
251
click to vote
ADT
2011
14 years 10 months ago
2011
Currently, there is a strong effort of the research community in rethinking the Internet architecture to cope with its current limitations and support new requirements. Many resea...
198
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
164
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In transportation network research, the main approach for predicting traffic distribution due to noncooperative vehicle choices has been through fluid type models. The...