Markovian Process and Novel Secure Algorithm for Big Data in Two-Hop Wireless Networks

  • Thiagarajan K
  • Saranya K
  • Veeraiah A
  • et al.
Citations of this article
Mendeley users who have this article in their library.


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.




Thiagarajan, K., Saranya, K., Veeraiah, A., & Sudha, B. (2015). Markovian Process and Novel Secure Algorithm for Big Data in Two-Hop Wireless Networks. International Journal of Advanced Computer Science and Applications, 6(6).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free