Abstract

This paper checks the correctness of our novel algorithm for secure, reliable and flexible transmission of big data in two-hop wireless networks using cooperative jamming scheme of attacker location unknown through Markovian process. Big data has to transmit in two-hop from source-to-relay and relay-to-destination node by deploying security in physical layer. Based on our novel algorithm, the nodes of the network can be identifiable, the probability value of the data absorbing nodes namely capture node C, non-capture node NC, eavesdropper node E, in each level depends upon the present level to the next level, the probability of transition between two nodes is same at all times in a given time slot to ensure more secure transmission of big data. In this paper, maximum probability for capture nodes is considered to justify the efficient transmission of big data through Markovian process.

Highlights

  • Wireless networks have become an indispensable part of our daily life, used in many applications where the amount of data is very massive and is called big data [2]

  • Based on probability value for capture node we want to classify the transmission as secure data transmission and unsecure data transmission

  • The novel secure transmission algorithm which we have proposed in [9] satisfies with the stochastic process in which the behavior of the system varies randomly with time and space for each end-to-end transmission of big data

Read more

Summary

INTRODUCTION

Wireless networks have become an indispensable part of our daily life, used in many applications where the amount of data is very massive and is called big data [2]. Security is a critical issue in wireless applications of big data, when people rely heavily on wireless networks for transmission of important/private information. The ability to share secret information reliably in the presence of eavesdroppers is extremely important in the environment of big data [8]. Security in physical layer is used to retain the everlasting security in big data as it prevents eavesdroppers and malicious nodes from capturing the data [11]. Security can be improved by cooperative networks by having the information content minimum to the eavesdropper nodes of the expected destination and having maximum to the relay node of the expected destination [6]. The recently proposed cooperative network technique is cooperative jamming to improve physical layer security in the presence of eavesdroppers [5]. We conclude our paper by experimental result verification for the proposed algorithm

OVERVIEW OF NOVEL SECURE ALGORITHM
Stochastic Process
DISCUSSION
EXPERIMENTAL RESULT VERIFICATION
Case I
Case II
Case III
CONCLUSION AND FUTURE WORK

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.