iosr-JCE   Volume-16 ~ Issue-2 ~ March-April 2014

Paper Type	:	Research Paper
Title	:	High Efficient Complex Parallelism for Cryptography
Country	:	India
Authors	:	H.Anusuya Baby, Christo Ananth
	:	10.9790/0661-16230107

Abstract: Cryptography is an important in security purpose applications. This paper contributes the complex parallelism mechanism to protect the information by using Advanced Encryption Standard (AES) Technique. AES is an encryption algorithm which uses 128 bit as a data and generates a secured data. In Encryption, when cipher key is inserted, the plain text is converted into cipher text by using complex parallelism. Similarly, in decryption, the cipher text is converted into original one by removing a cipher key. The complex parallelism technique involves the process of Substitution Byte, Shift Row, Mix Column and Add Round Key. The above four techniques are used to involve the process of shuffling the message. The complex parallelism is highly secured and the information is not broken by any other intruder.

Keywords: Advanced Encryption Standard (AES), Complex Parallelism, Cryptography, Substitution Byte(S-Box).

[2] Agarwal.A, Ander M.A, Gueron .S, Hsu. S.K, Kaul. H, Kounavis .M, S.K. Mathew, F. Sheikh, R.K. Krishnamurthy, "53 gbps Native GF(2^4) Composite-Field AES-Encrypt/Decrypt Accelerator for Content-Protection in 45 nm High-Performance Microprocessors," IEEE J. Solid-State Circuits, vol. 46, no. 4, pp. 767-776, Apr. 2011.
[3]. Bernstein.D and P. Schwabe, "New AES Software Speed Records," Proc. INDOCRYPT '08: Ninth Int'l Conf. Cryptology in India: Progress in Cryptology, pp. 322-336, 2008.
[4]. Biham.E, "A Fast New DES Implementation in Software," Proc. Fourth Int'l Workshop Fast Software Encryption, pp. 260-272, 1997.
[5]. Borkar.S, "Thousand Core Chips: A Technology Perspective,"Proc. 44th Ann. Design Automation Conf., pp. 746-749, 2007.

Paper Type	:	Research Paper
Title	:	RFID Based Centralized Patient Monitoring System and Tracking (RPMST)
Country	:	India
Authors	:	Dr. S. Padmapriya M.E, PhD (Guide), Indu Goel, A.Sunitha, P.Arul
	:	10.9790/0661-16230815

Abstract: Radio Frequency Identification (RFID) though finds its use in many applications, still has to be accepted in a clear view. Talking in the perspective of a patient the only thing that strikes first is that lots of treatments undergone, many health records to be maintained, and after which remembering the concerned doctor's name and other details. This becomes impossible at a certain point of time when the details have to be conveyed. To make it easier this concept of maintaining a centralized information system and sharing has been proposed through the use of RFID technology.

[1] "Reliable and Low Cost RFID Based Authentication System for Large Scale Deployment", "International Journal of Network Security, Vol.14, No.3, PP. 173-179, May 2012"
[2] "RFID enabled smartcards as a context-aware personal health node", "Health Care and Informatics Review Online, 2010, 14(2), pg 10-16, Published online at www.hinz.org.nz
[3] "Cryptanalysis of Security Enhancement for a Modi¯ed Authenticated Key Agreement Protocol"," International Journal of Network Security, Vol.11, No.1, PP.55{57, July 2010"
[4] "Privacy and Security Requirements for RFID Applications", "Received 5 April 2008; Revised 21 July 2009; Accepted 25 Aug. 2009"
[5] "RFID-based Information System for Patients and Medical Staff Identification and Tracking", Tudor Ioan CERLINCA, Cristina TURCU, Cornel TURCU and Marius CERLINCA
[6] "Hospital Automation RFID-Based: Technology Stored In Smart Cards", "Proceedings of the World Congress on Engineering 2008 Vol II WCE 2008, July 2 - 4, 2008, London, U.K."

Paper Type	:	Research Paper
Title	:	Bandwidth Assurance Using Energetic Fusion Channel In Ad-Hoc Networks
Country	:	India
Authors	:	Mr.P.Vinoth Kumar, B.E.,(M.E)., Mrs.S.Shobana M.E.,
	:	10.9790/0661-16231624

Abstract: Wireless mesh networks (WMNs) have been proposed to provide cheap, easily deployable and vigorous Internet access. Improving user throughput is a primary objective in a WMN. The system focus on wireless networks with inactive nodes, such as community wireless networks. The goal of the metric is to choose a high-output path between a source and a destination. Metric assigns weights to individual links based on the Expected Transmission Time (ETT) of a packet over the link using many to many communications. In such networks, most of the nodes are either stationary or minimally mobile and do not rely on batteries. Hence, the effort of routing algorithms is on improving the network capacity or the performance of individual transfers for this, the system use Ad-hoc On-Demand Multi Path Distance Vector (AOMDV) for selecting and Demanding Shortest Path for transmission with Bandwidth Assurances. One of the main problems facing such networks is the reduction in total capacity due to interference between multiple simultaneous transmissions.

Index Terms: Ad-hoc On-Demand Multi Path Distance Vector, Bandwidth Assurances, Quality of Service, high-throughput, topology control.

