K. A. Sumithra Devi

Analysis of Bluetooth threats and v4.0 security features

The advent of Bluetooth technology has made wireless communication easier. Any new invention or improvement is viewed very closely by people who are looking to gain information in an unauthorized manner. Security in any area is given more importance as it leads to better product and satisfied customers. The initial days of any technological invention is more challenging as they deal with new issues every day. The product/invention needs to keep evolving to address the growing list of new features requirement and handling of security issues. Bluetooth security has evolved a lot with different versions of blue tooth. Keeping in mind the growing list of Bluetooth products in the market, there has been lot of improvements done in the version 4.0 of Bluetooth. The LE (Low Energy) operational mode which is new in version 4.0 has slightly different security association models. In this paper, a review of the recent studies in the analysis of Bluetooth security issues and new security features of v4.0 is done. Specifically the paper covers secure simple pairing in Bluetooth normal mode and low energy mode. For each threat, the particular issues are addressed and a review of major approaches to improve security of Bluetooth communication using secure simple pairing is discussed.

Contention for Man-in-the-Middle Attacks in Bluetooth Networks

The adoption rate of Bluetooth technology has been very fast. It is estimated that there will be around 1 billion users who will be using some Bluetooth devices one way or the other. The fast adoption rate has made the manufacturers and users to work on delivering products based on the latest version of Bluetooth which is v4.0. One of the major attacks on Bluetooth is the Man in the middle attack. This paper reviews the existing literature on various man in the middle attacks. The existing counter measures for thwarting the man in the middle attack are also discussed. We propose an additional counter measure that will help in countering the attack and making the communication more secure.

A Flexible Interface for Security Issues in Cloud Computing

especially with regard to the security issues. Changes will have to be made such that these changes will not stunt the growth of the cloud. A way of bringing normalization while allowing a free hand to the vendor has to be considered and in this paper we are discussing a flexible interface for the various cloud services that are available.

Cross Language Information Retrieval Approach in Peer-to-Peer Network

Peer-to-Peer systems have emerged as popular way of sharing large volume of data. It is an application layer networks which enables network host to share resources in a distributed manner. The usability of these systems depends on effective search techniques to retrieve data. In this paper, an approach is made to list out some of the searching techniques that are applicable for the peer-to-peer network. However, most of the Peer-to-Peer information Systems is still unaware of some important features, such as cross-language information retrieval. Cross-language information retrieval is the state-of-art research area in the information retrieval research area.

Comparision of Hierarchial Mixed-Size Placement Algorithms for VLSI Physical Synthesis

Placement is a physical synthesis task that transforms a block/gate/transistor-level net list into an actual layout for timing convergence. It is a crucial step that assembles the basic building blocks of logic net list and establishes the overall timing characteristic of a design by determining exact locations of circuit elements within a given region. If a design is placed poorly, it is virtually impossible to close timing, no matter how much other physical synthesis and routing optimizations are applied to it. The algorithms for solving the mixed size placement problem fall into two categories, flat and hierarchical. The strategy of flat algorithm is to view both standard cells and macro blocks as the same placement components, whose advantage is that low complexity placement algorithm, such as quadratic-based algorithm, can be used to do the placement with very high speed. The strategy of hierarchical algorithm is to do the placement through block level and cell level, and the overlaps involving macro blocks are eliminated in block level. In both levels, the number of placement components reduces considerably.

Inference in Belief Network using Logic Sampling and Likelihood Weighing algorithms

Over the time in computational history, belief networks have become an increasingly popular mechanism for dealing with uncertainty in systems. It is known that identifying the probability values of belief network nodes given a set of evidence is not amenable in general. Many different simulation algorithms for approximating solution to this problem have been proposed and implemented. This paper details the implementation of such algorithms, in particular the two algorithms of the belief networks namely Logic sampling and the likelihood weighing are discussed. A detailed description of the algorithm is given with observed results. These algorithms play crucial roles in dynamic decision making in any situation of uncertainty.

Conventional ontology for cross language information system

Much of the information in science, engineering and business has been recorded in the form of text. Traditionally, this information would appear in journals, but in the present decade increasingly it is noticed online in the World-Wide Web. Tools to support information access and discovery on the Internet are proliferating at an astonishing rate. Some of this development reflects real progress but there are also many exaggerated claims. The focus of this paper is to emphasis Research on ontology which is becoming increasingly widespread predominately in the computer science community. Its importance is being recognized in a multiplicity of research fields and application areas, including knowledge engineering, database design and integration, information retrieval and extraction.