Abstract
Learning automata have been found to be useful in the systems with incomplete knowledge. Therefore, it can be used as a tool to solve problems of Ad Hoc networks, where nodes are mobile and operate within a dynamic environment, which entails possibly unknown and time varying characteristics. In this paper, after a short review on the related works, learning automata and CEC algorithm, which is a sleep based topology control algorithm, a modified version (called MCEC) is proposed. In addition, a probabilistic algorithm is recommended to make decision about whether or not a node has to sleep. Furthermore, a distributed algorithm is recommended; in order to improve the proposed probabilistic algorithm, using learning automata. Finally, nominated algorithms have been simulated in both of the stationary and non-stationary networks. In conclusion, as the simulation results show, the proposed algorithms outperform corresponding topology control algorithms and reveal the effectiveness of using learning automata.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.