Sciweavers

570 search results - page 54 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
INFOCOM
2003
IEEE
14 years 2 months ago
Distributed Network Monitoring with Bounded Link Utilization in IP Networks
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
Erran L. Li, Marina Thottan, Bin Yao, Sanjoy Paul
ICDCS
2010
IEEE
14 years 25 days ago
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
Chen Chen, Hans-Arno Jacobsen, Roman Vitenberg
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
IPSN
2007
Springer
14 years 3 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
ADHOC
2011
13 years 4 months ago
Evaluation and design of beaconing in mobile wireless networks
One of the intrinsic problems of mobility in wireless networks is the discovery of mobile nodes. A widely used solution for this problem is to use different variations of beacons, ...
Abbas Nayebi, Gunnar Karlsson, Hamid Sarbazi-Azad