A Framework for Detection of Selfishness in Multihop Mobile Ad Hoc Networks

• Autorzy: Konorski J. , Orlikowski R.
• Języki publikacji: EN

Abstrakty

EN

The paper discusses the need for a fully-distributed selfishness detection mechanism dedicated for multihop wireless ad hoc networks which nodes may exhibit selfish forwarding behavior. The main contribution of this paper is an introduction to a novel approach for detecting and coping with the selfish nodes. Paper describes a new framework based on Dempster-Shafer theory-based selfishness detection framework (DST-SDF) with some mathematical background and simulation analysis.

Słowa kluczowe

EN

reputation system; selfish behavior; wireless ad hoc network

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2009
• Tom: nr 2
• Strony: 34--40
• Opis fizyczny: Bibliogr. 15 poz., rys.

Twórcy

autor

Konorski J.

autor

Orlikowski R.

• Gdańsk University of Technology, G. Narutowicza st 11/12, 80-952 Gdańsk, Poland,

Bibliografia

• [1] G. Shafer, A Mathematical Theory of Evidence. Princeton: Princeton University Press, 1976.
• [2] L. A. Zadeh, “A simple view of the Dempster-Shafer theory of evidence and its implication for the rule of combination”, AI Mag., no. 7, pp. 85–90, 1986.
• [3] L. Zhang, “Representation, independence, and combination of evidence in the Dempster-Shafer theory”, in Advances in the Dempster-Shafer Theory of Evidence, R. R. Yager, J. Kacprzyk, and M. Fedrizzi, Eds. New York: Wiley, 1994.
• [4] K. Sentz and S. Ferson, “Combination of evidence in Dempster-Shafer theory”, Tech. Rep. SAND2002-0835, New Mexico, Sandia National Laboratories, 2002.
• [5] L. Buttyan and J.-P. Hubaux, “Nuglets: a virtual currency to stimulate cooperation in self organized mobile ad hoc networks”, Tech. Rep. DSC/2001, EPFL, Lausanne, 2001.
• [6] S. Zhong, J. Chen, and R. Yang, “Sprite: a simple, cheatproof creditbased system for mobile ad hoc networks”, in Proc. IEEE Infocom’03 Conf., San Francisco, USA, 2003, pp. 1987–1997.
• [7] S. Buchegger and J.-Y. Le Boundec, “Performance analysis of the confidant protocol: cooperation of nodes – fairness in distributed ad-hoc networks”, in Proc. 3rd ACM Int. Symp. Mob. Ad Hoc Netw. Comp. MobiHoc 2002, Lausanne, Switzerland, 2002, pp. 226–236.
• [8] P. Michiardi and R. Molva, “CORE: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks”, in Proc. IFIP Commun. Multimed. Secur. Conf., Portoroz, Slovenia, 2002, pp. 107–121.
• [9] Q. He, D. Wu, and P. Khosla, “SORI: a secure and objective reputation-based incentive scheme for ad hoc networks”, in Proc. IEEE Wirel. Commun. Netw. Conf., Pittsburgh, USA, 2004, pp. 825–830.
• [10] S. Bansal and M. Baker, “Observation-based cooperation enforcement in ad hoc networks”, Tech. Rep. Arxiv preprint cs. NI/0307012, 2003.
• [11] T. M. Refaei, V. Srivastava, L. Dasilva, and M. Eltoweissy, “A reputation-based mechanism for isolating selfish nodes in ad hoc networks”, in Proc. Second Ann. Int. Conf. Mob. Ubiq. Syst. Netw. Serv. MobiQuitous’05, San Diego, USA, 2005, pp. 3–11.
• [12] J. Hu and M. Burmester, “LARS: a locally aware reputation system for mobile ad hoc networks”, in Proc. 44th Ann. South. Reg. Conf., Melbourne, USA, 2006, pp. 119–123.
• [13] D. B. Johnson, D. A. Maltz, and Y.-C. Hu, “The dynamic source routing protocol for mobile ad hoc networks (DSR), 2004 [On-line]. Available: http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-10.txt
• [14] J-Sim [Online]. Available: www.j-sim.org
• [15] J. Konorski and R. Orlikowski, “Distributed reputation system for multihop mobile ad hoc networks”, in Proc. 5th Polish-German Teletraf. Symp. PGTS’08, Berlin, Germany, 2008, pp. 161–167.