Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Call For Paper : Vol. 9, Issue 6 , 2022
Identification of Truthful Packet Dropping In Wireless Ad-Hoc Networks Using HLA Algorithm

Author : CH V Divya Teja 1 V Dinesh 2 Prasad B 3

Date of Publication :7th March 2016

Abstract: Identification of truthful packet dropping in wireless ad-hoc networks using HLA algorithm’s main purpose is to determine whether the is loss of packets are caused by link errors only or by the combined effect of link errors and malicious drop errors that are the two causes in multi-hop wireless adhoc networks. It is particularly considered for insider attack case, where by malicious nodes which are part of the route exploit cognition of communication context to selectively drop a small amount of packets that act critical to the network performance. Development of homo_morphic linear authenticator [HLA] is necessary to ensure truthful calculation of these correlations and to verify truthfulness of the packet loss information reported by nodes. This construction is privacy preserving, collusion proof and provokes low communication and storage overheads. To reduce computation overhead a packet block based mechanism is also proposed to trade detection accuracy for low computation complexity.

Reference :

    1. J. N. Arauz, ―802.11 Markov channel modeling,β€– Ph.D. dissertation, School Inform. Sci., Univ. Pittsburgh, Pittsburgh, PA, USA, 2004.
    2. C. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, ―Provable data possession at untrusted stores,β€– in Proc. ACM Conf. Comput. and Commun. Secur., Oct. 2007, pp. 598–610.
    3. G. Ateniese, S. Kamara, and J. Katz, ―Proofs of storage from homomorphic identification protocols,β€– in Proc. Int. Conf. Theory Appl. Cryptol. Inf. Security, 2009, pp. 319–333.
    4. B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, ―ODSBR: An ondemand secure byzantine resilient routing protocol for wireless ad hoc networks,β€– ACM Trans. Inform. Syst. Security, vol. 10, no. 4, pp. 1–35, 2008.
    5. B. Awerbuch, R. Curtmola, D. Holmer, C. NitaRotaru, 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.
    6. 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.
    7. D. Boneh, B. Lynn, and H. Shacham, ―Short signatures from the weil pairing,β€– J. Cryptol., vol. 17, no. 4, pp. 297–319, Sep. 2004
    8. S. Buchegger and J. Y. L. Boudec, ―Performance analysis of the confidant protocol (cooperation of nodes: Fairness in dynamic adhoc networks),β€– in Proc. 3rd ACM Int. Symp. Mobile Ad Hoc Netw. Comput. Conf., 2002, pp. 226–236
    9. L. Buttyan and J. P. Hubaux, ―Stimulating cooperation in selforganizing mobile ad hoc networks,β€– ACM/Kluwer Mobile Netw. Appl., vol. 8, no. 5, pp. 579–592, Oct. 2003.
    10. J. Crowcroft, R. Gibbens, F. Kelly, and S. Ostring, ―Modelling incentives for collaboration in mobile ad hoc networks,β€– presented at the First Workshop Modeling Optimization Mobile, Ad Hoc Wireless Netw., Sophia Antipolis, France, 2003.

Recent Article