Results 1  10
of
525
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 276 (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.
On greedy construction of connected dominating sets in wireless networks
 NSF International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor and PeertoPeer Networks
, 2004
"... Due to the fact that there is no fixed infrastructure or centralized management in ad hoc wireless networks, a Connected Dominating Set (CDS) of the graph representing the network is widely used as the virtual backbone of the network. Constructing a minimum CDS is NPhard. In this paper, we propose ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
Due to the fact that there is no fixed infrastructure or centralized management in ad hoc wireless networks, a Connected Dominating Set (CDS) of the graph representing the network is widely used as the virtual backbone of the network. Constructing a minimum CDS is NPhard. In this paper, we propose
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 366 (9 self)
 Add to MetaCart
, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication. Two polynomial time algorithms that achieve approximation factors of O(H (\Delta)) are presented, where \Delta is the maximum
Impact of network density on Data Aggregation in wireless sensor networks
, 2001
"... Innetwork data aggregation is essential for wireless sensor networks where resources (e.g., bandwidth, energy) are limited. In a previously proposed data dissemination scheme, data is opportunistically aggregated at the intermediate nodes on a lowlatency tree which may not necessarily be energy ef ..."
Abstract

Cited by 321 (4 self)
 Add to MetaCart
efficient. A more energyefficient tree is a greedy tree which can be incrementally constructed by connecting each source to the closest point of the existing tree. In this paper, we propose a greedy approach for constructing a greedy aggregation tree to improve path sharing. We evaluated the performance
Constructing Minimum Connected Dominating Set: Algorithmic approach
"... Abstract: Connected Dominating Set is popularly used for constructing virtual backbones for broadcasting operation in WSNs. UD Graph is the most suitable model for a wireless sensor network. In this paper we provide an algorithm to find MCDS in UD Graph. It is based on the computation of convex hull ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract: Connected Dominating Set is popularly used for constructing virtual backbones for broadcasting operation in WSNs. UD Graph is the most suitable model for a wireless sensor network. In this paper we provide an algorithm to find MCDS in UD Graph. It is based on the computation of convex
A Distributed Greedy Algorithm for Constructing Connected Dominating Sets in Wireless Sensor Networks
"... Abstract: A Connected Dominating Set (CDS) of the graph representing a Wireless Sensor Network can be used as a virtual backbone for routing in the network. Since sensor nodes are constrained by limited onboard batteries, it is desirable to have a small CDS for the network. However, constructing a ..."
Abstract
 Add to MetaCart
Abstract: A Connected Dominating Set (CDS) of the graph representing a Wireless Sensor Network can be used as a virtual backbone for routing in the network. Since sensor nodes are constrained by limited onboard batteries, it is desirable to have a small CDS for the network. However, constructing a
An improved energy Minimum Connected Dominating Sets Construction Algorithm in MANET
"... Abstract. In recent years，MANET gain a significant attention for the potential application in battlefield, disaster relief, traffic monitoring and environment monitoring. Construction and maintain of virtual backbone, and energy effective routing in mobile ad hoc wireless network come to be the basi ..."
Abstract
 Add to MetaCart
to be the basic and main problem in MANET. This paper proposed the efficient ENMCDS algorithm for constructing the minimum connected dominating set, the algorithm in most cases can quickly generate a near optimal size of ENMCDS. Theoretical analysis and simulation results show the superiority of the algorithm
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
, 2009
"... Connected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone incurs less maintenance overhead. Unfortunately, computing a minimum size CDS is NPhard, and thus most researchers in this area concentrate on how to construct smaller CDSs. However, pe ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
Connected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone incurs less maintenance overhead. Unfortunately, computing a minimum size CDS is NPhard, and thus most researchers in this area concentrate on how to construct smaller CDSs. However
An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network
"... Abstract. One of the critical issues in wireless sensor network is the design of a proper routing protocol. One possible approach is utilizing a virtual infrastructure, which is a subset of sensors to connect all the sensors in the network. Among the many virtual infrastructures, the connected domin ..."
Abstract
 Add to MetaCart
dominating set is widely used. Since a small connected dominating set can help to decrease the protocol overhead and energy consumption, it is preferable to find a small sized connected dominating set. Although many algorithms have been suggested to construct a minimum connected dominating set, there have
Results 1  10
of
525