Abstract
AbstractIn this paper we present a novel efficient, simple, local, memoryless and deterministic storage aggregation model for large wireless sensor networks (WSNs). Our goal is to maximize the system storage utilization. While normally most of WSN systems have a vast amount of global storage reserves, their storage capacity may not be fully explored due to the fact that each sensor individually has a very limited low storage capacity. We suggest an aggregated storage model that overcomes this drawback of low individual storage capacity. Our model constructs “on-demand” distributed storage chains (DSCs) which search for available un-occupied storage space inside WSNs. Those chains are constructed via deterministic geographic walks; however, their behavior resembles random walks. Simulation has revealed that the proposed storage distribution model is capable of maximizing utilization of WSN storage capacity as well as maintaining network loads geographically uniformly distributed.KeywordsDistributed algorithmsExpandersGeo-RoutingP2PRandom walkVoronoi Diagrams
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
