704 search results - page 95 / 141 » Novel Algorithms for the Network Lifetime Problem in Wireles... |
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
ICDCS
2010
IEEE
14 years 1 months ago
2010
IEEE
—Cloud computing is enabling groups of academic collaborators, groups of business partners, etc., to come together in an ad-hoc manner. This paper focuses on the group-based data...
ASUNAM
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
SIGCOMM
2012
ACM
11 years 11 months ago
2012
ACM
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...