Related Journals
IJNSA
IJCNC
IJCSIT
IJWMN
Courtesy

Accepted Papers

  • Efficient Popular Aware Prefetching Mechanism Using BufferMap In P2VoD Systems
    Prashanthi Ganesan, Arockia Xavier Arockia Xavier Annie, Anitha Murugesan and Yogesh Palanichamy, Anna Univeristy, India
    ABSTRACT
    Video-on-Demand (VoD) streaming service has become popular in recent years, e.g.,Internet TV, online video, distance education, etc. Peer-to-Peer (P2P) computing technology has been considered as an effective technique for providing ”play-as-download” VoD service .The aim of our proposed work is to reduce response latency in Peer-to-Peer based Video-on-Demand (P2VoD) systems. We use popular aware pre-fetching technique to accomplish the objective. To reduce the response latency of interactive requests, prefetching technique is employed in the P2P streaming systems. The adopted popular aware prefetch technique proactively fetches the segments that are likely to be requested by the user in near future. The Apriori Algorithm for popular video prefetch is a classic algorithm for frequent item set mining over transactional databases which is used to identify the frequently viewed videos. Our work addresses issues like load balancing, network traffic and waiting time of the user. The simulation result obtained shows that our proposed work is efficient compared to non-prefetching technique.
  • Performance Analysis of Operating Systems in IPv4 and IPv6 and Wireless Local Area Networks
    Samad S. Kolahi, Peng Li, Mulugeta Argawe and Mustafa Safdari, Unitec New Zealand, New Zealand
    ABSTRACT
    In this paper the performance of some of the latest popular operating systems, Windows XP, Windows 7 and Fedora 12 are investigated over IEEE 802.11n WLAN using Internet protocols and for both TCP and UDP protocols. We determine the throughput and delay differences between IPv4 and IPv6 for all operating systems considered. IPv6 performance is affected by the choice of operating system used. TCP provides lower bandwidth than UDP in IPv4 and IPv6 environment for all operating systems considered. For both IPv4 and IPv6, Fedora 12 provided highest throughput and lowest delay while Windows XP had lowest throughput and highest delay.
  • TCP and UDP Performance Evaluation ofIPv6 in IEEE 802.11n WLAN Client-Server Environment
    Samad S. Kolahi, Hitesh Singla, Mohd Nash Ehsan Initec New Zealand
    ABSTRACT
    The perfromance of IPv6 with and without WPA2 security (bandwidth-security trade-off) using wireless 802.11nclient-server network is investigated. The highest point ofdifference between open system and WPA2 for UDP was noticed at packet size 1408 bytes where IPv4 provided 31.48 Mbps and IPv6 provided 24.33 Mbps higher throughput in the open environment. For TCP, the highest point of difference between open system and WPA2 was at packet size 1408 bytes for IPv4 and 128 bytes for IPv6 where IPv4 provided 35.08 Mbps and IPv6 provided 7.02 Mbps higher throughput in the open environment. The performance of IPv4 and IPv6 with and without security for both TCP and UDP are also compared.
  • Vector Ant Colony Optimization and Travelling Salesman Problem
    Chiranjib Patra and Pratyush Agarwal, Jadavpur University, India
    ABSTRACT
    This paper introduces Vector Ant Colony Optimization (VACO), a distributed algorithm that is applied to solve the traveling salesman problem (TSP). In Any Colony System (ACS), a set of cooperating agents called ants cooperate to find good solutions of TSPs. Ants cooperate uss sing an indirect form of communication mediated by pheromone they deposit on the edges of the TSP graph while building solutions. The proposed system (VACO) based on basic ACO algorithm with well distribution strategy in which the entire search area is initially divided into 2n number of hyper-cubic quadrants where n is the dimension of search space for updating the heuristic parameter in ACO to improve the performance in solving TSP. From our experiments, the proposed algorithm has better performance than standard bench mark algorithms.
  • Detection and Tracking of Multiple Objects In Cluttered Backgrounds With Occlusion Handling
    Sukanyathara J, Viswajyothi College Of Engineering and Technology, India
    ABSTRACT
    Segmentation and tracking are two important aspects in visual surveillance systems. Many barriers such as cluttered background, camera movements, and occlusion make the robust detection and tracking a difficult problem, especially in case of multiple moving objects. Object detection in the presence of camera noise and with variable or unfavourable luminance conditions is still an active area of research. This paper proposes a framework which can effectively detect the moving objects and track them despite of occlusion and a priori knowledge of objects in the scene. The segmentation step uses a robust threshold decision algorithm which uses a multi-background model. The video object tracking is able to track multiple objects along with their trajectories based on Continuous Energy Minimization. In this work, an effective formulation of multi-target tracking as minimization of a continuous energy is combined with multi-background registration. Apart from the recent approaches, it focus on making use of an energy that corresponds to a more complete representation of the problem, rather than one that is amenable to global optimization. Besides the image evidence, the energy function considers physical constraints, such as target dynamics, mutual exclusion, and track persistence. The proposed tracking framework is able to track multiple objects despite of occlusions under dynamic background conditions.
  • Improve security mechanism for Supporting Routing Services on WANET using SG-PKM
    Ashwini Shendre and P. S. Mohod, G.H.R.I.E.T.W, India
    ABSTRACT
    Increases the dependence of people on critical applications in wireless networks, high level of reliability, security and availability to ensure secure and reliable service operation. The use of SAMNAR (Survivable Ad hoc and Mesh Network Architecture) to design a path selection scheme for WANET routing and using the concept of SG-PKM (survivable public key infrastructure) uses groups based on users relationships to increase survivability in the presence of different types of attacks. Finally, it highlights open issues in designing survivable key management Systems. SG-PKM technique also improves the network performance and survivability. Result shows under any condition and attack the survivability is archived in routing services.
  • Moving Object Detection with Fixed Camera and Moving Camera for Automated Video Analysis
    Ms. Dipali Shahare and Ms.Ranjana Shende, G.H.Raisoni Institute of Engineering for Womens, India
    ABSTRACT
    Detection of moving objects in a video sequence is a difficult task and robust moving object detection in video frames for video surveillance applications is a challenging problem. Object detection is a fundamental step for automated video analysis in many vision applications. Object detection in a video is usually performed by object detectors or background subtraction techniques. Frequently, an object detector requires manual labeling, while background subtraction needs a training sequence. To automate the analysis, object detection without a separate training phase becomes a critical task. This paper presents a survey of various techniques related to moving object detection and discussed the optimization process that can lead to improved object detection and the speed of formulating the low rank model for detected object.
  • Hybrid Recommender System for Activity Planout
    Somya Singhal and Durga Toshniwal, Indian Institute of Technology, India
    ABSTRACT
    Recommender systems are information filtering engines which provides personalised recommendations to the user based on the user’s past history or his similarity to other users. Due to the enormous amount of technological advances, large amount of data is being added everyday. So discovering personalised valuable information from the data is even more challenging. Some key challenges posed in the recent years for developing the recommender system are: producing high quality precise and accurate recommendations to the user and handling billions of requests per second with the huge amount of data residing in the database. New recommendation algorithms are needed to produce relevant and accurate recommendations, even for very large scale problems.But less work has been seen in the field of recommending many activites simultaneously to the user. In this paper, we analyse the content based filtering prediction model which computes the item-item similarity using our proposed method. Then items are clustered using the proposed theta similarity method with the optimisations being done at each and every step. Using these clusters, rating is predicted for every new item for the user based on the ratings given by the user to various other items. We use these predicted ratings to suggest many activites that can be performed one after the other by the user.
  • Improving the Retrieval of Information using Pattern Taxonomy Model
    Ms. Priya P. Malkhede and Ms. Hemlata Dakhore, G H Raisoni Institute of Engineering and Technology for Women, India
    ABSTRACT
    In the last decade, several data processing techniques are designed for mining supportive patterns in text documents. On the contrary, how resourcefully uses link degreed update discovered patterns remains an open research issue, especially within the domain of text mining. The existing system is used term-based approach for extracting the text. Pattern evolution technique is used for enlarging the performance of term-based approach. The complications of polysemy and synonymy causes agonizing for the term-based tactics. Subsequent methods give a way to improve the usefulness of victimization and change discovered patterns for locating significant and attention-grabbing data. Considerable experiments on information assortment and topics demonstrate that the planned answer achieves encouraging performance. Researchers are still going in efficient updating of discovered pattern.
  • Enhancing Security in Multi Cloud Storage System using Security Algorithm
    Dolly Talware and Ms. Purnima Soni, Nagpur University , G. H. Raisoni Institute of Engineering and Technology, India
    ABSTRACT
    In modern centuries use of Cloud computing in different mode like cloud storage, cloud hosting, cloud servers are increased in industries and other organization as per requirements. While considering the power, stability and the security of cloud one can’t ignore different threats to user’s data on cloud storage. File access mechanism is an actual technique to guarantee the file safety in the cloud. On the other hand, due to file farm out and untrusted cloud servers. The file entrance mechanism develops an exciting issue in cloud storage systems. In effect right to use mechanism systems are no longer applicable to cloud storage systems, because they also produce various converted copies of the similar files or involve a completely reliable cloud server. Malicious user at cloud storage is become most difficult attacks to stop. In proposed system, we are executing the ideas of various cloud storage beside with enhanced safety using encryption methods where rather storing complete file on single cloud system. File can divided the file in different sections at that time encode and store it on different cloud and the meta informations necessary for decrypting and affecting a file will be stored in metadata organisation server.
  • Design of Prototype Model For Simulation of Vehicle to Vehicle Communication Using Control and Warning Packets
    Pooja Prakash Kothe and V.N. Katkar, Nagpur University, India
    ABSTRACT
    Vehicular ad hoc networks (VANETs) are being developed to provide on-demand wireless communication infrastructure among vehicles and authorities. Such an infrastructure is expected to deliver multiple road safety and driving assistance applications. Vehicles will be equipped with sensors and communication devices that will allow them to cooperate with each other. Vehicles can exchange different type of information as per requirements on demand for specified application. It is important to have some standard protocols for communications between vehicles to vehicles. Hence we are proposing system which will demonstrate the implementation of Vehicle to Vehicle communication along with categorized modes of communication like control, informational and alert messages. Expected outcome of the proposed system will be to develop a prototype vehicle models which will communicate with each other using wireless technology and react upon with defined action on specific type of message from sender vehicle.Vehicular ad hoc networks (VANETs) are being developed to provide on-demand wireless communication infrastructure among vehicles and authorities. Such an infrastructure is expected to deliver multiple road safety and driving assistance applications. Vehicles will be equipped with sensors and communication devices that will allow them to cooperate with each other. Vehicles can exchange different type of information as per requirements on demand for specified application. It is important to have some standard protocols for communications between vehicles to vehicles. Hence we are proposing system which will demonstrate the implementation of Vehicle to Vehicle communication along with categorized modes of communication like control, informational and alert messages. Expected outcome of the proposed system will be to develop a prototype vehicle models which will communicate with each other using wireless technology and react upon with defined action on specific type of message from sender vehicle.
  • Study on Load Balancing in Cloud Computing Environment Using Evolutionary and Swarm Based Algorithm
    Madhurima Rana, Saurabh Bilgaiyan and Utsav Kar, KIIT University, India
    ABSTRACT
    Literature meaning of cloud computing is distributed computing, storing, sharing and accessing data over the Internet. It provides a pool of shared resources to the users available on the basis of pay as you go service, means users pay only for those services which are used by him according to their access times. The data processing and storage amount is increasing quickly day by day in cloud environment. This leads to an uneven distribution of overall work on cloud resources. So a proper balance of overall load over the available resources is a major issue in cloud computing paradigm. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. It also minimizes the time and cost involved in such big computing models. Load balancing and better resource utilization is provided by many existing algorithms. To overcome load balancing problem this paper provides a summary of evolutionary and swarm based algorithms which will help to overcome such problem in different cloud computing environment.
  • Facial Feature Tracking and Expression Recognition of Face Using Dynamic Bayesian Network
    Ms.Sonali Hedaoo and M.D.Katkar, Nagpur University, G.H. Raisoni Institute of Engineering and Technology for Women, India
    ABSTRACT
    The human face plays a central role in social interaction, hence it is not surprising that facial information processing is an important and highly active subfield of cognitive science research. The face is a complex stimulus displaying information about identity, age, gender, as well as emotional and attention state. Here we consider the problem of extracting information about emotional state (facial expression) from single images. Due to the difficulty of obtaining controlled video sequences of standard facial expressions, many psychological and neurophysiologic studies of facial expression processing have used single image motivations. In proposed system, in contrast to the mainstream approaches, we are trying to build a probabilistic model based on the Dynamic Bayesian Network (DBN) to capture the facial interactions at different levels. Hence the proposed system deal with the identification of facial expression on the image captured through camera.
  • Cloud Computing: Concept, Terminologies, Issues, Recent Technologies
    Saurabh Bilgaiyan, Santwana Sagnika and Sonali Swetapadma Sahu, KIIT University, Bhubaneswar, India
    ABSTRACT
    In recent computing trends where processing capabilities, storage capacity, automation for computing, etc. are increasing rapidly as per demand, cloud computing emerges as a forerunner for such type of processing environment. Cloud computing is a network-based computing paradigm which maintains a huge pool of computing resources. Access to such computing resources is open to demanding users through internet. The distribution and flexibility of cloud environment makes it one of the best distributed computing environments. Services offered by a cloud service provider are charged as per their use by end-user, while at any instance users can hold or release number of services. This paper deals with the important concepts of cloud computing, issues, some important terminologies of cloud computing and shows how cloud computing is effective for future computing trend shifts.
  • Automatic Inspection of Railway Track Using Vision and Vibration Method
    Ashwini Belkhade and Snehal Kathale, GHRIETW, India
    ABSTRACT
    Now a day, railway track inspection is done by trained human inspector to maintain safety in railway. Manual inspection takes too much time to detect fault. Hence to avoid delay and disaster this system will automatically inspect the railway track with the help of vision and vibration method. This system continuously monitoring of railway track component such as tie plates, anchors, bolts with the help of camera and do the calibration of railway track with the help of vibration sensors. Haar classifier algorithm is used to detect the required image of component from the railway track images. Automatic vision inspections of rail road track provide a robust solution and give more efficient and effective inspection of railway track.
  • Automated Book Detection System Using Robotic Hand
    Ashwini Belkhade and Snehal Kathale, GHRIETW, India
    ABSTRACT
    In this paper, a new approach for detection, sorting and placing of books is described. The location, shape as well as barcode of book’s are unknown. Therefore autonomous book detection is a big challenge. In this work, the projected approach is implemented in the scope of a library in which a robotic hand is used. The projected approach uses the Bayesian model to read and detect the barcode of book that models the form and look of barcodes. Then the work suggested that an automated sorting system shelves and rearranges inexactly placed objects using vision algorithm. At last, placing the book from a bookshelf image using path mapping. The experimental results show that the proposed technique is capable of automatically extracting the book from the library bookshelf image using simulated robotic hand.
  • Industrial Automation Through Zigbee Based Wireless Remote Controller
    Minal Nikose and Pratibha Mishra, RTMNU, India
    ABSTRACT
    Using sensors in industrial plants, industrial environment can become more advanced by sensing their information from distant places.This paper presents the emerging applications of the Zigbee technology. Using this technology, an industrial automation system has been proposed, designed, implemented and tested. A wide range of activities can be performed by remote controller based on Zigbee which can cover up to the range of 200 meters. The system is mainly contains triac controlling Module to switch ON/OFF the devices, Dimmer Controller Module which vary the intensity of light, Seven segment display Modules to show various modes, DC Motor Module which rotate motor in either direction, temperature controlling module and shaft indicator module which displays the position of shaft on display board.
  • The Effect of Parallel Corpus Quality VS Size in English-To-Turkish Smt
    Eray Yildiz Ahmed Cüneyd Tantug and Banu Diri, Yildiz Technical University, Turkey
    ABSTRACT
    A parallel corpus plays an important role in statistical machine translation (SMT) systems. In this study, our aim is to figure out the effects of parallel corpus size and quality in the SMT. We develop a machine learning based classifier to classify parallel sentence pairs as high-quality or poor-quality. We applied this classifier to a parallel corpus containing 1 million parallel English-Turkish sentence pairs and obtained 600K high-quality parallel sentence pairs. We train multiple SMT systems with various sizes of entire raw parallel corpus and filtered high-quality corpus and evaluate their performance. As expected, our experiments show that the size of parallel corpus is a major factor in translation performance. However, instead of extending corpus with all available “so-called” parallel data, a better translation performance and reduced time-complexity can be achieved with a smaller high-quality corpus using a quality filter.
  • An Implementation of Wormhole Attack Prevention using Unobservable Secure Routing Protocol
    Vaishali Patil and Priyanka Fulare, GHRIETW, India
    ABSTRACT
    Privacy protection of mobile ad-hoc network is more demanding than that of wired network due to open the nature & mobility of wireless media. An unobservable secure routing protocol with wormhole attack prevention for mobile ad-hoc network provide privacy protection in terms of anonymity, content unobservability & wormhole attack prevention by employing anonymous trust establishment & unobservable route discovery. This technique detect malicious node within network & trying to isolate all malicious nodes or any suspicious route, which will not consider for packet transmission & traffic is transmitted via another shortest path.
  • Design and Implementation of Web Crawler
    Trupti V. Udapure and Ravindra D. Kale, G.H. Raisoni Institute of Engineering and Technology for Women, India
    ABSTRACT
    This is the era of web; everyone uses various search engines to retrieve the information from the web. Searching on the World Wide Web is the integral part of everyone’s life and is the most frequent operation on web. Web crawler is the central part of the search engines, it transverse through the web and collect the URL as per the requirement. In this paper we are going to develop a crawler which crawls through the web pages and stores the URL in its database and according to the number of clicks of the link/URL, popularity of the link is decided which gives the best possible result in less time and avoids the unnecessary search delay.
  • Investigation of SPM approaches for Academic IT –Projects
    Varsha Karandikar, Ankit Mehra and Shaligram Prajapat, IIPS-DAVV, India
    ABSTRACT
    In IT world, millions of software projects have been initiated, being developed and deployed every year. Almost billion dollars are invested for successful and useful software’s. But many of these projects are not able to satisfy user’s need. Many of them are not being delivered as per the allotted budget and schedule due to lack of project management standards. Especially in CS and IT education system of central India, academic projects are not evaluated on these grounds. In this paper, we focus on the study of quality and success of academic projects, and investigating the various approaches of project monitoring and management for developing usable software. The paper puts deep insight towards existing approaches in practice and opens scope for analysis of academic CS projects in Indore districts near future.
  • An Efficient Block-based Simple Motif Search Algorithm in biological sequences
    Khaled Fayala, Tarek El Falah and Mourad Elloumi, ESSTT, Tunisia
    ABSTRACT
    One of the most important problems in biology is the analysis of biological sequences to find common motifs. In the literature, many different versions and variants of this problem have been identified and for each version, various algorithms have been proposed by researchers. In this paper, we are particularly interested in the Simple Motif Search Problem (SMP). We propose an exact algorithm called SMS-H-BSM to solve this problem. This algorithm use a hash table as an indexing structure and a new notion of blocks of motifs which consists to treat motifs by blocks. Indeed, SMS-H-BSM searches the more specific motifs and so that identifies the most relevant motifs for biologists. Extracted motifs help biologist to solve many difficult problems and offer many tracks of research to explore.
  • Heat Stress Risk Prediction By Using Bayesian Model With Sensor Network
    Kanchan Taiwade and Prof. Prakash Mohod, G.H. Raisoni college of Engg. And Technology, Women, India
    ABSTRACT
    With advancement in use of automation system, it is also desired to be able to know about the susceptible risk in advance for taking the preventive measures either automatically or manually. Disaster management is such an area where operatives wearing the suits and performing the activities are prone to the risk of heat stress which may cause mental impairments along with other serious effects leading to death. Such type of risk occurs in human body by not being able to compensate the heat generated into the surrounding air. The paper presents the concept of mechanism which can be used to prevent such situation by activating an alert to the operative or invoke cooling mechanism automatically before onset of the risk. The Bayesian Network Model is used to predict the onset of the risk. The model is based on the probabilities gives flexibility and simplicity in modeling the system. The system was trained with appropriate data and then compared with the real time parameters to check whether possibility of risk or not. Only those body parameters are considered which directly or indirectly participate in indicating heat stress or its onset.
  • Context Based Document Searching Using Apriori Association for Mobile Devices
    Ashwini Dhanne1, Geetanjali Kale1 and Parag Kulkarni2, 1PICT, Pune and 2EKlat Research, Pune
    ABSTRACT
    Day by day numbers of documents on Internet are increasing. Many traditional searching techniques may not return most accurate results in some cases. Because search methods don’t consider document context i.e. content profile. In this paper we have proposed a system which tries to address this issue with novel method of content profiling. Here our proposed system is using Naďve Bayes text classifier and Apriori association rule to build content profile. This system accepts document from users and reply with set of similar documents. Here it is using document context of both input document and stored documents. This gives system where searching can also be done without using keywords. Content profile: Set of simple sentences that capture essence of document.
  • Dynamic Data Management among Multiple Databases for Optimization of Parallel Computations in Heterogeneous HPC Systems
    Pawel Rosciszewski, Gdansk University of Technology, Poland
    ABSTRACT
    Rapid development of diverse computer architectures and hardware accelerators caused that designing parallel systems faces new problems resulting from their heterogeneity. Our implementation of a parallel system called KernelHive allows to eciently run applications in a heterogeneous environment consisting of multiple collections of nodes with di erent types of computing devices. The execution engine of the system is open for optimizer implementations, focusing on various cri-teria. In this paper, we propose a new optimizer for KernelHive, that utilizes distributed databases and performs data prefetching to optimize the execution time of applications, which process large input data. Em- ploying a versatile data management scheme, which allows combining various distributed data providers, we propose using NoSQL databases for our purposes. We support our solution with results of experiments with our OpenCL implementation of a regular expression matching ap- plication.
  • Performance of Private Cache Replacement Policies for Multicore Processors
    Matthew Lentz and Manoj Franklin, University of Maryland College Park, United States
    ABSTRACT
    Multicore processors have become ubiquitous, both in general-purpose and special-purpose applications. With the number of transistors in a chip continuing to increase, the number of cores in a processor is also expected to increase. Cache replacement policy is an important design parameter of a cache hierarchy. As most of the processor designs have become multicore, there is a need to study cache replacement policies for multicore systems. Previous studies have focused on the shared levels of the multicore cache hierarchy. In this study, we focus on the top level of the hierarchy, which bears the brunt of the memory requests emanating from each processor core. We measure the miss rates of various cache replacement policies, as the number of cores is steadily increased from 1 to 16. The study was done by modifying the publicly available SESC simulator, which models in detail a multicore processor with a multi-level cache hierarchy. Our experimental results show that for the private L1 caches, the LRU (Least Recently Used) replacement policy outperforms all of the other replacement policies. This is in contrast to what was observed in previous studies for the shared L2 cache. The results presented in this paper can direct hardware designers to optimize their cache designs or the program codes.
  • Analysis of Rsa Security Using Arithmetic Functions
    N.Ramanjaneya Reddy, VITS, India
    ABSTRACT
    In Public key cryptography encryption and decryption are carried out using two keys called public key and private key. In this paper security issues of popular public key cryptography algorithm RSA using Euler totient function are reviewed. Carmichael function instead of Euler totient function is applied on RSA algorithm and it is proved that it results in smaller value for decryption key. The use of Carmichael function results in reduced decryption time.
  • A Streams-based Publish-Subscribe Replication System with High Availability and Disaster Recovery Protection
    Rao S. Kasinadhuni, Hewlett-Packard, United States
    ABSTRACT
    Replication is traditionally used to propagate and disseminate data to multiple sites. However replication can also be associated with consolidation of data. When the data is consolidated from multiple sites into a single repository, the repository can help in data warehouse and data mining applications. When the repository is critical from availability point of view, it needs high availability and disaster recovery capabilities. The high availability functionality also helps in upgrading or in migrating the operating system and the database without downtime. This paper discusses a database replication system developed using Oracle Streams, a Publish-Subscribe technology, for replicating data from multiple sites into a single destination site or the repository. To provide high availability to the data repository, Oracle’s Data guard technology is used by creating a hot standby to the repository. This paper presents how the replication thus Oracle Streams can failover seamlessly to the hot standby and vice versa during the disaster.
  • Comparison of Oracle Replication and High Availability Technologies and their Implementations
    Rao S. Kasinadhuni, Hewlett-Packard, United States
    ABSTRACT
    Database replication and high availability have enabled more collaboration and information sharing by extending the reach of data to various industries. In commercial database technologies, replication is the process of using a set of supplied database management utilities and procedures to enable the sharing of database objects and data between multiple databases. To maintain replicated database objects and data between multiple databases, a change to one of these database objects in a database is shared with the other linked databases. In this way, the database objects and data are kept synchronized within all of the databases in the replication environment. There can be more than one source and more than one destination database. The Oracle database provides key data replication and integration features critical to the success of data sharing. In this paper, we compare Oracle’s replication and high availability technologies and provide an insight in their implementations.
  • Implementation of Secure Single Sign On Mechanism in Distributed Network Using ECC
    Ms. Shreya B. Pandey and Ms. Antara Bhattacharya, G.H.Raisoni Institute of Engineering and Technology for Womens, India
    ABSTRACT
    Single sign-on (SSO) is a mechanism where an authenticated user has a permission for access multiple services with a single login. Single sign on improving the user productivity as the user is no longer required to remember multiple passwords and ID’s. Single sign on mechanism provides simplified administration as it reduces the administrative burden of managing user accounts. In this mechanism after obtaining a credential from a trusted authority, each legal user can use that credential to access multiple services. SSO using Elliptic Curve Cryptography (ECC) is a new attractive traditional public-key cryptosystems that offers equivalent security with smaller key sizes resulting in faster computations, low bandwidth, lower power consumption, as well as lower memory use.
  • Embedded Systems and Software- A Review
    Sai C. Hanumanthu, New York institute of technology, United States
    ABSTRACT
    Embedded systems are used in various devices and have many applications in home media systems, portable players, smart phones, embedded medical devices and sensors, automotive embedded systems have surrounded us and with continued convergence of communications and computing functions within these devices, which are transforming themselves into really complex systems, creating newer opportun - ities and challenges to develop and market more powerful, energy efficient processors, peripherals and otheraccessories.
  • A Design of System to Identify Tags Using Multiple Bit Slots in Slotted Aloha Model
    Ms. Rupali D.Patil, Ms. V. N. Katkar, A.TayaL, G.H. Raisoni Institute of Engineering and Technology for Women, India
    ABSTRACT
    The Radio frequency identification system (RFID) having the radio frequency transmitter and receiver. The consumer will get product related information of tags by using radio frequency receiver in the mobile RFID environment. When the Aloha protocol implemented the tag collision arises in RFID environment. Multiple bit slot reservation slotted aloha protocol is used to remove the collision in tag. Before allocating the frame slot in multiple bit slot reservation slotted aloha protocol, radio frequency assigns the reservation slot and radio frequency receiver generate random sequence in its own reservation slot randomly selected by transmitter to reserve a frame slot, then the transmitter efficiently captures the reservation collisions in reservation slot. The protocol reduces collision frame slot and eliminates empty frame slots. The performance evaluation shows that the proposed slotted aloha protocol outperforms the other aloha based protocols and gives the high density data of RFID tags.