[1] Apoorva Jindal, Konstantinos Psounis and Mingyan Liu," CapEst: Estimating wireless link capacity in multi-hop networks", 2005.
[2] Krishna N. Ramachandran, Elizabeth M. Belding, Kevin C. Almeroth,and Milind M.Buddhikot," Interference-Aware Channel
Assignment in Multi-Radio Wireless Mesh Networks", 2006.
[3] Li. H, Cheng .Y, Zhou. Z, and Zhuang. W, "Minimizing End-to-End Delay: A Novel Routing Metric for Multi-Radio Wireless Mesh
Networks," Proc. IEEE INFOCOM, Apr. 2009.
[4] Mihail L.Sichitiu, "Wireless Mesh Networks : Opportunities and Challenges", 2006.
[5] Murali Kodialam and Thyaga Nandagopal," Characterizing Achievable Rates in Multi-Hop Wireless Mesh Networks With Orthogonal
Channels", IEEE/ACM Transactions on Networking, Aug 2005.

Paper Type	:	Research Paper
Title	:	Enhancing Security and Fine-Grained Access Control for Personal Health Record in Cloud Computing
Country	:	India
Authors	:	Rinkumol Kuriakose, R .Tamilarasu
	:	10.9790/0661-16232532

Abstract: Now a days , personal health record become patient-centric model in which PHR service allows a patient to manage and control personal health data in one place through the web, which has made the storage, retrieval and sharing of the medical information more efficient . For the wide range access it has out sourced in third party storage such as cloud providers. These PHR contains sensitive data that should be protected from unauthorized parties.

[1] U.Jyothi K., Nagi Reddy, B. Ravi Prasad," Review of "Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing"" International Journal Of Engineering And Computer Science ISSN:2319-7242Volume 2 Issue 8 August, 2013 Page No. 2440-2447
[2] M. Li, S. Yu, N. Cao, and W. Lou, "Authorized Private Keyword Search over Encrypted Personal Health Records in Cloud Computing," Proc. 31st Int‟l Conf. Distributed Computing Systems (ICDCS ‟11), June 2011.
[3] M. Li, S. Yu, K. Ren, and W. Lou, "Securing Personal Health Records in Cloud Computing: Patient-Centric and Fine-Grained Data Access Control in Multi-Owner Settings," Proc. Sixth Int‟l ICST Conf. Security and Privacy in Comm. Networks (SecureComm ‟10), pp. 89-106, Sept. 2010.
[4] H. Lo¨ hr, A.-R. Sadeghi, and M. Winandy, "Securing the E-Health Cloud," Proc. First ACM Int‟l Health Informatics Symp. (IHI ‟10), pp. 220-229, 2010.\
[5] S. Yu, C. Wang, K. Ren, and W. Lou, "Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing," Proc. IEEE INFOCOM ‟10, 2010.

Paper Type	:	Research Paper
Title	:	Analysis for Diagnosing Myocardial Ischemia by Detecting the Boundary of Left Ventricle in Echocardiography Sequences using GVF snake
Country	:	India
Authors	:	N.Sameena,MPhil,DR.A.R.Mohamed Shanavas,
	:	10.9790/0661-16233338

Abstract: Left ventricular performance, one of the hallmarks of coronary artery disease, can be detected by echocardiography. Coronary artery disease (CAD) also known as myocardial ischemic heart disease (MIHD), is the most common type of heart disease and cause of heart attacks or heart failure. Heart failure (HF) can result from any structural or functional cardiac disorder that impairs the ability of the ventricle to fill with or eject blood. Echocardiography represents "the gold standard" in the assessment of left ventricle LV systolic and diastolic dysfunction. Left ventricular dimensions, volumes and wall thicknesses are measured from systolic and diastolic movements that are widely used in clinical practice and research.

[1] S.Sudha, G.R.Suresh and R.Sukanesh Speckle Noise Reduction in Ultrasound Images by Wavelet Thresholding based on Weighted Variance, International Journal of Computer Theory and Engineering, Vol. 1, No.1, April 2009.
[2] A. Mishra, P. K. Dutta, and M. K. Ghosh, A GA based approach for boundary detection of left ventricle with echocardiographic image sequences. Image Vis. Compute., vol. 21, pp. 967-976, 2003.
[3] T. Loupas, W. N. Mcdicken, and P. L. Allan. An Adaptive Weighted Median Filter for Speckle Suppression in Medical Ultrasonic Images OO98-4094/89/01OO-012901 .01 989 IEEE.
[4] Saulo Guerreiro Lacerda, Adson F. da Rocha, Daniel F. Vasconcelos,Joo L. A. de Carvalho, Iwens G. Sene Jr. and Juliana F. Camapum Left Ventricle Segmentation in Echocardiography Using a Radial-Search-Based Image Processing Algorithm. IEEE 2008.
[5] Sheila Chan, Gopalakrishnan Sainarayanan, Fuzzy-based boundary enhancement for echocardiogram using local image characteristics. Malaysian Journal of Computer Science, Vol. 19(2), 2006.

