CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Reputation-based Incentive Framework for Mobile Ad Hoc Networks

by Vivek Richhariya, Praveen Kaushik
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 120 - Number 12
Year of Publication: 2015
Authors: Vivek Richhariya, Praveen Kaushik
10.5120/21277-4142

Vivek Richhariya, Praveen Kaushik . A Reputation-based Incentive Framework for Mobile Ad Hoc Networks. International Journal of Computer Applications. 120, 12 ( June 2015), 6-11. DOI=10.5120/21277-4142

@article{ 10.5120/21277-4142,
author = { Vivek Richhariya, Praveen Kaushik },
title = { A Reputation-based Incentive Framework for Mobile Ad Hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { June 2015 },
volume = { 120 },
number = { 12 },
month = { June },
year = { 2015 },
issn = { 0975-8887 },
pages = { 6-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume120/number12/21277-4142/ },
doi = { 10.5120/21277-4142 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:07:12.525990+05:30
%A Vivek Richhariya
%A Praveen Kaushik
%T A Reputation-based Incentive Framework for Mobile Ad Hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 120
%N 12
%P 6-11
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In mobile ad hoc networks (MANIT), nodes forward the packet to other with the help of intermediate nodes within the transmission range and as they are expected to cooperate to make the networks reliably. In ad hoc network, node may have limited resources. Due to this, some nodes (selfish node) may not to forward packets to save resources for their own use. To discourage such misbehaviour, we propose reputation-based incentive mechanism to motivate the selfish nodes to cooperate in order to packet forwarding. Incentive will be earned by the intermediate nodes which are responsible for forwarding the packet. In this paper, a cluster head will be used as reputation management of each node in the network. This paper highlights various views of cooperation enforcement mechanism and reliability. We perform an overall analysis of our paper by simulation using the network simulator (NS- 2) with the help of AODV protocol.

References
  1. C. E. Perkins, "Ad hoc Networking", Addison Wesley, 2001.
  2. Bing Wu, Jianmin Chen, Jie Wu, Mihaela Cardei, "A Survey on Attack and countermeasures in Mobile Ad Hoc Network", Springer 2006
  3. Qi Zhang and Dharma P. Agrawal, "Impact of Selfish Nodes on Route Discovery in Mobile Ad Hoc Networks", IEEE Communications Society, pp. 2914-2918, 2004.
  4. Matthias Hollick, Jens Schmitt, Christian seipl, (2004) ''On the Effect of Node Misbehaviour in Ad hoc Network" Proc. IEEE Conference on Communication, Vol 6, pp 3759– 3763.
  5. S. Buchegger and J-Y. Le Boudec, (2002) "Performance Analysis of the CONFIDANT Protocol:Cooperation Of Nodes, Fairness In Dynamic Ad-hoc Networks", Proc. of the IEEE/ACMSymposium on Mobile Ad Hoc Networking and Computing (MobiHOC).
  6. S. Bansal and M. Baker. "Observation-Based Cooperation Enforcement in Ad hoc Networks", July 2003. Available on: http://arxiv. org/pdf/cs. NI/0307012.
  7. P. Michiardi and R. Molva. Core: "A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks", In Proceedings of the 6th IFIP . Communications and Multimedia Security Conference, pages 107 121, Portorosz, Slovenia, September 2002.
  8. Khairul Azmi, Abu Bakar and James Irvine. " A Scheme for Detecting Selfish Nodes in MANET using OMNET++", 2010 Sixth International Conference on Wireless and Mobile Communications, pp 411-414, 2010.
  9. Marti, S. , Giuli, T. J. , Lai, K. , & Baker, M. (2000), "Mitigating routing misbehavior in mobile ad-hoc networks", Proceedings of the 6th International Conference on Mobile Computing and Networking (MobiCom), ISBN 1-58113- 197-6, pp. 255-265.
  10. P Das S. Perkins C. E. , Belding-Royer E. M. Ad-hoc on-demand distance vector (aodv) routing. RFC 3561, IETF Network Working Group, 2003.
  11. Perkins C and E. Royer, "Ad-hoc on-demand distance vector routing," in Proceedings of Second IEEE Workshop on Mobile Computing Systems and Applications, February1999, pp. 90–100.
  12. AODV homepage. http://moment. cs. ucsb. edu/aodv/aodv. html
  13. Schiller J. Mobile Communications. Addison Wesley, 2nd edition, 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Incentive scheme reputation ad hoc network

Powered by PhDFocusTM