In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical systems in which space and time are discrete and rules are local, is proper candidate to simulate and analyze the problem. Using CA presents a better understanding of the problem.
Saadatmand, S., Moazzami, D., & Moeini, A. (2016). A Cellular Automaton Based Algorithm for Mobile Sensor Gathering. Journal of Algorithms and Computation, 47(1), 93-99. doi: 10.22059/jac.2016.7947
MLA
S. Saadatmand; D. Moazzami; A. Moeini. "A Cellular Automaton Based Algorithm for Mobile Sensor Gathering". Journal of Algorithms and Computation, 47, 1, 2016, 93-99. doi: 10.22059/jac.2016.7947
HARVARD
Saadatmand, S., Moazzami, D., Moeini, A. (2016). 'A Cellular Automaton Based Algorithm for Mobile Sensor Gathering', Journal of Algorithms and Computation, 47(1), pp. 93-99. doi: 10.22059/jac.2016.7947
VANCOUVER
Saadatmand, S., Moazzami, D., Moeini, A. A Cellular Automaton Based Algorithm for Mobile Sensor Gathering. Journal of Algorithms and Computation, 2016; 47(1): 93-99. doi: 10.22059/jac.2016.7947
)