98 search results - page 14 / 20 » Approximating minimum independent dominating sets in wireles... |
MOBIHOC
2012
ACM
11 years 9 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
JCO
2006
13 years 7 months ago
2006
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—This paper studies the coexistence of several independent and dynamic wireless networks using the frequency hopping technique in the unlicensed radio band. We propose a ...