Results 1  10
of
362,211
Algorithms for Minimum mConnected kDominating
 Set Problem, COCOA 2007, LNCS 4616
, 2007
"... Abstract. In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high e ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we consider how to establish a small virtual backbone to balance efficiency and fault tolerance. This problem can be formalized as the minimum mconnected kdominating set problem, which is a general version
SelfStabilizing Small kDominating Sets
"... Abstract—A selfstabilizing algorithm, after transient faults hit the system and place it in some arbitrary global state, recovers in finite time without external (e.g., human) intervention. In this paper, we propose a distributed asynchronous silent selfstabilizing algorithm for finding a minimal ..."
Abstract
 Add to MetaCart
minimal kdominating set of at most d n k+1 e processes in an arbitrary identified network of size n. We propose a transformer that allows our algorithm work under an unfair daemon (the weakest scheduling assumption). The complexity of our solution is in O(n) rounds and O(Dn2) steps using O(logn+ k log n
On Constructing kConnected kDominating Set in Wireless Networks
 In Proceedings of the 19 th International Parallel & Distributed Processing Symposium (IPDPS
, 2005
"... An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Previous work in this area has focused on selecting a small virtual backbone for high efficiency. In this paper, we propose ..."
Abstract

Cited by 53 (1 self)
 Add to MetaCart
the construction of a kconnected kdominating set (kCDS) as a backbone to balance efficiency and fault tolerance. Four localized kCDS construction protocols are proposed. The first protocol randomly selects virtual backbone nodes with a given probability pk, where pk depends on the value of k and network
On Constructing kConnected kDominating Set in Wireless Networks ∗
"... An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Previous work in this area has focused on selecting a small virtual backbone for high efficiency. ..."
Abstract
 Add to MetaCart
. We propose to construct a kconnected kdominating set (kCDS) as a backbone to balance efficiency and fault tolerance. Three localized kCDS construction protocols are proposed. The first protocol randomly selects virtual backbone nodes with a given probability pk, where pk depends on network
An extended localized algorithm for connected dominating set formation in ad hoc wireless networks
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2004
"... Efficient routing among a set of mobile hosts is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in the sy ..."
Abstract

Cited by 143 (15 self)
 Add to MetaCart
Efficient routing among a set of mobile hosts is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts
An Efficient Local Search Algorithm for kMedian Problem
"... Abstract: The kmedian problem is one of the NPhard combinatorial optimization problems. It falls into the general class of clustering problem and has application in the field of classification and data mining. One has confirmed that local search technique is the most effective and simplest method ..."
Abstract
 Add to MetaCart
for designing the algorithms for kmedian problem, and has been looking for the more efficient algorithms which can simplify the search space of the problem to solve the largescale instance and obtain the high quality solution. In this paper, we first analyze the search space of the problem by making use
Solving the kcenter problem efficiently with a dominating set algorithm
, 2005
"... We present a polynomial time heuristic algorithm for the minimum dominating set problem. The algorithm can readily be used for solving the minimum αallneighbor dominating set problem and the minimum set cover problem. We apply the algorithm in heuristic solving the minimum kcenter problem in poly ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a polynomial time heuristic algorithm for the minimum dominating set problem. The algorithm can readily be used for solving the minimum αallneighbor dominating set problem and the minimum set cover problem. We apply the algorithm in heuristic solving the minimum kcenter problem
Results 1  10
of
362,211