570 search results - page 30 / 114 » Approximating Some Network Design Problems with Node Costs |
125
click to vote
GLOBECOM
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
116
click to vote
EVOW
2001
Springer
15 years 6 months ago
2001
Springer
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
158
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—We consider the location service in a mobile adhoc network (MANET), where each node needs to maintain its location information in the network by (i) frequently updating ...
DASFAA
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
109
click to vote
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...