IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
PROF. PRIYA PISE, PROF. R M GOUDAR Department Of IT Indira College of Engeneering & Management, Pune, India Department of Computer, MITAOE, Alandi (D), Pune, India
DR. MAYA NAYAK AND ER. JNANA RANJAN TRIPATHY Department of Information Technology, Biju Pattnaik University of Technology, Orissa Engineering College Bhubaneswar, Odisha-752050, India Department of Computer Science & Engineering, Biju Pattnaik University of Technology, Orissa Engineering College Bhubaneswar, Odisha-752050, India
K.PARKAVI, DR.P.VIVEKANANDAN Research scholar, Department of Computer Science and Engineering, Anna University, Chennai, India Professor, Department of Chemical engineering, Anna University, Chennai, India
K.BHARATH REDDY, CH. RAJENDRA PRASAD PG Student, Department of ECE, SR Engineering College, Warangal Assistant professor, Department of ECE, SR Engineering College, Warangal
BINU.A, NITHESH K.NANDHAKUMAR Asst. Professor, Dept. of IT, Rajagiri School of Engineering & Technology, Kochi, India Dept. of IT, Salalah College of Technology, Dhofar Governorate, Salalah, Sultanate of Oman
MANISHA THOOL, PROF. PREETI VODITEL Student of M-Tech, Computer Science & engineering, Ramdeobaba College of Engineering & Management, Nagpur, India HOD, MCA, Ramdeobaba College of Engineering & Management, Nagpur, India
D.VENKATARAMI REDDY, S. CHANDRAVATHI, M. NIHARIKA, G. DIVYA KUMARI PG Student, CSE Department, Shri Vaishnav Institute of Technology & Science, Indore, India Reader, CSE Department, SVITS, Indore, India
SHUBHAM KOTHARI, MR. DINESH CHANDRA JAIN PG Student, CSE Department, Shri Vaishnav Institute of Technology & Science, Indore, India Reader, CSE Department, SVITS, Indore, India
NEHA MEHTA, MAMTA KATHURIA MAHESH SINGH Student, M.tech (CSE), Advanced Institute of Technology & Management, Palwal, Haryana, India Asstt. Proff.CSE, YMCA University of Science & Technology, Faridabad, Haryana, India Asstt. Proff.(CSE) Advanced Institute of Technology & Management, Palwal, Haryana, India
KHYATI N.PATEL, MRS. SAMEENA ZAFAR, MISS SWETA S.PATEL P.G.Student, Dept of Electronics & Communication, Patel College Of Science & Technology, Rajiv Gandhi Praudyogiki Vishvavidyalaya, Bhopal Head Of The Dept of Electronics & Communication, Patel College Of Science & Technology, Rajiv Gandhi Praudyogiki Vishvavidyalaya, Bhopal Lecturer in M.L.Institute Of Diploma Studies, Bhandu, Mehsana
ISHA JINDAL, RAJESH KHANNA Student, Department of Electronics and Communication Engineering, Thapar University, Patiala, India Professor, Department of Electronics and Communication Engineering, Thapar University, Patiala, India
BANGARU VEERA BALAJI, VEDULA VENKATESWARA RAO M.Tech Final, Department of CSE, Sri Vasavi Engineering College, Tadepalligudem, India Associate Professor, Department of CSE, Sri Vasavi Engineering College, Tadepalligudem, India
VISHWAJIT N. SONAWANE, PROF. SANJAY V. KHOBRAGADE M.Tech Student, Department of E & TC, Dr. B.A.T.U., Lonere, Maharashtra, India Assistant Professor, Department of E & TC, Dr. B.A.T.U., Lonere, Maharashtra, India
PRADEEP S G, AKESH GOVADA, KENDAGANNA SWAMY PG Scholar, Biomedical Signal Processing & Instrumentation, Dept of IT, RVCE, Bangalore, India PG Scholar, Biomedical Signal Processing & Instrumentation, Dept of IT, RVCE, Bangalore, India Assistant professor, Biomedical Signal Processing & Instrumentation, Dept of IT, RVCE, Bangalore, India
GARIMA, AMANPREET KAUR, RAJESH KHANNA Student, ECE, Thapar University, Patiala, India Assistant Professor, ECE, Thapar University, Patiala, India Professor, ECE, Thapar University, Patiala, India
DR.NEERAJ BHARGAVA, DR.RITU BHARGAVA, PRAKASH SINGH TANWAR, ANKIT SHARMA Associate Professor, Dept. of Computer Science, School of Engg., & System Sciences, MDS University, Ajmer, India Lecturer, Dept. of MCA, Govt. Women’s Engineering College, Ajmer, India Research Scholar, Dept. of Computer Science, MJRP University, Jaipur,India Dept. of Computer Science, School of Engineering & System Sciences, MDS University, Ajmer, India
N.V.MURALI KRISHNA RAJA, K.SHIRIN BHANU M.Tech Final, Department of CSE, Sri Vasavi Engineering College, Tadepalligudem, India Associate Professor, Department of CSE, Sri Vasavi Engineering College, Tadepalligudem, India
USHA B A, DR. N K SRINATH, DR. N K CAUVERY Assistant Professor, Department of CSE, R V College of Engineering, Bangalore, India Professor and Head, Department of CSE, R V College of Engineering, Bangalore, India Professor, Department of ISE, R V College of Engineering, Bangalore, India
MRS. SONAM JAIN, MR. SANDEEP POONIA M.Tech (CSE) Scholar, Jagannath University, Jaipur Associate Professor, Department of Computer Science & Engineering, JNIT University, Jaipur
S.R.M.KRISHNA, P.KAMAKSHI PRASAD, Y.VISHNUTEJ, P.NARENDRA KUMAR Assistant Professor, Department of CSE, Gayatri Vidya Parishad College of Engineering, Visakhapatnam, INDIA Professor, Department of CSE, JNTU Hyderabad, Hyderabad, INDIA Student, Department of CSE, Gayatri Vidya Parishad College of Engineering, Visakhapatnam, INDIA Student, Department of CSE, Gayatri Vidya Parishad College of Engineering, Visakhapatnam, INDIA
VINAI G. BIJU, VINOD. K. AGRAWAL Assistant Prof. Dept. of CSE, Christ University, Bangalore, India Professor, Dept. of Information Science, PESIT, Bangalore, India
SUNITA SHARMA, AMIT CHUGH, AJAY KUMAR M.Tech. Student, Dept. of CSE, Lingayas University Faridabad, Faridabad, India Assistant Professor, Dept. of CSE, Lingayas University Faridabad, Faridabad, India Software Engineer, Aricent Group, Gurgaon, India
SUMANPREETKAUR, RAJINDER SINGHVIRK Student, Computer Science and Engineering, Guru Nanak Dev University Amritsar, Punjab, India Associate Professor, Computer Science and Engineering, Guru Nanak Dev University Amritsar, Punjab, India
PAVAN MULGUND, GAYATHRI. N 4th Sem M.Tech, Computer Science and Engineering, MVJCE, Bangalore, India Associate Professor & H.O.D, Information Science and Engineering, MVJCE, Bangalore, India
NISHA ACHRA, GARIMA MATHUR, PROF. R.P. YADAV M. Tech.Scholar, EC Deptt., JEC Kukas, Jaipur, India Research Scholar, EC Deptt., M.N.I.T, Jaipur, India Vice Chancellor RTU Kota, India
RITIKA MITTAL, KRITIKA SONI Assistant professor, Dept of CSE, Manav Rachna International University, Faridabad, India Student of M Tech., Dept of CSE, Manav Rachna International University, Faridabad, India
SHAMNA P, PAUL AUGUSTINE, TRIPTI C M.Tech Scholar, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India
M. Renuka Devi, Mr.S.Saravanan Assistant Professor of MCA Department, Sree Saraswathi Thyagaraja College, Pollachi, Bharathiar University, Coimbatore, Tamil Nadu, India Research Scholar of Computer Science, Sree Saraswathi Thyagaraja College, Pollachi, Assistant Professor, Department of Computer Science, Nehru Arts and Science College, Coimbatore, Bharathiar University, Coimbatore, Tamil Nadu, India
JISHA S, DIYA THOMAS, SANGEETHA JAMAL M. Tech Scholar, Department of Computer Science, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Department of Computer Science, Rajagiri School of Engineering and Technology, Kochi, India
K.VIDHYA, DR. K.R.SHANKAR KUMAR AP / ECE Department, Sri Ramakrishna Engineering College, Coimbatore, Tamil Nadu, India Professor/ ECE Department, Sri Ramakrishna Engineering College, Coimbatore, Tamil Nadu, India
T. GOKARAMAIAH, M. VYSHNAVI, E.SANDEEP KUMAR, K. ANGEL Assistant Professor, Information Technology, G.Pullaiah College of Engineering and Technology, Kurnool, India Student, Information Technology, G.Pullaiah College of Engineering and Technology, Kurnool, India
MILIND U. NEMADE, PROF. SATISH K. SHAH Associate Professor, Department of Electronics and Telecommunication, K.J.Somaiya Institute of Engineering and Information Technology, Sion (E), Mumbai, India Professor, Department of Electrical Engineering, Faculty of Technology and Engineering, Vadodara, India
KEDAR TRIVEDI, NANDISH THAKER BTech, EC, Institute of Technology, Nirma University, Ahmedabad, India BTech, EC, Institute of Technology, Nirma University, Ahmedabad, India
N.S.SIVARAJAN, D.SHANMUGAVEL, P.R.NIRMALBINU II ME CSE, Sri Muthukumaran Institute of Technology, Chennai, Anna University Chennai Assistant Professor, Department of CSE, Sri Muthukumaran Institute of Technology, Chennai, Anna University Chennai Assistant Professor, Department of CSE, P.S.N College of Engineering and Technology College, Tirunelveli, Anna University Chennai
MR. K. RAJKUMAR, DR. P. GANESHKUMAR, P. SENTHILKUMAR Associate Professor, Dept of IT, PSNA College of Engineering &Technology, Dindigul, Tamilnadu Professor, Dept of IT, PSNA College of Engineering &Technology, Dindigul, Tamilnadu Associate Professor, Dept of IT, PSNA College of Engineering &Technology, Dindigul, Tamilnadu
PRIYANKA SHARMA, PARUL DIHULIA, VIKAS GUPTA Research Scholar, EC Department, TIT, Bhopal, Madhya Pradesh, India Assistant Professor, EC Department, TIT, Bhopal, Madhya Pradesh, India Head of Department, EC Department, TIT, Bhopal, Madhya Pradesh, India
B.SANKARA SUBRAMANIYAN, K.MOHAN, S.SRINIVASAN Asst. Professor, Dept. of Computer Science and Engineering, SCSVMV University, Kanchipuram, India Principal, Dept. of Information Technology, Padaleswarar Polytechnic College, Cuddalore, India PG Scholar, Dept. of Computer Science and Engineering, SCSVMV University, Kanchipuram, India
DR. MRS.S.V.SANKPAL, PROF. M.K.NARAYANKAR Asso.Professor, ETC dept, D.Y.P.College of engg. & Tech. Kolhapur, India Asst.Professor, ETC dept., S.T.B.College of engg, Tuljapur, India
VIJAY JEYAKUMAR, M. KATHIRARASI HASMI Assistant Professor, Department of Biomedical Engg & P.S.N.A College of Engg and Technology, Tamil Nadu, India Lecturer, Department of Biomedical Engg & P.S.N.A College of Engg and Technology, Tamil Nadu, India
GEETHA V, DEEPIKA SINGH Assistant Professor, Information Science and Engineering, RVCE, Bangalore, India Student – MTECH, Information Science and Engineering, RVCE, Bangalore, India
KEE-CHEOL LEE Computer Engineering Department, Hongik University, Seoul, Korea 121-791
|
Abstract
Watermarking Of Images In Discrete Cosine Transform
PROF. PRIYA PISE, PROF. R M GOUDAR Department Of IT Indira College of Engeneering & Management, Pune, India Department of Computer, MITAOE, Alandi (D), Pune, India
Abstract: Data embedding is simplest technique to achieve the secret data sharing information. Now days a color image is a very popular to consider cover image medium used to send the secret data. I have proposed an approach for hiding a secret image in a cover image. In the beginning, the DCT [8] of image is computed that is compress the secret image, and then encrypt cover data by DES. Various authors have proposed many watermarking algorithms. These algorithms are implemented in ether the spatial, frequency or wavelet domains. But which algorithms are better? Is embedding a watermark in one domain better than another? Do combining domains result in a better watermarking algorithm? This report attempts to answer these questions by selecting eight algorithms and analyzing them. Of these eight algorithms 2 embeds the watermark in the spatial domain, 2 in the frequency domain, 2 in the wavelet domain, one in a combination of frequency and spatial domain. Do to the wide variety of algorithms a standard benchmark is also developed, within this report, to analyze the algorithms. In this work, the steganographic paradigm of data hiding in digital images has implemented. Several algorithms based on this approach exist in literature and the strengths and limitations of these algorithms are mentioned. Two existing algorithms which secures a cover image during embedding and DCT [9] algorithm embeds secrete image into a cover image while inherently preserving the first order statistics of the image. Finally, embed the cover image into the middle-frequency domain of DCT [1]. After embedding the secret image, the goal of steganography can be successfully achieved .The proposed algorithms are successful in embedding the image in bit alteration .The purpose of this project is provide n-Bit security.
Keywords: Steganography, data hiding, fractal image compression, DCT,BCBS
Pattern Classification Using Neuro Fuzzy and Support Vector Machine (SVM) – A Comparative Study
DR. MAYA NAYAK AND ER. JNANA RANJAN TRIPATHY Department of Information Technology, Biju Pattnaik University of Technology, Orissa Engineering College Bhubaneswar, Odisha-752050, India Department of Computer Science & Engineering, Biju Pattnaik University of Technology, Orissa Engineering College Bhubaneswar, Odisha-752050, India
Abstract: In this paper, we present a comparative study on applications of Neuro Fuzzy and Support Vector Machines (SVMs) for pattern recognition. Since SVMs show good generalization performance on many real-life data and the approach is properly motivated theoretically, it has been applied to wide range of applications. This paper describes a brief introduction of SVMs and summarizes its numerous applications and comparative study of SVM and Neuro Fuzzy in pattern recognition.
Energy Aware Secure Routing Protocol For Mobile Adhoc Networks
K.PARKAVI, DR.P.VIVEKANANDAN Research scholar, Department of Computer Science and Engineering, Anna University, Chennai, India Professor, Department of Chemical engineering, Anna University, Chennai, India
Abstract: Ad-hoc networks are collection of mobile nodes that temporarily form a dynamic network and these nodes are communicated through the wireless link. Ad-hoc mobile networks are self organizing distributed networks in which the nodes rely on each other to transfer data without any fixed infrastructure. A routing protocol plays a vital role to handle entire network for communication and determines the efficient path. If the transmission from a source to the destination is successful, it has been assumed that the routing protocol is more suitable. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an adhoc Network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Although establishing an efficient route is a main goal, a more challenging task is to provide energy efficient routing protocols. Since, the critical factors for an ad-hoc network are the operation time that can be restricted by battery energy and propagation effects. This paper surveys the efficient energy aware routing techniques proposed for MANETs.
The Embedded Web server based Electrical Ethernet Monitoring system using ARM
K.BHARATH REDDY, CH. RAJENDRA PRASAD PG Student, Department of ECE, SR Engineering College, Warangal Assistant professor, Department of ECE, SR Engineering College, Warangal
Abstract: In the monitoring system, the existing resource of Ethernet is used to remotely monitor power network parameters. A practical design of embedded Web server for power network monitoring is introduced, which applies high speed MCU (ARM7-LPC2148) to conveniently link to Ethernet. Adopting Ethernet interface control mode, the remote network monitoring of power network is realized under Windows. A web server in the device provides access to the user interface functions for the device through a device webpage. A web server can be embedded into any appliance and connected to the Internet so the appliance can be monitored and controlled from remote places through the browser in a desktop .The aim of the paper is to control the devices or equipment‟s from the remote place through a web page. The web-server circuit is connected to LAN or Internet. The client or a person on the PC is also connected to same LAN or Internet. By typing the IP-address of LAN on the web browser, the user gets a web page on screen; this page contains all the information about the status of the devices. The user can also control the devices interfaced to the web server by pressing a button provided in the web page.
Keywords: Keywords-Ethernet; embedded Web server, monitoring system; TCP/IP protocol
A Survey on Intrusion Detection Systems in Mobile Ad Hoc Networks
TREESA NICE P.A. Department of Computer Science and Engineering, Rajagiri School of Engineering and Technology, Ernakulam, India
Abstract: The mobile ad hoc networks (MANET) have been used in recent years, in many applications. They are more vulnerable to malicious attack. It is very tough to accomplish the complete security in the mobile ad hoc network. This is because of some of its unique characteristics. Besides the prevention methods, we need to detect and take necessary actions to provide the security to these types of networks. For this purpose we are using many intrusion detection systems (IDSs). In this paper, we have described the different characteristics of ad hoc networks and some of the attacks in ad hoc networks. Besides that, a comparative study about the existing IDSs is also presented.
Keywords: Ad hoc network, Anomaly detection, IDS Agent, Home Agent.
A Survey on Bio-inspired Methods for Resource Discovery
BINU.A, NITHESH K.NANDHAKUMAR Asst. Professor, Dept. of IT, Rajagiri School of Engineering & Technology, Kochi, India Dept. of IT, Salalah College of Technology, Dhofar Governorate, Salalah, Sultanate of Oman
Abstract: In the past, people exposed a variety of the motivating insect or creature behaviours in the nature. A congregate of birds sweeps across the sky. A group of ants hunt for food. A group of fish swims, turns, flees together... - we label this category of group activity as swarm behaviour. Recently biologists and computer scientists in the field of artificial life have studied how to model biological swarms to understand how such social animals interact, achieve goals, and evolve. Biologically inspired computing is an area of computer science which uses the advantageous properties of biological systems. It is the amalgamation of computational intelligence and collective intelligence. Biologically inspired mechanisms have already proved successful in achieving major advances in a wide range of problems in computing and communication systems.
Keywords: Bio-inspired Methods, ACO, Honey Bee Foraging, Migration of Elephants
MANISHA THOOL, PROF. PREETI VODITEL Student of M-Tech, Computer Science & engineering, Ramdeobaba College of Engineering & Management, Nagpur, India HOD, MCA, Ramdeobaba College of Engineering & Management, Nagpur, India
Abstract: Many applications involve the generation and analysis of a new kind of data, called stream data, where data flow in and out of an observation platform or window dynamically. Such data streams have the unique features such as huge or possibly infinite volume, dynamically changing, flowing in or out in a fixed order, allowing only one or a small number of scans. An important problem in data stream mining is that of finding frequent items in the stream. This problem finds application across several domains such as financial systems, web traffic monitoring, internet advertising, retail and e- business. This raises new issues that need to be considered when developing association rule mining technique for stream data. In this paper, we propose an integrated online streaming algorithm for solving both problems of finding the top-k elements, and finding frequent elements in a data stream. Our Space-Saving algorithm reports both frequent and top-k elements with tight guarantees on errors. We also develop the notion of association rules in streams of elements. The Streaming-Rules algorithm is integrated with Space-Saving algorithm to report 1-1 association rules with tight guarantees on errors, using minimal space, and limited processing per element and we also implement the Apriori algorithm for static datasets and generated association rules and implement Streaming-Rules algorithm for pair, triplet association rules. We compare the top- rules of static datasets with output of stream datasets and find percentage of error.
Keywords: Association rule mining, frequent itemsets, Apriori algorithm, streaming-rules algorithm
Defect Secure Encoder and Decoder for very Small Memory Appliance
D.VENKATARAMI REDDY, S. CHANDRAVATHI, M. NIHARIKA, G. DIVYA KUMARI PG Student, CSE Department, Shri Vaishnav Institute of Technology & Science, Indore, India Reader, CSE Department, SVITS, Indore, India
Abstract: The project consists of an efficient VLSI implementation of fault secure encoder and decoder for memory appliances. A novel and efficient VLSI architecture is proposed and implemented for the fault secure memory. The VLSI architecture has been authored in Verilog code for fault secure encoder and decoder for memory and its synthesis was done with Xilinx XST. Xilinx ISE Foundation 9.1i has been used for performing mapping, placing and routing. For behavioral simulation and place and route simulation ISE simulator has been used. The Synthesis tool was configured to optimize for area and high effort considerations. The interest of the project work is an attempt to obtain fault secure memory architecture. This fault secure memory is used in computer systems mainly servers and in memory appliances and also used in military appliances. A new approach is introduced to design fault-secure encoder and decoder circuitry for memory designs. The key novel contribution of this proposed system is identifying and defining a new class of Error-Correcting Codes (ECC) whose redundancy makes the design of Fault-Secure Detectors (FSD) particularly simple. This project present a fault-tolerant nano scale memory architecture which tolerates transient faults both in the storage unit and in the supporting logic (i.e., encoder and decoder (corrector) circuitry).The proposed system with high fault-tolerant capability is feasible when the following two fundamental properties are satisfied.
Keywords: encoder,decodet, fault-tolerant detector, tolerentmemory,majoritylogiccorrector, synthesizing and optimizing
2D-DWT Lifting Based Implementation using VLSI for JPEG2000
MRS. A.F. MULLA, DR. SMT.R.S.PATIL Asst.Prof. ETC, BVC, Kolhapur, India Professor, ETX, DYPCT, Kolhapur, India
Abstract: This paper proposes the design of VLSI architecture for image compression. The architecture has been simulated using behavioral VHDL. VHDL allows as much of the design as possible to be portable and flexible to other synthesis tools. To perform the process of image compression VLSI architecture is designed using lifting based discrete wavelet transform (DWT) and it is implemented in Spartan 3EDK kit. The decomposition algorithm of this transform is designed and synthesized with the VHDL language and then implemented on the FPGA Spartan 3E starter kit (XC3S500E) to check validation of results and performance of design. The VHDL model is validated through simulation using ModelSim-Altera. . The motivation in designing is to reduce its complexity, enhance its performance and to make suitable development on a reconfigurable FPGA based platform for VLSI implementation. The main feature of the lifting based DWT scheme is to break up the high pass and low pass filters into a sequence of upper and lower triangular matrices and convert the filter implementation into banded matrix multiplications [1], [2]. Such a scheme has several advantages, including “in-place” computation of the DWT, integer-to-integer wavelet transform (IWT), symmetric forward and inverse transform, etc. Traditional DWT architectures are based on convolutions. Then, the second-generation DWTs, which are based on lifting algorithms, are available. The outputs generated by the row and column processors are stored in memory modules. The memory modules are divided into multiple banks to accommodate high computational bandwidth requirements. The lifting based DWT architecture has the advantage of lower computational complexities and higher efficiencies. Through the DWT, signals can be decomposed into different sub bands with both time and frequency information. Compared with convolution-based ones; lifting-based architectures not only have lower computation complexity but also require less memory.
SHUBHAM KOTHARI, MR. DINESH CHANDRA JAIN PG Student, CSE Department, Shri Vaishnav Institute of Technology & Science, Indore, India Reader, CSE Department, SVITS, Indore, India
Abstract: As each technical user is needed to have Operating Systems like Windows XP/Windows 7 in his/her pendrive because many computers,tablets ,laptops & i-pads, do not have drives. Our aim here is to make start PC with the help of flash drives.These flash drives are used here to start systems which donot have any type of Operating System or having corrupt or damaged operating system.
Comparison of Conventional & Fuzzy Clustering Techniques: A Survey
NEHA MEHTA, MAMTA KATHURIA MAHESH SINGH Student, M.tech (CSE), Advanced Institute of Technology & Management, Palwal, Haryana, India Asstt. Proff.CSE, YMCA University of Science & Technology, Faridabad, Haryana, India Asstt. Proff.(CSE) Advanced Institute of Technology & Management, Palwal, Haryana, India
Abstract: The web is the largest information repository observed till date. Due to its huge size however, finding the relevant information is not an easy task. So different searching and web mining techniques are being employed by the present day search engine for the purpose of information retrieval from the web. Web document clustering is one possible technique to improve the efficiency in information finding process. The traditional web mining, techniques of web mining have difficulties in handling the challenges posed by the collection of data which is vague and uncertain. Fuzzy clustering methods have the potential to manage such type of situations efficiently. This paper summarizes the different characteristics of web data, the web mining basics and limitations of existing web mining methods. The application of use of Fuzzy logic with web mining is being discussed with a view to highlight its importance in information retrieval. A comparative study of different fuzzy clustering techniques with the conventional clustering technique has been discussed.
Keywords: Web mining, Conventional clustering, Fuzzy Clustering.
Performance Comparison between Optical and Copper Interconnects
MAHESH KUMAR, KARAMJIT SINGH SANDHA Student, M.E. ECE, Thapar University, Patiala, India Asst. Professor Dept. of E.C.E., Thapar University, Patiala, India
Abstract: This paper gives performance comparison between optical and copper interconnects in terms of delay for global interconnect level. As the technology is scaled down, device dimensions have been shrunk on the chip, the conventional copper interconnects are not able to fulfil different design requirements. The optical interconnects can be considered as a substitute for copper interconnects. In this paper delay of optical and copper interconnects is simulated using SPICE simulation for different technology nodes at global interconnect length. The results of this paper show that optical interconnects give better results as compared to conventional copper interconnect for global interconnect length.
Keywords: Optical interconnects, copper interconnects, delay, technology nodes and CMOS.
Abstract: WMNs are multi-hop systems in which devices sustain each other in transmitting packets from beginning to end in the network. A mesh system offers multiple redundant interactions paths throughout the network. If one link fails for any reason, the network automatically routes messages through alternate paths. One of the principal issues in routing is to providing acceptable performance while scaling the wireless mesh network. It is appealing, however to look at what happens when routing nodes are extended in propagation environment and how that affects routing metric. In this paper, we examine the usage of different proactive, reactive and hybrid protocols in such a way so that we may be able to built a cost function which helps in selecting the optimum grouping of routing protocols for a particular urban wireless mesh network. The key metric is network throughput. A non linear cost function equation has been proposed analogous to routing metric taken. Bit rate is in use as constant (CBR).
Implementation Of Disparity Estimation Algorithm For Digital Images
KHYATI N.PATEL, MRS. SAMEENA ZAFAR, MISS SWETA S.PATEL P.G.Student, Dept of Electronics & Communication, Patel College Of Science & Technology, Rajiv Gandhi Praudyogiki Vishvavidyalaya, Bhopal Head Of The Dept of Electronics & Communication, Patel College Of Science & Technology, Rajiv Gandhi Praudyogiki Vishvavidyalaya, Bhopal Lecturer in M.L.Institute Of Diploma Studies, Bhandu, Mehsana
Abstract: Obtaining the reliable disparity maps, indicating distance of surface from the stereo camera pair. Stereo vision is one of the methods. It uses stereo image pairs from two cameras to produce disparity maps that can be easily turn into depth maps. Reliability of depth maps and computational cost of algorithm is key issue for implementing real time robust applications.
Algorithm for visual correspondence search has been implemented to generated disparity. Quality metrics used for evaluating the performance of stereo correspondence algorithms and the techniques used for acquiring image data sets and ground truth estimates and got comparisons of the algorithm.
Keywords: Image Processing, Stereo matching, Window based method, horizontally line based method.
Rejection of Multiple Interfering Bands Using Stepped Impedance Resonators along the Feed Line
ISHA JINDAL, RAJESH KHANNA Student, Department of Electronics and Communication Engineering, Thapar University, Patiala, India Professor, Department of Electronics and Communication Engineering, Thapar University, Patiala, India
Abstract: Rejection of interfering bands in ultrawide band antenna has become a latest topic of research. For this purpose, etching of slots, EBG structures, folded strip configuration was used but from that only one or two notch bands are obtained. In this paper, multiple narrow bands are being notched on a circular monopole ultrawide band (UWB) antenna by using stepped impedance resonators (SIRs) along both sides of the feed line. The principle of wave cancellation is used and discussed by taking two cases with one stepped impedance resonator(SIR) on each side separately and then by combining their effects. By using two Stepped Impedance Resonators (SIRs), four bands can be rejected simultaneously.
Performance on SOA Based Wavelength Conversion at 10 GB/s by dual pump four wave mixing over a 50 nm
PROF A.K.JAISWAL, SHREYASHREE VERMA
Abstract: We demonstrate an 50 nm wavelength shift using two orthogonally polarized pump with four wave mixing .We show that the wavelength conversion using of a four wave mixing in SOA ,increases the error free conversion .50 nm wavelength down conversion 35nm up conversion have been obtained at10 Gb/s. This results a significance improvement over the previous best performance of an Fwm based wavelength converter and demonstrate the large wavelength shift capacity of Fwm technique.
Keywords: Semiconductor optical amplifier, four wave mixing, optical network, wavelength conversion, frequency conversion communication system.
Improved Classification Based Association Rule Mining
BANGARU VEERA BALAJI, VEDULA VENKATESWARA RAO M.Tech Final, Department of CSE, Sri Vasavi Engineering College, Tadepalligudem, India Associate Professor, Department of CSE, Sri Vasavi Engineering College, Tadepalligudem, India
Abstract: Association rule mining and classification are two important techniques of data mining in knowledge discovery process. Integration of these two techniques is an important research focus and has many applications in data mining. Integration of these two techniques has produced new approaches called Class Association Rule Mining or Associative Classification Technique. These two combined approaches provide better classification accuracy in classifying the data. Content based information retrieval research areas require high efficiency and performance. In these applications association rule mining discovers association patterns from data and based on association patterns we classify target classes. Our paper mainly focuses on combining classification and association rule mining for classifying the data accurately. In this paper we proposed to implement two new algorithms CPAR (Classification Based on Predictive Association Rule) and CMAR (Classification Based on Multiple-class Association Rules) which combines the advantages of both associative classification and traditional rule-based classification. Instead of generating a large number of candidate rules as in associative classification, CPAR adopts a greedy algorithm to generate rules directly from training data. Moreover, CPAR generates and tests more rules than traditional rule-based classifiers to avoid missing important rules. To avoid over fitting, CPAR uses expected accuracy to evaluate each rule and uses the best k rules in prediction. CMAR applies a CR-tree structure to store and retrieve mined association rules efficiently, and prunes rules effectively based on confidence, correlation and database coverage. The classification is performed based on a weighted χ2 analysis using multiple strong association rules. Our extensive experiments show that CMAR is consistent, highly effective at classification of various kinds of databases and has better average classification accuracy in comparison with FOIL (First Order Inductive Learner) and PRM (Predictive Rule Mining). The proposed algorithms are superior in terms of memory requirements, time complexity and eliminate intermediate data structures in implementation.
Keywords: Association Rule Mining, Classification, Data Mining , Knowledge Discovery, FOIL(First Order inductive Learner), PRM(Predictive Rule Mining), CMAR(Classification Based on Multiple-class Association Rules), CPAR(Classification Based on Predictive Association Rule) , CBA(Classification Based Association).
Comparative Analysis between A-law & μ-law Companding Technique for PAPR Reduction in OFDM
VISHWAJIT N. SONAWANE, PROF. SANJAY V. KHOBRAGADE M.Tech Student, Department of E & TC, Dr. B.A.T.U., Lonere, Maharashtra, India Assistant Professor, Department of E & TC, Dr. B.A.T.U., Lonere, Maharashtra, India
Abstract: In this paper, one of the categories of PAPR Reduction Technique i.e. Signal distortion techniques are being simulated & discussed using Matlab/Simulink Software version 7.14. Then comparison of A-law companding technique and μ-law companding technique which comes under above mentioned scheme is being discussed. Here companding techniques are applied in the OFDM system to minimize the PAPR and effects of value “A” & “μ” are discussed.
Keywords: Additive White Gaussian Noise (AWGN), Inverse Fast Fourier Transform (IFFT), Orthogonal Frequency Division Multiplexing (OFDM),Peak to Average Power Ratio (PAPR), Quadrature Phase Shift Keying (QPSK), Q-point.
PRADEEP S G, AKESH GOVADA, KENDAGANNA SWAMY PG Scholar, Biomedical Signal Processing & Instrumentation, Dept of IT, RVCE, Bangalore, India PG Scholar, Biomedical Signal Processing & Instrumentation, Dept of IT, RVCE, Bangalore, India Assistant professor, Biomedical Signal Processing & Instrumentation, Dept of IT, RVCE, Bangalore, India
Abstract: This paper presents an implementation of a low-cost aid for severely disabled persons to communicate with computer directly by bioelectricity rather than by physical means. The communication is done through Electro Occulo Gram (EOG) signals generated by the movement of eyes. The blink, left & right commands are used to communicate with computer. We will provide RF interface between acquisition or processing part and application so that it’s easy to handle and easy to install in homes and hospitals[1-5].
Dual- and Triple- Band U-slot Microstrip Patch Antenna for WLAN Applications
GARIMA, AMANPREET KAUR, RAJESH KHANNA Student, ECE, Thapar University, Patiala, India Assistant Professor, ECE, Thapar University, Patiala, India Professor, ECE, Thapar University, Patiala, India
Abstract: In this paper, Microstrip patch antenna fed through an aperture coupled 50Ω microstrip line is designed for dual- band and triple- band applications by cutting U-slots in the patch. When a U-slot is cut in the patch, a notch is introduced within the matching band, results in dual- band antenna. If another U-slot is cut in the same patch, antenna becomes a triple- band antenna. For better coupling aperture in ground is of U-shape. The patch antenna has been designed and simulated in CST Microwave Studio. The dual- band antenna resonates at 3.6GHz and 5.2 GHz whereas triple- band antenna resonates at 3.6 GHz, 5.2 GHz and 5.8 GHz. For U-slot dual- band antenna, the directivity of 6.345 dBi and 5.725 dBi is obtained at lower resonant frequency 3.6 GHz and upper resonant frequency 5.2 GHz respectively. U- slot triple band antenna shows 6.103 dBi, 6.371 dBi and 5 dBi directivity at lower resonant frequency 3.6 GHz, middle resonant frequency 5.2 GHz and upper resonant frequency 5.8 GHz respectively. The proposed antenna is used for WLAN applications.
DR.NEERAJ BHARGAVA, DR.RITU BHARGAVA, PRAKASH SINGH TANWAR, ANKIT SHARMA Associate Professor, Dept. of Computer Science, School of Engg., & System Sciences, MDS University, Ajmer, India Lecturer, Dept. of MCA, Govt. Women’s Engineering College, Ajmer, India Research Scholar, Dept. of Computer Science, MJRP University, Jaipur,India Dept. of Computer Science, School of Engineering & System Sciences, MDS University, Ajmer, India
Abstract: This research paper is made to understand the rainfall fluctuation with respect to spatial distribution in Bhilwara Tehsil of Bhilwara District in Rajasthan. It illustrates the practical approach towards classification of rainfall data over the study area. To achieve the aim, it is divided into three sections. The first section describes pre-processing, data collection, geo-referencing, digitization, database creation, and refinement of data has been accomplished. In the second section joining of spatial and non spatial data with map creation is accomplished. In the last section post processing part the final layout with various components is created.
Cell Phone Usage While Driving Avoidance with GSM-RF Based Accident Emergency Alert System
PROF. ABHAY P. BAGADE Assistant Professor, Deptt. Of E & T Engg., B. D. College of Engineering, Sevagram, Maharashtra, India
Abstract: The significant rise in use of cellular phone leads to increase in road accidents due to use of cell phone while driving, still no research has been carried out to find the number of drivers using cell phone involved in road accident and very limited efforts has been carried out to prevent accident due to cell phone usage. So in this project we are providing a solution to this project in which a mobile stand where driver should have to place his cell phone. If the driver doesn’t do so then the microcontroller starts its working accordingly and tend driver to stop the car and then continue the conversation on cell-phone, which leads to the least chances of happening of an accident. In another case if road mishaps took place, this project sends emergency message to the rescue teams and surrounding people to save the life of victims.
Keywords: Mobile Stand, Microcontroller, GSM Module, RF.
Content Bases Image Search And Retrieval Using Indexing By KMeans Clustering Technique
N.V.MURALI KRISHNA RAJA, K.SHIRIN BHANU M.Tech Final, Department of CSE, Sri Vasavi Engineering College, Tadepalligudem, India Associate Professor, Department of CSE, Sri Vasavi Engineering College, Tadepalligudem, India
Abstract: With the popularity of network and development of multimedia technology, the traditional information retrieval techniques are not working efficiently according to users demand in searching and retrieving images from database. Recently the content based image retrieval concept becomes the hot topic in information retrieval domain. Due to the demand of information retrieval technique for image retrieval research has focused on content based image retrieval method. In today’s world there is increased need of content based image retrieval technique in number of different domains such as education, medical imaging, crime prevention, whether forecasting, remote sensing and management of earth resources. Content based image retrieval (CBIR) deals with retrieval of relevant images from the large image database. It works on the features of images like color and texture. In our system we are proposing an enhancement to basic content based image retrieval technique with indexing support by using K-means clustering data mining technique. The enhanced feature helps in retrieving images from large database fastly. In this system an index is applied on database of images based on clustering technique. During this process clustering concept uses features like texture, color, shape, relevance feedback and wavelet based histogram method to find similarity among the images. Based on similarity value the images are divided into clusters, then the new image which is to be verified with database is compared with these clusters and based on its similarity corresponding images in cluster are retrieved.
Data Embedding Technique In Image Steganography Using Neural Network
USHA B A, DR. N K SRINATH, DR. N K CAUVERY Assistant Professor, Department of CSE, R V College of Engineering, Bangalore, India Professor and Head, Department of CSE, R V College of Engineering, Bangalore, India Professor, Department of ISE, R V College of Engineering, Bangalore, India
Abstract: The steganography is the process of concealing one medium of information within another. There are lots of techniques available to achieve steganography like least significant bit insertion method and transform domain technique. This project implements the new method of steganography whose foundation lies on neural network. The amount of data that can be hidden inside the cover image chosen depends on the properties of the image like number of noisy pixels. The neural network based image steganography ensures that quality and size of the image remains same after embedding the data. Neural network based steganography has wide applications today in military operations, protection of data alteration, media database systems and secret data storing.
A New approach of program slicing: Mixed S-D (static & dynamic) slicing
MRS. SONAM JAIN, MR. SANDEEP POONIA M.Tech (CSE) Scholar, Jagannath University, Jaipur Associate Professor, Department of Computer Science & Engineering, JNIT University, Jaipur
Abstract: Program slicing technique is used for decomposition of a program by analyzing that particular program data and control flow. The main application of program slicing includes various software engineering activities such as program debugging, understanding, program maintenance, and testing and complexity measurement. When a slicing technique gathers information about the data and control flow of the program taking an actual and specific execution (or set of executions) of it, then it is said to be dynamic slicing, otherwise it is said to be static slicing. Generally, dynamic slices are smaller than static because the statements of the program that affect by the slicing criterion for a particular execution are contained by dynamic slicing. This paper reports a new approach of program slicing that is a mixed approach of static and dynamic slice (S-D slicing) using Object Oriented Concepts in C++ Language that will reduce the complexity of the program and simplify the program for various software engineering applications like program debubbing.
DR. PRAMOD KUMAR, MRS. MONIKA AGARWAL, MISS. STUTI NAGAR Assistant Professor, Computer Application, Shri Ram College, MZN, India Scholar, Suresh Gyan Vihar, University, Jaipur, India
Abstract: Face recognition presents a challenging problem in the field of image analysis and computer vision, and as such has received a great deal of attention over the last few years because of its many applications in various domains. This paper focuses on the meaning of face recognition system, human face features that use to identify the face, face recognition types including two- dimensional system (2D) and three-dimensional system(3D)& the explanation of three-dimensional recognition procedures We also explained our new idea for recognizing the human face. This paper is an attempt to give an idea of the state of the art of face recognition technology.
Keywords: Face Recognition, Person Identification, Biometrics, 2D, 3D Technology
A theoritical model for projecting a dynamic and physically interactive virtual clone through emulation
AKASH GUPTA Student, Department of Computer Science, JamiaHamdard University, New Delhi, India
Abstract: This paper proposes an impendent avenue of hi-tech, super-fast digital transmission of organisms (humans in particular) across networks. It discusses a radical communication technology that may surpass the objectives of teleconference or telepresence in near future. Tremendous reduction in travelling and enhanced multitasking will be concomitant worldwide. The basic ideology lies in the marshaling and de-marshaling of data objects. If a living organism could be translated into a programmable object with all its characteristics and behavior, this object will be serialized, transmitted and deserialized at the destination to obtain a copy of the original object. Artificial intelligent systems for reconstructing digital holograms and analyzing inputs from various sensors can make it possible for two or more participants to communicate without being physically engaged during the whole communication process. The paper argues on the possibility of creating such a communication system and investigates the challenges and obstacles in its deployment. It is for the first time, as per the best of the author‟s knowledge that such a communication system using human level artificial intelligence and dynamic holography is proposed.
Keywords: digital transmission; cognitive communication; dynamically interacting volumetric display; mind uploading; whole brain emulation; artificial psychology; cognitive computing; personal construct psychology based expert systems, 3D scanning; expert systems; digital transmission; human computer interaction; ultra-high speed data transmission
S.R.M.KRISHNA, P.KAMAKSHI PRASAD, Y.VISHNUTEJ, P.NARENDRA KUMAR Assistant Professor, Department of CSE, Gayatri Vidya Parishad College of Engineering, Visakhapatnam, INDIA Professor, Department of CSE, JNTU Hyderabad, Hyderabad, INDIA Student, Department of CSE, Gayatri Vidya Parishad College of Engineering, Visakhapatnam, INDIA Student, Department of CSE, Gayatri Vidya Parishad College of Engineering, Visakhapatnam, INDIA
Abstract: A technology can be sustainably viable only if it can find widespread use. In order to allow ad hoc networks to achieve commercial success, we must solve the scalability problem. One approach is through clustering. Various clustering algorithms have been devised as building blocks for this purpose. This paper proposes a clustering technique for MANETs, which is distributed, dominating set based, weighted and adaptive to changes in the topology called Distributed Scenario- based Clustering Algorithm for Mobile ad hoc networks (DSCAM). The purpose of the proposed work is to provide QOS through cluster classification based on their battery power and signal strength using rough sets idea. we incorporate security, provide guaranteed QoS and enhancement for use in heterogeneous mesh and sensor networks and this is accomplished by using SSL-DES-96(double encryption) enhancement algorithm. The performance of this algorithm is evaluated through simulation and data transfer among the nodes is done through SFTP.
Keywords: Mobility, Multi cluster head, Dominating Set, classification, Rough set
Analysis of Different Regression Testing Approaches
CHANDANA BHARATI, SHRADHA VERMA Department of Computer Science, MRIU, Faridabad, India Department of Computer Science, MRIU, Faridabad, India
Abstract: As the software systems evolve with time, regression testing is an important and very expensive activity to ensure that this evolution will not disrupt the existing functionalities of the system. An important issue, in this context, is optimal selection of subset of test cases from the initial test suite to minimize the testing time, cost and effort. Researchers have proposed various types of regression test selection techniques that are code-based, and model-based. Code-based regression test selection techniques can be effectively applied for unit-testing. It uses relationship between code parts and test cases that traverse them to locate test cases for retest when code is modified. Broad adoption of model centric development has created opportunities for model-based regression testing as models also evolve. It selects test cases based on model modification, so it uses relationships between model elements and test cases that traverse those elements to locate test cases for retest. This paper is the analysis of both code-based and model-based regression testing technique according to some comparison and evaluation criterion.
Verification of Interaction Overview Diagrams Using Colored Petrinets
VINAI G. BIJU, VINOD. K. AGRAWAL Assistant Prof. Dept. of CSE, Christ University, Bangalore, India Professor, Dept. of Information Science, PESIT, Bangalore, India
Abstract: The UML 2 Interaction Overview Diagram (IOD) provides a visual representation of system‟s overall interactions. The UML 2 IOD visualizes the behaviour of a system only for the interaction among the components and also a partial order between send and receive message events; however the semantics of communication among the interaction occurrences and process execution policy remains vague. It does not provide formal approach of specification and has a weak support for the validation. So, it is extremely important to improve the „quality‟ of the design model using formal description and thereby validating the highest level of abstraction of design. An attempt has been made in this paper towards formalizing the IOD Sequence diagrams by mapping it into Colored Petri nets (CPNs). This approach of formal translation allows a designer using UML 2.0 to verify and validate models using CPN tools.
Keywords: Colored Petri net (CPN), Unified Modeling Language (UML), and Interaction Overview Diagram (IOD).
Optimization of Hybrid Plasmonic Photonic waveguide for confinement of Light at the Nanoscale
TARUN SHARMA, VARUN MEHTA Assistant Prof (ECE), Himachal Institute of Engineering, shahpur, H.P, India Assistant Prof (ECE), KITM, Kurukshtra, Haryana, India
Abstract: The UML 2 Interaction Overview Diagram (IOD) provides a visual representation of system‟s overall interactions. The UML 2 IOD visualizes the behaviour of a system only for the interaction among the components and also a partial order between send and receive message events; however the semantics of communication among the interaction occurrences and process execution policy remains vague. It does not provide formal approach of specification and has a weak support for the validation. So, it is extremely important to improve the „quality‟ of the design model using formal description and thereby validating the highest level of abstraction of design. An attempt has been made in this paper towards formalizing the IOD Sequence diagrams by mapping it into Colored Petri nets (CPNs). This approach of formal translation allows a designer using UML 2.0 to verify and validate models using CPN tools.
Keywords: Colored Petri net (CPN), Unified Modeling Language (UML), and Interaction Overview Diagram (IOD).
SUNITA SHARMA, AMIT CHUGH, AJAY KUMAR M.Tech. Student, Dept. of CSE, Lingayas University Faridabad, Faridabad, India Assistant Professor, Dept. of CSE, Lingayas University Faridabad, Faridabad, India Software Engineer, Aricent Group, Gurgaon, India
Abstract: We believe that data storage security in Cloud Computing, an area full of challenges and of paramount importance, is still in its infancy now, and many research problems are yet to be identified. We envision several possible directions for future research on this area. To ensure the correctness of user’s data in cloud data storage, we proposed an effective and flexible distributed scheme with explicit dynamic data support, including block update, delete, and append. To ensure the security of data, we proposed to use DES (Data Encryption Standards) algorithm. In present paper we have given a working architecture of Cloud data security using DES algorithm.
Keywords: DES Algorithm, Cloud Service Provider, Third Party Auditor (TPA), Cloud Authentication Server
SUMANPREETKAUR, RAJINDER SINGHVIRK Student, Computer Science and Engineering, Guru Nanak Dev University Amritsar, Punjab, India Associate Professor, Computer Science and Engineering, Guru Nanak Dev University Amritsar, Punjab, India
Abstract: This paper proposed a noble face recognition algorithm which integrates the principal component analysis; back propagation neural network (BPNN) and discrete cosine transform (DCT) to improve the performance of face recognition algorithms.PCA is used to reduce the dimensionality of face image and the recognition is done by the BPNN for efficient and robust face recognition. DCT is an accurate and robust face recognition system used in compression due to its compact representation power. Various faces images are considered in this research work to evaluate the performance of the proposed algorithm. The proposed algorithm is efficient and fast because DCT reduce the amount of time required to recognize a face.
Keywords: Face recognition, Eigen faces, principal component analysis, back propagation neural network, discrete cosine transform
A Survey On Tying Data To Geographic Locations In Mobile-Disconnected Networks Using Boomerang Protocol
PAVAN MULGUND, GAYATHRI. N 4th Sem M.Tech, Computer Science and Engineering, MVJCE, Bangalore, India Associate Professor & H.O.D, Information Science and Engineering, MVJCE, Bangalore, India
Abstract: We provide a protocol which retain content of information even in mobile disconnected networks without using infrastructure networks. As the mobile device keep the content information for a short period of time the boomerang protocol provide a efficient method to retain it and using a method called trajectory it records each geographical location while moving away from the sensing location. The performance result show that the trajectory algorithm is more efficient and Using this protocol, the holder can handoff the geo cache to other candidates preferably those traveling toward the anchor location.
LATA, KASHYAP INDU Dept. of CSE, FET, MRIU Faridabad, Haryana, India
Abstract: Intrusion detection system is device or software applications that monitor network or system activities for malicious activities or policy violation. Two types of Intrusion detection systems are network based and host based. This paper is only discussed about network based intrusion system. Snort and Sax2 are network based intrusion detection system. These systems monitor the network and capture packets in promiscuous mode, analyze these packets and give report. Three methodologies are used for detect intrusion on the Network, signature based, anomaly based and stateful protocol analysis. This paper is based on the signature based intrusion detection system methodology. Intrusion can be possible on the header part or payload part .Different pattern matching algorithms are used for detection intrusion. Brute force and Knuth-Morris-Pratt are two single keyword pattern matching algorithms detect the payload part intrusion. String matching consists in finding one or more occurrences of a pattern in a text (input) if Pattern is present in the text send intrusion alarm. False alarm is very high in intrusion detection. I proposed a string matching algorithm to reduce false alarming percentage.
Keywords: Intrusion detection system (IDS), network behavior analysis system (NBAS), network based intrusion detection system (NIDS), TCP, UDP, intruders, attacks, signature, stateful, anomaly, false alarm.
Performance Analysis of MIMO OFDM System for Different Modulation Schemes under Various Fading Channels
NISHA ACHRA, GARIMA MATHUR, PROF. R.P. YADAV M. Tech.Scholar, EC Deptt., JEC Kukas, Jaipur, India Research Scholar, EC Deptt., M.N.I.T, Jaipur, India Vice Chancellor RTU Kota, India
Abstract: MIMO-OFDM (Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing) system has been recognized as one of the most popular and competitive technique in a wireless environment nowadays. The performance is calculated in terms of Bit Error Rate (BER) versus the Signal to Noise Ratio (SNR). In this paper we discuss the BER performance of the MIMO-OFDM system with two different equalizers (ZF and MMSE) for various modulation techniques i.e. BPSK, QPSK, 16-QAM and 64-QAM using multipath fading channels i.e. AWGN (Additive White Gaussian Noise), Rayleigh and Rician channel. The multicarrier modulation is employed, which gives advantages like inter symbol interference (ISI) reduction, high data rate, higher reliability, and better performance in multipath fading. The simulation results show that, with MMSE and ZF equalizers, the BER performances is better in MMSE equalizer. Further we analyzed in different fading channels for various modulation techniques in both the equalizers.
Keywords: OFDM, ZF and MMSE Equalizer, Multipath fading channels.
Study The Characteristics Of 65nm PMOS Transistor Incorporating The SILVACO TCAD TOOLS
ANIL KUMAR, ANJANI KUMAR, A.K.JAISWAL, ARPITA BHARTI Asst.Prof, Deptt.of ECE, SHIATS, Allahabad, India PG Student,Deptt.of ECE, SHIATS, Allahabad, India Professor,Deptt.of ECE, SHIATS, Allahabad, India
Abstract: This paper explains about the characteristics of 65 nm PMOS technology with strained silicon in terms of electrical parameters like drain current, gate voltage etc.. Fabrication processes of transistor were performed by the ATHENA fabrication simulator while electrical characterisation of device was performed by ATLAS simulator. The comparison of the performance of conventional 65 nm PMOS and strained silicon 65nm PMOS was done by 𝐈𝐃-𝐕𝐆 characteristic. Comparison result represents the strained silicon PMOS had lesser power consumption in comparison to conventional PMOS.
Keywords: PMOS, strained silicon, threshold voltage, simulation process
RITIKA MITTAL, KRITIKA SONI Assistant professor, Dept of CSE, Manav Rachna International University, Faridabad, India Student of M Tech., Dept of CSE, Manav Rachna International University, Faridabad, India
Abstract: Cloud computing has recently emerged as a new paradigm for hosting and delivering services over the Internet. Mobile cloud computing, new technology in the field of cloud computing enables cloud users to access cloud from their mobile devices (e.g. Laptops, PDA, and Smartphone‘s). Computational power and battery life is one of the major issues of these mobile devices. To overcome these problems clones of mobile devices are created on cloud servers. In this paper, we define clone cloud architecture and virtualized screen architecture in cloud computing. Clone Cloud is for the seamless use of ambient computation to augment mobile device applications, making them fast and energy efficient and in a Virtualized Screen; screen rendering is done in the cloud and delivered as images to the client for interactive display. This enables thin-client mobile devices to enjoy many computationally intensive and graphically rich services.
Keywords: Cloud Computing, Service Models, Clone Cloud, Virtualized Screen
An Exploratory Survey on Various Face Recognition Methods Using Component Analysis
SHAMNA P, PAUL AUGUSTINE, TRIPTI C M.Tech Scholar, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India
Abstract: Development in Human Computer Interactions (HCI) helps in budding user friendly systems to communicate with computers. One of the fundamental techniques that aid Human Computer Interaction (HCI) is face recognition. Face recognition is one of the most successful applications of image analysis and pattern recognition. Principle Component Analysis (PCA) is considered as the first real time face recognition technology. This paper compares the different PCA methods with standard PCA using eigenfaces. The methods considered in this paper are Kernel PCA, PCA with Image Gradient Orientation, PCA with Singular Value Decomposition and Diagonal PCA with KNN. This paper also suggests a statistical method for face recognition using the component analysis of difference image.
Keywords: Image Processing; Face Recognition PCA; IGO PCA; KPCA; PCA with SVD; DiaPCA
On Web Communities Analysis Of Relevant Web Page Ranking Algorithms
M. Renuka Devi, Mr.S.Saravanan Assistant Professor of MCA Department, Sree Saraswathi Thyagaraja College, Pollachi, Bharathiar University, Coimbatore, Tamil Nadu, India Research Scholar of Computer Science, Sree Saraswathi Thyagaraja College, Pollachi, Assistant Professor, Department of Computer Science, Nehru Arts and Science College, Coimbatore, Bharathiar University, Coimbatore, Tamil Nadu, India
Abstract: Today, web captures a vital role in all aspects of human endeavors. However searching, comprehending and using the semi structured information stored on the web poses a significant challenge in efficient retrieval of relevant web data. This is because of the lack of a uniform schema for web documents and the huge amount of data and dynamics of web data. This paper deals with analysis of web page ranking algorithms to find the advantages and drawbacks for the ranking of the web pages. The algorithms discussed in this paper would be used for various Web applications, such as enhancing Web search. The ideas and techniques in this work would be helpful to other Web- related researches.
Keywords: HITS, Page Rank, User Behavior Data, User Browsing Graph, Browse Rank
A Categorized Survey on Buffer Overflow Countermeasures
JISHA S, DIYA THOMAS, SANGEETHA JAMAL M. Tech Scholar, Department of Computer Science, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Department of Computer Science, Rajagiri School of Engineering and Technology, Kochi, India
Abstract: Buffer overflow vulnerability is a fundamental cause for most of the cyber attacks such as server breaking-in, worms, zombies, and botnets, since the attacker gets a capital control over a victim host. Many solutions to the buffer overflow attacks have been proposed in the last decade. However, on a routine basis new buffer overflow vulnerabilities are still discovered and reported. Since almost all existing solutions to the buffer overflow attack problem require significant modification to the computing infrastructure in which network applications are developed or executed, and thus have met considerable resistance in actual deployment. This paper is aimed to provide a categorized survey for the existing countermeasures to buffer overflow attack. A categorized survey is necessary in this field because researchers have proposed many software-based and hardware based countermeasures for buffer overflow exploits. These methods differ from one another in the strength of protection provided, the effects on performance, and the easiness of deployment. Finally, the paper compares the effectiveness, performance and limitations of the different category.
Ber Performance Of Awgn, Rayleigh And Rician Channel
K.VIDHYA, DR. K.R.SHANKAR KUMAR AP / ECE Department, Sri Ramakrishna Engineering College, Coimbatore, Tamil Nadu, India Professor/ ECE Department, Sri Ramakrishna Engineering College, Coimbatore, Tamil Nadu, India
Abstract: MIMO-OFDM is commonly used communication system due to its high transmission rate and robustness against multipath fading. In MIMO-OFDM, channel estimation plays a major role. It refers to estimation of transmitted signal bits using the corresponding received signal bits. Among the different channel estimation methods, Least Square (LS), Least Square-Modified (LS-Mod) and Minimum Mean Square Error (MMSE) methods are commonly used. In this project, AWGN, Rayleigh and Rician channel models are implementing by using LS, LS-Modified and MMSE algorithms. In LS estimation, procedure is simple but it has high Mean Square Error. In low SNR, MMSE is better than that of LS, but its main problem is its high computational complexity and LS-Modified is considered to be the best among the three channel estimation methods. The system is simulated in MATLAB and analysed in terms of Bit Error Rate with Signal to Noise Ratio
Smart Cart to Recognize Objects Based on User Intention
T.SHANMUGAPRIYAN PG Scholar-Master of Engineering in Pervasive Computing Technologies, Kings College of Engg., Punalkulam, India
Abstract: Shopping in the real world is becoming an increasingly interactive experience as stores integrate various technologies to support shoppers. We present Smart cart a sensible mobile grocery aid which supports customers in the shopping process. We conducted a user study to assist the design of smart shopping trolley. Through which are explored preferable features to be incorporated in a mobile grocery aid we describe the study and its results the design principles and design of massive the features that are supported by smart cart and the functionalities that are to be integrated into smart Shopping. We also describe the technical challenge we came across during our development efforts. The aim of the system is to support shopping in supermarket through acquiring user attention. Thus ,the interactive trolley guides and directs shoppers in the handling and finding of groceries than traditional trolley shoppers by exhibiting a more uniform behaviour in terms of product sequence collection and easier for shoppers to find products and shorter distance.
Keywords: Mobile and Pervasive Technologies, Smart Cart, Sensor, Supermarket.
A Novel Signature Histogram Based Indexing For CBIR System
T. GOKARAMAIAH, M. VYSHNAVI, E.SANDEEP KUMAR, K. ANGEL Assistant Professor, Information Technology, G.Pullaiah College of Engineering and Technology, Kurnool, India Student, Information Technology, G.Pullaiah College of Engineering and Technology, Kurnool, India
Abstract: Content Based Image Retrieval (CBIR) is a technique used for retrieving similar images for given input image from an image database. CBIR aims to retrieve the images based on the content of a given image rather than textual information of a file name. CBIR uses the various features such as color, texture, shape etc.The shape is independent of transformations like scaling, translation, rotation and flip. A good shape representation method retrieve similar images irrespective of the transformation performed on a shape. The known shape representation called “centroid contour distance (CCD) signature” is invariant to translation, scale but not to rotation and flip. The CCD signature quantize into signature histogram which is invariance to rotation and flip. It has a drawback namely number of false positives will increase i.e. many different shapes can have a “similar signature histogram”. This problem can be solved with augmented signature histogram with information present at the boundary of object. Images are presented to a user calculating Euclidian distance matching with every shape descriptor is a computational expensive problem. With large database this process may take minutes, hours. So to reduce the computational requirement, the images are indexed based on Color, Medial Axis, Area, Eccentricity, and Euler number.These indexing parameters are bias. To overcome this problem the static parameter such as mean was calculated from the signature histogram. Based on mean value images are indexed. This reduces the search space in retrieval process. So that the performance is increased.Keywords: Signature histogram, centroid distance signature, shape signature, indexing.
Study and Analysis of Network based Intrusion Detection System
LATA, INDU KASHYAP M.tech student, MRIU, fbd, india Assistant professor CSE dept. MRIU, fbd, India
Abstract: Mobile means random and perhaps constantly changing or moving and ad-hoc means for this or temporary without any centralized administration. Mobile ad-hoc network is a collection of mobile nodes forming an instant network characterized by wireless links, dynamic topology and easy deployment. The wireless links in this network are highly prone to error. Routing is a challenging task for networks that do not offer fixed infrastructure, like in ad-hoc wireless networks that offer unrestricted mobility. Based on Routing Update Mechanism, there are two broad categories of Routing Protocol viz. Table- Driven Routing Protocols includes; protocols like DSDV & WRP and On-Demand Routing Protocols include protocols like DSR, AODV & LMR. In this paper, an attempt has been made to analyze three well known protocols namely, DSR, AODV and DSDV.
Keywords: Ad Hoc Networks, DSDV, DSR, AODV, Comparison between different Routing protocols.
KEDAR TRIVEDI, NANDISH THAKER BTech, EC, Institute of Technology, Nirma University, Ahmedabad, India BTech, EC, Institute of Technology, Nirma University, Ahmedabad, India
Abstract: This paper deals with the design of 4X4 memory arbiter and its results. The memory arbiter is completely optimized from synthesis till VLSI layout design. The designed block of 4X4 arbiter can be re used as a component to have N number of clients. Memory arbiter is an important system for controlling multiple requests. It works according to the priority of the request.
Twitter based Sentiment Analysis for Subject Identification
JISHA S MANJALY Department of Computer Science, Rajagiri School of Engineering and Technology, Kochi, India
Abstract: Nowadays the social media such as blogs, Twitter, Facebook etc. are widely used for participatory information sharing and collaboration. The analysis of the dynamic opinion of users in these social media forums will helps to answer many questions from various business and research fields across the world. Sentiment mining is used to identify and extract the sentiment and other emotional states in the online text. This paper aims to study the subject identification by analyzing tweets from Twitter, a micro-blogging site.
Keywords: Sentiment mining, Twitter, Naive Bayes, Fisher, API, Bag of Words, Bag of N-Grams.
Building Parallel Applications Using Spatiotemporal Patterns
MR. B P KOLHE M.E. Student, Department of Computer Science Engineering, Government College of Engineering, Aurangabad
Abstract: The exploration of design pattern concepts in the parallel programming domain is not something new. In fact, parallel computing is becoming an integral part in several major application domains, for instance: space, medicine, geological survey, cancer and genetic research, graphics and animation, image processing-to name a few. This paper addresses detail study on spatial data partitioning strategy.
Statistical Analysis Of Energy Efficient Hierarchical Routing Protocols In Wsn
TINTU DEVASIA, GOPIKA S Department of Computer Science Rajagiri School of Engineering & Technology Rajagiri Valley, Kochi-39, Kerala, India
Abstract: Wireless sensor nodes with limited battery power are deployed to collect data from the environment. Initially WSN was developed for military purpose, now it is extended to wide range of applications. Gathering sensed data in an energy efficient manner is critical to operate the network for a long period of time. For different applications many protocols have been developed. This paper surveys various energy efficient hierarchical routing protocols for sensor networks and presents a classification and comparative study of the various approaches pursued. .
Keywords: Wireless Sensor Networks, Routing Protocols, energy efficiency, cluster head.
Energetic Processing For Message Passing In Distributed Approach
N.S.SIVARAJAN, D.SHANMUGAVEL, P.R.NIRMALBINU II ME CSE, Sri Muthukumaran Institute of Technology, Chennai, Anna University Chennai Assistant Professor, Department of CSE, Sri Muthukumaran Institute of Technology, Chennai, Anna University Chennai Assistant Professor, Department of CSE, P.S.N College of Engineering and Technology College, Tirunelveli, Anna University Chennai
Abstract: In generally dealing with failures has been one of the main challenges in the construction of real reliable applications able to work in a distributed system. Shared objects are one of the main abstractions provided to developers of distributed applications. all the shared objects, the register object is fundamental. Several protocols have been proposed to build fault resilient registers on top of message-passing system, but unfortunately failures are not the only challenge in modern distributed systems and new issues arise in the presence of churn. This system addresses the construction of a multi writer/multi reader regular register in an eventually synchronous distributed system affected by the continuous arrival/departure of participants. In particular, a general protocol implementing a regular register is proposed and feasibility conditions associated with the arrival and departure of the processes. This system, based on a generic churn model has presented the implementation of a multi-writer/ multiple-reader regular register in such a model and also enhancing the Consensus process. Consensus to agree only on the sequence of configurations and not on the individual operations. Also, in Consensus algorithm, processed into the termination of consensus affects the terminations of reconfiguration, but not of read and writes operations. Consensus is the process of agreeing on one result among the group of participants and reconfiguration service is uses distributed consensus to agree on the successive configurations.
Comparative Study of Network Coding Techniques in Wireless Network
SHEENU TOMS, DEEPA JOHN Department of Computer Science Rajagiri School of Engg & Technology, Rajagiri Valley, Kochi-39, Kerala, India
Abstract: Wireless network is now an interesting area of research. In this paper we are giving a comparative study of COPE and DCAR the two main network coding systems in wireless network; both give high throughput gain in wireless network. COPE mix packets from different sources to increase information content of each transmission. It takes into advantage the broadcast nature of wireless network. COPE is the first practical wireless network coding system. DCAR, the first distributed coding-aware routing mechanism can be seen as a variant of COPE. It in co-operate the features of COPE plus some extra features. This paper give the similarities, variations, advantages and disadvantages of both COPE and DCAR.
Identification And Isolation Of Replica Attack Using Risk Aware Response Mechanism
MR. K. RAJKUMAR, DR. P. GANESHKUMAR, P. SENTHILKUMAR Associate Professor, Dept of IT, PSNA College of Engineering &Technology, Dindigul, Tamilnadu Professor, Dept of IT, PSNA College of Engineering &Technology, Dindigul, Tamilnadu Associate Professor, Dept of IT, PSNA College of Engineering &Technology, Dindigul, Tamilnadu
Abstract: Mobile ad hoc networks (MANETs) are a set of mobile nodes which are self-configuring and connected by wireless links automatically as per the defined routing protocol. The key feature of MANETs is the absence of a central management agency or a fixed infrastructure. Since the most devastating damage to MANET is caused by routing attacks they have received considerable attention. In the existing system, a risk-aware response mechanism is proposed to systematically cope with routing attacks in MANET. The intrusion detection systems (IDS) used here have limited response mechanisms that are inadequate given the current threat. In the proposed system, along with the existing system approach, a more efficient detection algorithm for detecting replica attacks in MANET is proposed. Replica Attacks is an attempt by the adversary to add one or more nodes to the network that use the same ID as another node in the network. Location Information Exchange protocol and Time Domain Detection & Space Domain Detection Scheme both to detect node replication attack in the network. The advantage of this system will be increased detection accuracy and reduced network damage.
Keywords: Mobile ad hoc networks, replica nodes, intrusion response, adaptive decision making.
PRIYANKA SHARMA, PARUL DIHULIA, VIKAS GUPTA Research Scholar, EC Department, TIT, Bhopal, Madhya Pradesh, India Assistant Professor, EC Department, TIT, Bhopal, Madhya Pradesh, India Head of Department, EC Department, TIT, Bhopal, Madhya Pradesh, India
Abstract: Automatic Speech Recognition (ASR) is an essential component in many Human-Computer Interaction systems. A variety of applications exits in the field of ASR and shown a good improvement and reached high performance levels but only for condition-controlled environments. Hence a robustness technique has to be build for the ASR which can improve the performance of ASR in the adverse environment.
E-Waste By Electrical Wires – Implementation Of Green Supply Chain Managegment
ER. NARESH CHANDRA AGRAWAL, DR. ASHISH AGARWAL HOD, ECE Department, SIET Allahabad, India Associate. Professor, SOET, IGNOU, New Delhi, India
Abstract: The electrical and electronic waste (E-waste) is one of the fastest growing waste streams in the world. The increasing “market penetration” in developing countries, “replacement market” in developed countries and “high obsolescence rate” make e-waste as one of the fastest growing waste streams. Globalization results in both pressure and drivers for Indian citizens to improve their environmental performance. As a developing country, India has to balance economic and environmental performance. Green supply chain management (GSCM) is emerging to be an important approach for Indian citizens to improve performance, possibly on these dimensions. More attentions have been paid to resource usage reduction and ecology protection. The framework is applied to electricity supply through wires within the internal operations of an environmental service. Green product design has received much attention recently, because product design significantly influences the cost component and repair. We investigate the impact of the Eco-design. In this research paper we consider the literature and survey to suggest an Eco-design replica to reduce consumption of wires used in electric supply, according to the energy/power used by the electric wires, used for distribution of supply in residence.
QoS Enhancements using IEEE 802.11p WLANs for Communication Based Train Control Systems
B.NANDHA KUMAR, A.M.BASHA PG Scholar, K.S.R College of Engineering, India Director, K.S.R College of Engineering, India
Abstract: In near future, communication based train control (CBTC) systems will play a major role in the urban railway networks in the world. CBTC systems are an automated railway signaling system that makes use of telecommunications to ensure safe operation between rail vehicles. For the urban railways Wireless local area networks (WLAN) based CBTC is the best approach because of wide availability of WLAN equipments. In the earlier works, IEEE 802.11a based WLANs are used to provide bidirectional train ground communications. But these WLANs are not suitable for high speed environments with frequent change in network topology, which may result in communication interrupt and long latency. In this paper IEEE802.11p WLANs are used to provide better communication availability in the CBTC environment. In the proposed work Quality of service (QoS) parameter metrics like throughput, delay are analyzed by using NS-2. Simulated results show 802.11p is more suitable than 802.11a for CBTC systems.
Keywords: CBTC system, Quality of services, IEEE 802.11p, Vehicular Networks.
Hidden Interaction Pattern Discovery Of Human Interaction In Meetings
B.SANKARA SUBRAMANIYAN, K.MOHAN, S.SRINIVASAN Asst. Professor, Dept. of Computer Science and Engineering, SCSVMV University, Kanchipuram, India Principal, Dept. of Information Technology, Padaleswarar Polytechnic College, Cuddalore, India PG Scholar, Dept. of Computer Science and Engineering, SCSVMV University, Kanchipuram, India
Abstract: In this paper, we propose a mining method to extract frequent patterns of human interaction based on the captured content of face-to-face meetings. Human interaction, such as proposing an idea, giving comments and expressing a positive and negative opinion, indicate user topic or role in a discussion. Human interaction flow in a discussion session is represented as a tree. We developed several applications based on the discovered patterns. We explore embedded tree mining for hidden interaction pattern discovery. Embedded sub trees are a generalization of induced sub tree, which allow not only direct parent child branches, but ancestor-descendant branches. The current meetings are all task oriented. It is valuable to capture various categories of meetings for analysis such as panel, debate, interview etc. There would be some differences in the frequent interaction patterns for different meeting styles.
Keywords: patterns, human interaction, tree mining, pattern discovery, embedded.
Performance Comparison of Multicast Routing Protocol Parameters in Wireless Network
DR. MRS.S.V.SANKPAL, PROF. M.K.NARAYANKAR Asso.Professor, ETC dept, D.Y.P.College of engg. & Tech. Kolhapur, India Asst.Professor, ETC dept., S.T.B.College of engg, Tuljapur, India
Abstract: This paper proposes on demand link weight routing protocol (ODLW). ODLW selects an optimum route on the basis of available bandwidth, low delay and long route lifetime. The technique adapts a cross-layer framework where the ODLW is integrated with application and physical layer. The proposed design allows applications to convey preferences to the ODLW protocol to overcome the default path selection mechanism. The results confirm improvement over AODV in terms of network load, route discovery time and link reliability.
Key-Words: - Routing Protocol, Ad Hoc Network, QoS
Quantitative Analysis Of Segmentation Methods On Ultrasound Kidney Image
VIJAY JEYAKUMAR, M. KATHIRARASI HASMI Assistant Professor, Department of Biomedical Engg & P.S.N.A College of Engg and Technology, Tamil Nadu, India Lecturer, Department of Biomedical Engg & P.S.N.A College of Engg and Technology, Tamil Nadu, India
Abstract: Image segmentation is an important processing step in many image, video and computer vision applications. Extensive research has been done in creating many different approaches and algorithms for image segmentation, but it is still difficult to assess whether one algorithm produces more accurate segmentations than another, whether it be for a particular image or set of images, or more generally, for a whole class of images. The most common method for evaluating the effectiveness of a segmentation method is subjective evaluation, in which a human visually compares the image segmentation results for separate segmentation algorithms, which is a tedious process and inherently limits the depth of evaluation to a relatively small number of segmentation comparisons over a predetermined set of images. The purpose of this paper is to describe a framework for evaluating ultrasound kidney image segmentation using various algorithms like Edge detection; Watershed segmentation; Region based segmentation and Clustering Method. We prove here that the K-means clustering gives better result for kidney image segmentation because of less intensity variations in ultrasound kidney image and the results are compared with other segmentation methods.
A Study On Program Verification Using Efsbi Approach
P.JOSHNA, E.SANDHYA, T.LAKSHMI Dept of Information Technology, Sree Vidyaniketan Engineering College, Tirupati, Andhra Pradesh, India
Abstract: Testing plays an important role in any software industry. Now a day it is very difficult to release completely defect free product. For detecting defects external formal specification based inspection is used. It can be carried out by step by step process and include five activities. First step, functional scenarios are derived from specification. Second step is paths are derived from program. Third step is linking from scenarios to paths. Fourth step is to reading and analyzing of paths against the corresponding scenarios and finally inspection report is produced. For increasing the effectiveness of formal inspection methods it can be applied in SPRT (Specification-Based Program Review Tool). Finally to compare this method with the perspective based reading then the results shows that the method is less effective in implementation-related defects rather than functional-related defects.
Keywords: Formal methods, Static analysis, validation of programs.
Secure Data Collection using Simple Path Diversity
GEETHA V, DEEPIKA SINGH Assistant Professor, Information Science and Engineering, RVCE, Bangalore, India Student – MTECH, Information Science and Engineering, RVCE, Bangalore, India
Abstract: This paper proposes a simple path diversity algorithm (SPDA) for Inter domain routing. The SPDA uses source routing to find an alternate path from a source to a destination, and allows flexible division of traffic over the best and alternate path. The SPDA comprises three steps. First, the BGP protocol is extended to allow the BGP routing table to save the multiple paths for any destination. Second, a given source is able to detect whether the point of congestion along the best path occurs. Third, if congestion occurs, the source will specify an alternate path and direct traffic over the best and alternate path concurrently. Simulation results indicate that the SPDA produces better performance than existing approaches in average end-to-end delay. In this paper, we develop mechanisms that generate randomized multipath routes. Under our designs, the routes taken by the Shares of different packets change over time; so even if the routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the routes traversed by each packet. Besides randomness, the generated routes are also highly dispersive and energy efficient, making them quite capable of circumventing black holes
Keywords: Simple path diversity, Secure Data Collection, Shamirs algorithm, PRP algorithm, NPRP algorithm, MTRP algorithm, SPD algorithm
KEE-CHEOL LEE Computer Engineering Department, Hongik University, Seoul, Korea 121-791
Abstract: It is well-known that most games and real world problems are technically classified as NP-hard, and we often resort to human-like heuristics to get their sub-optimal solutions. In case we really want to find an optimal path to a fixed goal of a problem instance in an enormous search space, the conventional A* algorithm framework may be useful. The success of A* algorithms depends on how to generate a maximally informed admissible version of h-val, the estimated distance to the goal state, such that it is not larger than but still as close as the unknown real distance to the goal. Recently we have suggested a method of generating a heuristic value with that property. To operate A* algorithms in binary search fashions, some depth of fixed step backward states are pre-stored in disk, and the hashing schemes to handle efficiently pre- stored states must be designed to confirm fast the non-existence of a given state, not its existence, because the optimal path is there as soon as the existence of a state is confirmed. In this paper, state-nonexistence fast-confirming hashing schemes have been experimentally compared. The same pre-stored static backward states are also used for solving partial problems for the purpose of generating maximally informed admissible heuristic which guides the priority queue for A* algorithm in deciding which state to expand next. To show the validity of our method, it has been massively experimented for instances of Rubik‟s cube problem whose search space of states reachable from any given start state is known to cover 43*1018 states. The partial problems are experimentally compared, by varying forward search depths and tie-breaking functions, to show their effectiveness and efficiency in generating heuristic values.
