295 search results - page 19 / 59 » An approximation algorithm for the wireless gathering proble... |
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— Wireless sensor networks (WSNs) are energyconstrained in nature, in this paper, we formulate the problem of data transport in sensor networks as a network utility maxim...
124
click to vote
OL
2011
14 years 4 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
ADHOCNOW
2008
Springer
15 years 4 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We consider wireless sensor networks with multiple gateways and multiple classes of traffic carrying data generated by different sensory inputs. The objective is to devise joi...