Paper Type	:	Research Paper
Title	:	Colorectal Cancer Detection using Image Processing based on IGVF Model
Country	:	India
Authors	:	G. Shantha Lakshmi,MPhil, Prof. B. Mohamed FaizeBasha, MCA., M.Phil
	:	10.9790/0661-16233943

Abstract: Colorectal cancer is the third most common cancer in both men and women. Computed Tomography (CT) Colonography is a valid technique for detecting and screening colorectal cancers. In order to accomplish an effective way to identify colon cancer at an early stage, digital images of colon polyps have been investigated. In this paper, an improved gradient vector flow (IGVF) is considered as an essential method to segment an image appropriately. This new algorithm, IGVF can improve GVF snake model's ability to capture thin boundary indentation like the boundary of cancer images. The segmented candidates are typically characterized by features describing like the polyp shape and its internal intensity distribution. Such features will serve as input for the classification system. Classification is performed by Support Vector Machine (SVM).Finally, measure the overlap between the manual and the algorithm segmentation to test the accuracy of frame work. It is expected to obtain greater accuracy and to produce good segmentation results of colonic polyps. Keywords: Colorectal Cancer, CT Colonography, IGVF, SVM

[1] Abraham, H. Dachman and Hiro Yoshida, 2003.Virtual colonoscopy: past, present,and future.Elsevier Science (USA) RadiolClinnam 41, pp: 377–393. DOI:10.1016/S0033-8389(02)00124-0.
[2] John, H. and Bond, 2000. Polyp Guideline: Diagnosis, Treatment and Surveillance for Patients with Colorectal Polyps, The American Journal Of Gastroenterology, 95: 11. Published by Elsevier Science, pp: 3053-3063.
[3] Yoshida, H., N¨appi, J.: Three-dimensional computer-aided diagnosis scheme for detection of colonic polyps. IEEE Transactions on Medical Imaging 20 (2001) 1261–1274.
[4] Yao, J., Miller, M., Summers, R.M.: Automatic segmentation and detection of colonic polyps in CT colonography based on knowledge-guided deformable models. Volume 5031. (2003) 370–380.

Paper Type	:	Research Paper
Title	:	Loadbalancing and Maintaining the QoS On Cloud Computing
Country	:	India
Authors	:	S.Saranya ,K.Dinesh
	:	10.9790/0661-16234450

Abstract: Loadbalancing is the key of cloudcomputing environment.Loadbalancing main function is solving the unbalance or overload problem.Now a days many algorithm using for solve this problem. In this project we introduce load balancer concept.The cloud sever transfer all load to the load balancer.Load balancer concerned with the number of strong nodes and weak nodes.Strong nodes represent the normal load and weak nodes represent the heavy load or overload.Strong nodes and weak nodes denoted green and yellow colour respectively.Loadbalancer split the load among these node and also intimate the normal and overload node.The yellow colour or overload node loads are charged by neighbour node in cyclic manner using this algorithm and also make quick recovery of overload node.Loadbalncer maintain the index for server loading process and create database backup on server when any malicious attack the server.Main objective of this paper is solve the overload problem and make efficient searching process on cloud environment. Keywords: Loadbalance, clouds

