100 JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010REFERENCESFigure 10: Impact <strong>of</strong> blackhole attack on End-to-End DelayV. CONCLUSIONIn this paper, we studied AODV <strong>in</strong> detail and theblackhole attack <strong>in</strong> AODV. We evaluate the effects <strong>of</strong>blackhole nodes on AODV <strong>in</strong> ad hoc networks. Wesimulate the blackhole behavior with the help <strong>of</strong> NetworkSimulator 2 and compared the performance <strong>of</strong>blackholeAODV with the orig<strong>in</strong>al AODV <strong>in</strong> terms <strong>of</strong>packet loss percentage. The simulation results show thatthe packet loss <strong>in</strong>creases <strong>in</strong> the network with a blackholenode. Simulation results also show that the throughput <strong>of</strong>the network is decreased with blackhole attack ascompared to without blackhole attack.. When the number<strong>of</strong> blackhole nodes <strong>in</strong>creases the throughput decreases.We observed that the End-to-end Delay withoutblackhole attack is slightly <strong>in</strong>creased as compared to theeffect <strong>of</strong> blackhole attack. The detection <strong>of</strong> blackhole <strong>in</strong>ad hoc networks is still to be a challeng<strong>in</strong>g taskACKNOWLEDGEMENTI would like to take the opportunity to thank peoplewho guided and supported me dur<strong>in</strong>g this process.Without their contributions, this project would not havebeen possible. I have a great pleasure <strong>in</strong> express<strong>in</strong>g mydeep sense <strong>of</strong> gratitude and <strong>in</strong>debtedness to Mr. JagpreetS<strong>in</strong>gh, Lecturer, Teg Bahadur Khalsa Institute <strong>of</strong>Eng<strong>in</strong>eer<strong>in</strong>g and Technology, Malout and Ms. Rajkumari,lecturer, University Institute <strong>of</strong> Eng<strong>in</strong>eer<strong>in</strong>g andTechnology, Panjab University, Chandigarh, mysupervisor for their cont<strong>in</strong>uous guidance and <strong>in</strong>valuablesuggestions at all the time dur<strong>in</strong>g the research work. Myspecial thanks to all my friends for be<strong>in</strong>g supportive <strong>in</strong>my hours <strong>of</strong> need. F<strong>in</strong>ally, I would not forget to thank myparents for their love and bless<strong>in</strong>gs that support andencouraged me at every moment I need. They were thefirst ones that <strong>in</strong>troduced the amaz<strong>in</strong>g world to me andencouraged me to explore the wonderful nature.[1] Latha Tamilselvan and Dr. V.Sankaranarayanan,“Solution to Prevent Rush<strong>in</strong>g Attack <strong>in</strong> Wireless Mobile Adhoc Networks”.[2] Latha Tamilselvan, Dr.V Sankaranarayanan, “Prevention <strong>of</strong>Blackhole Attack <strong>in</strong> MANET”. The 2 nd InternationalConference on Wireles Broadband and Ultra WidebandCommunications (AusWireless 2007) India, 2007 IEEE.[3] Mohammad O. Pervaiz, Mihaela Cardei, and Jie Wu,“Rout<strong>in</strong>g Security <strong>in</strong> Ad Hoc wireless Networks”, NetworkSecurity, 2005 Spr<strong>in</strong>ger.[4] Elizabeth M. Royer, and Chai-Keong Toh, “A Review <strong>of</strong>Current Rout<strong>in</strong>g Protocols for Ad Hoc Mobile WirelessNetworks,” IEEE Personal Communications, pp. 46-55,April 1999.[5] Satoshi Kurosawa, Hidehisa Nakayama, Nei Kato, AbbasJamalipour, and Yoshiaki Nemoto. “Detect<strong>in</strong>g BlackholeAttack on AODV based Mobile Ad hoc networks byDynamic Learn<strong>in</strong>g Method”. International <strong>Journal</strong> <strong>of</strong>Network Security, Vol.5, No.3, PP.338–346, Nov 2007.[6] ns-2 : http://www.isi.edu/nsnam/ns/[7] C. E. Perk<strong>in</strong>s and E. M. Royer, “Ad Hoc On-DemandDistance Vector Rout<strong>in</strong>g,” Proc. 2nd IEEE Wksp. MobileComp. Sys. and Apps., New Orleans, LA, Feb. 1999, pp.90–100.Anu Bala from Bhogpur (Jalandhar, India)and her date <strong>of</strong> birth is 22 nd August 1985. She isa ME (IT) student <strong>in</strong> Information Technologyat the University Institute <strong>of</strong> Eng<strong>in</strong>eer<strong>in</strong>g andTechnology, Panjab University, Chandigarh,India. She received her B.Tech (CSE) degreefrom Panjab Technical University, jalandhar,India <strong>in</strong> 2006. Her research <strong>in</strong>terests <strong>in</strong> the area <strong>of</strong> mobile adhoc networks, especially ad hoc network security. Her recentwork has focused on ad hoc rout<strong>in</strong>g protocol attacks.She has worked as Lecturer for one year at IITT college <strong>of</strong>engg., Pojewal, Punjab, India.Raj Kumari from chandigarh (India) and his date <strong>of</strong> birth is6 th June 1981. she received her M.Tech (IT) degree fromGNDU, Amritsar, India <strong>in</strong> 2006 and her B.Tech from PanjabTechnical University, Jalandhar, India <strong>in</strong> 2003.She has works as Lecture for one year at college <strong>of</strong> Engg.Tangori, India. She has been work<strong>in</strong>g <strong>in</strong> UIET, Chandigarh,India s<strong>in</strong>ce 2007Jagpreet S<strong>in</strong>gh from Malout (India) and his date <strong>of</strong> birth is5 th March 1983. He received his MS (S<strong>of</strong>tware System) degreefrom BITS Pilani, India and his B.Tech from Panjab TechnicalUniversity, Jalandhar, India. He has been engaged <strong>in</strong> researchon mobile adhoc network and he has enhanced algorithm <strong>of</strong>AODV protocol. He has been work<strong>in</strong>g <strong>in</strong> GTBIET, Malout,India s<strong>in</strong>ce 2003. Two <strong>of</strong> his papers has been published <strong>in</strong>National Conferences.1) Communication technology on UBI Quietestcomput<strong>in</strong>g2) Successful implementation <strong>of</strong> recruisiteimplementation <strong>of</strong> e-governance© 2010 ACADEMY PUBLISHER
JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010 101Copyright Protection <strong>of</strong> Gray Scale Images byWatermark<strong>in</strong>g Technique Us<strong>in</strong>g (N, N) SecretShar<strong>in</strong>g SchemeSushma YalamanchiliPr<strong>of</strong>essor & Head, Department <strong>of</strong> CSE,V.R.Siddhartha Eng<strong>in</strong>eer<strong>in</strong>g College, Vijayawada.Email: sushma_yalamanchili@yahoo.co.<strong>in</strong>M.Kameswara RaoLecturer, P.B.Siddhartha College, P.G.Centre, Vijayawada.Email: kamesh.manchiraju@gmail.comAbstract— S<strong>in</strong>ce the rise <strong>of</strong> the Internet one <strong>of</strong> the mostimportant factors <strong>of</strong> <strong>in</strong>formation technology andcommunication has been the security <strong>of</strong> <strong>in</strong>formation. Aspecial case <strong>of</strong> <strong>in</strong>formation hid<strong>in</strong>g is digital watermark<strong>in</strong>g.Digital watermark<strong>in</strong>g is the process <strong>of</strong> embedd<strong>in</strong>g<strong>in</strong>formation <strong>in</strong>to digital multimedia content such that the<strong>in</strong>formation (the watermark) can later be extracted ordetected for a variety <strong>of</strong> purposes <strong>in</strong>clud<strong>in</strong>g copy preventionand control. Among numerous cryptographic solutionsproposed <strong>in</strong> the past few years, secret shar<strong>in</strong>g schemes havebeen found sufficiently secure to facilitate distributed trustand shared control <strong>in</strong> various communication applications.In this paper, a new image watermark<strong>in</strong>g algorithm isdeveloped us<strong>in</strong>g (n,n) secret shar<strong>in</strong>g scheme for copyrightprotection. The proposed method embeds the copyrightimage <strong>in</strong>to orig<strong>in</strong>al image and is to be shared among nparticipants. Then the copyright image could be recoveredus<strong>in</strong>g simple XOR operations without any loss.Experimental simulations are provided us<strong>in</strong>g MATLAB 7.1to demonstrate the efficient performance <strong>of</strong> the developedtechnique <strong>in</strong> terms <strong>of</strong> reliability <strong>of</strong> watermark embedd<strong>in</strong>gand extraction. The scheme conta<strong>in</strong>s three phases: thecopyright image embedd<strong>in</strong>g phase, embedded image secretshar<strong>in</strong>g phase, copyright image extraction phase. Theexperimental results show that the proposed scheme canresist several attacks such as JPEG compression, resize andnoise addition.Index Terms— copyright protection, secret shar<strong>in</strong>g,watermark<strong>in</strong>g, steganography.I. INTRODUCTIONOn the Internet today it is possible to duplicate digital<strong>in</strong>formation a million-fold and distribute it over the entireworld <strong>in</strong> seconds. These issues worry creators <strong>of</strong><strong>in</strong>tellectual property to the po<strong>in</strong>t that they do not evenconsider to publish on the Internet. To solve the problem<strong>of</strong> publish<strong>in</strong>g digital images, researchers have come upwith digital image watermark<strong>in</strong>g [1]. Digitalwatermark<strong>in</strong>g is a method <strong>of</strong> embedd<strong>in</strong>g identify<strong>in</strong>g<strong>in</strong>formation <strong>in</strong> an image, <strong>in</strong> such a manner that it cannoteasily be removed .An application <strong>of</strong> watermark<strong>in</strong>g iscopyright control, <strong>in</strong> which an image owner seeks toprevent illegal copy<strong>in</strong>g <strong>of</strong> the image. A digital watermarkis a code that is embedded <strong>in</strong>side an image. It acts as adigital signature, giv<strong>in</strong>g the image a sense <strong>of</strong> ownershipor authenticity. Digital watermark<strong>in</strong>g <strong>of</strong> an image hasalso been proposed for the prevention <strong>of</strong> copy<strong>in</strong>g <strong>of</strong> animage by unauthorized persons.To a computer, an image is a collection <strong>of</strong> numbersthat constitute different light <strong>in</strong>tensities <strong>in</strong> different areas<strong>of</strong> the image [4]. This numeric representation forms agrid and the <strong>in</strong>dividual po<strong>in</strong>ts are referred to as pixels.Most images on the Internet consists <strong>of</strong> a rectangular map<strong>of</strong> the image’s pixels (represented as bits) where eachpixel is located and its colour [5]. Digital colour imagesare typically stored <strong>in</strong> 24-bit files and use the RGB colourmodel, also known as true colour [6]. All colourvariations for the pixels <strong>of</strong> a 24-bit image are derivedfrom three primary colours: red, green and blue, and eachprimary colour is represented by 8 bits [4].Secret shar<strong>in</strong>g [2] refers to method for distribut<strong>in</strong>g asecret amongst a group <strong>of</strong> participants, each <strong>of</strong> which isallocated a share <strong>of</strong> the secret. The secret can bereconstructed only when the shares are comb<strong>in</strong>edtogether; <strong>in</strong>dividual shares are <strong>of</strong> no use on their own.Secret image shar<strong>in</strong>g is a technique for protect<strong>in</strong>g imagesthat <strong>in</strong>volves the dispersion <strong>of</strong> the secret image <strong>in</strong>to manyshadow images. This endows the method with a highertolerance aga<strong>in</strong>st data corruption or loss than otherimage-protection mechanisms, such as encryption orsteganography.A secret kept <strong>in</strong> a s<strong>in</strong>gle <strong>in</strong>formation-carrier could beeasily lost or damaged. Secret shar<strong>in</strong>g (SS) schemes,called (n, n) schemes, have been proposed s<strong>in</strong>ce late1970s. To encode the secret <strong>in</strong>to n pieces (“shadows” or“shares”) that the pieces can be distributed to nparticipants at different locations. The secret can only bereconstructed from n pieces [2].II. PROPOSED METHODConsider an image A <strong>of</strong> NR ×NC. Each pixel <strong>of</strong> Acan take any one <strong>of</strong> c different colors or gray-levels.Image A is represented by an <strong>in</strong>teger matrix A:A = [aij ]NR×NC , where i = 1, 2, . . . , NR,j = 1, 2, . . . , Nc, and aij {0, 1, . . . , c − 1}.We have c=2 for a b<strong>in</strong>ary image, and c =256 for a grayscale image© 2010 ACADEMY PUBLISHERdoi:10.4304/jetwi.2.2.101-105