On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Dominating-set-based routing in ad hoc wireless networks
Handbook of wireless networks and mobile computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
An approximation algorithm for the group Steiner problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Scalability study of the ad hoc on-demand distance vector routing protocol
International Journal of Network Management
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Approximability of the Independent/Connected Edge Dominating Set Problems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Information Processing Letters
Topology management in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
IEEE Transactions on Computers
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Broadcast Protocols in Ad Hoc Networks Based on Self-Pruning
IEEE Transactions on Parallel and Distributed Systems
A Distributed Mobile Backbone Formation Algorithm for Wireless Ad Hoc Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Efficient gathering of correlated data in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Computers
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Virtual backbone based on MCDS for topology control in wireless ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
IEEE Transactions on Computers
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
Journal of Global Optimization
Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree
Mobile Networks and Applications
IEEE Transactions on Mobile Computing
Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
Computer Networks and ISDN Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimizing broadcast latency in ad hoc wireless networks
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks
International Journal of Network Management
Clustering wireless ad hoc networks with weakly connected dominating set
Journal of Parallel and Distributed Computing
Energy-efficient opportunistic topology control in wireless sensor networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Energy-Efficient Localized Topology Control Algorithms in IEEE 802.15.4-Based Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Enabling SIP-based sessions in ad hoc networks
Wireless Networks
Constructing battery-aware virtual backbones in wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
Intelligent broadcasting inmobile ad hoc networks: three classes of adaptive protocols
EURASIP Journal on Wireless Communications and Networking
Association management for data dissemination over wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On approximation algorithms of k-connected m-dominating sets in disk graphs
Theoretical Computer Science
Fast distributed dominating set based routing in large scale MANETs
Computer Communications
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
International Journal of Sensor Networks
An energy-efficient heterogeneous dual routing scheme for mobile ad hoc and sensor networks
International Journal of Mobile Network Design and Innovation
An enhanced approach to determine connected dominating sets for routing in mobile ad hoc networks
International Journal of Mobile Communications
Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Multi-agent ERA Model Based on Belief Interaction Solves Wireless Sensor Networks Routing Problem
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
EQOWSN: Evolutionary-based query optimization over self-organized wireless sensor networks
Expert Systems with Applications: An International Journal
Hierarchical routing in ad hoc networks using k-dominating sets
ACM SIGMOBILE Mobile Computing and Communications Review
Variable radii connected sensor cover in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Simulation-Based Performance Comparison of VANETs Backbone Formation Algorithms
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
PTAS for Minimum Connected Dominating Set in Unit Ball Graph
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Construction of strongly connected dominating sets in asymmetric multihop wireless networks
Theoretical Computer Science
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Graph-Theoretic Concepts in Computer Science
Linear Kernel for Planar Connected Dominating Set
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Topology management for public safety networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Probabilistic counter-based route discovery for mobile ad hoc networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
A passive tree-based backbone construction scheme for MANETs
Computer Communications
A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks
Journal of Global Optimization
Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient data association for view based SLAM using connected dominating sets
Robotics and Autonomous Systems
IEEE Transactions on Neural Networks
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Stable energy-aware topology management in ad hoc networks
Ad Hoc Networks
QoS-aware on-demand channel width adaptation protocols for multi-radio ad-hoc networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
SCAM: scenario-based clustering algorithm for mobile ad hoc networks
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Clustering the wireless Ad Hoc networks: A distributed learning automata approach
Journal of Parallel and Distributed Computing
Clustering the wireless Ad Hoc networks: A distributed learning automata approach
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Discrete Applied Mathematics
Randomised algorithms for finding small weakly-connected dominating sets of regular graphs
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Predictive modeling-based data collection in wireless sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Backbone construction for heterogeneous wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks
The Journal of Supercomputing
On computing compression trees for data collection in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
Message-efficient CDS construction in MANETs
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Two algorithms for minimum 2-connected r-hop dominating set
Information Processing Letters
Multi-document summarization via the minimum dominating set
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Using agent-oriented simulation system AGNES for evaluation of sensor networks
MACOM'10 Proceedings of the Third international conference on Multiple access communications
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Efficient structure from motion by graph optimization
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
IEEE Transactions on Communications
PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Computational study for planar connected dominating set problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Deterministic dominating set construction in networks with bounded degree
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
A linear kernel for a planar connected dominating set
Theoretical Computer Science
The minimum-energy broadcast problem in symmetric wireless ad hoc networks
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Energy efficient multicasting problem in wireless ad-hoc networks
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Efficient multi-hop broadcasting in wireless networks using k-shortest path pruning
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Network verification via routing table queries
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
On parameterized independent feedback vertex set
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A genetic algorithm for constructing a reliable MCDS in probabilistic wireless networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Energy efficient data aggregation in solar sensor networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
A maximal independent set based giant component formation in random unit-disk graphs
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Wireless Personal Communications: An International Journal
A new pruning method for efficient broadcasting in ad hoc networks
International Journal of Mobile Network Design and Innovation
Theoretical Computer Science
INOC'11 Proceedings of the 5th international conference on Network optimization
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
Journal of Parallel and Distributed Computing
Tree-based double-covered broadcast for wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Scene reconstruction and visualization from internet photo collections
Scene reconstruction and visualization from internet photo collections
Summarization and matching of density-based clusters in streaming environments
Proceedings of the VLDB Endowment
MCDS based multicasting in mobile adhoc networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
A convex-hull based algorithm to connect the maximal independent set in unit-disk graphs
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Solving connected dominating set faster than 2n
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
An efficient distributed algorithm for finding virtual backbones in wireless ad-hoc networks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Strongly connected dominating sets in wireless sensor networks with unidirectional links
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
On the construction of k-connected m-dominating sets in wireless networks
Journal of Combinatorial Optimization
Journal of Network and Computer Applications
An improved distributed algorithm for connected dominating sets in wireless ad hoc networks
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Survivable network design problems in wireless networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The set cover with pairs problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Genetic algorithm simulated annealing based clustering strategy in MANET
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part I
On the minimization of the number of forwarding nodes for multicast in wireless ad hoc networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Optimal transmission range for topology management in wireless sensor networks
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
Extended dominating set in ad hoc networks using cooperative communication
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Max-leaves spanning tree is APX-hard for cubic graphs
Journal of Discrete Algorithms
A coloring based backbone construction algorithm in wireless ad hoc network
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
International Journal of Sensor Networks
Adaptive clustering with virtual subnets support in ad hoc networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Distributed clustering algorithm for finding virtual backbone in ad hoc networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
Minimum-Cost broadcast through varying-size neighborcast
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
Journal of Combinatorial Optimization
Algorithms for the minimum weight k-fold (connected) dominating set problem
Journal of Combinatorial Optimization
Finding minimum weight connected dominating set in stochastic graph based on learning automata
Information Sciences: an International Journal
Note: On the (h,k)-domination numbers of iterated line digraphs
Discrete Applied Mathematics
An approximation algorithm for directed shallow Steiner trees
Proceedings of the 3rd International Conference on Information and Communication Systems
Flooding in wireless ad hoc networks
Computer Communications
A weight-value algorithm for finding connected dominating sets in a MANET
Journal of Network and Computer Applications
A method to construct counterexamples for greedy algorithms
Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
Efficient link-heterogeneous multicast for wireless mesh networks
Wireless Networks
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
SIAM Journal on Discrete Mathematics
Maximizing lifetime of connected-dominating-set in cognitive radio networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Deterministic parameterized connected vertex cover
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Reliable signaling an emergency shutdown in large-scale, wireless controlled industrial plants
Proceedings of the 10th ACM international symposium on Mobility management and wireless access
Journal of Combinatorial Optimization
Connected dominating sets on dynamic geometric graphs
Computational Geometry: Theory and Applications
On Parameterized Independent Feedback Vertex Set
Theoretical Computer Science
Energy and time efficient broadcasting in known topology radio networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
MatchMiner: efficient spanning structure mining in large image collections
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part II
The power of local information in social networks
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Active node determination for correlated data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Connected dominating set algorithms for wireless sensor networks
International Journal of Sensor Networks
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Theoretical Computer Science
New heuristic approaches for the dominating tree problem
Applied Soft Computing
SCALAR: Scalable data lookup and replication protocol for mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-Stabilizing Algorithm for Low Weight Connected Dominating Set
DS-RT '13 Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
Dominating problems in swapped networks
Information Sciences: an International Journal
Hi-index | 0.02 |
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 minimum size, 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 2H(Δ)+2 and H(Δ)+2 are presented, where Δ is the maximum degree and H is the harmonic function. This question also arises in relation to the traveling tourist problem, where one is looking for the shortest tour such that each vertex is either visited or has at least one of its neighbors visited. We also consider a generalization of the problem to the weighted case, and give an algorithm with an approximation factor of (cn+1) \ln n where cn ln k is the approximation factor for the node weighted Steiner tree problem (currently cn = 1.6103 ). We also consider the more general problem of finding a connected dominating set of a specified subset of vertices and provide a polynomial time algorithm with a (c+1) H(Δ) +c-1 approximation factor, where c is the Steiner approximation ratio for graphs (currently c = 1.644 ).