A hierarchical system of learning automata that can learn the globally optimal path
Information Sciences: an International Journal
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)
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
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
Clustering wireless ad hoc networks with weakly connected dominating set
Journal of Parallel and Distributed Computing
A novel distributed MCDS approximation algorithm for wireless sensor networks
Wireless Communications & Mobile Computing - Distributed Systems of Sensors and Actuators
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
Graph Coloring Problem 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
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
The capacity of wireless networks
IEEE Transactions on Information Theory
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
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
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
Wireless Personal Communications: An International Journal
The Journal of Supercomputing
An adaptive backbone formation algorithm for wireless sensor networks
Computer Communications
Sleep-based topology control in the Ad Hoc networks by using fitness aware learning automata
Computers & Mathematics with Applications
LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks
Wireless Personal Communications: An International Journal
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
ELACCA: Efficient Learning Automata Based Cell Clustering Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In wireless ad hoc networks, due to the dynamic topology changes, multi hop communications and strict resource limitations, routing becomes the most challenging issue, and broadcasting is a common approach which is used to alleviate the routing problem. Global flooding is a straightforward broadcasting method which is used in almost all existing topology-based routing protocols and suffers from the notorious broadcast storm problem. The connected dominating set (CDS) formation is a promising approach for reducing the broadcast routing overhead in which the messages are forwarded along the virtual backbone induced by the CDS. In this paper, we propose an intelligent backbone formation algorithm based on distributed learning automata (DLA) in which a near optimal solution to the minimum CDS problem is found. Sending along this virtual backbone alleviates the broadcast storm problem as the number of hosts responsible for broadcast routing is reduced to the number of hosts in backbone. The proposed algorithm can be also used in multicast routing protocols, where the only multicast group members need to be dominated by the CDS. In this paper, the worst case running time and message complexity of the proposed backbone formation algorithm to find a 1/(1-@e) optimal size backbone are computed. It is shown that by a proper choice of the learning rate of the proposed algorithm, a trade-off between the running time and message complexity of algorithm with the backbone size can be made. The simulation results show that the proposed algorithm significantly outperforms the existing CDS-based backbone formation algorithms in terms of the network backbone size, and its message overhead is only slightly more than the least cost algorithm.