Sciweavers

570 search results - page 24 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
INFOCOM
2008
IEEE
15 years 8 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
INFOCOM
2005
IEEE
15 years 7 months ago
Designing incentives for peer-to-peer routing
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
Alberto Blanc, Yi-Kai Liu, Amin Vahdat
INFOCOM
2005
IEEE
15 years 7 months ago
Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach
— When a sensor network is deployed in hostile environments, the adversary may compromise some sensor nodes, and use the compromised nodes to inject false sensing reports or modi...
Wensheng Zhang, Guohong Cao
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 7 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
AAAI
2012
13 years 3 months ago
Threats and Trade-Offs in Resource Critical Crowdsourcing Tasks Over Networks
In recent times, crowdsourcing over social networks has emerged as an active tool for complex task execution. In this paper, we address the problem faced by a planner to incentivi...
Swaprava Nath, Pankaj Dayama, Dinesh Garg, Y. Nara...