Providing Security to the Neighbouring Nodes in the Data Link Layer using Pseudo Random with RSA Algorithm

N. Poornima*, M.Ganesh Karthik**
* PG Scholar, Department of Computer Science and Engineering, Sree Vidyanikethan Engineering College, JNTU Anantapur, Tirupati, India.
** Assistant Professor, Department of Computer Science and Engineering, Sree Vidyanikethan Engineering College, JNTU Anantapur, Tirupati, India.
Periodicity:August - October'2015
DOI : https://doi.org/10.26634/jmt.2.3.5951

Abstract

Mobile adhoc networks are a gathering of mobile nodes that communicate through a wireless channel without any unchanging infrastructure such as an access point or a mobile base station. In this network, every node transmits data from the forwarding packets to its neighboring nodes. Some nodes may not participate in forwarding the packets for the reduction in its resources. The presence of selfish behavior among the nodes may lead to network partition and makes a major harmful impact in the network operation. To avoid such conditions, selfish node inference is essential. To overcome this problem some techniques like, a credit based technique, reputation based technique, Record and Trust Based Detection techniques (RTBD) and so on, have been used. The proposed model provides security to the neighbor nodes by using pseudo random number generation using RSA algorithm, to avoid the neighboring node from being compromised by the selfish node. It significantly improves the performance metrics such as, packet delivery ratio, energy, and routing overhead.

Keywords

Mobile Adhoc Network (MANET), Selfish Node, Identifying, Security, Record and Trust based Detection Techniques (RTBD), Pseudo Random Number with RSA Algorithm.

How to Cite this Article?

Poornima, N., and Karthik, M.G. (2015). Providing Security to the Neighbouring Nodes in the Data Link Layer using Pseudo Random with RSA Algorithm. i-manager’s Journal on Mobile Applications and Technologies, 2(3), 30-35. https://doi.org/10.26634/jmt.2.3.5951

References

[1]. Jebakumar Mohan Singh Pappaji Josh Kumar, Kathirvel, Namaskaram Kirubakaran, Ayyaswamy Perumal Sivaraman and Muthusam Subramanian, (2015). “A unified approach for detecting and eliminating selfish nodes in MANETs using TBUT”. EURASIP Journal on Communications and Networking, Vol. 143, pp. 1-11.
[2]. K. Pazhanisamy, and Lathaparthiban, (2014). “PRN using RSA Algorithm for Secure Routed Creation and Data Transfer in MANETs”. International Journal of Engineering and Technology (IJET), ISSN : 0975-4024, Vol. 6, pp. 2.
[3]. Kaur Sharndeep, and Gupta Anuj, (2014). “A review on different secure routing protocols and security attacks in mobile adhoc networks”. International Journal of Advanced Engineering Technology, E-ISSN 0976-3945, pp.01-05.
[4]. Senthilkumar Subramanian, William Johnson and Karthikeyan Subramanian, (2014). “A distributed framework for detecting selfish nodes in MANET using Record and Trust-Based Detection (RTBD) technique”. Wireless Communications and Networking, Vol. 205, pp.1-10.
[5]. Mangesh M. Ghonge and P. M. Jawandhiya, (2015). “Survey on Selfish Node Detection System in MANETs”. International Journal of Research in Advent Technology, E-ISSN: 2321-9637, Vol. 3, No. 8.
[6]. K. Vinoth Kumar, and A. Rajaram, (2014). “An Efficient Security Aware Routing Protocol for Mobile Ad-Hoc Networks”. IJCSNS International Journal of Computer Science and Network Security, Vol.14, No. 12.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.