Abstract

This work presents a cellular automata (CA) based model for finding minimum spanning tree in wireless sensor networks (WSN) with distinct edge weights. A regular grid topology network is created by the sensor nodes where every sensor node can have maximum four neighbor nodes in the tree. To perform the computation every sensor node communicates with its immediate neighbour nodes which are within its communication range . Nodes use simple CA based localized algorithms which can optimize the performance. By limiting the maximum number of neighbour nodes it also minimizes the redundancy in the network which can increase the lifetime of the network.KeywordsCellular automata (CA)Wireless sensor networksMinimal spanning tree

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.