IOSR Journal of Computer Engineering (IOSR-JCE)

Volume 12- Issue 3

Paper Type : Research Paper
Title : Handoff Management protocols MIPV6 and HMIPV6 Comparative analysis in 4G wireless networks
Country : India
Authors : Sonali Chavan, Vanita Mane
: 10.9790/0661-1230105      logo

Abstract: With the increasing demands for new data and real-time services, wireless networks should support calls with different traffic characteristics and different Quality of Service (QoS) guarantees. Instead of developing a new uniform standard for all wireless communications systems, 4G communication networks strive to seamlessly integrate various existing wireless communication technologies. IP has been recognized to be the de facto protocol for next-generation integrated wireless. In this paper we discuss different types of protocol for handoff management in 4G. Mobile IPv6, Hierarchical Mobile IPv6 and their comparative study and analysis.

Keywords: 4G networks, Handoff management, Handoff latency, HMIPV6, MIPV6

[1] Ibrahim Al-Surmi, Mohamed Othman, Borhanuddin Mohd Ali, "Mobility management for IP-based next generation mobile networks: Review, challenge and perspective", ELSEVIER Journal of Network and Computer Applications 35, 2012.

[2] C. Makaya and S. Pierre, "An Analytical Framework for Performance Evaluation of IPv6-Based mobility Management Protocols", IEEE Transactions on Wireless Communications, vol. 7, no. 3, pp. 972–983, March 2008.

[3] Xavier Pérez Costa, Ralf Schmitz, Hannes Hartenstein, Marco Liebsch, "A MIPv6, FMIPv6 and HMIPv6 handover latency study: analytical approach"

[4] P Deepika H1, Nilakshee R2 and Bhavana A3," Handover in next generation networks - challenges and solution", World Journal of Science and Technology 2012, 2(4):89-92ISSN: 2231 – 2587.

[5] C. Makaya and S. Pierre, "An Analytical Framework for Performance Evaluation of IPv6-Based mobility Management Protocols", IEEE Transactions on Wireless Communications, vol. 7, no. 3, pp. 972–983, March 2008.

[6] Jong-Hyouk Lee, Jean-Marie Bonnin, Ilsun You, Tai-Myoung Chung, "Comparative Handover Performance Analysis of IPv6 Mobility Management Protocols", IEEE Transactions On Industrial Electronics, 2012.

[7] Nguyen Van Hanh , Soonghwan Ro, Jungkwan Ryu, "Simplified fast handover in mobile IPv6 networks", ELSEVIER Computer Communications 31, 2008.

[8] Xavier P´erez-Costaa Marc Torrent-Moreno, "A Performance Comparison of Mobile IPv6, Hierarchical Mobile IPv6, Fast Handovers for Mobile IPv6 and their Combination". Mobile Computing and Communications Review, Volume 7, Number 4

[9] Archan Misra, Subir Das, "IDMP-based FAST HANDOFFS AND PAGING INIP-BASED CELLULAR NETWORKS" 2001 Telcordia Technologies Inc. and the University of Texas at

[10] Arlington ROSLI SALLEH and XICHUN LI "HANDOFF TECHNIQUES FOR 4G MOBILE WIRELESS INTERNET "3rd International Conference: Sciences of Electronic, Technologies of Information and Telecommunications March 27-31, 2005 – TUNISIA

Paper Type : Research Paper
Title : Skeletal Bone Age Analysis Using Emroi Technique
Country : India
Authors : Dr. Shubhangi D. C, Sweta
: 10.9790/0661-1230613      logo

Abstract: Bones are calcified connective tissue forming the major portion of the skeleton of most vertebrates. There are about 206 bones in our body and contains more calcium. Bones begin to develop before birth. From the moment of birth until the time one has grown up, bones go through a set a characteristic changes. Therefore the skeletal maturity, or bone age, can be estimated from radiographs of specific bones in the human body. Children who grow exceptionally slow or fast are often examined by making a radiograph of their left hand and wrist. The aim of this work is to develop a system for skeletal bone age estimation using region of extraction. By analyzing left hand x-ray image, the feature extracted are CROI(Carpal ROI), EMROI (Ephiphysial/Metaphysial ROI),using discrete wavelet transformation, ISEF edge detector, energy based segmentation, Jacobi method, cell full and vertex full method. Extracted features are classified using k-mean classifier. Results obtained on a sample of 24 X-rays are discussed. The systems were studied and their performances were compared by various other methods.

Keywords - Bone age assessment, CROI, EMROI, Jacobi method, TW2 method.

[1] D. Giordano, R. Leonardi, F. Maiorana, G. Scarciofalo, and C. Spampinato: "Epiphysis and Metaphysis Extraction and Classification by Adaptive Thresholding and DoG Filtering for Automated Skeletal Bone Age Analysis" Proceedings of the 29th Annual International Conference of the IEEE EMBS Cité Internationale, Lyon, France August 23-26, 2007.

[2] P. Thangam, K. Thanushkodi ,T. V. Mahendiran: "Comparative Study of Skeletal Bone Age Assessment Approaches using Partitioning Technique"International Journal of Computer Applications (0975 – 8887) Volume 45– No.18, May 2012.

[3] N. Olarte L, A. Rubiano F, A. Mejía F: "Comparison of Valuation Techniques for Bone Age Assessment" World Academy of Science, Engineering and Technology 68 2012.

[4] P.Thangam, T.V.Mahendiran and K. Thanushkodi: "Skeletal Bone Age Assessment – Research Directions" Review Article Journal of Engineering Science and Technology Review 5 (1) (2012) 90 – 96.

[5] P. Thangam,K. Thanushkodi,&T. V. Mahendiran: "Computerized Convex Hull Method of Skeletal Bone Age Assessment from Carpal Bones" European Journal of Scientific Research ISSN 1450-216X Vol.70 No.3 (2012), pp. 334-344.

Paper Type : Research Paper
Title : Game Theory Approach for Identity Crime Detection
Country : India
Authors : J. R. Jayapriya, A. Karthikeyan
: 10.9790/0661-1231419      logo

Abstract: To present game theory approach to detect identity crimes. Improve the adaptability of identity crime detection systems to real time application. Time constraints on the reactive time of the detection and fraud events need to be minimized. Identity crime has major thrust in credit application. Existing work presented multilayered detection system based on two layers named as Communal detection and Spike detection. Dynamic Time Warping algorithm is applied to minimize the time constraints on detecting fraudulent identity usage and reaction time. Performance analysis is carried out on CD and SD with real credit applications. Experiment is conducted on real time credit card application using UCI repository data sets with synthetic and real data sets.

