Distributed Data Storage Through Secure Routing in Wireless Sensor Networks

R. Jebakumar(1*), P. Vivekanandan(2)

(1) Research Scholar, Department of Computer Science and Engineering, Anna University, Chennai., India
(2) Professor and Head, Computer Center A.C. Tech, Anna University, India
(*) Corresponding author


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


Data transmission is a very energy consuming operation in wireless sensor networks (WSNs). Data collection, aggregation and its communication is a challenging task between the remote sensors and the sink. To minimize the transmission costs, the storage nodes are used to store data and aggregate it if required and forward to the sink. The secure keys are generated by a key distribution center choosing randomly that is shared by all the secure nodes in the network session by session. In this proposed architecture, a distributed data server (DDS) is connected with base stations (BS) or sink and each BS will act like a virtual DDS to reduce the centralized process and increase distributed computation. The storage nodes are placed between sensors and BSs to collect the data from remote sensors and itself. Each base station has its own regional data and maintains the fact for the whole data in the network to increase the query performance through distributed environment


Copyright © 2014 Praise Worthy Prize - All rights reserved.

Keywords


Wireless Sensor Network; Distributed Data Server; Virtual Distributed Data Server; Base Station; Key Distribution Center; Storage Node

Full Text:

PDF


References


Claude Castelluccia, Inria and Aldar C.F. Chan, “Efficient and Provably Secure Aggregation of Encrypted Data in Wireless Sensor Networks”, ACM Transactions on Sensor Networks, Vol. 5, No. 3, Article 20, May 2009.

Q. Wang, K. Ren, W. Lou, and Y. Zhang, “Dependable and secure sensor data storage with dynamic integrity and assurance”, in Proc. of IEEE INFOCOM, 2009.

A. G. Dimakis and K. Ramchandran, “Network coding for distributed storage in wireless networks”, Networked Sensing Information and Control, Signals and Communication Series, Springer Verlag, 2008.

S. Ratnasamy, D. Estrin, R. Govindan, B. Karp, S. Shenker, L. Yin, and F. Yu, “Data-centric storage in sensornets”, First Workshop on Sensor Networks and Applications (WSNA), Atlanta, GA, September 2002.

D. Ganesan, D. Estrin, and J. Heidemann, “DIMENSIONS: Why do we need a new Data Handling architecture for Sensor Networks?”, Computer Communication Review, January 2003, Vol.33, pp.143-148.

D. Ganesan, B. Greenstein, D. Perelyubskiy, D. Estrin, and J. Heidemann, “An Evaluation of Multi-resolution Storage for Sensor Networks”, in ACM SenSys 2003.

Hongbo Luo, Guoliang Xing, Minming Li and Xiaohua Jia, “Dynamic Multi-resolution Data Dissemination in Storage-centric Wireless Sensor Networks”, MSWiM’07, 2007, pp.78-85.

R. Biswas, K.Chowdhury and D. P. Agrawal, “Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks”, International Journal of Wireless Information Networks, October 2006, v 13, pp. 303-315.

H. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks," in Proc. IEEE Symp. Research Security Privacy, May 2003.

W. Du, J. Deng, Y. S. Han, and P. K. Varshney, “A pairwise key predistribution scheme for wireless sensor networks," in Proc. 10th ACM Conf. Comput. Commun. Security, Oct. 2003.

J. Lee and D. R. Stinson, “Deterministic key predistribution schemes for distributed sensor networks," in Proc. 11th Workshop Sel. Areas Cryptography, Aug. 2004.

J. Lee and D. R. Stinson, “A combinatorial approach to key predistribution for distributed sensor networks," in Proc. IEEE Wireless Commun.Netw. Conf., Mar. 2005.

D. Liu and P. Ning, “Establishing pairwise keys in distributed sensor networks," in Proc. 10th ACM Conf. Comput. Commun. Security, Oct. 2003.

S. Ratnasamy, B, Karp, S. Shenker, D. Estrin, R.Govindan, L. Yin and F. Yu, “Data-centric storage in sensornets with GHT, a geographic Hash Table”, Mobile Networks Applications, August 2003, Vol.8, pp.427-442.

Kai Xing, Xiuzhen Cheng and Jiang Li, “Location-Centric Storage for Sensor Networks”, IEEE International Conference on Mobile Adhoc and Sensor Systems, 2005.

C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann and F. Silva, “Directed diffusion for wireless sensor networking”, IEEE/ACM Transactions on Networking, February 2003, vVol.11, pp. 2-16.

S. R. Madden, M. J. Franklin, J. M. Hellerstein and W. Hong, “TinyDB: An acquisitional query processing system for sensor networks”, ACM Transactions on Database Systems, March 2005, Vol.30, pp.122-173.

S. Shenker, S. Ratnasamy, B. Karp, R. Bovindan and D. Estrin, “Data-centric storage in sensornets”, Computer Communication Review, January 2003, Vol.33, pp.137-142.

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable peer-to-peer lookup service for Internet applications”, Proceedings of the ACM SIGCOMM 01 Conference, San Diego, CA, August 2001.

R. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, “A Scalable content-addressable network”, Proceedings of the ACM SIGCOMM 01 Conference, San Diego, CA, August 2001.

B. Greenstein, D. Estrin, R. Govindan, S. Ratnasamy, and S. Shenker, “Difs: a distributed index for features in sensor networks," in Sensor Network Protocols and Applications, 2003. Proceedings of the First IEEE. 2003 IEEE International Workshop on, May 2003, pp. 163-173.

M. Aly, K. Pruhs, and P. K. Chrysanthis, “Kddcs: a load-balanced in-network data centric storage scheme for sensor networks," in CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management. New York, NY, USA: ACM, 2006, pp. 317-326.

Faheem, M., Din, Z.U., Shahid, M.A., Ali, S., Raza, B., Sakar, L., Energy based efficiency evaluation of cluster and tree based routing protocols for wireless sensor networks, (2013) International Review on Computers and Software (IRECOS), 8 (4), pp. 1012-102.

Tan, P., Ju, M., An energy-efficient real-time routing protocol for wireless sensor networks, (2012) International Review on Computers and Software (IRECOS), 7 (5), pp. 2285-228..

A. Poornima and B. Amberker, “Tree-based key management scheme for heterogeneous sensor networks," in 16th IEEE International Conf. Netw., 2008.

Y. Zhang, W. Yang, K. Kim, and M. Park, “An AVL tree-based dynamic key management in hierarchical wireless sensor network," in Proc. International Conf. Intelligent Inf. Hiding Multimedia Signal Process., pp. 298-303, 2008.

Wenjun Gu, Neelanjana Dutta, Sriram, and Xiaole Bai, “Providing End-to-End Secure Communications in Wireless Sensor Networks” in IEEE Transactions on networks and service management, Vol. 8, No. 3, September 2011.

R. Jebakumar and Dr. P. Vivekanandan, “Misbehaving Node Detection in Wireless Sensor Networks Using Trust-Based System,” Pensee Journal, Vol 75, No. 12, 2013, pp. 245-254.

R. Jebakumar and Dr. P. Vivekanandan, “Multi-Level Reliable Data Aggregation in Wireless Sensor Network,” International Journal of Engineering and Technology (IJET), Vol 5 No 6 Dec 2013-Jan 2014, pp. 4815-4825.


Refbacks

  • There are currently no refbacks.



Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2019 Praise Worthy Prize