The week's pick
Random Articles
Reseach Article
Distributed Detection Methods for Byzantine Attack in Tree Topology
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 90 - Number 18 |
| Year of Publication: 2014 |
| Authors: Apeksha.b.dhakde, Sonali.u.nimbhorkar |
10.5120/15817-4238
|
Apeksha.b.dhakde, Sonali.u.nimbhorkar . Distributed Detection Methods for Byzantine Attack in Tree Topology. International Journal of Computer Applications. 90, 18 ( March 2014), 1-4. DOI=10.5120/15817-4238
Abstract
In Adhoc network the Byzantine Attack is the most safety threads as it bring to a halt in the communication of nodes in the network and behave like a fair nodes while take part normally in the network. It is very important in the network to provide the communication between the nodes is to be error free and communication takes place in a particular time period. In a tree based topology every node is take part in communication with other nodes. So it is major challenge to protect the data transmission between the nodes in the network as many types of attacks are collaborating with Byzantine attack. In order to provide optimal strategy to generate the attack in the network and also provide the good way to attack the precious node which will affect the network with a big loss. some solution is to be provided so the attack can be take place on the most important node who have the confidential data in it, with the cost associated to the node and some algorithm should provide in order to find the time delays between the nodes also provide bounds to the nodes in order to transmit the data ,detect the faulty data transmission and also limits the use of the resources by falling the investment of resources which takes part in communication. In this paper the major focus is on the cost which is provided to the nodes while differentiating with the random cost, linear cost and performance can be measures in term of minimum cost with the linearity, packet delivery,End-to-end delays, Throughput with and without attacks.
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.
- 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.
- X. He and A. Yener, The Gaussian many-to-one interference channel with con?dential 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 Bene?ts 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.
- 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.
- 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. Jaggi, M. Lang berg, S. Katti, T. Ho, D. Katabi, and M. M´edard, Resilient network coding in the presence of byzantine adversaries in Proceedings of IEEE INFOCOM, March 2007, pp. 616 – 624.
- 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.
- D. Lun, M. M´edard, D. Karger, and M. Effros, "On coding for reliable communication over packet networks," in Proceedings of 42nd Annual Allert on Conference on Communication Control, and Computing Invited paper, September–October 2004.
- 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)
Index Terms
Keywords