SURVEY ON DISTRIBUTED DETECTION MECHANISM FOR BYZANTINE ATTACK IN TREE-BASED TOPOLOGY
Keywords:
Byzantine Attack, Distribution Detection, Tree Topology, AODV, Polynomial Time AlgorithmAbstract
In tree based topology each and every nodes are participating on communication with other nodes. So it is major challenge to secure the data transmission between the nodes in the network as many types of attacks are generated in between the communication. Byzantine attack is one of the most important security thread as it interrupt the communication of nodes in the network and behave like a innocent nodes while participating normally. In Byzantine attack compromisation of nodes takes place in that condition it is very difficult to detect the innocent and malicious nodes, with the byzantine nodes many other attacks are deployed as Blackhole attack, wormhole attack, gray-hole attack, flood rushing attack, sinkhole attack etc. Routing protocols helps to provide the way through which the nodes can be able to communicate with each other. Also provide the cost associated with each node so as to differentiate investment of resources from each nodes as communication takes place. For securing the data transmission in a network algorithms proposed which will bound the faulty data transmission and also limits the resources usage by decreasing the investment of resources which takes part in communication. Performance will be measures in terms of parameter as packet delivery fraction, energy consumption, End-to-end delays.
References
Xiang He, Aylin Yener.” Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay,” IEEE transaction on information theory, vol. 59, no. 1, January 2013.
Bhavya Kailkhura, Swastik Brahma, Pramod K.Varshney, “Optimal Byzantine Attacks on Distributed Detection in Tree based Topology,” International Conference on Computing, Networking and Communication, Workshop Cyber Physical system,2013.
Mai Abdelhakim, Leonard E. Lightfoot, Jian Ren, and Tongtong Li,” Distributed Detection in Mobile Access Wireless Sensor Networks under Byzantine Attacks,” IEEE Transaction on parallel and distributed System, March 2013
Xiaofan He, Huaiyu Dai, Peng Ning,” A Byzantine Attack Defender: the Conditional Frequency Check,” 2012 IEEE International Symposium on Information Theory Proceedings.
Shabir Sofi, Eshan Malik, Rayees Baba, Hilal Baba, Roohie Mir,” Analysis of Byzantine Attacks in Adhoc Networks and Their Mitigation,” ICCIT 2012
Vaibhav Pandit, Jung Hyun Jun, Dharma P. Agrawal,” Inherent Security Benefits of Analog Network Coding for the Detection of Byzantine Attacks in Multi-Hop Wireless Networks,” Eighth IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, 2011
E. Ekrem and S. Ulukus, “The secrecy capacity region of the Gaussian MIMO multireceiver wiretap channel,” IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2083–2114, Apr. 2011.
X. He and A. Yener, “The Gaussian many-to-one interference channel with confidential messages,” IEEE Trans. Inf. Theory, vol.57, no.5, pp. 2730–2745, May 2011.
Vaibhav Pandit, Jung Hyun Jun and Dharma P. Agrawal,” Inherent Security Benefits of Analog Network Coding for the Detection of Byzantine Attacks in Multi-Hop Wireless Networks,” 2011 Eighth IEEE International Conference on Mobile Ad-Hoc and Sensor Systems.
X. He and A. Yener, “Cooperation with an untrusted relay: Asecrecy perspective,” IEEE Trans. Inf. Theory, vol. 56, no. 8, pp. 3801–3827, Aug. 2010.
X. He and A. Yener, “Providing secrecy with structured codes: Tools and applications to Gaussian two-user channels,” submitted to IEEE Trans. Inf. Theory, Jul. 2009 [Online].0907.5388.
MinJi Kim, Lu´isa Lima, Fang Zhao, Jo˜ao Barros, Muriel M´edard, Ralf Koetter, Ton Kalker, Keesook J. Han,” On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks,” IEEE journal on selected areas in communication, vol. 28, no. 5, June 2010.
Priyank Anand, Ankit Singh Rawat,” Collaborative Spectrum Sensing in the Presence of Byzantine Attacks in Cognitive Radio Networks,” 978-1-4244-5489-1/10/$26.00 2010 IEEE.
Stefano Marano, Vincenzo Matta, and Lang Tong,” Distributed Detection in the Presence of Byzantine Attacks,” IEEE Transaction on signal processing, vol. 57, no.1, January 2009.
R. Koetter and F. Kschischang, “Coding for errors and erasures in random network coding,” IEEE Trans. Inf. Theory, vol. 54, pp. 3579–3591, 2008.
S. Katti, S. Gollakota, and D. Katabi, “Embracing wireless interference: Analog network coding,” in Proceedings of the 2007, ACM Conference on Applications, Technologies,
B. Awerbuch, R. Curtmola, D. Holmer, et. al,” Mitigating byzantine attacks in ad hoc wireless networks,”. Department of Computer Science, Johns Hopkins University, Technical Report Version 1, March 2004.
C. Adjih, A. Laouiti, P. Minet, et. al., Optimized link state routine protocol. Work in Progress, IETF draft, MANET Working Group, INRIA Rocquencourt, France, 2003.
C. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of SIGCOMM '94 Conference on Communications, Architectures, Protocols, and Applications, (London, UK, Sept 1994), p. 234-244.
Downloads
Published
Issue
Section
License
Copyright (c) -1 Apeksha.B.Dhakde, S. U. Nimbhorkar (Author)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
