Beaconless cooperative localization in wireless sensor network: Implementing Cellular Automata Von Neumann neighborhood

Localization in WSN is a field under constant research. Localization is a critical parameter in certain applications. Our survey shows that most of these existing methods are either `Beacon´ dependent or depends on complex probabilistic calculations and assumptions. We propose a simple algorithm using the concept of minimalistic neighborhood, of Von Neumann type Cellular Automata. The proposed algorithm stores a relative neighborhood based location data and forms a connected graph. Such graphs at each node (with self at the root) help with proper localization, with very little computational and storage overheads.