International Journal of Modern Education and Computer Science (IJMECS)
IJMECS Vol. 5, No. 6, 8 Jun. 2013
Cover page and Table of Contents: PDF (size: 289KB)
Performance Evaluation of Routing Protocol with Selfish Users in Realistic Environment
Full Text (PDF, 289KB), PP.49-55
Views: 0 Downloads: 0
Author(s)
Mansi Dua
1,*
Shailender Gupta
2
Bharat Bhushan
2
C.K. Nagpal
3
Index Terms
Ad-hoc network, Routing, Obstacles.
Abstract
Mobile Ad hoc Network (MANET) consists of wireless mobile nodes that can be set up any time at any place without the requirement of pre-requisite infrastructure. The nodes in these networks have several constraints such as battery power, processing capability and bandwidth. Moreover each node in MANET has to act as a relay node for others for the successful network operations. In an ideal environment in spite of above mentioned limitations, the node performs this community task faithfully but as in real world there exists nodes with selfish attitude also. Therefore, this paper is an effort to evaluate the efficacy of network with nodes having such behavior prevailing in realistic environment. Various researchers have evaluated the network performance in idealistic conditions but none has made an effort to evaluate it in practical condition such as in presence of obstacles. To make the scenario realistic different number, type and shape of obstacles were taken. The work was accomplished by designing a simulator in MATLAB-11.
Cite This Paper
Mansi Dua, Shailender Gupta, Bharat Bhushan, C. K. Nagpal, "Performance Evaluation of Routing Protocol with Selfish Users in Realistic Environment", International Journal of Modern Education and Computer Science (IJMECS), vol.5, no.6, pp.49-55, 2013. DOI:10.5815/ijmecs.2013.06.07
Reference
[1]Shailender Gupta ,Chirag Kumar ,C. K. Nagpal ,Bharat Bhushan ,” Performance Evaluation of MANET in Realistic Environment “,I.J.Modern Education and Computer Science, July 2012 in MECS.
[2]Joseph Macker and Scott Corson,”Mobile ad-hoc networks (MANET)”, http://www.ieft.org/procedings/01dec/183.htm,December 2001.
[3]Charles E.Perkins,”Mobile Ad-hoc Networks,” Addison – Wesley (2000).
[4]Giorgos Papastergiou, Ioannis Psaras , Vassilis Tsaoussidis," Deep-Space Transport Protocol: A Novel Transport Scheme for Space DTNs", Computer Communications Volume 32, Issue 16, 15 October 2009, Pages 1757–1767 , Elsevier.
[5]Shailender Gupta , C. K. Nagpal and Charu Singla ” IMPACT OF SELFISH NODE CONCENTRATION IN MANET S”, IJWMN Vol. 3, No. 2, April 2011.
[6]S. Marti, T. J. Giuli, K. Lai, M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proc. of MobiCom 2000, Boston, August 2000.
[7]L. Blazevic, L. Buttyan, S. Capkun, S. Giordano, J. P. Hubaux, J. Y. Le Boudec, “Self- Organization in Mobile Ad-Hoc Networks: the Approach of Terminodes,” IEEE Communications Magazine, Vol. 39, No. 6, June 2001.
[8]L. Buttyán, J.-P. Hubaux, “Nuglets: a Virtual Currency to Stimulate Cooperation in Self- Organized Mobile Ad Hoc Networks,” Technical report No. DSC/2001/001, Swiss Federal Institution of Technology, Lausanne, January 2001. http://icawww.epfl.ch/hubaux/.
[9]Levente Butty´an and Jean-Pierre Hubaux. Nuglets: a Virtual Currency to Stimulate Cooperation in Self-Organized Mobile Ad Hoc Networks. Technical Report DSC/2001/001, EPFL-DI-ICA, January 2001.
[10]Shailendra Gupta,C.K.Nagpal,Charu Singla,” Impact of Selfish Node Concentration in MANETs”, IJWMN,Vol. 3,No.2,April 2011.
[11]Levente Butty´an and Jean-Pierre Hubaux. Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks. ACM/Kluwer Mobile Networks and Applications, 8(5), October 2003.
[12]Michael Feeley, Norman Hutchinson, and Suprio Ray,"Realistic Mobility for Mobile Ad Hoc Network Simulation",I. Nikolaidis et al. (Eds.): ADHOC-NOW 2004, LNCS 3158, pp. 324–329, 2004.
[13]Cedric Gael AboueNze, Frederic Guinand and Yoann Pign,"Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs",arXiv:0911.0141v1 [cs.NI] 1 Nov 2009.
[14]Amit Jardosh, E. M. Belding-Royer, K. C. Almeroth, and S. Suri, "Real world Environment Models for Mobile Ad hoc Networks," IEEE Journal on Special Areas in Communications - Special Issue on Wireless Ad hoc Networks, vol. 23, pp. 622-632, 2005.
[15]P. Venkateswaran, Rahul Ghosh, Aritra Das, S.K. Sanyal, R. Nandi,"An Obstacle Based Realistic Ad-Hoc Mobility Model for Social Networks",JOURNAL OF NETWORKS, VOL. 1, NO. 2, JUNE 2006.
[16]P. Venkateswaran, Rahul Ghosh, Aritra Das, S.K. Sanyal, R. Nandi,"An Obstacle Based Realistic Ad-Hoc Mobility Model for Social Networks",JOURNAL OF NETWORKS, VOL. 1, NO. 2, JUNE 2006.
[17]Chirag Kumar, C.K. Nagpal, Bharat Bhushan, Shailender Gupta,"Reachability Analysis of Mobility Models under Idealistic and Realistic Environments", published in prceedings by springer,wimoa-2012,page no. 519.
[18]Li Feng,Qinghai Yang,Fenglin Fu,Kyung Sup Kwak,”Impact of node selfishness on the connectivity and path delay of Ad-hoc networks”,ICT Convergence(ICTC),2012,International Conference.
[19]Yongguang Zhang, Wenke Lee, and Yi-An Huang. Intrusion Detection Techniques for Mobile Wireless Networks. to appear in ACM Wireless Networks (WINET), 9, 2003. also available as http://www.wins.hrl.com/people/ygz/papers/winet03. pdf.
[20]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.
[21]Yongguang Zhang and Wenke Lee. Intrusion detection in wireless ad-hoc networks. In Mobile Computing and Networking, pages 275–283, 2000.