iosr-JCE   Volume-3 ~ Issue-5

Abstract: Each pixel of an Image (assuming 24 bit BMP) is stored in the three 8 bits corresponding to three colors. Bit Plane Slicing is the technique of breaking image into 8 planes corresponding to 8 different bit positions. The bit plane image corresponding to the plane of the most significant bit (MSB) has the maximum contribution to the total image and forms the majority of the visually significant image data and planes corresponding to other lower bit positions contribute only the subtle details of the image. And the bit-plane image corresponding to the LSB of the RGB value has the minimum contribution of only 1 out of total of 255 Intensity level to the total image. In spite of this the LSB Plane of the image is not insignificant. In fact it is used in Image Steganography for hiding secret information in the images. Image based Steganography is a potent tool used by Terrorists and Criminal organizations for securely broadcasting, dead-dropping and communicating malicious secret messages over the internet by hiding them in the images. Our cyber space is full of such mala-fide images containing hidden secret information. The most difficult aspect of tracking such malicious images is the lack of efficient and fast algorithms for identifying and isolating them from the bulk of innocent images. Analysis of the pixels in the LSB Plane of the image is very effective technique of identification of Distributing Spatial Domain Steganographic Algorithms. In this paper the properties of Information Pixels pixel present in the LSB Plane of any stego image generated by Distributing Algorithms is analyzed in detail. These properties will be very useful in identification of malafide stego images lurking in our cyber space. All the images and tables used in this paper are generated using MATLAB ©Image Processing Tool Box.
Key Words: Bit Plane Slicing, Cyber Crime, Distributing Steganographic Algorithms. Global Terrorism, Image Steganalysis, Multicolor LSB Transform, SDT based Image Steganography.

[1] Kaustubh Choudhary, Image Steganography and Global Terrorism, IOSR Volume 1, Issue 2, July 2012.http://iosrjournals.org/journals/iosr-jce/papers/vol1-issue2/14/N0123448.pdf
[2] Infosecurity Magazine article dated 02 May 2012 reports that Al-Qaeda uses Steganography to hide documents. http://www.infosecurity-magazine.com/view/25524/alqaeda-uses-steganography-documents-hidden-in-porn-videos-found-on-memory-stick
[3] Daily Mail Online, UK article dated 01 May 2012 reported that a Treasure trove of Intelligence was embedded in porn video.http://www.dailymail.co.uk/news/article-2137848/Porn-video-reveals-Al-Qaeda-planns-hijack-cruise-ships-execute-passengers.html#ixzz1uIgxpire
[4] The New York Times article dated Oct 30, 2001 with title "Veiled Messages of Terror May Lurk in Cyberspace" claims 9/11 attacks planned using Steganography.
[5] Wired article dated 02nd July, 2001 nicknamed Bin Laden as "the Steganography Master"
[6] Kaustubh Choudhary, Novel Approach to Image Steganalysis (A Step against Cyber Terrorism) IOSR Volume 2, Issue 5, August 2012http://iosrjournals.org/journals/iosr-jce/papers/vol2-issue5/B0251628.pdf
[7] Kaustubh Choudhary, Mathematical Modeling of Image Steganographic System IOSR Volume 2, Issue 5, August 2012http://iosrjournals.org/journals/iosr-jce/papers/vol2-issue5/A0250115.pdf
[8] Kaustubh Choudhary, Identification of Stego Signatures in Images using Suspicion Value (special reference to Concentrating Stego Algorithms), IOSR Volume 3, Issue 4, August 2012
[9] Kaustubh Choudhary , Quick Identification of Steganographic Signatures of Distributing Stego Algorithms using Suspicion Value, IOSR Volume 3, Issue 4, August 2012.

Abstract: All nodes in a Mobile Ad hoc Network are having mobility and dynamically tied in a subjective approach. Due moving directions caused by mobility, the frequent link failure happens, which consequences in packet losses. The protocol used in transmission handling in general fails to identify the root cause of the packet dropping hence assumes that these packet losses are due to congestion only. This wrong assumption need packet retransmissions till packet arrive successfully at the receiver. The protocols used in mobile ad-hoc networks are based on the layered architecture. The layered approach is extremely rigid and strict since each layer of the architecture is only concerned about the layers immediately above it or below it. Current wireless protocols rely on significant interactions between various layers of the network stack. In this context in our earlier work we proposed a crosslayered routing topology in short CRT to improve the congestion detection and handling strategy. The CRT is Mac, application and physical layer centric in particular. With the motivation gained from CRT, here in this paper we propose a crosslayered power conserved routing topology (CPCRT) for mobile ad hoc networks. The goal is to improve transmission performance by distinguishing between packet loss due to link failure and arbitrary loss of packets along with power conservation that used for packet transmission. Hence in our proposed cross layer routing topology the strength of the communication signal between hop level nodes is used to determine link failure. The objective of the CPCRT is to distinguish between packet loss due to link failure and arbitrary loss of packets and ensure QOS at the application layer along with conserving power that used at node level to transmit packets. The experiment results emerged as an evidence for better resource utilization and power conservation in congestion controlling by proposing crosslayered and power conserved routing topology.
Keywords: Manet; routing protocol; congestion control; cross layer; CRT, CPCRT, Mac, Mobile ad hoc network routing, TCP

