Results 1  10
of
116
Messageoptimal connected dominating sets in mobile ad hoc networks
 in Proceedings of The Third ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc), 2002
"... A connected dominating set (CDS) for a graph G(V,E) isa subset V ′ of V, such that each node in V − V ′ is adjacent to some node in V ′,andV ′ induces a connected subgraph. A CDS has been proposed as a virtual backbone for routing in wireless ad hoc networks. However, it is NPhard to find a minimum ..."
Abstract

Cited by 110 (6 self)
 Add to MetaCart
the maintenance of the same approximation ratio. In this algorithm each node requires knowledge of its singlehop neighbors, and only a constant number of twohop and threehop neighbors. The message length is O(log n) bits. Keywords ad hoc networks, connected dominating set, maximal independent
An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks
"... Abstract — In this paper, we propose an efficient, distributed and localized algorithm for finding an almost connected dominating set of small size on wireless ad hoc networks. Broadcasting and routing based on a connected dominating set (CDS) is a promising approach. A set is dominating if all the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract — In this paper, we propose an efficient, distributed and localized algorithm for finding an almost connected dominating set of small size on wireless ad hoc networks. Broadcasting and routing based on a connected dominating set (CDS) is a promising approach. A set is dominating if all
Chapter 19 Dominating Set
"... In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set of the network graph. As it is the case for the MIS, an efficient dominating set algorithm can be used as a basic building ..."
Abstract
 Add to MetaCart
In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set of the network graph. As it is the case for the MIS, an efficient dominating set algorithm can be used as a basic building
A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks
"... Connected dominating set based routing is a promising approach for enhancing the routing efficiency in the mobile ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is an NPcomplete problem. Restricted Rule k is a localized algorithm for finding a small dominating se ..."
Abstract
 Add to MetaCart
Connected dominating set based routing is a promising approach for enhancing the routing efficiency in the mobile ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is an NPcomplete problem. Restricted Rule k is a localized algorithm for finding a small dominating
Forwardnodesetbased broadcast in clustered mobile ad hoc networks
 Wireless Communication and Mobile Computing
, 2003
"... A taxonomy of broadcast protocols in mobile ad hoc networks (MANETs) is given where protocols are classified into four groups: global, quasiglobal, quasilocal, and local. The taxonomy also divides protocols based on the nature of algorithms: probabilistic and deterministic. The locality of mainten ..."
Abstract

Cited by 62 (14 self)
 Add to MetaCart
to further reduce each forward node set. It is shown that this approach is quasilocal with locality of maintenance. In addition, this approach has a constant approximation ratio to the minimum connected dominating set (MCDS) and generates a small forward node set in the average case. Comparisons are also
DominatingSetIndex based Searching Algorithm in Mobile P2P Networks
"... Abstract 1 Because of the isomorphism between P2P networks and mobile ad hoc networks (MANET), many research communities are focusing on the work based on the combination of P2P and the backbone strategy, and this produces a field called mobile peertopeer (MP2P) networks. An effective algorithm ..."
Abstract
 Add to MetaCart
for searching and retrieving information has proven to make a great impact on the performance of MP2P systems. Based on the connected dominatingset (CDS), which overlays the whole Mobile P2P ad hoc network, we propose a dominatingsetindex based searching algorithm, named DSI, using dominating set indices
Finding Facilities Fast
, 2008
"... Clustering can play a critical role in increasing the performance and lifetime of wireless networks. The facility location problem is a general abstraction of the clustering problem and this paper presents the first constantfactor approximation algorithm for the facility location problem on unit di ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
disk graphs (UDGs), a commonly used model for wireless networks. In this version of the problem, connection costs are not metric, i.e., they do not satisfy the triangle inequality, because connecting to a nonneighbor costs ∞. In nonmetric settings the best approximation algorithms guarantee an O
Finding groups in gene expression data
 J Biomed Biotechnol
"... The vast potential of the genomic insight offered by microarray technologies has led to their widespread use since they were introduced a decade ago. Application areas include gene function discovery, disease diagnosis, and inferring regulatory networks. Microarray experiments enable largescale, h ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
is cluster analysis, and many different flavors of algorithms have been used and indeed tailored for microarray data. Cluster analysis, however, implies a partitioning of the entire data set, and this does not always match the objective. Sometimes pattern discovery or bump hunting tools are more appropriate
Results 1  10
of
116