Keywords - Data mining-based fraud detection, security, and data stream mining, and anomaly detection.

[1] Clifton Phua, Member, IEEE, Kate Smith Miles, Senior Member IEEE, Vincent Cheng- Siong Lee, and Ross Gayler"ResilientIdentity Crime Detection", Ieee Transaction On Knowledge And Data ENGINEERING(references)A. Bifet and R. Kirkby "Massive Online Analysis, Technical Manual, Univ. of Waikato, 2009.
[2] R. Bolton and D. Hand, "Unsupervised Profiling Methods for Fraud Detection," Statistical Science, vol. 17, no. 3, pp. 235-255, 2001.
[3] P. Brockett, R. Derrig, L. Golden, A. Levine, and M. Alpert, "Fraud Classification Using Principal Component Analysis of RIDITs," The J. Risk and Insurance, vol. 69, no. 3, pp. 341-371, 2002, doi: 10.1111/1539-6975.00027.
[4] R. Caruana and A. Niculescu-Mizil, "Data Mining in Metric Space: An empirical Analysis of Supervised
[5] Learning Performance Criteria," Proc. 10th ACM SIGKDD Int'l Conf. Knowledge discovery and Data Mining (KDD '04), 2004, doi: 10.1145/1014052.1014063.
[6] Exper Detect: Application Fraud Prevention System, Whitepaper, experian_detect.pdf, 2008.
[7] T. Fawcett, "An Introduction to ROC Analysis," Pattern Recognition Letters, vol. 27, pp. 861-874, 2006, Doi: 10.1016/j .patrec. 2005.10.010.

Paper Type : Research Paper
Title : Enhancing a Dynamic user Authentication scheme over Brute Force and Dictionary attacks
Country : India
Authors : A. Sai Kumar, P. Subhadra
: 10.9790/0661-1232024      logo

Abstract: The most universal computer authentication method is to use alpha numerical user names and passwords. This technique has been shown to have significant drawbacks. For example, users tend to pick passwords that can be simply guessed. Conversely, if a password is stiff to guess, then it is often tough to memorize. To tackle this setback, some researchers have urbanized authentication methods that use pictures as passwords. In this paper, we accomplish complete assessment of the obtainable graphical password techniques. We classify these techniques into two categories: recognition-based and recall based approaches. We discuss the strengths and boundaries of every scheme and mention the future study directions in this area. In this paper, we are conducting widespread assessment of existing graphical image password authentication technique. Also we are here proposing a new technique for graphical authentication moving towards rather advance we have been added some features like sending text to registered number and as well as registered email ids. so, in this way security is going to be increase more and more. For generating sms we are going to use some embedded devices like gsm modem. In this way we are going to increase the authentication of our application.

Index terms : Online password secure attacks , brute force and dictionary attacks, password collections, ATTs.

