A cellular learning automata-based deployment strategy for mobile wireless sensor networks

Abstract

Abstract:One important problem which may arise in designing a deployment strategy for a wireless sensor network is how to deploy a specific number of sensor nodes throughout an unknown network area so that the covered section of the area is maximized. In a mobile sensor network, this problem can be addressed by first deploying sensor nodes randomly in some initial positions within the area of the network, and then letting sensor nodes to move around and find their best positions according to the positions of their neighboring nodes. The problem becomes more complicated if sensor nodes have no information about their positions or even their relative distances to each other. In this paper, we propose a cellular learning automata-based deployment strategy which guides the movements of sensor nodes within the area of the network without any sensor to know its position or its relative distance to other sensors. In the proposed algorithm, the learning automaton in each node in cooperation with the learning automata in the neighboring nodes controls the movements of the node in order to attain high coverage. Experimental results have shown that in noise free environments, the proposed algorithm can compete with the existing algorithms such as PF, DSSA, IDCA, and VEC in terms of network coverage. It has also been shown that in noisy environments, where utilized location estimation techniques such as GPS-based devices and localization algorithms experience inaccuracies in their measurements, or the movements of sensor nodes are not perfect and follow a probabilistic motion model, the proposed algorithm outperforms the existing algorithms in terms of network coverage.

Accurate, Dynamic, and Distributed Localization of Phenomena for Mobile Sensor Networks

“…The interested reader could refer to the survey in [Savvides et al 2001] which provides detailed discussion on location discovery algorithms in MSN and the GPS-free localization model in [Wang & Xu 2010]. In our case, we assume that nodes (i) either know their position directly through GPS or (ii) they could adopt other localization techniques [Alcan et al 2010, Esnaashari andMeybodi 2011] or (iii) a hybrid scheme, as, in our model, location information from neighbouring nodes (either absolute or relative w.r.t. the position of the vanguard) is exploited for the relocation directives.…”

An Energy Aware Cellular Learning Automata Based Routing Algorithm for Opportunistic Networks

“…This dynamicity is necessary in many applications such as mobile ad hoc and sensor networks [20]. And this kind of ICLA is called as the dynamic irregular cellular learning automata (DICLA).…”

Adaptive cooperative particle swarm optimizer

“…To attain high coverage in wireless sensor networks, an automatic node deployment is proposed in [47]. For solving vertex coloring problem, Torkestani and Meybodi proposed an algorithm in [48].…”