Seamless continuity is the main goal in fourth generation Wireless networks (FGWNs), to achieve this " HANDOVER" technique is used, when a mobile terminal(MT) is in overlapping area for service continuity, Handover mechanism are mainly used. In Heterogeneous wireless networks main challenge is continual connection among the different networks like WiFi, WiMax, WLAN, WPAN etc. In this paper, Vertical handover decision schemes are compared and Multi Attribute Decision Making (MADM) is used to choose the best network from the available Visitor networks (VTs) for the continuous connection by the mobile terminal. In our work we mainly concentrated to the handover decision phase and to reduce the processing delay in the period of handover. MADM algorithms SAW and TOPSIS where compared to reduce the processing delay by using NS2 to evaluate the parameters for processing delay. KeywordsHandover, Vertical handover decision schemes, Multi attribute decision making

In diagnosis of diseases Ultrasonic devices are frequently used by healthcare professionals. The main problem during diagnosis is the distortion of visual signals obtained which is due to the consequence of the coherent of nature of the wave transmitted. These distortions are termed as 'Speckle Noise'. The present study focuses on proposing a technique to reduce speckle noise from ultrasonic devices. This technique uses a hybrid model that combines fourth order PDE based anisotropic diffusion, linked with SRAD filter and wavelet based BayesShrink technique. The proposed filter is compared with traditional filters and existing filters using anisotropic diffusion. Experimental results prove that the proposed method is efficient in reaching convergence quickly and producing quality denoised images.

No abstract

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packet to the node present in the edge of the limited transmission range of forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We evaluate the performance of our solutions via Manhattan mobility model. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.

The task of recognizing, in a data warehouse, records that pass on to the identical real world entity despite misspelling words, kinds, special writing styles or even unusual schema versions or data types is called as the record deduplication. In existing research they offered a genetic programming (GP) approach to record deduplication. Their approach combines several different parts of substantiation extracted from the data content to generate a deduplication purpose that is capable to recognize whether two or more entries in a depository are duplications or not. Because record deduplication is a time intense task even for undersized repositories, their aspire is to promote a method that discovers a proper arrangement of the best pieces of confirmation, consequently compliant a deduplication function that maximizes performance using a small representative portion of the corresponding data for preparation purposes also the optimization of process is less. Our research deals these issues with a novel technique called modified bat algorithm for record duplication. The incentive behind is to generate a flexible and effective method that employs Data Mining algorithms. The structure distributes many similarities with evolutionary computation techniques such as Genetic programming approach. This scheme is initialized with an inhabitant of random solutions and explores for optima by updating bat inventions. Nevertheless, disparate GP, modified bat has no development operators such as crossover and mutation. We also compare the proposed algorithm with other existing algorithms, including GP from the experimental results.

No abstract

No abstract

No abstract