98 search results - page 6 / 20 » Approximating minimum independent dominating sets in wireles... |
DAM
2011
13 years 2 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
LCN
2003
IEEE
14 years 19 days ago
2003
IEEE
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...
WASA
2009
Springer
14 years 1 months ago
2009
Springer
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
OL
2011
13 years 2 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
IPPS
2005
IEEE
14 years 29 days ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...