CFP last date
28 May 2025
Call for Paper
June Edition
CAE solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 28 May 2025

Submit your paper
Know more
The week's pick
Responsive image
Property (Land) Registration Management Using Blockchain in Nigeria

A. Festus Osuolale Ojebiyi David-Daniel Seriki Oluwasogo
Random Articles
Reseach Article

Optimized Routing by Excluding Selfish Nodes for MANET

by Smita Rukhande, Prasanna Shete
journal cover thumbnail

Communications on Applied Electronics
Foundation of Computer Science (FCS), NY, USA
Volume 3 - Number 5
Year of Publication: 2015
Authors: Smita Rukhande, Prasanna Shete
10.5120/cae2015651951

Smita Rukhande, Prasanna Shete . Optimized Routing by Excluding Selfish Nodes for MANET. Communications on Applied Electronics. 3, 5 ( November 2015), 43-49. DOI=10.5120/cae2015651951

@article{ 10.5120/cae2015651951,
author = { Smita Rukhande, Prasanna Shete },
title = { Optimized Routing by Excluding Selfish Nodes for MANET },
journal = { Communications on Applied Electronics },
issue_date = { November 2015 },
volume = { 3 },
number = { 5 },
month = { November },
year = { 2015 },
issn = { 2394-4714 },
pages = { 43-49 },
numpages = {9},
url = { https://www.caeaccess.org/archives/volume3/number5/466-2015651951/ },
doi = { 10.5120/cae2015651951 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-09-04T19:44:03.114029+05:30
%A Smita Rukhande
%A Prasanna Shete
%T Optimized Routing by Excluding Selfish Nodes for MANET
%J Communications on Applied Electronics
%@ 2394-4714
%V 3
%N 5
%P 43-49
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Mobile nodes in MANET’s are free to move randomly. Therefore, the network topology may change rapidly. Routing protocols for MANET are used for delivery of data packets from source to the desired destination. Routing protocols AODV are also designed based on the assumption that all the participating nodes are fully cooperative. However, due to the scarcity of available battery, node misbehaviors may exist. One such routing misbehaviors is that some nodes may be selfish as they take assistance of other nodes in route discovery and maintenance process, but refuse to forward the packet in order to save its resources. To solve this problem we propose a selfish node detection algorithm SIAODV that finds selfish node and calculates risk factor to find the optimum path (minimum risk path) for data forwarding. Most of the existing work focused on identification of selfish nodes but not on the selection of optimum path (minimum risk path) for data forwarding because shortest path may not be suitable in all the cases. The proposed solution presents a technique that identifies selfish nodes and finds the minimum risk path for data forwarding in Ad hoc On-demand Distance Vector (AODV) routing protocol for MANETs.

References
  1. S. Corson and J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations” RFC 2501, January 1999.
  2. Shin Yokoyama, Yoshikazu Nakane, Osamu Takahashi, Eiichi Miyamoto, “Evaluation of the Impact of Selfish Nodes in Ad-Hoc Networks and Detection and Countermeasure Methods” 7th International Conference on Mobile Data Management, IEEE 2006.
  3. L. Buttyan and J.P. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks,” ACM/KUler Mobile Networks and Applications, Vol. 8 No. 5 2003
  4. S. Zhong, J. Chen and Y. R. Yang, “Sprite: A Simple Cheat-Proof, Credit Based System for Mobile Ad hoc Networks”, Proc. INFOCOM, Mar-Apr 2003.
  5. Jae-Ho Choi, Kyn-Sun Shim, SangKeun Lee and Kun-Lung Wu, “Handling Selfishness in Replica Allocation over a Mobile Ad-Hoc Network”, IEEE Transaction on Mobile Computing, February 2012.
  6. Sergio Marti, T.J. Giuli, Kevin Lai, and Mary Baker “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks”, ACM 2000.
  7. Sonja Buchegger, Jean-Yves Le Boudec, “Performance Analysis of the CONFIDANT Protocol (Cooperation Of Nodes: Fairness In Dynamic Ad-Hoc Networks)” ACM June 2002.
  8. Tiranuch Anantvalee and Jie, “Reputation-Based System for Encouraging the Cooperation of Nodes in Mobile Ad Hoc Networks” , 2007 IEEE
  9. S. Bansal and M. Baker, “Observation-Based Cooperation Enforcement in Ad Hoc Networks”, Research Report NI/0307012, Stanford University, 2003.
  10. Saloua Chettibi, Salim Chikhi, “An Adaptive Energy-Aware Routing Protocol for MANETs Using The SARSA Reinforcement Learning Algorithm”, 978-1-4673-1727 ©2013 IEEE.
  11. Shivashankar, Hosahalli Narayanagowda Suresh, Golla Varaprasad, And Guruswamy Jayanthi, “Designing Energy Routing Protocol With Power Consumption Optimization in MANET”, IEEE Transactions on emerging topics in computing, volume 2, no. 2, June 2014.
  12. Tanmoy Kanti, Halder, Chandreyee Chowdhury, Sarmistha Neogy, “Power Aware AODV Routing Protocol for MANET”, 978-1-4799-4363-0/14 2014 IEEE.
  13. Xu Zhen, Xiao Juan , “Energy-aware and Delay-aware QoS Routing in Mobile Ad-Hoc Networks”, 978-1-4673-1697-2 2012 IEEE and ICCP 2012 Proceeding.
  14. R. Sutton and A. Barto, "Reinforcement leaming," MIT Press, Cambridge, 1998.
  15. C. E. Perkins and E. M. Royer, “Ad Hoc On Demand Distance Vector (AODV) Routing”, Proceedings of 2nd IEEE Workshop on Mobile Computing Systems and Applications, February 1999.
  16. Wu, Lien-Wen, and Rui-Feng Yu. "A threshold-based method for selfish nodes detection in MANET." Computer Symposium (ICS), 2010 International. IEEE, 2010.
Index Terms

Computer Science
Information Sciences

Keywords

Mobile Ad-Hoc Networks (MANET) Selfish nodes Ad-Hoc on Demand Distance Vector Routing Protocol (AODV) RREQ.

Powered by PhDFocusTM