Sciweavers

16404 search results - page 2389 / 3281
» A set coverage problem
Sort
View
INFOCOM
2006
IEEE
16 years 1 months ago
Broadcasting in Sensor Networks: The Role of Local Information
Abstract— Flooding based strategies are conventionally employed to perform querying and broadcasting in sensor networks. These schemes have low hop-delays of Θ( 1 M(n) ) to reac...
Sundar Subramanian, Sanjay Shakkottai, Ari Arapost...
214
Voted
INFOCOM
2006
IEEE
16 years 1 months ago
Distributed Uplink Power Control for Optimal SIR Assignment in Cellular Data Networks
Abstract—This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-...
Prashanth Hande, Sundeep Rangan, Mung Chiang
INFOCOM
2006
IEEE
16 years 1 months ago
Mistreatment in Distributed Caching Groups: Causes and Implications
— Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the...
Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bes...
NOMS
2006
IEEE
105views Communications» more  NOMS 2006»
16 years 1 months ago
Adaptive Flow Aggregation - A New Solution for Robust Flow Monitoring under Security Attacks
— Flow-level traffic measurement is required for a wide range of applications including accounting, network planning and security management. A key design challenge is how to gr...
Yan Hu, Dah-Ming Chiu, John C. S. Lui
PODC
2006
ACM
16 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
« Prev « First page 2389 / 3281 Last » Next »