Skip to main content

Advertisement

Log in

Adaptive Storage Policy Switching for Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In wireless sensor networks, storage policies can be categorized into external storage, local storage and data centric storage. Each storage police has its suitable network environments. If a correct storage policy is chosen for a given network condition, unnecessary control messages can be significantly reduced. Then the network lifetime can be increased. In this paper, adaptive data storage (ADS) policy which can dynamically choose suitable storage policy for wireless sensor network according to the frequencies of user queries and events happening is proposed. Through collection and computation of user query and event rates, the proposed algorithm switches between local storage and data centric storage policies adaptively. Simulations are given to justify that the proposed adaptive storage policy indeed reduces the traffic in network and increases network lifetime.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Akyildiz I., Su W., Sankarasubramaniam Y. and Cayirci E. (2002). Wireless sensor networks: A survey. Computer Networks 38(4): 393–422

    Article  Google Scholar 

  2. Zhang, W., & Cao, G. (2003). An energy efficient framework for mobile target tracking in sensor networks. In Proceedings of IEEE International Conference on Military Communications (MILCOM2003) Vol. 1, pp. 597–602, 13–16 Oct. 2003.

  3. Seada, K., & Helmy, A. (2004). Rendezvous regions: A scalable architecture for service location and data-centric storage in large-scale wireless networks. In Proceedings of 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS2004), pp. 218–225, 26–30 April 2004.

  4. Chen, J., Guan, Y., & Pooch, U. (2004). An efficient data dissemination method in wireless sensor networks. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM2004), Vol. 5, pp. 3200–3204, 29 November-3 December 2004.

  5. Yu, W., Le, T. N., Xuan, D., & Zhao, W. (2004). Query aggregation for providing efficient data services in sensor networks. In Proceedings of 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS2004), pp. 31–40, 25–27 October 2004.

  6. Intanagonwiwat C., Govindan R., Estrin D., Heidemann J. and Silva F. (2003). Directed diffusion for wireless sensor networking. IEEE/ACM Transactions on Networking 11(1): 2–16

    Article  Google Scholar 

  7. Baronti P., Pillai P., Chook V.W.C., Chessa S., Gotta A. and Hu Y.F. (2007). Wireless sensor networks: A survey on the state of the art and the 802.15.4 and Zigbee standards. Computer Communications 30: 1655–1695

    Article  Google Scholar 

  8. Ratnasamy, S., Karp, B., Yin, L., Yu, F., Estrin, D., Govindan, R., & Shenker, S. (2002). A geographic hash table for data-centric storage. Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA2002), pp. 78–87, 2002.

  9. Ratnasamy S., Karp B., Shenker S., Estrin D., Govindan R., Li Y. and Yu F. (2003). Data-centric storage in sensornets with GHT, a geographic hash table. Mobile Networks and Applications, 8(4): 427–442. doi:10.1023/A:1024591915518.

    Article  Google Scholar 

  10. Zhang, W., Cao, G., & La Porta, T. (2003). Data dissemination with ring-based index for wireless sensor networks. Proceedings of 11th IEEE International Conference on Network Protocols, pp. 305–314, 4–7 November 2003.

  11. Zhang W. and Cao G. (2004). DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks. IEEE Transactions on Wireless Communications 3(5): 1689–1701. doi:10.1109/TWC.2004.833443.

    Article  Google Scholar 

  12. Karp, B., & Kung, H. T. (2000). GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom2000), pp. 243–254, August 2000.

  13. Zhang, W., Cao, G., & La Porta, T. (2004). Dynamic proxy tree-based data dissemination schemes for wireless sensor networks. In Proceedings of 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS2004), pp. 21–30, 25–27 October 2004.

  14. Zhao, Y. J., Govindan, R., & Estrin, D. (2002). Residual energy scan for monitoring wireless sensor networks. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC 2002), Vol. 1, pp. 356–362, Orlando, USA, March 2002.

  15. McCanne, S., & Floyed, S., ns network simulator, http://www.isi.edu/nsnam/ns.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gwo-Jong Yu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, GJ. Adaptive Storage Policy Switching for Wireless Sensor Networks. Wireless Pers Commun 48, 327–346 (2009). https://doi.org/10.1007/s11277-008-9525-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-008-9525-y

Keywords

Navigation