An Efficient Approach for Storage Balancing in Wireless Sensor Networks

Asmaa Ez-zaidi, Said Rakrak

Abstract


the use of mobile sinks in data collection has received much attention in recent years. In fact, mobility was introduced to solve problems that occur in data gathering with static sinks such as hotspots, quick energy depletion of sensor nodes and so on. Using mobile sinks provides an effective mechanism to improve reliability, security as well as connectivity within the network. Nevertheless, the sink’s mobility poses new challenges, especially when the sink follows an unpredictable movement while gathering data. In this case, the network will experience huge latency and suffer from significant packet loss particularly when sensor nodes do not have enough memory storage to buffer collected data between two successive visits of the mobile sink. In this paper we propose a new approach in which sensor nodes cooperate to manage the storage and prevent packet drops. When a node’s memory is almost full, it offloads its data to its neighbor nodes in function of their free spaces.  In case there are no neighbor nodes with sufficient storage space, the sink is urgently notified about the overloaded region that needs to be rapidly dumped. Simulation results reveal that our proposed approach decreases drastically the loss of packets and balances the sensor network.

Keywords


wireless sensor network; storage; distributed data storage; data gathering.

Full Text:

PDF



International Journal of Online Engineering (iJOE).ISSN: 1861-2121
Creative Commons License
Indexing:
Web of Science ESCI logo Engineering Information logo INSPEC logo DBLP logo ELSEVIER Scopus logo EBSCO logo Ulrich's logoGoogle Scholar logo Microsoft® Academic Search