CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

M-CONFIDANT: A Multicast based Cooperation of Node Fairness in Dynamic Ad hoc Network

by Sarvesh Acharya, Gulshan Kumar, Vikas Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 73 - Number 19
Year of Publication: 2013
Authors: Sarvesh Acharya, Gulshan Kumar, Vikas Singh
10.5120/12996-0267

Sarvesh Acharya, Gulshan Kumar, Vikas Singh . M-CONFIDANT: A Multicast based Cooperation of Node Fairness in Dynamic Ad hoc Network. International Journal of Computer Applications. 73, 19 ( July 2013), 36-40. DOI=10.5120/12996-0267

@article{ 10.5120/12996-0267,
author = { Sarvesh Acharya, Gulshan Kumar, Vikas Singh },
title = { M-CONFIDANT: A Multicast based Cooperation of Node Fairness in Dynamic Ad hoc Network },
journal = { International Journal of Computer Applications },
issue_date = { July 2013 },
volume = { 73 },
number = { 19 },
month = { July },
year = { 2013 },
issn = { 0975-8887 },
pages = { 36-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume73/number19/12996-0267/ },
doi = { 10.5120/12996-0267 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:40:33.290408+05:30
%A Sarvesh Acharya
%A Gulshan Kumar
%A Vikas Singh
%T M-CONFIDANT: A Multicast based Cooperation of Node Fairness in Dynamic Ad hoc Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 73
%N 19
%P 36-40
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Mobile Ad-hoc Network (MANET) consists of many wireless mobile nodes that temporally constitute a dynamic infrastructure less network. To enable communication between nodes that do not have direct contact, each node must function as a wireless access point and potentially forward data traffic on behalf of the other nodes present in the network. Due to limitation of resources with these Mobile nodes the property of selfishness is exhibited. A technique system level based Cooperation of Node Fairness in Dynamic Ad hoc Network that promise to detect and nullify the effect of selfish nodes on the basis of monitoring, assigning reputation measure to every node and isolation of the detected misbehaving nodes. Previously, this scheme was implemented in GloMoSim simulator using unicast protocol and the idea is to integrate the CONFIDANT protocol with multicast protocol, so that the network performance can be boosted. In this paper, we suggest a M-CONFIDANT: A Multicast based Cooperation of Node Fairness in Dynamic Ad hoc Network. This scheme integrates a multicast based MAODV protocol with the CONFDIANT protocol previously integrated with DSR protocol.

References
  1. S. Buchegger and J. -Y. Le Boudec 2002. Performance analysis of the CONFIDANT protocol (cooperation of nodes: Fairness in dynamic ad-hoc networks). In J. Hubaux, J. J. Garcia Luna-Aceves, and D. Johnson, editors, Proceedings of the Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland, June 9-11, 2002, pages 226–236. ACM Press, June 2002.
  2. Shane Balfe, Po-Wah Yau and Kenneth G. Paterson. A Guide to Trust in Mobile Ad Hoc Networks
  3. Malamati Louta, Stylianos Kraounakis and Angelos Michalas. A survey on reputation-based cooperation enforcement schemes in wireless ad hoc networks.
  4. Jos´e Montero-Castillo and Esther Palomar 2011. Cooperation in Ad Hoc Network Security Services:Classification and Survey. In UBICOMM 2011: The Fifth International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, 2011.
  5. Royer, E. M. and Perkins, C. E. , 2000. Multicast Ad hoc On-Demand Distance Vector (MAODV) Routing. In IETF, Intemet Draft: draft- ietf-manet-maodv-00. txt, 2000.
  6. Yufang Zhu and Thomas Kunz 2004. MAODV Implementation for NS-2. 26. In Systems and Computing Engineering, Carleton University, Technical Report SCE-04-01, January 2004.
  7. Abeer Ghandar, Eman Shabaan and Zaky Fayed, 2011. Performance Analysis of Observation Based Cooperation Enforcement in Ad Hoc Networks. In IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 6, No 2, November 2011.
  8. Pietro Michiardi, Refik Molva, CORE: A COllaborative Reputation mechanism to enforce node cooperation in Mobile Ad Hoc Networks, IFIP CMS02, Communication and Multimedia Security Conference, September 2002
  9. Priyanka Goyal, Vinti Parmar and Rahul Rishi, 2011. MANET: Vulnerabilities, Challenges, Attacks, Application. In IJCEM International Journal of Computational Engineering & Management, Vol. 11, January 2011.
  10. Renu Dalal, Manju Khari and Yudhvir Singh, 2012. Different Ways to Achieve Trust in MANET. In International Journal on AdHoc Networking Systems (IJANS) Vol. 2, No. 2, April 2012.
  11. Ashok M. Kanthe, Dina Simunic, Ramjee Prasad, 2012. The Impact of Packet Drop Attack and Solution on Overall Performance of AODV in Mobile Ad–hoc Networks. In International Journal of Recent Technology and Engineering (IJRTE), Volume-2, Issue-2, December 2012.
  12. Qi He, Dapeng Wu and Pradeep Khosla, 2004. SORI: A Secure and Objective Reputation-based Incentive Scheme for Ad-hoc Networks.
Index Terms

Computer Science
Information Sciences

Keywords

Routing cooperation reputation mobile ad-hoc networks multicasting

Powered by PhDFocusTM