Sciweavers

955 search results - page 74 / 191
» Cover Set Problem in Directional Sensor Networks
Sort
View
PODC
2010
ACM
14 years 11 months ago
Distributed data classification in sensor networks
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
Ittay Eyal, Idit Keidar, Raphael Rom
INFOCOM
2007
IEEE
15 years 4 months ago
Protecting Receiver-Location Privacy in Wireless Sensor Networks
—Due to the open nature of a sensor network, it is relatively easy for an adversary to eavesdrop and trace packet movement in the network in order to capture the receiver physica...
Ying Jian, Shigang Chen, Zhan Zhang, Liang Zhang
JSAC
2008
140views more  JSAC 2008»
14 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
NETWORKS
2006
14 years 9 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
14 years 11 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov