A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks

DOI10.1016/j.comnet.2010.03.014zbMath1208.68092OpenAlexW2154371512MaRDI QIDQ605616

Sumit K. Garg

Publication date: 25 November 2010

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2010.03.014

zbMATH Keywords

schedulinglearning automatawireless sensor networkdynamic point coverage

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Formal languages and automata (68Q45) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory ⋮ An adaptive learning routing protocol for the prevention of distributed denial of service attacks in wireless mesh networks ⋮ A cellular learning automata-based deployment strategy for mobile wireless sensor networks ⋮ A learning automata-based algorithm for solving coverage problem in directional sensor networks ⋮ Cellular Automata, Learning Automata, and Cellular Learning Automata for Optimization

This page was built for publication: A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks