Sciweavers

867 search results - page 3 / 174
» The Generalized Maximum Coverage Problem
Sort
View
JSAC
2008
140views more  JSAC 2008»
13 years 5 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
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 2 days ago
On the Connected Nodes Position Distribution in Ad Hoc Wireless Networks with Statistical Channel Models
—In this paper the problem of evaluating the statistics of the connected nodes position in a multi-hop wireless random ad hoc network is addressed. In particular, an analytical m...
Davide Dardari
INFOCOM
2012
IEEE
11 years 8 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 5 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
IPCCC
2007
IEEE
14 years 2 days ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002