Results 1  10
of
3,254,217
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 365 (9 self)
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
Connected Dominating Sets
"... Wireless sensor networks (WSNs), consist of small nodes with sensing, computation, and wireless communications capabilities, are now widely used in many applications, including environment and habitat monitoring, traffic control, and etc. Routing in WSNs is very challenging due to the inherent chara ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. As such, the concept of hierarchical routing is also utilized to perform energyefficient routing in WSNs. Using a virtual backbone infrastructure which is one kind of hierarchical methods has received more attention. Thus, a Connected Dominating Set (CDS) has been recommended to serve as a virtual
On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks
, 1999
"... Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in adhoc wireless networks. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dominating i ..."
Abstract

Cited by 373 (40 self)
 Add to MetaCart
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in adhoc wireless networks. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dominating
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
 Mobile Networks and Applications
, 2002
"... Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. ..."
Abstract

Cited by 269 (20 self)
 Add to MetaCart
Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS.
Approximation Algorithms for Connected Dominating Sets
, 1998
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex in the dominating set. We focus on the related question of finding a connected dominating set of minim ..."
Abstract
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex in the dominating set. We focus on the related question of finding a connected dominating set
Approximation Algorithms for Connected Dominating Sets
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, wh ..."
Abstract
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
Construction of Minimum Connected Dominating Set
 in 3Dimensional Wireless Network,” The 3rd International Conference on Wireless Algorithms, Systems and Applications (WASA 2008
"... Abstract. Connected Dominating Set (CDS) has been a well known approach for constructing a virtual backbone to alleviate the broadcasting storm in wireless networks. Previous literature modeled the wireless network in a 2dimensional plane and looked for the approximated Minimum CDS (MCDS) distribut ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. Connected Dominating Set (CDS) has been a well known approach for constructing a virtual backbone to alleviate the broadcasting storm in wireless networks. Previous literature modeled the wireless network in a 2dimensional plane and looked for the approximated Minimum CDS (MCDS
Computing connected dominated sets with multipoint relays
 Journal of Ad Hoc and Sensor Wireless Networks
, 2002
"... Multipoint relays offer an optimized way of flooding packets in a radio network. However, this technique requires the last hop knowledge: to decide whether or not a flooding packet is retransmitted, a node needs to know from which node the packet was received. When considering broadcasting at IP lev ..."
Abstract

Cited by 74 (4 self)
 Add to MetaCart
level, this information may be difficult to obtain. We thus propose a scheme for computing an optimized connected dominating set from multipoint relays. Proof of correctness and simulations are given for all these broadcasting mechanisms. Keywords: multipoint relays, connected dominating set, ad hoc
Routing in AdHoc Networks Using Minimum Connected Dominating Sets
, 1997
"... this paper, we impose a virtual backbone structure on the adhoc network, in order to support unicast, multicast, and faulttolerant routing within the adhoc network. This virtual backbone differs from the wired backbone of cellular networks in two key ways: (a) it may change as nodes move, and (b) ..."
Abstract

Cited by 293 (3 self)
 Add to MetaCart
, to keep the virtual backbone as small as possible, we use an approximation to the minimum connected dominating set (MCDS) of the adhoc network topology as the virtual backbone. The hosts in the MCDS maintain local copies of the global topology of the network, along with shortest paths between all pairs
Results 1  10
of
3,254,217