P. Madhuri, P.C. Deepusudha and N.Kumar
Several protocols of address auto configuration in the mobile ad hoc network (MANET) are present in the current literature. Although some of these protocols perform decently in sparse and small networks, but exhibit poor performance (e.g., single point of failure, storage limitation, large protocol overhead and so on) when the network is either dense or very large. We propose an efficient and scalable address auto configuration protocol that automatically configures a network by assigning unique IP address to every node with low overhead and minimal cost. Evenly distributed Duplicate-IP Detection Servers are used to ensure the uniqueness of an IP address during IP address assignment session. We propose and analyze an efficient approach called Filter-based Addressing Protocol (FAP), which maintains a distributed database stored in filters containing the currently allocated addresses in a compact fashion. We propose the use of two different filters, depending on the scenario: the Bloom filter, which is based on hash functions, and the Sequence filter, which compresses data based on the address sequence. Moreover, we propose the filter signature, which is the hash of the address filter, as a partition identifier. The filter signature is an important feature for easily detecting network merging events, in which address conflicts may occur.
Ale D.T. and Ogunti E.O
In this paper, we have investigated the LTE-A uplink (User Equipment to eNodeB), and performed link level analysis and simulation of Single-Carrier Frequency Domain Equalization (SC-FDE) in comparison to Orthogonal Frequency Division Multiplexing (OFDM). The comparison has been done in terms of Signal to Noise Ratio (SNR), Symbol Error Rate (SER) using Zero-Forcing (ZF) and Minimum Mean Square Error (MMSE) equalization techniques, and the results show that the performances of the two techniques are similar for a frequency flat fading channel and that the use of appropriate cyclic prefix of length not less than the Doppler spread of the channel improves performance of both systems.
Vesmawala Gaurang, Kulkarni Swati Ajay, Jha Abhishek, Chauhan Abhipranay
This paper details out web based software developed for designing Reduced Beam Section (RBS) for available range of sections with Indian profile for Special Moment Frame (SMF). In RBS connection, some portion of the beam flanges at a short distance from column face is removed, so that the yielding and plastic hinge occurs within the trimmed area of flanges. As far as RBS connection is concerned,generally the amount of shear and axial force generated at the column interface are less than the full beam cross-section due to the formation of the plastic hinge at the reduced flange area of beam flanges. Although RBS connection is widely investigated and used in US, Japan and Europe, however design of such type of connection is not presented and used in India. Formulae from Federal Emergency Management Academy (FEMA) and American Institute of Steel Construction (AISC) codes are used to study RBS for Indian profile sections. Software solution developed enables users to design RBS connection for all available Indian profiles for any intended beam to column combination.
Virtualization is a technology that combines or divides computing resources to present one or many operating environments using methodologies like hardware and software partitioning or aggregation, partial or complete machine simulation and others. Virtualization technologies find important applications over a wide range of areas such as server consolidation, secure computing platforms, supporting multiple operating systems, system migration, virtual local area network (VLAN) etc, resulting in widespread usage. Virtualization to be the act of abstracting the physical boundaries of a technology. Physical abstraction is now occurring in several ways, with many of these methods including optimize security, flexibility, fault tolerance, power efficiency, and performance. Virtual machines are separate entities from one another. Therefore if one of them fails, they are completely isolated from all the other software on that physical machine, including other virtual machines. This greatly increases security, because problems can be contained.
A.Maivizhi and C.Kalaiselvi
Microarray cancer data are useful for identifying potential gene markers for each cancer subtype, which helps in successful diagnosis of particular cancer type. The main goal of this paper consists of the exploration of new strategies and in the development of new clustering methods to improve the accuracy and robustness of clustering results, taking into account the uncertainty underlying the assignment of examples to clusters in the context of gene expression data analysis. A cancer identification system is developed by identifying potential gene markers and applying the fuzzy c-means algorithm. In order to gain a deep insight into the cancer classification problem, it is necessary to take a closer look at the problem, the proposed solutions and the related issues all together. In this paper, the algorithms such as k-means, fuzzy c-means are used to find the cancer affected genes in the sample dataset. The sample dataset that has been taken for research work is leukaemia, prostate and lung. The specified algorithms are not well functioned, in a cancer genes. So, the modified fuzzy c-means algorithm is proposed to grasp the cancer genes. These datasets are used to implement proposed algorithm using Matlab. The overall accuracy is predicted using different training sets in the dataset. An experimental prototype system has been developed, implemented and tested to demonstrate the effectiveness of the proposed model. In order to identify the cancer gene the modified fuzzy c means algorithm is used efficiently in this work and examined with better results. The performance of the proposed technique is also investigated and results are screened out efficiently.