[1]. Michael Gerharz, Christian de Waal, and Matthias Frank, "A Practical View on Quality-of-Service Support in Wireless Ad Hoc Networks", BMBF.
[2]. Xiaoqin Chen, Haley M. Jones, A .D .S. Jayalath, "Congestion-Aware Routing Protocol for Mobile Ad Hoc Networks", IEEE, 2007.
[3]. Hongqiang Zhai, Xiang Chen, and Yuguang Fang, "Improving Transport Layer Performance in Multihop Ad Hoc Networks by Exploiting MAC Layer Information", IEEE, 2007.
[4]. Yung Yi, and Sanjay Shakkottai, "Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network", IEEE, 2007.
[5]. Tom Goff, Nael B. Abu-Ghazaleh, Dhananjay S. Phatak and Ridvan Kahvecioglu, "Preemptive Routing in Ad Hoc Networks", ACM, 2001.
[6]. Xuyang Wang and Dmitri Perkins, "Cross-layer Hop-byhop Congestion Control in Mobile Ad Hoc Networks", IEEE, 2008.
[7]. Dzmitry Kliazovich, Fabrizio Granelli, "Cross-layer Congestion Control in Ad hoc Wireless Networks," Elsevier, 2005.
[8]. Duc A. Tran and Harish Raghavendra, "Congestion Adaptive Routing in Mobile Ad Hoc Networks", 2006.
[9]. Nishant Gupta, Samir R. Das. Energy-Aware On-Demand Routing for Mobile Ad Hoc Networks, OPNET Technologies, Inc. 7255 Woodmont Avenue Bethesda, MD 20814 U.S.A., Computer Science Department SUNY at Stony Brook Stony Brook, NY 11794-4400 U.S.A.
[10]. Laura, Energy Consumption Model for performance analysis of routing protocols in MANET,Journal of mobile networks and application 2000.

