Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
472405 | Computers & Mathematics with Applications | 2012 | 10 Pages |
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.