CONFIDENTIALITY-DESTRUCTIVE AND DISHONEST DISCOVERY OF PACKET FALLING ASSAULTS IN WIRELESS AD HOC NETWORKS

Shaik Shabbir Basha, V. Venkateswarlu

Abstract


In broad wireless means, link errors are relatively important, and may not be significantly lesser than packet shedding rate of insider attacker hence insider attacker can hide in backdrop of harsh funnel conditions.  We're concerned in combating an insider attack and thinking about complexity to discover happening of selective packet drops and recognize malicious node that handle such drops. Within our work during study of packet sequence losses inside the network, we're concerned in exercising whether losses result from approach to link errors simply, otherwise by collective after effect of link errors in addition to malicious drop. We develop accurate formula for recognition of selective packet drops which are produced by insider attackers. To create apparent on computation of correlations, we create a homomorphic straight line authenticator that's on public auditing design basis that enables the detector to make sure honesty of packet loss information that's as outlined above by nodes. This arrangement is privacy preserving, and sustains low communication in addition to storage spending. Our formula additionally provides honest in addition to freely verifiable decision statistics as proof to keep recognition decision.


Keywords


Insider Attacker; Malicious Node; Selective Packet; Homomorphic Linear Authenticator; Privacy Preserving; Public Auditing;

References


K. Balakrishnan, J. Deng, and P. K. Varshney, “TWOACK: Preventing selfishness in mobile ad hoc networks,” in Proc. IEEE Wireless Commun. Netw. Conf., 2005, pp. 2137–2142.

H. Shacham and B. Waters, “Compact proofs of retrievability,” in Proc. Int. Conf. Theory Appl. Cryptol. Inf. Secur., Dec. 2008, pp. 90– 107.

T. Shu, M. Krunz, and S. Liu, “Secure data collection in wireless sensor networks using randomized dispersive routes,” IEEE Trans. Mobile Comput., vol. 9, no. 7, pp. 941–954, Jul. 2010.

T. Shu, S. Liu, and M. Krunz, “Secure data collection in wireless sensor networks using randomized dispersive routes,” in Proc. IEEE INFOCOM Conf., 2009, pp. 2846–2850.

B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, “ODSBR: An on-demand secure byzantine resilient routing protocol for wireless ad hoc networks,” ACM Trans. Inform. Syst. Security, vol. 10, no. 4, pp. 1–35, 2008.

B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, “ODSBR: An on-demand secure byzantine resilient routing protocol for wireless ad hoc networks,” ACM Trans. Inf. Syst. Secur., vol. 10, no. 4, pp. 11–35, 2008.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

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