Abstract: The study presents the review status of automation in Engineering College libraries and information centers of Jabalpur city in Madhya Pradesh. The uses of Information and communication Technology (ICT) facilitate easy & immediate access to Information. During the process of Automation understanding and analyzing the various problems faced by the Management and the staff. The methodology adopted for the present study is survey using a structured questionnaire. It was observed that 52.63% of the Engineering College libraries were not automated for reason such as, Lack of computer facilities, Inadequate finance, Lack of trained Manpower; Management is not interested in library automation, collection from library is very less, tentativeness and lack of attitude towards automation and unsatisfactory library software problems are the major hindrances to speedy automation. Only` 47.37% of Engineering College libraries are using automation to show that the libraries must be updated on the current scenario and the other libraries will follow these updates. This study also gives a status view of the software packages used by different engineering college libraries & the opinion of the librarians & library staff about the performance of software they use.

[1] Sinha. M K, Chakraborthy. S K, Bhattacharjee.J.(2007) "Application of Information Communication Technology in college Libraries of Barak Valley (Southern Assam)".5th convention planner, Guhati, Ahmadabad: INFLIBNET centre Dec.7-8.
[2] Mulla KR, Chandrashekara M. (2010) "Use of Integrated library software: A survey of Engineering College Libraries in Karnataka". International Journal of Information Science & Management, vol.8, no.2, July-December.
[3] Sangeeta, K & Sarika, L. (2008) Evaluation of ICT Based services in the academic libraries of Manipur: A Study. 6th International CALIBER. Allahabad.
[4] Suku & pillai. (2005) "Perspectives on automation of university libraries in Kerala status, problems & prospects."
[5] Lohar, M.S. & Kumber, M (2005) "College libraries in Shimoga district: A survey". SRELS J. Inf. Manag. 42(3), 335-53.
[6] Chakaraborty, Abira & Maisal, Anjali. (2005) Library automation and networking: A case study on Hoogly Mohsin College. In Automation and Networking of the College Libraries, edited by Biswajit Banerjee. Maulana Azad College, Kolkata, 224-25.
[7] Sen, P. (2005) Automation of a college library: Some issues. In Automation and Networking of the college libraries, edited by Biswajit Banerjee. Maulan Azad College, Kolkata, 125-26.
[8] Singh, N. (2005) "Revamping agriculture library & information services in India: Retrospect & prospect". Annals of library & information studies 52, 1; 31-36.
[9] Rajput & Jain (2006)."Status of Automation in Special Libraries & Information centers of Gwalior Survey.NCIMDiL.
[10] Shivram, B.S. (2007) "Library automation: an overview".

Abstract : Public safety agencies are using LMR network, which has less service availability, less multimedia services and low data rates during the emergency communication. These less services may impact the life in the critical emergency situation. The commercial cellular network provides higher service availability, more multimedia services and higher data rates. The LMR network mobile node can access the cellular network services if cellular/LMR network are interoperable. For accessing the cellular network services, the LMR network mobile node should handoff to cellular network if there is resource available. Ongoing communication may disrupt by this handoff and radio resources very intensive. We have studied Traditional SIP and Seamless SIP method with the constraints of handoff delay and resource utilization. The study presents Session Schedule Manager SIP, which achieves the optimal handoff and increase the radio resource utilization. This Paper intends optimal handoff and maximizes the resource utilization in the interoperable heterogeneous network which provides efficient communication between Disaster responder and Disaster commander.
Keywords – Hand off delay, Heterogeneous Network, Radio resource, Packet loss, SIP

[1] W. Zhang, "Handover decision using fuzzy MADM in heterogeneous networks," in Proc. IEEE WCNC, Atlanta, GA, Mar. 2004, pp. 653–658.
[2] Q. Song and A. Jamalipour, "A network selection mechanism for next generation networks," in Proc. IEEE CC, Seoul, Korea, May 2005, pp. 1418–1422.
[3] H. Wang, R. Katz, and J. Giese, "Policy-enabled handoffs across heterogeneous wireless networks," in Proc. IEEE WMCSA, New Orleans, LA,Feb. 1999, pp. 51–60.
[4] K. Yoon and C. Hwang, Multiple Attribute Decision Making: An Introduction.Newbury Park, CA: Sage, 1995.
[5] M. R. Kibria, A. Jamalipour, and V. Mirchandani, "A location aware three-step vertical handoff scheme for 4G/B3G networks," in Proc. IEEE GLOBECOM, St. Louis, MO, Nov. 2005, pp. 2752–2756.
[6] E. Stevens-Navarro and V. Wong, "Comparison between vertical handoff decision algorithms for heterogeneous wireless networks," in Proc. IEEE VTC—Spring, Melbourne, Australia, May 2006, pp. 947–951.
[7] F. Zhu and J. MacNair, "Optimizations for vertical handoff decision algorithms," in Proc. IEEE WCNC, Atlanta, GA, Mar. 2004, pp. 867–872.
[8] W. Chen and Y. Shu, "Active application oriented vertical handoff in next generation wireless networks," in Proc. IEEE WCNC, New Orleans, LA, Mar. 2005, pp. 1383–1388.
[9] A. Zahran and B. Liang, "Performance evaluation framework for vertical handoff algorithms in heterogeneous networks," in Proc. IEEE ICC,Seoul, Korea, May 2005, pp. 173–178.
[10] A. Sur and D. Sicker, "Multi layer rules based framework for vertical handoff," in Proc. BROADNETS, Boston, MA, Oct. 2005, pp. 571–580.

Abstract : The proportionate increase in the size of the data with increase in space implies that clustering a very large data set becomes difficult and is a time consuming process. Sampling is one important technique to scale down the size of dataset and to improve the efficiency of clustering. After sampling, allocating unlabeled data point into proper cluster is difficult in the categorical domain and in real situations data changes over time. However, clustering this type of data not only decreases the quality of clusters and also disregards the expectation of users, who usually require recent clustering results. In both the cases mentioned above, one is of allocating unlabeled data point into proper clusters after the sampling and the other is of finding clustering results when data changes over time which is difficult in the categorical domain. In this paper, using node importance technique, a rough set based method proposed to label unlabeled data point and to find the next clustering result based on the previous clustering result.
Keywords: Categorical Data, Data Labeling, Node Importance, Rough Membership Function.

[1]. Anil K. Jain and Richard C. Dubes. ―Algorithms for Clustering Data‖, Prentice-Hall International, 1988.
[2]. Jain A K MN Murthy and P J Flyn, ―Data Clustering: A Review,‖ ACM Computing Survey, 1999.
[3]. Kaufman L, P. Rousseuw,‖ Finding Groups in Data- An Introduction to Cluster Analysis‖, Wiley Series in Probability and Math. Sciences, 1990.
[4]. Han,J. and Kamber,M. ―Data Mining Concepts and Techniques‖, Morgan Kaufmann, 2001.
[5]. Bradley,P.S., Usama Fayyad, and Cory Reina,‖ Scaling clustering algorithms to large databases‖, Fourth International Conference on Knowledge Discovery and Data Mining, 1998.
[6]. Joydeep Ghosh. Scalable clustering methods for data mining. In Nong Ye, editor, ―Handbook of Data Mining‖, chapter 10, pp. 247–277. Lawrence Ealbaum Assoc, 2003.
[7]. Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, and Liadan O'Callaghan,‖ Clustering data streams: Theory and practice‖, IEEE Transactions on Knowledge and Data Engineering, PP.515–528, 2003.
[8]. Gibson, D., Kleinberg, J.M. and Raghavan,P. ―Clustering Categorical Data An Approach Based on Dynamical Systems‖, VLDB pp. 3-4, pp. 222-236, 2000.
[9]. Michael R. Anderberg,‖ Cluster analysis for applications‖, Academic Press, 1973.
[10]. Chen H.L, M.-S. Chen, and S-U Chen Lin ―Frame work for clustering Concept –Drifting categorical data‖, IEEE Transaction Knowledge and Data Engineering v21 no 5 , 2009.