Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
Learning automata with changing number of actions
IEEE Transactions on Systems, Man and Cybernetics
Learning automata: an introduction
Learning automata: an introduction
Discrete Mathematics - Topics on domination
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
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Ad hoc Networking
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
On greedy construction of connected dominating sets in wireless networks: Research Articles
Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
AD HOC NETWORKS: Technologies and Protocols
AD HOC NETWORKS: Technologies and Protocols
Efficient algorithms for the minimum connected domination on trapezoid graphs
Information Sciences: an International Journal
Construction of strongly connected dominating sets in asymmetric multihop wireless networks
Theoretical Computer Science
A novel distributed MCDS approximation algorithm for wireless sensor networks
Wireless Communications & Mobile Computing - Distributed Systems of Sensors and Actuators
A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
Information Processing Letters
Approximating the Minimum Connected Dominating Set in Stochastic Graphs Based on Learning Automata
ICIME '09 Proceedings of the 2009 International Conference on Information Management and Engineering
Efficient data association for view based SLAM using connected dominating sets
Robotics and Autonomous Systems
Dominating sets in directed graphs
Information Sciences: an International Journal
On the k-tuple domination of generalized de Brujin and Kautz digraphs
Information Sciences: an International Journal
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
Journal of Parallel and Distributed Computing
A linear kernel for a planar connected dominating set
Theoretical Computer Science
A link stability-based multicast routing protocol for wireless mobile ad hoc networks
Journal of Network and Computer Applications
Flooding in wireless ad hoc networks
Computer Communications
A new approach to the job scheduling problem in computational grids
Cluster Computing
An adaptive backbone formation algorithm for wireless sensor networks
Computer Communications
Mobility prediction in mobile wireless networks
Journal of Network and Computer Applications
A distributed resource discovery algorithm for P2P grids
Journal of Network and Computer Applications
An adaptive learning to rank algorithm: Learning automata approach
Decision Support Systems
LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks
Wireless Personal Communications: An International Journal
Degree constrained minimum spanning tree problem: a learning automata approach
The Journal of Supercomputing
An optimal time algorithm for minimum linear arrangement of chord graphs
Information Sciences: an International Journal
An energy-efficient topology construction algorithm for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks
Wireless Personal Communications: An International Journal
Energy-efficient backbone formation in wireless sensor networks
Computers and Electrical Engineering
Dominating problems in swapped networks
Information Sciences: an International Journal
Hi-index | 0.07 |
Finding the minimum weight connected dominating set (MCDS) in an arbitrary graph is an NP-hard problem and several heuristics and approximation methods have been proposed to solve it. Forwarding the messages along the virtual backbone induced by the connected dominating set (CDS) significantly reduces the routing overhead as well as the power consumption by reducing the routing nodes to the backbone nodes. This paper first defines the stochastic MCDS problem where the probability distribution function (PDF) of the random weight associated with the graph vertices is unknown. Then, it presents several learning automata-based algorithms (Algorithms 1-6) to solve the stochastic MCDS problem. Taking advantage of learning automata, the proposed algorithms significantly reduce the number of samples that must be taken from the graph to construct the MCDS. It is proved that by the proper choice of the learning rate, the probability of finding the MCDS is close enough to unity. The standard sampling method (SSM) is the baseline with which we compare the performance of the proposed algorithms. Experimental results show that Algorithm 6 significantly outperforms the SSM and the other proposed algorithms in terms of the sampling rate.