Achieving Confidentiality in Wireless Network using Dynamic Control Algorithm
Anurupa Mitra, Supriya Kajale, Rushikesh Shinde, Prof. Manisha Bharati
Student, Department of Computer Engineering, Indira College of Engineering and Management, Pune, India, India
Abstract
Large-scale ad-hoc networks are deployed in numerous application domains, and the data they collect are used in decision making for critical infrastructures. We consider the problem of resource allocation and control of multi-hop networks in which multiple source-destination pairs communicate confidential messages, to be kept confidential from the intermediate nodes. We act the problem as that of network service maximization, into which confidentiality is incorporated as an additional quality of service constraint. Data are streamed from multiple sources through intermediate processing nodes that aggregate information. In this paper, we propose a novel lightweight scheme to securely transmit data. The proposed technique relies on in-packet Bloom filters to encode data. We introduce efficient mechanisms for data verification and reconstruction at the base station. In addition, we extend the secure data scheme with process to detect packet drop attacks execute by malicious data forwarding nodes. We classify the proposed technique both analytically and empirically, and the results prove the effectiveness and efficiency of the lightweight secure data scheme in detecting packet forgery and loss attacks.
Keywords
How to cite
Anurupa Mitra, Supriya Kajale, Rushikesh Shinde, Prof. Manisha Bharati (2017). Achieving Confidentiality in Wireless Network using Dynamic Control Algorithm. IJAREST, 4(12), 51-56.
BibTeX
@article{ijarest2017A88027,
title={{Achieving Confidentiality in Wireless Network using Dynamic Control Algorithm}},
author={Anurupa Mitra and Supriya Kajale and Rushikesh Shinde and Prof. Manisha Bharati},
journal={IJAREST},
volume={4},
number={12},
pages={51-56},
year={2017}
}Published under an open-access licence. See copyright & licensing.