A hierarchical system of learning automata that can learn the globally optimal path
Information Sciences: an International Journal
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
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Mobility prediction and routing in ad hoc wireless networks
International Journal of Network Management
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
A Learning Automata Based Dynamic Guard Channel Scheme
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Mobility control for throughput maximization in ad hoc networks: Research Articles
Wireless Communications & Mobile Computing - Wireless Ad Hoc Networks: Technologies and Challenges
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
Solving the Minimum Spanning Tree Problem in Stochastic Graphs Using Learning Automata
ICIME '09 Proceedings of the 2009 International Conference on Information Management and Engineering
A general call admission policy for next generation wireless networks
Computer Communications
An adaptive call admission algorithm for cellular networks
Computers and Electrical Engineering
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
Journal of Network and Computer Applications
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Algorithms on graphs with small dominating targets
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Flooding in wireless ad hoc networks
Computer Communications
Adaptive downlink scheduling and rate selection: a cross-layer design
IEEE Journal on Selected Areas in Communications
Journal of Network and Computer Applications
A Learning Automata-Based Cognitive Radio for Clustered Wireless Ad-Hoc Networks
Journal of Network and Systems Management
A cellular learning automata-based algorithm for solving the vertex coloring problem
Expert Systems with Applications: An International Journal
Learning automata-based algorithms for solving stochastic minimum spanning tree problem
Applied Soft Computing
A link stability-based multicast routing protocol for wireless mobile ad hoc networks
Journal of Network and Computer Applications
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks
Computers and Electrical Engineering
The Journal of Supercomputing
An adaptive backbone formation algorithm for wireless sensor networks
Computer Communications
A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks
The Journal of Supercomputing
LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks
Wireless Personal Communications: An International Journal
Energy-efficient backbone formation in wireless sensor networks
Computers and Electrical Engineering
Wireless Personal Communications: An International Journal
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |
In this paper, we first propose three centralized learning automata-based heuristic algorithms for approximating a near optimal solution to the minimum weight Steiner connected dominating set (WSCDS) problem. Finding the Steiner connected dominating set of the network graph is a promising approach for multicast routing in wireless ad-hoc networks. Therefore, we present a distributed implementation of the last approximation algorithm proposed in this paper (Algorithm III) for multicast routing in wireless mobile ad-hoc networks. The proposed WSCDS algorithms are compared with the well-known existing algorithms and the obtained results show that Algorithm III outperforms the others both in terms of the dominating set size and running time. Our simulation experiments also show the superiority of the proposed multicast routing algorithm over the best previous methods in terms of the packet delivery ratio, multicast route lifetime, and end-to-end delay.