[1] B. Pinkas and T. Sander, "Securing Passwords against Dictionary Attacks," Proc. ACM Conf. Computer and Comm. Security (CCS '02), pp. 161-170, Nov. 2002.

[2], "Important Information Distributed SSH Brute Force Attacks," SANS Internet Storm Center Handler's Diary, June 2010,pp250-254.

[3] Mansour Alsaleh, Mohammad Mannan, and P.C. van Oorschot, "Revisiting Defenses against Large-Scale Online Password Guessing Attack", feb.2012,pp.140-154

[4] M. Naor, Verification of a human in the loop, or Identification via the Turing test, Manuscript (1996). human_abs.html

[5] The CAPTCHA Project.



Paper Type : Research Paper
Title : An Efficient Modified Common Neighbor Approach for Link Prediction in Social Networks
Country : India
Authors : Abhisek Chaturvedi, Tapodhir Acharjee
: 10.9790/0661-1232534      logo

Abstract: Link prediction in social networks aims at estimating the likelihood of the appearance of a new link between two nodes, based on the existing links and the attributes of the nodes. Many methods for link prediction problem in social networks have been proposed in literature. We especially analyze the shortcomings of common neighbor leading method. Accordingly we generate a new modified common neighbor approach for link prediction in social networks. Our approach efficiently works under the integrated analysis of features along with topological structure of a social network. As a co-authorship network is a true social network, we have considered the co-authorship networks for verifying the effectiveness of the existing leading methods as well as our proposed link prediction method. We have implemented the leading methods as well as our proposed method on two different data domains of co-authorship networks obtained from author lists of papers at five sections of Physics e-Print arXiv, In the first data domain, the papers in the periods (1994 – 1996) and (1997 – 1999) are taken as the training set and testing set respectively. Similarly the papers in the periods (2007 – 2009) and (2010 – 2012) are taken as the training set and testing set for the second data domain. Experimental results show that all the methods are found to perform much better over the random predictor. Again we find that our modified common neighbor approach outperforms over all the existing leading methods considered.

Keywords: co-authorship networks, common neighbor, modified common neighbor approach, link prediction, random predictor

[1] Salton G. and McGill M. J., Introduction to Model Information Retrieval (McGraw-Hill, Auckland) 1983.

[2] Zhou T., Ren J., Medo M. and Zhang Y.C., Bipartite network projection and personnel recommendation, Phys.Rev. E, 76 (2007) 046115.

[3] Zhou T., Jiang L.L., Su R.Q. and Zhang Y.C., Effect of initial configuration on network-based recommendation, EPL 81 (2008) 58004.

[4] Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of the twelfth international conference on Information and Knowledge Management, pp. 556-559.ACM Press, New York (2003).

[5] Liben-Nowell D. and Kleinberg J., J. Am. Soc. Inf.Sci. & Technol., 58 (2007) 1019.

[6] Xiaoming Liu, Johan Bollen, Michael Nelson, Herbert Van De Sompel. Co-authorship networks in digital library research community, Journal of Information Processing and Management, volume 41, issue 6, 2005.

[7] Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, Mohammed Zaki. Link Prediction Using Supervised Learning, In Proc. of SDM 06 workshop on Link Analysis, Counterterrorism and Security, 2006.

[8] Linyuan Lšu and Tao Zhou, Link prediction in weighted networks: The role of weak ties, EPL, 89 (2010) 18001.

[9] Zhou T., Lšu L. and Zhang Y.-C., Eur. Phys. J. B, 71(2009) 623. [

10] Lšu L., Jin C.-H. and Zhou T., Phys. Rev. E, 80 (2009)046122.

Paper Type : Research Paper
Title : Priority Based Weighted Queue QoS Model In MANETs
Country : India
Authors : Rajwinder Kaur, Ramnik Singh
: 10.9790/0661-1233538      logo

Abstract:Mobile ad-hoc networks (MANETs) is an appealing technology that has attracted lots of research efforts over past years. Although the principle of wireless, structure-less, dynamic networks is attractive, there are still some major flaws that prevent commercial expansion. QoS is one the main issue in todays multimedia technology. In this paper we purposed a model i.e, Priority Based Weighted Queue QoS model in MANETs. Model is implemented in NS-2.34 and results are compared with other models. Keywords: QoS,MANET, End to End delay,bandwidth,NS -2.34

[1] Neeraj Nehra, R.B. Patel, V.K. Bhat, "Routing with Load Balancing in Ad Hoc Network: A Mobile Agent Approch", 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 2007 IEEE

[2] M. Shreedhar and G. Varghese ,"Efficient fair queuing using deficit round robin, (1995)," IEEE/ACM Trans. Networking, vol. 4, no. 3, pp. 375–385.

[3] Tsung-Yu Tsai et .al, "Introduction to Packet Scheduling Algorithms for Communication Networks," Institute for Information Industry Graduate Institute of Communication Engineering."

[4] K . McLaughlin, S. Sezer, H. Blume, X. Yang, F. Kupzog, and T. Noll ,"A Scalable Packet Sorting Circuit for High-Speed (7 july 2008)," IEEE Trans. On very large scale integration (VLSI) system, vol. 16, no. 7 .G.

[5] Varaprasad, R.S.D. Wahidabanu , "Quality of Service Model for Multimedia Applications in a Mobile Ad Hoc Network ,(2011)," IEEE Potentials, vol. 30, no. 2, pp. 44-47.

[6] Maysam Hedayati, Hamid reza hoseiny, Seyed Hossein Kamali, Reza Shakerian, " Traffic Load Estimation and Load Balancing in Multiple Routing Mobile Ad Hoc Networks", 2010 International Conference on Mechanical and Electrical Technology(ICMET 2010), 2010 IEEE, pp 117-121

[7] P. Goudarzi, M. Hosseinpourr , "Quality of Service Model for Multimedia Applications in a Mobile Ad Network,(2010),Consumer Electronics, IEEE Transactions on , vol. 56, no. 4, pp. 2217-2225.

Paper Type : Research Paper
Title : Android Malware: Study and analysis of malware for privacy leak in ad-hoc network
Country : India
Authors : Akash Malhotra, Pawan Prakash Singh
: 10.9790/0661-1233943      logo

Abstract: Smartphone's users has been increasing since last few years which provides numerous operations like accessing information through online mode, payment options, using utility applications, playing games. Smartphone's have become so powerful these days that tends to play the role of PC's. The basic operation of any mobile phone calling, storing personal details like contact information in contact book, business data, text messages etc. Since we are in new generation, where so many different varieties of devices connect together with each other giving way for security concerns. With the huge and tremendous uprising Smartphone sales in market, the chances of malicious attacks became a trouble. As malware developers tries to steal information from such devices. This paper provides a study of analyzing malware through static and dynamic means. In static analysis we are performing reverse engineering to detect malicious code and in dynamic analysis we are using tools to identify the packet structure. Further we perform white listing for safe destination address. In this paper we are highlighting the aspects of mobile malware when compared with third party applications like Lookout etc.

Keywords -Android malware, reverse engineering, security and protection, Anti-virus, white listing

[1]. Adam, P. F ,Chaudhuri, A., & Foster, J. S. (2009). ScanDroid: Automated security certification of android applications. In IEEE symposium of security and privacy.
[2]. D. Barrera, H. G. Kayacik, P. C. van Oorschot, and Somayaji. A methodology for empirical analysis of permission-based security models and its application to android. In the Proceedings of the 17th ACM conference on Computer and communications security, CCS '10, pages 73–84, NY, USA, 2010. ACM
[3]. A. Shabtai, U. Kanonov, Y. Elovici, C. Glezer, Y. Weiss: Andromaly: a behavioral malware detection framework for android devices. Journal of Intelligent Information Systems 38(1) (January 2011) 161.
[4]. Enck, W., Gilbert, P., Chun, B.-g., Cox, L. P.,Jung, J., McDaniel, P., and Sheth, A. N.TaintDroid: An Information-Flow Tracking System for Real-time Privacy Monitoring on Smartphone's. In the Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation (2010),USENIX OSDI '10
[5]. Contagio mobile malware mini dump.
[6]. M. Nauman, S. Khan, and X. Zhang. Apex: Extending Android Permission Model and Enforcement with User Defined Runtime Constraints. In the Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ASIACCS '10, 2010
[7]. Risk Ranker
[8]. Felt, A. P., Chin, E., Hanna, S., Song, D., and Wagner. Android Permissions Demystified. In the Proceedings of the 18th ACM Conference on Computer and Communications Security (2011), CCS 11.
[9]. MalGenome: Proceedings of the 33rd IEEE Symposium on Security and Privacy San Francisco, CA, May 2012
[10]. Felt, A. P., Wang, H. J., Moshchuk, A., Hanna, S., and Chin, E. Permission Re-Delegation: Attacks and Defenses. In the Proceedings of the 20th USENIX Security Symposium (2011), USENIX Security '11.

Paper Type : Research Paper
Title : Enabling Use of Dynamic Anonymization for Enhanced Security in Cloud
Country : India
Authors : Ms. Swati Ganar, Apeksha Sakhare
: 10.9790/0661-1234451      logo

Abstract: Cloud computing is a model that enables Convenient and On-demand network access to a shared pool of configurable computing resources where millions of users share an infrastructure. Privacy and Security are significant obstacle that is preventing the extensive adoption of the public cloud in the Industry. Researchers have developed privacy models such as k-anonymity, l-diversity, t-closeness. However, even though these privacy models are applied, an attacker may still be able to access some confidential data if same sensitive labels are used by a group of nodes. Publishing data about individuals without revealing sensitive information about them is an important problem. Data Anonymization is a method that makes data worthless to anyone except the owner of the data. It is one of the methods for transforming the data that it prevents identification of key information from an unauthorized person. We survey the existing methods of anonymization to protect sensitive information stored in cloud. Data can also be anonymized by using techniques such as, Hashing, Hiding, Permutation, Shifting, Truncation, Prefix-preserving, Enumeration, etc. We have implemented these methods also to see an anonymization effect and implemented a new method for anonymization.

Keywords: Anonymization, Deanonymization, Data Hiding, Hash calculation, Data Shifting, Data Truncation, Data Enumeration, Data Permutation, IP prefix Preserving.

[1] Jeff sedayao, "Enhancing cloud security using Data Anonymization", Intel white paper, June 2012

[2] R. Pang, M. Allman, V. Paxson, and J. Lee, "The Devil and Packet Trace Anonymization" ACM Computer Communication Review, 36(1):29–38, January 2006.

[3] A. Slagell and W. Yurcik. Sharing Computer Network Logs for Security and Privacy: "A Motivation for New Methodologies of Anonymization. In Proceedings of SECOVAL": The Workshop on the Value of Security through Collaboration, pages 80–89, September 2005

[4] Latanya Sweeney, "Achieving k-Anonymity Privacy Protection Using Generalization and Suppression", 10 int‟l j. On uncertainty, fuzziness & knowledge-based sys. 571, 572, 2002

[5] Information Commissioner‟s office, "Anonymization: managing data protection risk , code of practice", 2012

[6] P. Samarati, "Protecting Respondent‟s Privacy in Microdata Release," I6EE Trans. Knowledge and Data Eng., vol. 13, no. 6, pp. 1010-1027, Nov./Dec. 2001.

Paper Type : Research Paper
Title : Advance Frameworks for Hidden Web Retrieval Using Innovative Vision-Based Page Segmentation
Country : India
Authors : Kopal Maheshwari, Namrata Tapaswi
: 10.9790/0661-1235258      logo

Abstract: The volatile intensification of internet has posed a exigent problem in extracting significant data. Conventional web crawlers focus merely on the surface web while the hidden web remains intensifying following the prospect. Hidden web pages are created dynamically as a result of queries masquerade to precise web databases. The structure of the hidden web pages crafts it unfeasible for conventional web crawlers to access hidden web contents. We proposed innovative Vision-based Page Segmentation (IVBPS) algorithm for hidden web retrieval and develop intelligent crawler and interpretation of hidden web query interfaces. Hidden intelligent crawler and interpretation of hidden web query interfaces split the method into two stages. The primary stage comprises query analysis and query translation and the subsequent wrap vision-based extraction of data from the dynamically created hidden web pages. There are numerous conventional approaches for the extraction of hidden web pages but our proposed technique intends at overcoming the inherent limitations of the former.

Keywords: vision-based page segmentation, Hidden Web, Blocks, crawlers, Wrapper.

[1] Sergio Flesca, Elio Masciari, and Andrea tagareiii," A Fuzzy Logic Approach to wrappingpdf Documents", IEEE Transactions On Knowledge And Data Engineering, VOL. 23, NO. 12, DECEMBER 2011.

[2] JerLangHong," Data Extraction for Deep Web Using WordNet", IEEE Transactions On Systems, Man, And Cybernetics-Part C: Applications And Reviews, VOL. 41, NO. 6, NOVEMBER 2011.

[3] L. Barbosa and J. Freire. "An Adaptive Crawler for Locating Hidden- Web Entry Points", www 2007, May 8 – 12,2007, Banff, Alberta, Canada.
[4] C.H. Chang, B. He, C. Li, and Z. Zhang: "Structured Databases on the Web: Observations and Implications discovery". Technical Report UIUCCDCS-R-2003-2321. CS Department, University of Illinois at Urbana-Champaign. February, 2003.

[5] Raghavan, S. and Garcia-Molina, H. "Crawling the Hidden Web", VLDB Conf., pp 129 – 138, 2001

[6] Rekha Jain ,Department of Computer Science, Apaji Institute,Banasthali University C-62 Sarojini Marg, C-Scheme, Jaipur,Rajasthan.Dr. G. N. Purohit,Department of Computer Science, Apaji Institute, Banasthali University. " Page Ranking Algorithms for Web Mining", International Journal o/Computer Applications (0975 - 8887) Volume 13- No.5, JanualY 2011.

[7] Wei Liu, Xiaofeng Meng, Member, IEEE, and Weiyi Meng, Member, IEEE , "ViDE: A Vision-Based Approach for Deep Web Data Extraction IEEE Transactions On Knowledge And Data Engineering", VOL. 22, 2010.

[8] Jayant Madhavan, David Ko, Łucja Kot, Vignesh Ganapathy, Alex Rasmussen and Alon Halevy. "Google's DeepWeb Crawl". PVLDB '08, August 23-28, 2008, Auckland, New Zealand .

[9] Gang Liu, Kai Liu, Yuan-yuan Dang," Research on discovering Deep web entries Based ontopic crawling and ontology" 978-1-4244-8165-1/11 IEEE -2011.

Paper Type : Research Paper
Title : A Robust Approach in Iris Recognition for Person Authentication
Country : India
Authors : Chinni. Jayachandra, H. Venkateswara Reddy, B. Suresh Kumar, B. Sruthi
: 10.9790/0661-1235967      logo

Abstract: In Iris recognition authentication process, iris and sclera are used as the previous inputs using to recognize the eye with different mechanisms like segmentation combining with different versions. In this paper, entirely biometric-based personal verification and identification methods have gained much interest with an increasing accent on safety. The iris texture pattern has no links with the genetic structure of an individual and since it is generated by chaotic processes externally visible patterns imaged from a distance. Iris patterns possess a high degree of randomness and uniqueness. Here we propose two algorithms they are K-Means algorithm and canny Edge Detection. Totally eight process acting to identify the pupil and also for iris recognition. Comparing images k- means algorithm is to give accurate contest. As a final point it leads to open authentication person details from database.

Key words - Median filter, Iris Radius Detection, Iris Unrolling, Iris Recognition, Pupil Detection, Canny edge detection algorithm, K-means algorithm.

[1] Jain, A.K., Flynn, P., Ross, A. (Eds.), 2007. Handbook of Biometrics. Springer-Verlag.
[2] L. Flom, A. Safir, Iris Recognition System, U.S. Patent 4 641 349, 1987.
[3] J. G. Daugman, ―High confidence personal identification by rapid video analysis of iris texture,‖ in Proc. IEEE Int. Carnahan Conf. SecurityTechnol., 1992, pp. 1–11.
[4] J G Dauglllan, ―High confidence visual recognition of Persons by a test of statistical independence‖. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1993, 15(1):1148-116.
[5] R P wildes, et al. A system for automated iris recognition[C]. In Proceedings of the Second IEEE Workshop on Applications of Computer Vision. Sarasota, Horida, 1994. 121-128.
[6] W W Boles. A wavelet transform based technique for the recognition of the human iris. In Proeeedings of the 1996 International SylnPosium on Signal Processing and its Applications, Gold Cost, Australia, 1996.
[7] W. W. Boles and B. Boashash, ―A human identification technique using images of the iris and wavelet transform,‖ IEEE Trans. Signal Process. vol. 46, no. 4, pp. 1185–1188, Apr. 1998.
[8] Junzhou Huang, Yunhong Wang, Tieniu Tan, Jiali Cui, ―A New Iris Segmentation Method for Recognition‖, Proceedings of the 17th International Conference on Pattern Recognition, IEEE, 2004.
[9] H. Proenc¸a and L.A. Alexandre, ―Iris segmentation methodology for non-cooperative recognition‖. In IEE Proc.-Vis. Image Signal Process. Vol. 153, No. 2, April 2006.
[10] Chung-Chih Tsai, Heng-Yi Lin, Jinshiuh Taur, and Chin-Wang Tao, ―Iris Recognition Using Possibilistic Fuzzy Matching on Local Features‖. In IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics in 2010.

Paper Type : Research Paper
Title : Efficiency of Optical Fiber Communication for Dissemination of Information within the Power System Network.
Country : Nigeria
Authors : Engr Dr Mrs G.N Ezeh ,Okwe Gerald Ibe
: 10.9790/0661-1236875      logo

Abstract: Within the power system network, consistent domestic communications are essential to ensure safety, security and control of the power system equipments. Such communications customarily have been provided by methods such as power line carrier and microwave radio systems but are more recently being supplemented or replaced by Fiber optics. This paper focuses on the practical steps to review and evaluation on the effectiveness of using Fiber optic cable technology in the domestic communication of power system network. With the advent of information and communication technology, it has become obvious that Fiber optic is replacing this crude method of data communication. It offers a unique solution to ever increasing demand for bandwidth because of its remarkably high capacity for carrying data, and guaranteed consistency of signal transmission over the entire transmission network. A pair of Fiber has the ability to carry over eight thousand simultaneously voice channels and has high immunity to electromagnetic interference. All these advantages made it extra-ordinarily useful in data communication like Internet, multimedia and scada applications. Over short or long distances, video, audio and data signals arrive at their destination in the same perfect quality as they originated and also assures security of data being transmitted.

Keywords: Optical Fibre, Security, attenuation, Fiber degradation, bandwidth, splicing, Scada. algorithm.

[1]. M. N. Ott, R. Switzer, R.F. Chuska, F. V. LaRocca, W. J. Thomes, L. W. Day, and S. L. Macmurphy, "The Optical Fiber Array Bundle Assemblies for the NASA Lunar Reconnaissance Orbiter; Evaluation Lessons Learned for Flight Implementation," invited paper, ICSO, October 2008.
[2]. X. L. Jin, M. N. Ott, F. V. LaRocca, R. F. Chuska, S. M. Schmidt, A. J. Matuzseski, R. Switzer, W. J.Thomes, and S. L. Macmurphy, "Space Flight Qualification on a Novel Five-fiber Array Assembly for the Lunar Orbiter Laser Altimeter (LOLA) at NASA GSFC," SPIE, Vol. 6713, Aug 2007.
[3]. R. Setchell, K. Meeks, W. Trott, P. Klinsporn, and D. Berry, "High-Power Transmission Through Step-Index Multimode Fibers," SPIE, Vol. 1441, p. 61, 1991.
[4]. R. Setchell, "An Optimized Fiber Delivery System for Q-switched, Nd:YAG Lasers," SPIE, Vol. 2296, p.608, 1997.
[5]. W. Sweatt and M. Farn, "Kinoform/Lens System for Injecting a High Power Laser Beam Into an Optical Fiber," SPIE, Vol. 2114, p. 82, 1994.
[6]. R. Setchell, "Damage Studies in High-Power Fiber Transmission Systems," SPIE, Vol. 2114, p. 87, 1994.
[7]. W. Sweatt, R. Setchell, M. Warren, and M. Farn, "Injecting a Pulsed YAG Laser Beam Into a Fiber,"SPIE, Vol. 3010, p. 266, 1997.
[8]. R. Setchell, "Laser Injection Optics for High-Intensity Transmission in Multimode Fibers," SPIE, Vol. 4095, p. 74, 2000.
[9]. L. Weichman, F. Dickey, and R. Shagam, "Beam Shaping Element for Compact Fiber Injection Systems,"SPIE, Vol. 3929, p. 176, 2000.
[10]. F. Dickey, S. Holswade, Laser Beam Shaping: Theory and Techniques, Chapter 7 (D. Brown, F. Dickey,

Paper Type : Research Paper
Title : Concept and Viability of High Temperature Superconductor Fault Current Limiter for Power Systems Protection
Country : Nigeria
Authors : Engr Dr Damian Obioma Dike, Okwe Gerald Ibe, Inyama Kelechi, Olekaibe Richard
: 10.9790/0661-1237689      logo

Abstract: In today's technological era, electrical energy is one of the most vital forms of energy and is needed directly or indirectly in almost every field. As load gradually increases on a particular power system network, a higher operating current state leading to increased fault current level is attained. It is not possible to change the rating of the equipment and devices in the system or circuits to accommodate the increasing fault currents. Integration of High Temperature Superconductor Fault Current Limiter (HTSFCL) in power system network will provide instantaneous (sub cycle) current limitation abilities, which mitigates the effects and the buildup of fault currents in the power system network .The devices in electronic and electrical circuits are sensitive to disturbance and any disturbance or fault may damage the device permanently so that it must be replaced. The cost of equipment like circuit breakers and transformers in power grid are very expensive. Moreover, replacing damaged equipment is a time and labour consuming process, which also affects the reliability of power systems. It is not possible to completely eliminate the faults but it is possible to limit the current during fault in order to save the equipment and devices in the circuits or systems. One of the solutions to this age longed problem is the application of a current limiting device in the system. This paper is centered on the concepts and viability of High Temperature fault current limiters for power systems protection. The demonstration of this High Temperature Superconductor Fault Current Limiter (HTSFCL) in power systems has been explained and simulated using MATLAB tool. The results of the simulation with and without the fault are shown Keywords: Super conducting fault limiter, MATLAB simulation, system reliability algorithm.

[1] Schmitt. H, CIGRE," Fault current limiters report on the activities of CIGRE WG A3.16", Power Engineering Society General Meeting, 2006. IEEE, 18-22 June 2006, pp.5

[2] M.M.A.Salama, R.Sarfi and A.Y.Chikhani," Computer Controlled Fault Current Limiter (CCFCL)", Proceedings on Electric Machines and Power Systems, Vol. 24, 1996, pp 653-667

[3] E.F.King, A.Y.Chikhani, R.Hackman and M.M.A.Salama,"A Microprocessor Controlled Variable Impedance Adaptive Fault Current Limiter", IEEE Transactions on Power Delivery, Vol. 5, No.4, Nov. 1990, pp 1830 -1837.

[4] E.S.Ibrahim,"Electromagnetic Fault Current Limiter", Electric Power System Research, Vol. 42, 1997, pp. 189-194.

[5] R.A Dougal,"Current-Limiting Thermistors for High-Power Application", IEEE Transaction on Power Electronics, Vol.11, No.2, March 1996, pp.304-310.

[6] I.Lee, R.Carberry, W.Knauer, B.A.Renz and S.H.Horowitz,"An Ultrafast Fault Sensor for a Fault Current Limiting Device", IEEE Transaction on Power Apparatus and Systems, Vol. PAS-98, No.3, April 1992, pp.507-515.

[7] T.F.Godart, A.F.Imce, J.C.Mclver and E.A.Chebli,"Feasibility of Thyristor Controlled Series Capacitor for Distribution Substation Enhancements", IEEE Transactions on Power Delivery, Vol. 10, No. 1, January 1995, pp.203-209.

[8] M.Samii,"Inrush Current Limiters", PCIM, Oct.1998, pp94

[9] S.C.Mukhopadhyay, M.Iwahara, S.Yamada and F.P.Dawson," Analysis, Design and Experimental Results for A Passive Current Limiting Device", IEE Proceedings on Electric Power Applications, U.K., IEE, 146, May 1999, 3, pp. 309-316.

[10] M.Iwahara, S.C.Mukhopadhyay, N.Fujiwara and S.Yamada," Development of Passive Fault Current Limiter in Parallel Biasing Mode", Proc. on IEEE Intermag conference, Kiangsu, Korea, May 18-21, 1999, AS-09.

Paper Type : Research Paper
Title : Multicast Dual Arti-Q System in Vehicular Adhoc Networks
Country : India
Authors : S. Sujatha, P. Sukanya
: 10.9790/0661-1239095      logo

Abstract: The rising requirements of the wireless communication increase the researches in the wireless communication area. Wireless communication is used in Ad hoc network. MANET is one of the self organizing, self healing network in the Ad hoc network. VANET is a subset of the MANET which offers console and protection to the users of VANET. VANET is a collected works of vehicular mobile nodes which figures the vehicular Ad hoc networks. In VANET there are many confronting wanted to solve, in order to provide efficient and stable services. Existing paper represents the Artigence techniques which will solve the challenges in the VANET and improve the efficiency. Artigence uses Arti-Q algorithm, which is one type of efficient queuing technique. The Arti-Q and VANET are using in the call taxi management systems in order to provide efficient call taxi management service to the customers.

Keywords– Wireless Communication, Artigence techniques, Call taxi. algorithm.

[1] Cheng, P.-C., Weng, J.-T., Tung, L.-C., Lee, K. C., Gerla M., and Härri J. "GeoDTN+NAV: A Hybrid Geographic and DTN Routing with Navigation Assistance in Urban Vehicular Networks," (2008), Proceedings of the 1st International Symposium on Vehicular Computing Systems (ISVCS'08), Dublin, Irland, July 2008.

[2] Davis, J., Fagg, A. and Levine, B. "Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks. in International Symposium on Wearable Computing,", 2001.

[3] Flury, R. and Wattenhofer, R. (2006), "MLS: an efficient location service for mobile ad hoc networks." In MobiHoc ‟06: Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing, pages 226–237, New York, NY, USA, 2006.

[4] Forderer, D (2005). "Street-Topology Based Routing." Master‟s thesis, University of Mannheim, May 2005.

[6] Franz W., Eberhardt R., and Luckenbach T., "FleetNet - Internet on the Road," Proc. 8th World Congress on Intelligent Transportation Systems, Sydney, Australia, Oct. 2001.

[7] Giordano S., et al., "Position based routing algorithms for ad hoc networks: A taxonomy," in Ad Hoc Wireless Networking, X. Cheng, X. Huang and D.Z. Du (eds.), Kluwer, December 2003.

[8] Jaap, S., Bechler, M., Wolf, L. (2005), "Evaluation of Routing Protocols for Vehicular Ad Hoc Networks in City Traffic Scenarios," Proceedings of the 5th International Conference on Intelligent Transportation Systems (ITS) Telecommunications, June, 2005.

[9] Jerbi, M., Senouci, S.-M., Meraihi, R., and Ghamri-Doudane, Y. (2007), "An improved vehicular ad hoc routing protocol for city environments," Communications, 2007. ICC ‟07. IEEE International Conference, pp. 3972–3979, 24-28 June 2007.

[10] Jetcheva, J.G., Hu, Y.-C., PalChaudhuri, S., Saha, A.K., Johnson, D.B. (2003), "Design and evaluation of a metropolitan area multitier wireless ad hoc network architecture," Mobile Computing Systems and Applications, 2003. Proceedings. Fifth IEEE Workshop on , vol., no., pp. 32-43, 9-10 Oct. 2003.

Paper Type : Research Paper
Title : Information Security Management System: Emerging Issues and Prospect
Country : Nigeria
Authors : Amarachi A. A., Okolie S. O., Ajaegbu C.
: 10.9790/0661-12396102      logo

Abstract: Information Security Management System (ISMS) can be defined as a collection of policies concerned with Information Technology (IT) related risks or Information Security Management (ISM). Majority of ISMS frameworks that have been implemented and adopted by organizations, centre on the use of technology as a medium for securing information systems. However, information security needs to become an organisation-wide and strategic issue, taking it out of the IT domain and aligning it with the corporate governance approach. The aim of this paper is to highlight the available ISMS frameworks, the basic concept of ISMS, the impact of ISMS on computer networks and internet, the chronological developement of ISMS frameworks and IT Security Management/IT Security Organization. These were accomplished through the review of existing literatures on ISMS frameworks. In essence, it was observed that there is need for every organisation to have an information security management system that can adequately provide reasonable assurance and support for IT applications and business processes.

[1] Brykczynski B. & Small B. (2003). Securing Your Organization's Information Assests (p. 1). Retrieved from
[2] Bundesamt für Sicherheit in der Informationstechnik (BSI). (2009). BSI Standard 100-1 – Information Security Management Systems (ISMS)
[3] Burgess, S. (2002). Managing Information Technology in Small Business: Challenges & Solutions. Victoria University, Australia. Idea Group Publishing.
[4] Caralli, R. A. & Wilson, W. R. (2004). The Challenges of Security Management (p. 1). Retrieved from ESM White Paper v1.0 Final-2.doc
[5] Carlson, T. (2008). Understanding Information Security Management Systems. New York: Auerbach Publications.
[6] Deming, E. W. (1950). Evolution of the "Plan-Do-Check-Act" (PDCA) cycle. JUSE.
[7] Department of Trade and Industry (DTI). (2006). Information Security. Retrieved from
[8] European Network and Information Security Agency (ENISA). (2010). ISMS Framework. Retrieved from Ghosh, S. (2004). The Nature of Cyber-attacks in the Future: A Position Paper. Information Systems Security (p.18), 16p.
[9] Li et. al, (2003). BS7799: A Suitable Modell for Information Security Management.
[10] Parenty, T. (2003). Digital Defense. Boston, Massachusetts: Harvard Business School Press.

Paper Type : Research Paper
Title : Analysis of Rate Based Congestion Control Algorithms in Wireless Technologies
Country : India
Authors : Saneh Lata, Yogesh Chaba
: 10.9790/0661-123103109      logo

Abstract: In this paper, the congestion control algorithms in wireless technolologies are analysed. It has been found that TCP VEGAS is better than other TCP variants for sending data and information due to better delivery fraction and average end to end delay. But it has a consistent window size for packet transmission. Congestion Avoidance can resolve Congestion effectively and has higher average throughput than slow start due to the ability to deal with random loss. Cross layer Congestion Control require significant power and memory corresponding to network bandwidth. So to overcome all these problems, here we analyse the performance of AIMD, TFRC and TCP congestion control protocol. After observing simulation results, it is found that GAIMD is better than TFRC in terms of throughput and TFRC is better than GAIMD in terms of smoothness.


1] RambabuYerajana , A.K. Sarje "A Congestion Control in Mobile AD-HOC Network" 2009 IEEE International Advance Computing Conference (IACC 2009) Patiala, India, 6-7 March 2009
[2] ShukorAbdRazak, NormaliaSamian, MohdAizainiMaarof"Evaluation of Different TCP Congestion Control Algorithms "The Fourth International Conference on Information Assurance and Security,2008
[3] Xuyang Wang and Dmitri Perkins "Cross-layer Hop-by-hop Congestion Control in Mobile Ad-hoc Networks" proceeding of IEEE society in WCNC 2008.
[4] Kazuya NISHIMURA and Kazuko TAKAHASHI "A Multi-Agent Routing Protocol with Congestion Control for MANET",Proceedings 21st European Conference on Modelling and SimulationIvan Zelinka, ZuzanaOplatková, Alessandra Orsoni ©ECMS 2007ISBN 978-0-9553018-2-7 / ISBN 978-0-9553018-3-4 (CD),2007.
[5] LIBOM U.," Tcp performance over MANET" 0.BUPT-Qualcomm Wireless Laboratory Beijing University of Post and Telecommunication, China, September, 2007.
[6] Xu and I. Rhee, "Limitations of equation-based congestion control" IEEE/ACM Transactions on Networking, 15(4), August 2007.
[7] Sung Jae Jung1, MunGi Kim1, and Byung Ho Rhee "Performance EnhancementTechnique for TCP over Mobile Ad Hoc Networks"Department of Information and communications, Hanyang University, Seoul, Korea, 2006.
[8] HongqiangZhai, Xiang Chen and Yuguang Fang "Rate-Based Transport Control for Mobile Ad Hoc Networks" IEEE Communications Society / WCNC 2005.
[9] K. Chen, K. Nahrstedt, and N. Vaidya, "The utility of explicit rate-based flow control in mobile ad-hoc networks," in Proc. IEEE Wireless Communications and Networking Conference (WCNC 2004), Atlanta, Georgia, USA, Mar. 2004.
[10] S. H. Shah, K. Chen, and K. Nahrstedt, "Dynamic bandwidth management forsingle-hop ad-hoc wireless networks," in Proc. IEEE International Conference on Pervasive Computing and Communications (PerCom 2003), Dallas-Fort Worth, Texas,USA, Mar. 2003.

Paper Type : Research Paper
Title : Premium Customer Authentication by Using Third Generation Packet Network
Country : India
Authors : Ch. Divya, Dr. P. Govardhan
: 10.9790/0661-123110113      logo

Abstract: In third generation the technology has been developed into new world like as multimedia data transfer rate has been increased from GPRS, 2G to 3G along with these the misuse of data rate is also been increased. To avoid all these kind of scenarios we are going to propose the new ways to reduce the all kinds of vulnerabilities. 3G is the third generation of wireless technologies; It comes with enhancements over previous wireless technologies like high-speed transmission, advanced multimedia access and global roaming. 3G is mostly used with mobile phones and handsets as a means to connect the phone to the internet or other IP networks in order to make voice and video calls, to download and upload data and to surf the net. For real time H.264/AVC video in 3G Wireless environments with benefits shown especially in the presence of link outages. In the 3GPP packet – Switched Streaming Service Rel. 6, H.264/AVC and its RTP Payload format are specified. The RTP payload format allows interleaved transmission of NAL units of H.264/AVC. Keywords – 3G, HSDPA, Optimal Pricing, Video Streaming, Redistribution.

[1] G. Gualdi, A. Prati, and R. Cucciara, "video streaming for mobile video surveillance" IEEE Trants. Multimedia, vol. 10, no. 6, pp.1142-1154, Oct. 2008.

[2] H. Ibaraki, T. Fujimoto, and S. Nakano "Mobile video communications techniques and services" in Proc. SPIE, 1995, vol. 2501,p.1024.

[3] D. F. S. Santos and A. Perkusich, "Granola: A location and bandwidth aware protocol for mobile video on-demand systems" in Proc. Int Conf. SoftCom. Design, Sep. 2008, pp.309-313.

[4] S. Sudin, A.Tretakov, R. H. R. M. Ali, and M. E. Rusil, "Attacks on mobile networks: An overview of new security challenge " in Proc. Int. Conf. Electron. Design, Dec. 2008, pp. 1-6. [5] H. Lee, Y. Lee, J. Lee, D. Lee, and H. Shin, "Design of a mobile video streaming system using adaptive spatial resolution control " IEEE. Trans. Consum. Electron. Vol.55, no. 3, pp.1682-1689, Aug. 2009.

[6] T. Schierl, T. Stock hammer, and T. Wiegand, "Mobile video transmission using scalable video coding " IEEE Trans. Circuits Syst. Video Technol., vol. 17, no. 9, pp. 1204-1217, Sep. 2007. [7] S. Jumisko-Pyykko and J. Hakkinen, "Evaluation of subjective video quality of mobile devices" in Proc. 13th Annu. ACM Int. Conf. Multi-media, 2005, p.538.

Paper Type : Research Paper
Title : Open Source Software Survivability Analysis Using Communication Pattern Validation
Country : India
Authors : A. Angel Mary, S. K. Prasanth
: 10.9790/0661-123114118      logo

Abstract: The Growth Of Open Source Software has created a major change In Software Development. Open Source Binds The Power Of Distributed Peer Review And Transparency To Create High Quality, Secure And Easily Integrated Software At An Accelerated Pace And Lower Cost. Since OSS Has Reached A Mature Stage, Adoption In Business Has No Barrier. Effective Communication Between The OSS Developer Communities Is One Of The Signposts That Contribute The Open Source Success. In This Paper A Communication Validation Tool Is Proposed, That Brings Out Contribution Index, Community Between-Ness Certainty, Community Density Of The Communication Network. It Also Presents The Nativity Of Developer Community, Progress Of Activity And Distribution Overtime.

[1] OSI, The Open Source Definition, The Open Source Initiative, (Accessed: May 2001); Http://Opensource.Org/Docs/Definition _ Plain.Html

[2] R. Abreu And R. Premraj. How Developer Communication Frequency Relates To Bug Introducing Changes. In Proc. Joint Int'l Workshop On Software Evolution (IWPSE-EVOL), Pages 153-157. ACM SIGSOFT, 2009.

[3] E. Raymond, The Cathedral And The Bazaar: Musings On Linux And Open Source By An Accidental Revolutionary (O'Reilly, Cambridge, 1999).

[4] K. Lakhami, And E. Von Hippel (2000). How Open Source Software Works: "Free" User-To-User Assistance. MIT Sloan Open Source Project, (Accessed: October 2001); Http://Opensource.Mit.Edu/Papers/Lakhanivonhippelusersupport.Pdf

[5] A. Mockus, R. Fielding And J. Herbsleb, A Case Study Of Open Source Software Development: The Apache Server, Proceedings Of The Proceedings Of The 22nd International Conference On On Software Engineering, Limerick Ireland (2000).

[6] G. Madey, V. Freeh, And R. Tynan. The Open Source Software Development Phenomenon: An Analysis Based On Social Network Theory. In Eight Americas Conf. Information Systems, Pages 1806{1813, 2002.

[7] S. Y. T. Lee, Et Al, "Measuring Open Source Software Success," Omega-International Journal Of Management Science, Vol. 37, Pp. 426-438, 2009

[8] J. Wang, "Survival Factors For Free Open Source Software Projects: A Multi-Stage Perspective", European Management Journal, Vol.30(4), Pp.352-371, 2012.

[9] W. H. Delone, E. R. Mclean, "The Delone And Mclean Model Of Information Systems Success: A Ten-Year Update," Journal Of Management Information Systems, Vol. 19, Pp. 9-30, 2003

[10] V. Midha, P. Palvia, "Factors Affecting The Success Of Open Source Software", Journal Of Systems And Software, Vol. 85, Pp. 895-905, 2012

Paper Type : Research Paper
Title : A Robust Approach for Detecting Data Leakage and Data Leaker in Organizations
Country : India
Authors : B. Sruthi Patel, M. L. Prasanthi, Chinni. Jayachandra
: 10.9790/0661-123119129      logo

Abstract: In organizations sensitive data transaction is having less security because there may be a misusability of data from one to other from past years. In previous methods they calculated how much data is leaked but didn't find who is leaked. In this paper, we find leakage and leaker. A data distributor has given sensitive data to a set of supposedly trusted agents (third parties). Some of the data has leaked and found in an unauthorized place (e.g., on the web or somebody's laptop). The distributor should assess the likelihood of the leaked data came from one or more agents, as opposed to having independently gathered by others. We propose data allocation strategies (across the agents) that improve the probability of identifying leakages. These methods don't rely on alterations of the released data (e.g., watermarks). In some cases we can also inject "realistic but fake" data records to further improve our chances of detecting leakage and identifying the guilty party.

Key Words: Data Leakage, fraud detection, agent guilt model, Explicit Random, Sample Random. algorithm.

[1] Amir Harel, AsafShabtai, LiorRokach, and Yuval Elovici, "M-Score: Misusability weight measure". IEEE ransactions, june 2012.
[2] N.Sandhya , K. Bhima , G. Haricharan Sharma," Exerting Modern Techniques for Data Leakage Problems Detect" International Journal of Electronics Communication and Computer Engineering- 2012, Volume 3, Issue 1.
[3] ArchanaVaidya, PrakashLahange, Kiran More, ShefaliKachroo&NiveditaPandey. "DATA LEAKAGE DETECTION ".IJAET, 2012.
[4] A.subbiah and D.M.Blough.An Approach for fault tolerant and securedata storage in collaborative Work environments.
[5] M. Atallah and s.Wagstaff, "Watermarking with quadratic residues". In proctor IS&T/SPIE Conference on Security and Watermarking of Multimedia Contents, January 1999.
[6] P. Buneman and W.C. Tan, "Provenance in Databases", Proc. ACM SIGMOD, pp. 1171-1173, 2007.
[7] S.Katzenbeisser and F.A.peticolas , editors. Information Hiding Techniques for Steganography and Digital Watermarking. Artech House, 2000.
[8] R. Agrawal and J. Kiernan, "Watermarking Relational Databases,"Proc. 28th Int'l Conf. Very Large Data Bases (VLDB '02), VLDB Endowment, pp. 155-166, 2002.
[9] Y. Cui and J. Widom, "Lineage Tracing for General Data Warehouse Transformations," The VLDB J., vol. 12, pp. 41-58,2003.
[10] F. Hartung and B. Girod, "Watermarking of Uncompressed and Compressed Video," Signal Processing, vol. 66, no. 3, pp. 283-301,1998.

IOSR Journal Publish Online and Print Version Both