Learning automata with changing number of actions
IEEE Transactions on Systems, Man and Cybernetics
Learning automata: an introduction
Learning automata: an introduction
Learning automata and its application to priority assignment in a queueing system with unknown characteristics
Dynamic Spectrum Access with QoS and Interference Temperature Constraints
IEEE Transactions on Mobile Computing
Stochastic learning solution for distributed discrete power control game in wireless data networks
IEEE/ACM Transactions on Networking (TON)
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
QAP: A QoS supportive adaptive polling protocol for wireless LANs
Computer Communications
LACAS: learning automata-based congestion avoidance scheme for healthcare wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on wireless and pervasive communications for healthcare
Data aggregation in sensor networks using learning automata
Wireless Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks
Computers and Electrical Engineering
Learning automata based dynamic guard channel algorithms
Computers and Electrical Engineering
Wireless Personal Communications: An International Journal
Finding minimum weight connected dominating set in stochastic graph based on learning automata
Information Sciences: an International Journal
Learning in multilevel games with incomplete information. I
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Multiple stochastic learning automata for vehicle path control in an automated highway system
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
An adaptive backbone formation algorithm for wireless sensor networks
Computer Communications
A bandwidth-based polling scheme for QoS support in Bluetooth
Computer Communications
Adaptive downlink scheduling and rate selection: a cross-layer design
IEEE Journal on Selected Areas in Communications
A new approach to the job scheduling problem in computational grids
Cluster Computing
An adaptive learning automata-based ranking function discovery algorithm
Journal of Intelligent Information Systems
LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks
Wireless Personal Communications: An International Journal
An adaptive backbone formation algorithm for wireless sensor networks
Computer Communications
Mobility prediction in mobile wireless networks
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 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
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In multi-hop ad hoc networks, besides collision-free transmissions, channel utilization should be also enhanced due to the scarce bandwidth. In this paper, we propose a learning automat-based adaptive polling scheme for medium access scheduling in clustered wireless ad-hoc networks to enhance the channel utilization. In this scheme, each cluster-head takes the responsibility of coordinating intra-cluster transmissions so that no collisions occur. Taking advantage of learning automaton, each cluster-head learns the traffic parameters of its own cluster members. Cluster members are prioritized based on these traffic parameters. Each cluster-head then takes the traffic parameters into consideration for finding an optimal channel access scheduling within its cluster. By the proposed polling scheme, each cluster member is assigned a portion of bandwidth proportional to its need (i.e., traffic load). The results show that the proposed channel assignment policy considerably improves the channel utilization. Simulation experiments also show the superiority of the proposed polling-based medium access scheme over the existing methods in terms of channel utilization, waiting time for packet transmission, and control overhead.