Clustering the wireless ad hoc networks: a distributed learning automata approach

DOI10.1016/j.jpdc.2009.10.002zbMath1233.68093OpenAlexW2022545367MaRDI QIDQ666084

Juan-Miguel Gracia

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2009.10.002

zbMATH Keywords

clusteringwireless ad hoc networksweakly connected dominating setdistributed learning automata

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Distributed systems (68M14)

Related Items (6)

On ε-Optimality of the Pursuit Learning Algorithm ⋮ Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata ⋮ Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory ⋮ A learning automata-based algorithm for solving coverage problem in directional sensor networks ⋮ LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS ⋮ A cross-layer optimization framework for joint channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering wireless ad hoc networks with weakly connected dominating set
• An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata
• Unit disk graphs
• Approximation algorithms for connected dominating sets
• UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
• On the Behavior of a Learning Automaton in a Changing Environment with Application to Telephone Traffic Routing
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Bounds on the Convergence Probabilities of Learning Automata
• The capacity of wireless networks
• Simple heuristics for unit disk graphs
• Learning Automata - A Survey
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
• A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS

This page was built for publication: Clustering the wireless ad hoc networks: a distributed learning automata approach