1941 search results - page 181 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
230
click to vote
JSAC
2008
15 years 7 months ago
2008
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...
179
click to vote
HYBRID
2009
Springer
16 years 1 months ago
2009
Springer
To reduce the amount of data transfer in networked control systems and wireless sensor networks, measurements are usually taken only when an event occurs, rather than at each synch...
230
click to vote
DMTCS
2010
15 years 4 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
188
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
210
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...