Journal of Emerging Technologies in Web Intelligence Contents

More documents

Recommendations

Info

84 JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010We run each simulation four times with different nodepause time varying from 15 to 30sec with a step intervalof 5 sec. The graphs are presented in results section.ResultsThe performance of proposed protocol is evaluated usingthe following metrics:Packet delivery ratio (Throughput): Packet deliveryfraction is the ratio between the number of packetsoriginated by the application layer CBR sources and thenumber of packets received by the CBR sinks at the finaldestinations. Packet delivery Ratio is higher for AODVwith Dominating Sets than that of conventional AODV(figure 3 & 7 )Number of Control Packets: The total number ofcontrol packets occurred by different nodes is less inAODV with Dominating Sets than that of conventionalAODV(figure 4 & 8).Number of Route requests: It is the number of controlpackets generated by all the nodes in the simulation. Thenumber of Route Request packets is less in AODV withDominating Sets (figure 2 & 6 ) compare to conventionalAODV.End-to-End Delay: The End-to-End Delay of AODVwith Dominating Sets is better when compared withconventional AODV (figure 5 & 9).Performance of AODV with Dominatin sets andAODV in the Terrain Dimensions (500, 500)RouteThroughputs inRequests(persecondsnodes)Comparision Route Requests in AODV and AODV withDominating sets700600500400300200100020 40 60 80 100 120 140 160No of NodesAodvAodvdomFig 2 Route Request packet ComparisonComparision of Throughputs in AODV and AODV withDominating sets14000120001000080006000400020000AodvdomAodv20 40 60 80 100 120 140 160No of NodesAODVAODVDOMAODVAODVDOMEnd-to-End Delayin secondsComparision of End-to-End Delay in AODV and AODVwith Dominating sets0.050.040.030.020.010Aodv1 2 3 4 5 6 7 8No of NodesAodvdomFig 5 End-to-End Delay in SecAODVAODVDOMPerformance of AODV with dominating sets andAODV in the Terrain (2000, 2000) up to 40 nodesRouteRequestpackets sentThroughputs(inControl Packetsseconds)Comparing Route Request packets sent in AODV andAODV with dominating sets2000Aodv15001000500010 15 20 25 30 35 40No of NodesAodvdomFig 6 Route Request packet ComparisionComparision of Throughputs in AODV and AODV withdominating sets80007000Aodvdom60005000400030002000Aodv1000010 15 20 25 30 35 40No of nodes2000150010005000Fig 7 Throughput comparisonComparision of CTRL Packets in AODV and AODV withDominating setsAodvAodvdom10 15 20 25 30 35 40No of nodesFig 8.Control Packets ComparisonAODVAODVDOMAODVAODVDOMAODVAODVDOMControl Packets800600400200Fig 3 Throughput comparisonComparision of Control Packets in AODV and AODV withDominating sets020 40 60 80 100 120 140 160No of NodesAodvAodvdomFig4.Control Packets ComparisonAODVAODVDOMEnd-to-End delay insecondsComparision of End-to-End Delay in AODV and AODVwith Dominant sets0.350.3Aodv0.250.2AODV0.15AODVDOM0.1Aodvdom0.05010 15 20 25 30 35 40No of nodesFig 9 End-to-End Delay in Sec© 2010 ACADEMY PUBLISHER
JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010 85V. CONCLUSIONS AND FUTURE WORKWe presented an enhanced dominant pruning approachthat allows pruning redundant broadcasts even more thanthe conventional dominant pruning heuristic. Redundantbroadcasts increase the number of packet collisions, andconsequently delay the response for RREQs in the routediscovery process. DP is shown to reduce the number ofbroadcast transmissions when compared to standard DP.Because DP requires the two-hop neighborhood todetermine the forwarder list, we built a neighbor protocolas part of AODV. By making the neighbor protocol partof AODV, the result is a more accurate view of the localtopology, and therefore more accurate is thedetermination of the forwarder list. We also proposed aAPDP algorithm which is an enhanced version of PDP.Here we have shown the performance comparison ofAODV with DP algorithm. Future scope of the work is tocompare to the performance of AODV with PDPalgorithm and compare the performance of both.REFERENCES[1] Brad Williams and Tracy Camp. Comparison ofbroadcasting techniques for mobile adhoc networks. InMobiHoc ’02: Proceedings of the 3rd ACM internationalsymposiumon mobile ad hoc networking & computing,pages 194–205. ACM Press, 2002.[2] C. Perkins. Ad-hoc on-demand distance vector routing. InProceedings of the IEEE workshop on mobile computingsystems and applications, pages 90–100, 1999.[3] Charles E. Perkins and Elizabeth M.Royer. Ad-hoc ondemanddistance vector routing. Technical report, SunMicro Systems Laboratories, Advacnced DevelopmenetGroup, USA.[4] David B Johnson and David A Maltz. Dynamic sourcerouting in ad hoc wireless networks.In Mobile Computing,volume 353, pages 153–179. Kluwer AcademicPublishers,1996.[5] Dipti Joshi, Sridhar Radhakrishnan, and ChandrasekheranNarayanan. A fast algorithm for generalized networklocation problems. In Proceedings of the ACM/SIGAPPsymposium on applied computing, pages 701–8, 1993[6] H. Lim and C. Kim. Flooding in wireless ad hoc networks.Computer Communications, 24(3–4):353–363, February2001[7] Jie Wu and Fei Dai. Broadcasting in ad hoc networks basedon self-pruning. In IEEE INFOCOM, pages 2240–2250,2003.[8] Jorge Nuevo, “A comprensible glomosim tutorial”,March4,2004http://appsrv.cse.cuhk.edu.hk\~hndai\research.[9] Katia Obraczka, Kumar Viswanath, and Gene Tsudik.Flooding for reliable multicast in multi-hop ad hocnetworks. Wireless Networks, 7(6):627–634, 2001.[10] Marco A. Spohn and J. J. Garcia-Luna-Aceves. Enhanceddominant pruning applied to the route discovery process ofon-demand routing protocols. In Proceedings of the 12thIEEE international conference on computercommunications and networks, pages 497–502, October2003[11] Mobile Ad Hoc Networking:Routing Protocol PerformanceIssues and Evaluation Considerations Request ForComments 2501 available at http://www.ietf.org[12] Ning.P. and Sun.K. How to misuse aodv: a case study ofinsider attacks against mobile ad-hoc routing protocols.Technical report, Comput. Sci. Dept., North Carolina StateUniv., Raleigh, NC, USA, 2003.[13] Peng-Jun Wan, Khaled M. Alzoubi, and Ophir Frieder.Distributed construction of connected dominating set inwireless ad hoc networks. In IEEE INFOCOM, pages1597–1604, June 2002.[14] Rajive Bagrodia. README GloMoSim Software.University of California, Los Angeles - Department ofComputer Science. Box 951596, 3532 Boelter Hall, LosAngeles-CA 90095-1596 / rajive@cs.ucla.edu.[15] Teresa W. Haynes, Stephen T. Hedetniemi, and Peter J.Slater, editors. Fundamentals of Domination in Graphs.Marcel Dekker, Inc., 1998.[16] Xiaoyan Hong, Kaixin Xu, and Mario Gerla. Scalablerouting protocols for mobile ad hoc networks. 2002.[17] Yu-Chee Tseng, Sze-Yao Ni, Yuh-Shyan Chen, and Jang-Ping Sheu. The broadcast storm problem in a mobile ad hocnetwork. Wireless Networks, 8:153–167, 2002. H. Lim andC. Kim. Flooding in wireless ad hoc networks. ComputerCommunications,24(3–4):353–363, February 2001-04-15).[18] Z. Haas. A new routing protocol for the reconfigurablewireless network. In Proceedingsof the IEEE internationalconference on universal personal communications, pages562–566, October 1997.[19] A Nagaraju , Dr S.Ramachandram “Adaptive PartialDominating Set Algorithm For Mobile Ad-Hoc Networks”, Presented in the international conference ACM,COMPUTE-09, Jan 9 th -11 th ,2009,Banglore.[20] J.Hass and M.R.Pearlman, “The Zone RoutingProtoco(ZRP) for Ad Hoc Networks,” draft-ietf-manetzone-zrp-02.txt,workin progress,June 1999[21] T.Clausen, P.Jacquet,A.Laouiti, P.Muhlethaler,A. Q andL.Viennot. Optimized link state routing protocol for adhocnetworks. In Proceedings of the IEEE internat multitopics conferences. 2001© 2010 ACADEMY PUBLISHER
Page 1 and 2: Journal of Emerging Technologies in
Page 3 and 4: JOURNAL OF EMERGING TECHNOLOGIES IN
Page 6 and 7: 82 JOURNAL OF EMERGING TECHNOLOGIES
Page 24 and 25: 100 JOURNAL OF EMERGING TECHNOLOGIE
Page 58 and 59:
134 JOURNAL OF EMERGING TECHNOLOGIE
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 81 and 82:
Aims and ScopeCall for Papers and S
show all

Journal of Emerging Technologies in Web Intelligence Contents

Create successful ePaper yourself

Delete template?

Save as template?