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

Different Approaches on Cooperation in Wireless Ad Hoc Networks

by Raju Barskar, Gulfishan Firdose Ahmed
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 28 - Number 3
Year of Publication: 2011
Authors: Raju Barskar, Gulfishan Firdose Ahmed
10.5120/3365-4647

Raju Barskar, Gulfishan Firdose Ahmed . Different Approaches on Cooperation in Wireless Ad Hoc Networks. International Journal of Computer Applications. 28, 3 ( August 2011), 36-41. DOI=10.5120/3365-4647

@article{ 10.5120/3365-4647,
author = { Raju Barskar, Gulfishan Firdose Ahmed },
title = { Different Approaches on Cooperation in Wireless Ad Hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { August 2011 },
volume = { 28 },
number = { 3 },
month = { August },
year = { 2011 },
issn = { 0975-8887 },
pages = { 36-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume28/number3/3365-4647/ },
doi = { 10.5120/3365-4647 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:13:49.634451+05:30
%A Raju Barskar
%A Gulfishan Firdose Ahmed
%T Different Approaches on Cooperation in Wireless Ad Hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 28
%N 3
%P 36-41
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Wireless Ad hoc Networks: is an interconnection of nodes which are mobile, have wireless links with temporary connections and without any centralized control. All this properties makes the network dynamic in nature. To communicate with each other over distance, nodes either can transmit directly or through intermediate nodes, which can relay the data to the destination, but such paths are contemporaneous in such networks. To improve the performance of such network, nodes must remain available to route and forward the data packets of other nodes. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios (complete cooperation and complete noncooperation) are inimical to the interests of a user. Mobile ad-hoc networking works properly only if the par- participating nodes cooperate in routing and forwarding. How-ever, it may be advantageous for individual nodes not to cooperate. In this paper, we consider selfish node behavior in ad hoc networks and discuss trust and many reputation mechanisms that will stimulate cooperation between nodes. In this paper, we address the problem of service availability in mobile ad-hoc WANs. We present a secure mechanism to stimulate end users to keep their devices turned on, to refrain from overloading the network, and to thwart tampering aimed at converting the device into a “selfish” one.

References
  1. S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad hoc Networks,” in Proceedings of The Sixth International Conference on Mobile Computing and Networking 2000, Boston, MA, Aug. 2000, pp-255-265.
  2. Djamel Djenouri. CERIST, Basic Software Laboratory. Algiers, Algeria “New Approach for Selfish Nodes Detection in Mobile Ad hoc Networks”, Sept. 2005, pp-288-294.
  3. Paul, K. Westhoff, D. Sch. of Inf. Technol., Indian Inst. of Technol., Mumbai, India; “Context Aware Detection of Selfish Nodes in DSR Based Ad-hoc Networks”, vol.1, Nov. 2002,pp-178-182.
  4. L. Buttyan and J. P. Hubaux, “Enforcing Service Availability in Mobile Ad-Hoc WANs,” Proc. of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHOC), Boston, MA, USA, August 2000, pp-87-96.
  5. S. Buchegger and J.-Y. L. Boudec, “Nodes bearing grudges: Towards routing security, fairness, and robustness in mobile ad hoc networks,” in 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, 2002, pp-403-410.
  6. Sheng Zhong, Jiang Chen, and Yang Richard Yang, Sprite: A simple, Cheat proof, Credit-based System for Mobile Ad Hoc Networks, in Proceedings of IEEE Infocom '03, San Francisco, CA, April 2003, pp-1987-1997.
  7. Haijin Yan Lowenthal, D. Dept. of Comput. Sci., Georgia Univ., Athens, GA, USA; “Towards Cooperation Fairness in mobile Ad hoc Networks”,march-2005, pp-2143-2148.
  8. S. Buchegger and J.-Y. L. Boudec, “Performance analysis of the CONFIDANT protocol: Cooperation of nodes - fairness in dynamic ad-hoc networks,” in Proceedings of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHOC). IEEE, June2002
  9. P. Michiardi and R. Molva. Core: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In IFIP Communication and Multimedia Security Conference 2002, Aug 2002.
  10. S. Bansal and M. Baker, “Observation-based cooperation enforcement in ad hoc networks”, 2003.
  11. Jiangyi Hu. Computer Science Department. Florida StateUniversity.January11, 2005 “Cooperation in Mobile Ad Hoc Networks”.
  12. Binmore, Ken G; “Game Theory A Very Short Introduction” Oxford University Press 2007
  13. Baron. “Game Theory an Introduction”, A. J. Willy & Sons, Inc. publication, 2007.
  14. V Srinivasan, P Nuggehalli, C.F. Chiasserini, “An Analytical Approach to the Study of Cooperation in Wireless Ad Hoc Networks”. IEEE Transactions on Wireless Communications March2005.
Index Terms

Computer Science
Information Sciences

Keywords

Cooperation reputation wireless ad hoc networks fairness robustness trust

Powered by PhDFocusTM