Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Find_S Algorithm: To Detect Node Behaviour in Ad Hoc Network


Affiliations
1 Assistant Professor, Department of IS&E, Jawaharlal Nehru National College of Engineering, Shivamogga, Karnataka, India
     

   Subscribe/Renew Journal


As humans have different behaviour good and bad. Some of the behaviour the human has kind, selfish, cooperative, uncooperative, gentle, soft hearted, back biting, jealous etc. Similarly, nodes in the Ad Hoc network have different behaviour like selfish nodes, regular nodes, malicious nodes etc. Transferring the information from the source node to the destination node via intermediate nodes is done using different routing algorithms. Routing algorithms find out the optimal path to reach the destination. They fail to identify the behaviour of the nodes when transferring the information. Identification of the nodes whether they are good or bad is a difficult task. In this paper different dataset having different behaviour are collected. Find_S algorithm is used to analyze the dataset and give the correct hypothesis as output. The hypothesis consists of different attributes like nature of the agent, energy level, type of agent, and finally, is the decision of the node.

Keywords

Dataset, Find_S Algorithm, Node Behaviour, Regular Node, Selfish Node
Subscription Login to verify subscription
User
Notifications
Font Size


  • Mohd. A. A. Al-Jaoufi, Y. Liu, Z.-J. Zhang, and L. Uden, “Study on selfish node incentive mechanism with a forward game node in wireless sensor networks,” International Journal of Antennas and Propagation, vol. 2017, 2017.
  • E. Hern´andez-Orallo, M. D. Serrat, J.-C. Cano, C. T. Calafate, and P. Manzoni, “Improving selfish node detection in MANETs using a collaborative watchdog,” IEEE Communications Letters, vol. 16, no. 5, pp. 642-645, May 2012, doi: 10.1109/ LCOMM.2012.030912.112482.
  • S. Buchegger, and J.-Y. Le Boudec, “Self-policing mobile ad-hoc networks by reputation systems,” in National Competence Center in Research on Mobile Information and Communication Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS).
  • Neenavath, and B. T. Krishna, “Selfish node detection IDSM based approach using individual master cluster node,” in 2nd International Conference on Inventive Systems and Control, 2018.
  • S. Gupta, C. K. Nagpal, and C. Singla, “Impact of selfish node concentration,” International Journal of Wireless & Mobile Networks, vol. 3, no. 2, Apr. 2011.
  • N. K. Gupta, A. K. Sharma, and A. Gupta, “Selfish behaviour prevention and detection in mobile adhoc network using intrusion prevention system (IPS),” International Journal of Research Review in Engineering Science and Technology, vol. 1, no. 2, pp. 31-34, Sep. 2012.
  • A. Al Sharah, Mohd. Alhaj, and Mohd. Hassan, “Selfish dynamic punishment scheme: Misbehavior detection in MANETs using cooperative repeated game,” International Journal of Computer Science and Network Security, vol. 20, no. 3, pp. 158-173, Mar. 2020.
  • V. U. Raut, and M. S. Mahindrakar, “A comprehensive survey on intrusion detection in MANET,” International Journal of Information Technology and Knowledge Management, vol. 2, no. 2, pp. 305-310, Jul.-Dec. 2010.
  • S. Yi, P. Naldurg, and R. Kravets, “Security-aware ad hoc routing for wireless networks,” in Proceedings of ACM MOBIHOC, Oct. 2001, pp. 299-302.
  • Y.-C. Hu, D. B. Johnson, and A. Perrig, “SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks,” in Proceedings of the 4th IEEE Workshop on Mobile Computing Systems and Applications, Callicoon, NY, Jun. 2002, pp. 3-13.
  • K. Sanzgiti, B. Dahill, B. N. Levine, L. Y. Clay, S. Elizabeth, and M. Belding-Royer, “A secure routing
  • protocol for ad hoc networks,” in Proceedings of the 10th IEEE International Conference on Network Protocols (ICNP’ 02), Nov. 2002, pp. 78-87.
  • Z. Alfawaer, and S. Al Zoubi, “A proposed security subsystem for ad hoc networks,” International Forum
  • on Computer Science Technology and Applications, IEEE, 2009.

Abstract Views: 174

PDF Views: 0




  • Find_S Algorithm: To Detect Node Behaviour in Ad Hoc Network

Abstract Views: 174  |  PDF Views: 0

Authors

Samara Mubeen
Assistant Professor, Department of IS&E, Jawaharlal Nehru National College of Engineering, Shivamogga, Karnataka, India

Abstract


As humans have different behaviour good and bad. Some of the behaviour the human has kind, selfish, cooperative, uncooperative, gentle, soft hearted, back biting, jealous etc. Similarly, nodes in the Ad Hoc network have different behaviour like selfish nodes, regular nodes, malicious nodes etc. Transferring the information from the source node to the destination node via intermediate nodes is done using different routing algorithms. Routing algorithms find out the optimal path to reach the destination. They fail to identify the behaviour of the nodes when transferring the information. Identification of the nodes whether they are good or bad is a difficult task. In this paper different dataset having different behaviour are collected. Find_S algorithm is used to analyze the dataset and give the correct hypothesis as output. The hypothesis consists of different attributes like nature of the agent, energy level, type of agent, and finally, is the decision of the node.

Keywords


Dataset, Find_S Algorithm, Node Behaviour, Regular Node, Selfish Node

References