Enhanced Secure Dissemination with DIP and Data Discovery protocol in Wireless Sensor Networks

B. Manikumar, Kesavarao Seerapu

Abstract


In Wireless sensor Network, the security of data is an important aspect.We present DIPanddatadiscovery and spread convention for wireless networks. Earlier methodologies, for example, Trickle or SPIN, have overheads that scale straightly with the quantity of data things. For T things, DIP can recognize new things with 0(log(T)) parcels while keeping up an O(l) identification inertness. To accomplish this execution in a wide range of network setups, DIP utilizes a cross breed approach of randomized checking and tree-based coordinated quests. By progressively choosing which of the two algorithms to utilize, DIP outflanks both as far as transmissions and speed. Reenactment and testbed tests demonstrate that DIP sends 20-60% less parcels than existing conventions and can be 200% quicker, while just requiring O(log(log(T))) extra state per data thing. To help network programming, we present Deluge, a solid data spread convention for proliferating extensive data objects from at least one source nodes to numerous different nodes over a multihop, At scale, the convention uncovered fascinating proliferation elements just indicated by past scattering work. A basic model is likewise determined which depicts the breaking points of data engendering in wireless networks. At last, we contend that the rates got for scattering are naturally lower than that for single way spread. It seems hard to altogether enhance the rate gotten by Deluge and we recognize building up a tight lower bound as an open issue.


References


. J. W. Hui and D. Culler, “The dynamic behavior of a data dissemination protocol for network programming at scale,†in Proc. 2nd Int. Conf. Embedded Netw. Sensor Syst., 2004, pp. 81–94.

. D. He, C. Chen, S. Chan, and J. Bu, “DiCode: DoS-resistant and distributed code dissemination in wireless sensor networks,†IEEE Trans. Wireless Commun., vol. 11, no. 5, pp. 1946–1956, May 2012.

. T.Dang,N. Bulusu,W. Feng, and S. Park, “DHV:Acode consistency maintenance protocol for multi-hop wireless sensor networks,†in Proc. 6th Eur. Conf.Wireless Sensor Netw., 2009, pp. 327–342.

. G. Tolle and D. Culler, “Design of an application-cooperative management system for wireless sensor networks,†in Proc. Eur. Conf. Wireless Sensor Netw., 2005, pp. 121–132.

. K. Lin and P. Levis, “Data discovery and dissemination with DIP,†in Proc. ACM/IEEE Int. Conf. Inf. Process. Sensor Netw., 2008, pp. 433–444.

. M. Ceriotti, G. P. Picco, A. L. Murphy, S. Guna, M. Corra, M. Pozzi, D. Zonta, and P. Zanon, “Monitoring heritage buildings with wireless sensor networks: The Torre Aquila deployment,†in Proc. IEEE Int. Conf. Inf. Process. Sensor Netw., 2009, pp. 277–288.

. D. He, S. Chan, S. Tang, and M. Guizani, “Secure data discovery and dissemination based on hash tree for wireless sensor networks,†IEEE Trans. Wireless Commun., vol. 12, no. 9, pp. 4638–

. JoppeW.Bos, J. Alex Halderman , Nadia Heninger , Jonathan Moore, Michael Naehrig, and Eric Wustrow, “Elliptic Curve Cryptography in Practiceâ€

. M. Rahman, N. Nasser, and T. Taleb, “Pairing-based secure timing synchronization for heterogeneous sensor networks,†in Proc. IEEE Global Telecommun. Conf., 2008, pp. 1–5.

. Geoss. [Online]. Available:


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.

Â