[1] Y. Zhu and Y. Hu, "Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 4, pp. 349-361, Apr. 2005.
[2] H. Shen and C.-Z.Xu, "Locality-Aware and Churn-Resilient Load Balancing Algorithms in Structured P2P Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 849-862, June 2007.
[3] Q.H. Vu, B.C. Ooi, M. Rinard, and K.-L. Tan, "Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems," IEEE Trans. Knowledge Data Eng., vol. 21, no. 4, pp. 595-608, Apr. 2009.
[4] H.-C. Hsiao, H. Liao, S.-S.Chen, and K.-C. Huang, "Load Balance with Imperfect Information in Structured Peer-to-Peer Systems," IEEE Trans. Parallel Distributed Systems, vol. 22, no. 4, pp. 634-649, Apr. 2011.
[5] G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, "Dynamo: Amazon's Highly Available Key-Value Store," Proc. 21st ACM Symp. Operating Systems Principles (SOSP '07), pp. 205-220, Oct. 2007.

Paper Type	:	Research Paper
Title	:	Virtual image rendering with stationary RGB color correction for mirror image
Country	:	India
Authors	:	Jeeva.K, kavithaMargret.M
	:	10.9790/0661-16235157

Abstract:Digital image processing which concurrently process the stationary images, and RGB colour corrections in our proposed framework.In this paper we introduce two kind of algorithms.The first one is contour algorithm.This algorithm fully based on the background subtraction algorithm.contour algorithm main function is separation of foreground and background of the images.It can capture structural background motion over a long period of time under limited memory using adaptive and compact background model.The second one is edge detection algorithm. Edge detection is a set of mathematical methods used to identifying points in a digital images as well as the image brightness changes sharply.

[1] P. Eisert, P. Fechteler, and J. Rurainsky, "3-D tracking of shoes for virtual mirror applications," in Proc. Int. Conf. Comput. Vis. Pattern Recognit.,Jun. 2008, pp. 1–6.
[2] J. Shen, S-C S. Cheung, and J. Zhao, "Virtual mirror by fusing multiple RGB-D cameras," in Proc. APSIPA Ann. Summit Conf., Dec. 2012,pp. 1–9.
[3] C. Eisenacher, Q. Meyer, and C. Loop, "Real-time view-dependent rendering of parametric surfaces," in Proc. Symp. Interact. 3-D Graph.Games, 2009, pp. 137–143.
[4] P. Debevec, Y. Yu, and G. Boshokov, "Efficient view-dependent image based rendering with projective texture-mapping," EECS Dept., Univ.California at Berkeley, Berkeley, CA, USA, Tech. Rep. UCB/CSD-98-1003, Jun. 1998.
[5] V. Kitanovski and E. Izquierdo, "3-D tracking of facial features for augmented reality applications," in Proc. Int. Workshop Image Anal. Multimedia Interact. Services, vol. 2. Apr. 2011.
[6] T. Shao, W. Xu, K. Zhou, J. Wang, D. Li, and B. Guo, "An interactive approach to semantic modeling of indoor scenes with an rgbd camera,"ACM Trans. Graph., vol. 31, no. 6, pp. 136–147, Nov. 2012

Paper Type	:	Research Paper
Title	:	Role of Adjacency Matrix in Graph Theory
Country	:	India
Authors	:	Chiranjib Mukherjee, Dr.Gyan Mukherjee
	:	10.9790/0661-16235863

Abstract: Graph theory is an applied branch of the mathematics which deals the problems, with the help of graphs. There are many applications of graph theory to a wide variety of subjects which include Operations Research, Physics, Chemistry, Economics, Genetics, Sociology, Computer Science, Engineering, Mechanical Engineering and the other branches of science. A graph can be represented inside a computer by using the adjacency matrix. We define adjacency matrix and observed based on adjacency matrix. We prove theorem of adjacency matrix and give example. Also draw a graph of adjacency matrix. We derive algorithm to found new adjacency matrix after fusion and fusion for connectedness. Also use fusion algorithm to check the connectedness.

Keywords: Adjacency matrix, Binary matrix, Graph, Mathematical Induction, Fusion.

[1]. Keijo Ruohonen, Graph Theory, 2010,PP. 27-35.
[2]. Kenneth H. Rosen, Discrete Mathematics and its Applications, seventh edition, McGraw Hill, 2007, PP. 45-48.
[3]. Jonathan L. Gross and Jay Yellen, Graph Theory and its applications, Columbia University, New York, USA, 2005.
[4]. A. Gibbons, Algorithmic Graph Theory, Cambridge University Press, 2003.
[5]. C. Godsil and G.Royle, Algorithmic Graph Theory, Cambridge University Press, 2001.
[6]. J. A. Bondy and U.S.R. Murty, Graph Theory with applications, North-Holland, New York, Amsterdam, Oxford, 1982,PP.45-65.

Paper Type	:	Research Paper
Title	:	RDR Cube Cipher an Extension to Vigenere Cipher
Country	:	India
Authors	:	Rahul Sourav Singh, Rupayan Das, Dipta Mukherjee, Prannay Bothra
	:	10.9790/0661-16236471

Abstract: Vigenere Cipher is an encrypting method of alphabetic text using different Shift ciphers or additive based on letter of keywords [1]. It works on the set of 26 alphabets; however its scope is not just limited to English alphabets. Being an old method it's been vulnerable to many attacks. The proposed algorithm is to add a new dimension to this traditional method thus increasing its complexity and hence further reducing its vulnerability to different Vigenere Attacks. The keyword also called Encryption key used in Vigenere is used to select different table for encryption accordingly by the communicating parties using a modulus function. The more randomly the Table is varied based on the random selection of tables from a set of table virtually appearing like a cube more unpredictable the Encrypted text becomes hence increasing the complexity of the algorithm further. Different tables also reduces the variances of the characters hence making it more complex to analyze using the already existing Vigenere Analysis Algorithms. Keywords: Vigenere Cipher, Cryptanalysts, Cryptography, Encryption, Encryption Key, Decryption.

[1] William Stallings: ―Cryptography and Network Security: Principles and Practices 4th Edition, Prentice Hall‖
[2] "What is the frequency of the letters of the alphabet in English?‖ Oxford Dictionary. Oxford University Press. Retrieved 29 December 2012.
[3] Mička, Pavel. "Letter frequency (English)". Algoritmy.net.
[4] Statistical Distributions of English Text
[5] Dara Kirschenbaum:‖Advances in Cryptography History of Mathematics‖ Beker, Henry; Piper, Fred

Paper Type	:	Research Paper
Title	:	Qos Parameters of an Energy Efficient Multicast Congestion Control Protocol (Eemccp) Over Fading Channels
Country	:
Authors	:	Dr. M .Rajanbabu, Ms .A.R .Sushma, Ms. B.S.Sowjanya, Mr. B .Suresh kumar, Ms. B. Tejaswini
	:	10.9790/0661-16237282

Abstract: In this paper we propose an energy efficient multicasting congestion control protocol for mobile ad hoc networks (MANETs) over fading channels. Our proposed scheme overcomes the disadvantages of existing multicast congestion control protocols which depend on individual receivers to detect congestion and adjust their receiving rates over fading channels. In the first phase we observe the performance of data transmission over wireless channels is well captured by their bit error rate which is a function of the signal to noise ratio at the receiver. These models are a function of the distance between the sender and the receiver, the path loss exponent, and the channel gain. The channel gain which is a time-variation parameter is modeled by probability distribution functions.

[1]. LuoJunhai, Xue Liu, Ye Danxia," Research on multicast routing protocols for mobilead-hoc networks", Elsevier, 2007
[2]. AbdussalamNuriBaryun, and Khalid Al-Begain," A Design Approach for MANET Multicast Protocols", ISBN, 2008
[3]. Hua Chen, Baolin Sun," An Entropy-Based Fuzzy Controllers QoS Routing Algorithm in MANET",IEEE,2009
[4]. TolgaNumanoglu and Wendi Heinzelman," Improving QoS in Multicasting Through
[5]. Adaptive Redundancy",University of Rochester Center for Electronic Imaging Systems
[6]. D. Agrawal, T. Bheemarjuna Reddy, and C. Siva Ram Murthy," Robust Demand-Driven Video Multicast over Ad hoc Wireless Networks",IEEE,2006

Paper Type	:	Research Paper
Title	:	Survey on Load Rebalancing For Distributed File Systems in Clouds
Country	:	India
Authors	:	Ms. Nithya Kuriakose, Ms. Shinu Acca Mani
	:	10.9790/0661-16238186

Abstract: Cloud Computing is an emerging technology, it is based on demand service in which shared resources, information, software and other devices are provided according to the clients to the requirements at specific time with the availability of internet. Load balancing is one of the challenging issue in cloud computing. An efficient load balancing makes cloud computing more efficient and improves user satisfaction. It includes fault tolerance, high availability, scalability, flexibility, reduced overhead for users, reduced cost of ownership, on demand services etc. Distributed file systems are key building blocks for cloud computing applications based on the Map Reduce programming paradigm. In such file systems, nodes at the same time serve computing and storage functions. Files can be created, deleted, and appended dynamically. This results in load imbalance in a distributed file system; that is, the file chunks are not distributed uniformly as possible among the nodes.

Keywords: Cloud computing, Load rebalancing, Distributed File system

[2] J.W. Byers, J. Considine, and M. Mitzenmacher, "Simple Load Balancing for Distributed Hash Tables," Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '03), pp. 80-87, Feb. 2003.

[3] P. Ganesan, M. Bawa, and H. Garcia-Molina, "Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems," Proc. 13th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 444-455, Sept. 2004.

[4] A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems," Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms Heidelberg, pp. 161-172, Nov. 2001.

[5] D. Karger and M. Ruhl, "Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems," Proc. 16th ACM Symp. Parallel Algorithms and Architectures (SPAA '04), pp. 36-43, June 2004.

[6] J. Dean and S. Ghemawat, "MapReduce: Simplified Data Processing on Large Clusters," Proc. Sixth Symp. Operating System Design and Implementation (OSDI '04), pp. 137-150, Dec. 2004.

Paper Type	:	Research Paper
Title	:	Monitoring Performance over ISP Links in Route Control System
Country	:	India
Authors	:	E.Revathi, C.Darwin, G.Vivitha
	:	10.9790/0661-16238794

Abstract: Multihoming has been employed by end networks to ensure reliability of internet access. This paper makes two important contributions. First, we present a study of the potential improvements in Internet round-trip times (RTTs) and transfer speeds from employing Multihoming route control. Second, focusing on large enterprises, we propose and evaluate a wide-range of route control mechanisms and evaluate their design trade-offs. The main objective of the project is to implement the Multihoming technique on Route performance benefit using ISP to avoid Congestion. It does not require any modification to Internet routing protocols, and relies solely on end network decisions. We address a number of practical issues such as the usefulness of past history to guide the choice of the best ISP link, the impact of sampling frequency on measurement accuracy, and the overhead of managing performance information for a large number of destinations.

Keywords: Multihoming, Reliability,Round Trip Time, Internet Service Provider, Border Gateway Protocol .

[1] A. Akella, J. Pang, B. Maggs, S. Seshan, and A.Shaikh, "A comparison of overlay routing and multihomingroute control," in Proc. ACM SIGCOMM, Portland, pp 251-279,2004.

[2] J.W. Stewart,"BGP4: Inter-Domain Routing in the Internet"in proc.IEEE INFOCOM,pp24-31,1999.

[4] S. Agarwal, J. Rexford, and R. H. Katz, "Route Science Technologies and PathControl", in proc.IEEE conference, pp 156- 178,2003.

[5] M.Fang,N.Shivakumar,H.Garcia, R.Motwani "Internap Network Services and Flow Control Platform", pp 1140-1147,2002.

[6] C. Estan and G. Varghese, "New directions in Traffic measurement and accounting," in Proc. ACM SIGCOMM, Pittsburgh,pp 585- 598, 2002.

[7] E. M. Nahum, M. Rosu, S. Seshan, and Almeida, "The effects of wide-area conditions on server performance," in Proc. ACM SIGMETRICS, Cambridge,pp 2446-2457, 2001.

[8] F. Guo, J. Chen, W. Li, and T. Chiueh, "Experiences in building a multihoming load balancing system," in Proc. IEEE INFOCOM, Hong Kong, pp 1308-1318, 2004.

[9] Y. Zhang, N. Duffield, V. Paxson, and S.Shenker, "On the constancy of internet path properties," in Proc. ACM SIGCOMM Internet Measurement Workshop (IMW),pp 150-162, 2001.

Paper Type	:	Research Paper
Title	:	Remote Android Assistant with Global Positioning System Tracking
Country	:	India
Authors	:	Jyothi T. S., Catherine Mathew, Irene George
	:	10.9790/0661-16239599

Abstract: The paper describes a method which binds a web application and an Android mobile application, to provide remote exploration services. A remote exploration system has been developed using web server, database, and an Android mobile phone which supports GPS functionality. Web server deals with user interaction part which consists of setting command signals through which user can interact with remote devices. The system is loosely coupled with the introduction of an intermediate server. The user sends commands through browser which maps to the server. Mobile application is responsible for executing user commands. The Web application interacts with the server, fetches commands, executes and provides appropriate responses. The command is sent from the web page. The Android mobile phone reads the sent command and performs predefined action. It can also send GPS location of the mobile phone to server's database.

Keywords: GPS, Android mobile phone, Web application, Contacts, Call log, SMS log.

[1] William Enck, Machigar Ongtang, Patrick McDaniel, Understanding Android Security, IEEE Computer Society, IEEE Security & Privacy, January/February 2009
[2] William Enck, Damien Octeau, Patrick McDaniel, Swarat Chaudhuri, A Study of Android Application Security, Systems and Internet Infrastructure Security Laboratory, Department of Computer Science and Engineering, The Pennsylvania State University
[3] Jaya Bharathi, Srinivasa Rao, Remote computer access through Android mobiles, IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 5, No 3, September 2012, ISSN (Online): 1694-0814
[4] E. Tomur, R. Deregozu, T. Genc, A Wireless Secure Remote Access Architecture Implementing Role Based Access Control: WiSeR, World Academy of Science, Engineering and Technology 18 2008
[5] B. P. S. Sahoo, Satyajit Rath, INTEGRATING GPS, GSM AND CELLULAR PHONE FOR LOCATION TRACKING AND MONITORING, Proceedings of Geomatrix'12, India
[6] Md. Ashraful Alam Milton, Ainul Anam Shahjamal Khan, Web Based Remote Exploration and Control System Using Android Mobile Phone, IEEE/OSA/IAPR International Conference on Informatics, Electronics & Vision, 2012

Paper Type	:	Research Paper
Title	:	Detecting a Proficient Flow Label Propagation from Network Traffic Classification
Country	:	India
Authors	:	S. K. Murugaraja, R. Rameshkumar, K.Sarathkumar
	:	10.9790/0661-1623100106

Abstract: The system model in a traffic classification method introduces the threefunctions that are flow label propagation, nearest cluster based classifier and compound classification. For some special cases, the flow label propagation is critical to require that the labeled flows and unlabelled flows must be captured on the same network in a short period of time. In flow label propagation the peer whose initial flow we have labeled may be off-line, so no other peer will connect to it and flow label propagation is useless for this case. Same for servers, say, and FTP server is popular on a network, and then you will correctly propagate flow information to all other hosts connecting to that server. However, if the server changes its IP address (without changing its DNS name), then will fail to propagate its label. For these type of case propose a alter flow label propagation and also detect the unknown flow in the network

Keywords: FTP (file transfer protocol) , IP (Internet protocol.

Mahmoud And Shen: A Secure Payment Scheme With Low Communication And Processing, Overhead For Multihop wireless networks., IEEE Transactions On Parallel And Distributed Systems, Vol. 24,No. 2, pp. 209-224, February 2013.
[2] G. Shen, J. Liu, D. Wang, J. Wang, and S. Jin, "Multi-Hop Relay for Next-Generation Wireless Access Networks," Bell Labs Technical J., vol. 13, no. 4, pp. 175-193, 2009.
[3] C. Chou, D. Wei, C. Kuo, and K. Naik, "An Efficient Anonymous Communication Protocol for Peer-to-Peer Applications Over Mobile Ad-Hoc Networks," IEEE J. Selected Areas in Comm., vol. 25, no. 1, pp. 192-203, Jan. 2007.
[4] H. Gharavi, "Multichannel Mobile Ad Hoc Links for Multimedia Communications," Proc.IEEE, vol. 96, no. 1, pp. 77-96, Jan. 2008.
[5] S. Marti, T. Giuli, K. Lai, and M. Baker, "Mitigating Routing Misbehavior in Mobile Ad Hoc Networks," Proc. MobiCom‟00, pp. 255-265, Aug. 2000.

Paper Type	:	Research Paper
Title	:	Soft Phone Support Voice and Video Calling Using Sip And Rtp Protocol
Country	:	India
Authors	:	S.Sankar Ganesh, M.B. Prasanth Yokesh, M.E.
	:	10.9790/0661-1623107111

Abstract: Soft Phone is a VoIP soft phone that uses the Session Initiation Protocol. It is a powerful and unique SIP software telephone that lets users make phone and video calls using single software application using any Voice over IP (VoIP) telephony provider. As a fully featured SIP client, Soft Phone is designed from the ground up to work with current and future IP-based. Soft phone can be used in the place where we need establish the voice and video phone calls in the IP network. This can be installed at any personal computer. It uses the SIP protocol to establish the IP session and using RTP, RTCP and RTSP for media transmission. Using Soft phone they make call to any Soft Phone and Physical hardware SIP phone which can understand the SIP protocol.In computing, a soft phone is a software program for making telephone calls over the Internet using a general purpose computer, rather than using dedicated hardware. A soft phone is usually used with a headset connected to the sound card of the PC. To communicate, both end-points must have the same communication protocol and at least one common audio code. Many service providers use the Session Initiation Protocol (SIP) standardized by the Internet Engineering Task Force (IETF)

Keywords: SIP; RTP; VOIP; RTCP; RTSP; IETF.

[1] Ahmad reza Montazerolghaem1, Mohammad Hossein Yaghmaee2(2013)," Sip Overload Control Testbed: Design, Building And Evaluation",International Journal of Ambient Systems and Applications (IJASA) Vol.1, No.2.
[2] Charles Shen and Henning Schulzrinne(2009)," On TCP-based SIP Server Overload Control", Technical Report CUCS-048-09,Columbia University.
[3] Eric C. Noel and Carolyn R. Johnson(2007)," Initial Simulation Results That Analyze SIP Based VoIP Networks Under Overload", 20th International Tele traffic Congress, ITC20,Ottawa, Canada, 17-21.
[4] Hilt and I. Widjaja(2008)," Controlling overload in networks of sip servers", IEEE International Conference on Network Protocols(ICNP), pp.83-93.
[5] K.K. Ram, I.C. Fedeli, A.L. Cox, S. Rixner(2008)," Explaining the Impact of Network Transport Protocols on SIP Proxy Performance", IEEE International Symposium, pp.75-84.
[6] Mohan Krishna Ranganathan, Liam Kilmartin(2002)," Performance analysis of secure session initiation protocol based VoIP networks", Communication and Signal Processing Research Unit, Department of Electronic Engineering, National University of Ireland, University Road, Galway, Ireland.

Paper Type	:	Research Paper
Title	:	HiRLoc: High-resolution Robust Localization for Wireless Sensor Networks
Country	:	India
Authors	:	Wajahat GH Mohd1, Shelly Sharma, Avantika Saklani, Ashish Singhal
	:	10.9790/0661-1623112115

Abstract: In this paper the tiny nodes are deployed in target areas according to the deployment nature of target but nodes are easily targeted by attacker with physical attack of node capture. So, secure communications in some wireless sensor networks are critical because these networks are highly vulnerable to internal and external attacks. In our paper, we present an enhanced High-Resolution Robust Localization for security of wireless sensor networks.

[1] I.F. Akyildiz, and E. Cayirci, "Wireless sensor networks: A survey," Computer Networks, vol. 38, no. 4, pp. 393-422, 2009.
[2] J. Bachrach, C. Taylor. "Localization in sensor networks Handbook of Sensor Networks: Algorithms and Architectures", Hoboken:
John Wiley & Sons, 2009, pp. 277 – 310.
[3] G. Mao, B. Fidan, B. D. Anderson. "Wireless sensor network localization techniques. Computer Networks", 2010, 51(10), pp.
2529– 2553.
[4] Adel Youssef and Moustafa Youssef. Taxonomy of Localization Schemes for Wireless Sensor Networks. In ICWN, pages 444{450,
2009.
[5] "ROPE: robust position estimation in wireless sensor networks," in Proceedings of the 4th International Symposium on Information
Processing in Sensor Networks, April 2011, pp. 324–331.
[6] L. Lazos and R. Poovendran, Robust Range-independent Localization for Wireless Sensor Networks, to appear In Transactions on
Sensor Networks, available upon request.

Paper Type	:	Research Paper
Title	:	Visual Cryptography Implementation with Key Sharing For Effective Phishing Detection Process
Country	:	India
Authors	:	B. K. Prasath, P. Ashok Kumar,
	:	10.9790/0661-1623116119

Abstract: The advent of the internet, various online attacks has been increased and among them the most popular attack is phishing. Phishing is an attempt by an individual or a group to get personal, confidential information such as passwords, credit card information from unsuspecting victims for identity theft, financial gain and other fraudulent activities. Fake websites which appear very similar to the original ones are being hosted to achieve the effective phishing detection The result shows that if we focus on user also know using a website genuine or not, we can detect genuine site to avoid wasting network resources.

Keywords: Phishing, Attacks, Genuine site, Half image, Half key.

[1] S. Stamm, Z. Ramzan, et Jakobsson Markus, "Drive-By Pharming," Proceedings of the 9th international conference on Information and communications security, Zhengzhou, China: ACM, 2007, p. 495-506.
[2] G. Ollman, "The Pharming Guide," Jul. 2005; http://www.ngssoftware.com/papers/ThePharmingGuide.pdf.
[3] C. Jackson, A. Barth, A. Botz, W. Shao, et D. Boneh, "Protecting browsers from DNS rebinding attacks," ACM, vol. 3, Issue 1, Jan. 2009.
[4] C. Karlof, U. Shankar, J. Tygar, et D. Wagner, "Dynamic pharming attacks and locked same-origin policies for web browsers," Proceedings of the 14th ACM conference on Computer and communications security, Alexandria, Viriginia, USA: ACM, 2007, p. 58-71.
[5] S. Egelman, L. Cranor, et J. Hong, "You've been warned: an empirical study of the effectiveness of web browser phishing warnings," Proceeding of the twenty-sixth annual SIGCHI conference on Human factors in computing systems, Florence, Italy: ACM, 2008, p. 1065-1074.
[6] Y. Cao, W. Han, et Y. Le, "Anti-phishing Based on Automated Individual White-List," Proceedings of the 4th ACM workshop on Digital identity management, Alexandria, Viriginia, USA: ACM, 2008, p. 51-60.

Paper Type	:	Research Paper
Title	:	A Survey on Fault Tolerance Mechanisms for job scheduling in Grid computing
Country	:	India
Authors	:	S.Supriya, S.Dinesh Babu
	:	10.9790/0661-1623120122

Abstract: Grid computing is defined as a hardware and software infrastructure that enables sharing of coordinated resources in a dynamic environment. In grid computing, the probability of a failure is much greater than parallel computing. Therefore, the fault tolerance is an important issue in order to achieve reliability, availability of resources. When scheduling a job, the resource uses both average failure time and failure rate of grid resources combined with resources response time to generate scheduling. There are several reasons for failure in execution such as network failure, resource overloading, or non-availability of required software components. Thus, fault-tolerant systems should be able to identify and rectify the failures and support reliable execution in the presence of failures.In this paper, a survey made on various fault tolerance techniques and mechanism and job management in grid computing.

Keywords: Fault-tolerance, Grid scheduling, Checkpointing Recovery.

[1] DheerajBhardwaj. Grid Computing Concepts, Applications, anTechnologies Department of Computer Science and Engineering Indian Institute of Technology, Delhi
[2] Paul Townend and JeiXu, "Fault Tolerance within a Grid Environment" Proceedings of AHM2003
[3] Koo. R. and S.Toueg..Checkpointing and Rollback-Recovery for Distributed Systems. .IEEE Transactions on Software Engineering, SE- 13(1):23-31, January 1987.
[4] Silva L, Silva J 1992 Global checkpointing for distributed programs. Proc. IEEE 11th Symp.On Reliable Distributed Syst. pp 155-162.
[5] J.L. Kim and T. Park. "An efficient protocol for checkpointing recovery in Distributed Systems" IEEE Transaction On Parallel and Distributed Systems, 4(8):pp.955-960, Aug 1993.
[6] Prakash R. and SinghalM.Low-Cost Checkpointingand Failure Recovery in Mobile Computing Systems. ,IEEE Transaction On Parallel and Distributed Systems, vol. 7,no. 10, pp. 1035- 1048, October1996.
[7] Chandy K. M. and Lamport L., "Distributed Snapshots: Determining Global State of Distributed Systems," ACM Transaction on Computing Systems, vol. 3, No. 1, pp. 63-75, February 1985.

Paper Type	:	Research Paper
Title	:	Automated Packet Classification and Layer Identification of Network Packets a Review
Country	:	India
Authors	:	Shancy P. Varghese, Jasmine Joseph
	:	10.9790/0661-1623123126

Abstract: Traffic classification is an automated process which categorizes computer network traffic according to various into a number of traffic classes. In this paper we are comparing different traffic classification methods and also presents an automated packet classification and layer identification to improve classification performance when few training data is available. In this we are grouping the similar flows and classifying it by using a classifier combination framework. We are aggregating naive Bayes (NB) predictions of the correlated flows. In this we are finding the denial of service (DOS) attack and also we are identifying which all applications are running in the systems which connected in that network. We are identifying the applications based on their port number.

Keywords: Traffic classification, network security, naive Bayes..

[1] Jun Zhang, Chao Chen, Yang Xiang, Wanlei Zhou, and Yong Xiang, "Internet traffic classification by aggregating naïve bayes prediction," in Proc. SIGCOMM Comput. Commun. Rev., Jan. 2013, vol. 8, pp. 5–18.
[2] T. Karagiannis, K. Papagiannaki, and M. Faloutsos, "BLINC: Multi- level traffic classification in the dark," in Proc. SIGCOMM Comput. Commun. Rev., Aug. 2005, vol. 35, pp. 229–240.
[3] A. W. Moore and D. Zuev, "Internet traffic classification using bayesian analysis techniques," in SIGMETRICS Perform. Eval. Rev., Jun. 2005, vol. 33, pp. 50–60.
[4] S. Zander, T. Nguyen, and G. Armitage, "Automated traffic classifi- cation and application identification using machine learning," in Proc. Ann. IEEE Conf. Local Computer Networks, Los Alamitos, CA, 2005, pp. 250–257.
[5] L. Bernaille, R. Teixeira, I. Akodkenou, A. Soule, and K. Salama- tian, "Traffic classification on the fly," in Proc. SIGCOMM Comput. Commun. Rev., Apr. 2006, vol. 36, pp. 23–26.