Markovian Process and Novel Secure Algorithm for Big Data in Two-Hop Wireless Networks
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2015, Vol 6, Issue 6
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.
Authors and Affiliations
K. Thiagarajan, A. Veeraiah, B. Sudha
Project Management Metamodel Construction Regarding IT Departments
Given the fast technological progress, the need for project management continues to grow in terms of methodology and new concepts. In this article, we will build a framework of generating a metamodel that we will apply o...
Robust Facial Expression Recognition via Sparse Representation and Multiple Gabor filters
Facial expressions recognition plays important role in human communication. It has become one of the most challenging tasks in the pattern recognition field. It has many applications such as: human computer interaction,...
Development of a Mobile GIS Property Mapping Application using Mobile Cloud Computing
This study presents the development of a mobile GIS Property mapping application for use by local authorities in developing countries. Attempts to develop property mapping applications especially in developing countries...
Skip List Data Structure Based New Searching Algorithm and Its Applications: Priority Search
Our new algorithm, priority search, was created with the help of skip list data structure and algorithms. Skip list data structure consists of linked lists formed in layers, which were linked in a pyramidal way. The time...
An Algorithm for Solving Natural Language Query Execution Problems on Relational Databases
There continues to be an increased need for non-experts interaction with databases. This is essential in their quest to make appropriate business decisions. Researchers have, over the years, continued to find a methodolo...