IJCST Logo

 

INTERNATIONAL JOURNAL OF COMPUTER SCIENCE & TECHNOLOGY (IJCST)-VOL IV ISSUE IV, VER. 2, OCT. TO DEC, 2013


International Journal of Computer Science and Technology Vol. 4 Issue 4, Ver. 2
  S.No. Research Topic Paper ID
    41 Context-awareness using Linear Classifiers and Adaptivity on eDLTV Mobile ApplicationAthitaya Nitchot, Pattama Krataithong, Pornchai Tummarattananont, Thatsanee Charoenporn

Abstract

There are some problems of mobility of learning, personalized presentation and recommendation under eDLTV. We therefore propose an adaptive eDLTV mobile application. Adaptive presentation and navigation is concerned in order to suggest learning resources. In addition, the context-aware ubiquitous support is concerned in suggesting related places with the current watched learning resource. Linear-classifiers algorithm is also adopted in processing the ordering within a list of places according to places’ rating and distance. The results from experiments show that eDLTV with adaptation techniques is better than nonadaptative one. Users are satisfied with adaptive and contextualized techniques on eDLTV. In the future, we plan to consider the media annotation in assigning the media fragment into subject matters, in order to enhance the recommendations to videos fragments.
Full Paper

IJCST/44/2/D-1772
    42 Domain Specific Automatic Clustering of Web Pages for Search EngineManika Goel, Ankur Kumar Goel, Lavita Kathuria

Abstract

Users of Web search engines are often forced to sift through the long ordered list of document “snippets” returned by the engines. The IR community has explored document clustering as an alternative method of organizing retrieval results, but clustering has yet to be deployed on the major search engines. The proposed work suggests a new and efficient methodology for automatic clustering of web documents. Creating clusters for different documents makes searching easier and efficient. This technique can be utilized by search engines to provide relevant results to the user according to query. The proposed work maintains a cluster keyword file that contains the keywords or terms related to the documents of the cluster, the term frequency of the terms of the cluster keyword file is calculated in the new document and thus cosine similarity is measured between the new document and the doc’s of the cluster and if the similarity measure lies between the range of 0.75 to 0.82 the new document is assigned to the particular cluster. By this technique time consume for finding the appropriate cluster for a document will be reduced. This clustering algorithm works both online and offline. The proper clustering of documents will be further utilized by multi-document summarization system, which produces a summary for the documents related to each other.
Full Paper

IJCST/44/2/D-1773
    43 Prediction Based Cache Replacement in Mobile EnvironmentArfia Shabeer, Dr. K. Veerabhadra Rao

Abstract

During the last few decades mobile systems and mobile environments are developed rapidly. This development is accompanied by a development in mobile applications in many fields. With the extensive popularity of mobile devices, huge amount of research effort has been attempted towards exploring several aspects of mobile computing.Mobile Location-Dependent Information Services (LDISs) have become increasingly popular in recent years. However, that the data caching strategies for the LDISs have thus far received little attention.In this paper, we study the issues of cache replacement for location-dependent data under a geometric location model used for predicting the cell which will be user’s next move andthe technique of prefetchine the respective data item of that cell is called as Prediction based Caching (PBC). In addition to this two cache replacement policies, Least Recently Used (LRU) and Further Away Replacement (FAR), are implemented. We conduct a series of experiments to study the performance of the proposed and existing caching scheme taking hit-ratio as parameter. The experimental results show that the proposed location-dependent replacement scheme i.e. PBC is very effective and significantly outperform over the conventional replacement policies.
Full Paper

IJCST/44/2/D-1774
    44 Semantic Similarity Analysis Using Search Engine ApproachAsma Fatima, Manjusha Kalekuri

Abstract

Measuring the semantic similarity between words is an important component in various tasks on the web such as relation extraction, community mining, document clustering, and automatic metadata extraction .Despite the usefulness of semantic similarity measures in these applications, accurately measuring semantic similarity between two words (or entities) remains a challenging task. Page counts and snippets are two useful information sources provided by most web search engines. Using page counts alone as a measure of co-occurrence of two words and using snippets alone to measure semantic similarity presents several drawbacks. An empirical method is proposed to estimate semantic similarity using page counts and text snippets retrieved from a web search engine for two words. Specifically, we define various word co-occurrence measures using page counts and integrate those with lexical patterns extracted from text snippets. To identify the numerous semantic relations that exist between two given words, we propose a novel pattern extraction algorithm and a pattern clustering algorithm. Since most existing text mining methods adopted term-based approaches, they all suffer from the problems of polysemy and synonymy. This work also includes an innovative and effective pattern discovery technique which includes the processes of pattern deploying to improve the effectiveness of using semantic similarity for finding relevant and interesting information by finding frequent and closed patterns and computing sequential patterns.
Full Paper

IJCST/44/2/D-1775
    45 An Efficient On-Demand Routing Protocol for Providing Security in ManetG.Rohith Muni Kumar, P.Rajarajeswari

Abstract

Throughout this project, we’ve a bent to stipulate solid secrecy requirements concerning secrecy-maintain routing in Manet. We’ve a bent to propose associate impalpable secure routing theme USOR to provide complete unlink ability and content unobservability. USOR is economical as a result of it uses a totally distinctive combination of cluster signature and ID-based coding for route finding. Security analysis demonstrates that USOR can well defend user privacy against every inside and out of doors attackers.
Full Paper

IJCST/44/2/D-1776
    46 Intelligent Multi-Path Secure On Demand Routing in MANET for Military ApplicationSeyed Amin Ahmadi Olounabadi, Saeedreza Tabatabaeifard, N.Naveen Kumar

Abstract

Military concerned about the security of information exchanges have always heavily relied on secure exchanges of short messages. Secure Message Transmission protocol secure the data transmission phase by tailoring an end to end secure data forwarding protocol to the MANET communication requirements and increases the reliability through transmitting the messages in multiple paths with minimal redundancy.
Full Paper

IJCST/44/2/D-1777
    47 A Secure Approach for Assessment of Data Storage Services in CloudTasneem Sultana Sana, Dr. A.A.Moiz Qyser, Sabera Nadiya

Abstract

Cloud computing is the environment which enables the convenient, efficient, on-demand network access to the shared pool of configurable computing resources (e.g. servers, networks, services, and applications) these can be rapidly provisioned and released with minimal management effort or service provider interaction. The cloud is kind of centralized database where many organizations/clients store their data, retrieve data and possibly to modify the data. Though the benefits are clear, such that service is also relinquishing user’s physical possession of their outsourced data, which is inevitably poses new security risks towards the correctness of the data in cloud. In order to address this new problem and further achieve a secure and dependable cloud storage service, we propose a flexible distributed storage integrity auditing mechanism, utilizing the homomorphic token and the distributed erasure-coded data. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme has achieved the storage correctness insurance as well as data error localization. Our scheme supports secure and efficient dynamic operations on outsourced data, including block updation, deletion, and append. To support efficient authentication strategy we have introduced multi-level authentication technique which authenticates the cloud access in multiple levels. Extensive security and performance analysis show that the proposed schemes are highly efficient and provably secure.
Full Paper

IJCST/44/2/D-1778
    48 Compressed Video Streaming for Wireless Multimedia Networks Using CS Video EncoderB.Vineela Rani, N.Tulasi Radha

Abstract

Day by day the flows of data is rapidly growing around us and increasing enormously, where as the number if salient features of the data is usually much smaller than the number of co-efficient in data representation. Hence to overcome this the enormous data need to be compressed to go along with the data coefficient this is called compressed sensing or compressive sampling. In this paper we have discussed the design issues of networked system for joint compression, rate control and error correction of video over resource-constrained embedded devices based on the theory of compressed sensing.
Full Paper

IJCST/44/2/D-1779
    49 Implementation of Wormhole Router With Low Power Buffer ManagementSaravanakumar U, Anil Krishna Galla, Arun R, Abhishek Prabhu P

Abstract

Network-on-Chip (NoC) is an on-chip communication solution in the future System-on-a-Chip (SoC) compelling high performance operation by consuming low power. In this paper, we present a new dynamic power management technique for wormhole router. This power management technique has implemented in the block level of FIFO and CMOS SRAM buffer in the router. The experimental results show that the proposed router using 10T SRAM buffer reduced the power consumption up to 76.16% than conventional router which has FIFO buffer.
Full Paper

IJCST/44/2/D-1780
    50 PDM: Misbehaving Forwarders in Wireless Sensor NetworksEmandi Satya Sai Baba, CH.Sunil

Abstract

Providing security in WSN is became a challenge to the researchers. Mostly the problem like Packet dropping and modification are very frequently occurring problem in wireless sensor network which create interrupt in communication. There are many method proposed to overcome this problem but a few has been succeed till now. In this paper we proposing a simple effective scheme which can identify misbehaving forwarders that drop or modify packets along with jammer action ceases when it is detected by one or more monitoring nodes.
Full Paper

IJCST/44/2/D-1781
    51 Increasing with Securely Access the Vehicular Information on Grouping Mechanisms in Distributed SystemsPrabakar.D, S.Raja Ranganathan, Dr. M.Marikkannan, Dr. S.Karthik

Abstract

For the reason of fast moving of the vehicles, the topology of Vehicular Ad-Hoc Networks (VANETs) dynamically changes and disconnections may frequently occur due to noise pollution. When two vehicles are disconnected, they are not able to access Information (Location, speed, vehicle identification) from each other. Information duplication has been widely used to decrease the effect of intermittent connectivity and improves Information access performance in distributed systems. When a vehicle leaves the group, it prefetches interested Information and transfers its buffered Information to other vehicles in advance so that they can still access the Information after it leaves. Mainly securing VANET application is very crucial to the implementation for this technology. Need to make sure that the vehicle is broadcasting a message is not a self-seeking or malicious vehicle. To face this problem, there is a need of a vehicle verification mechanism. Vehicle verification is though necessary to ensure the integrity, reliability and Security of the messages exchanged in the network. Network Simulator Version 2.0 (NS-2) is used to implementing this Mechanism. Extensive simulation results show that this method provides high Information availability, low Information access overhead, and Security.
Full Paper

IJCST/44/2/D-1782
    52 An Overview of Infrastructure Based Multicasting Routing Protocols in Mobile Ad-Hoc NetworksGurjeet Singh, Dr. MK Sharma

Abstract

In recent years mobile adhoc networks have become very popular and lots of research is being done on different aspects of MANET. Mobile Ad Hoc Networks (MANET)-a system of mobile nodes interfacing without the assistance of centralized infrastructure There are different aspects which are taken for research like routing, power consumption, bandwidth considerations etc. There are different strategies proposed for efficient routing which claimed to provide improved performance. There are different routing protocols proposed for MANETs which makes it quite difficult to determine which protocol is suitable for different network conditions.
Full Paper

IJCST/44/2/D-1783
    53 Noisy Fingerprint Enhancement Technique for Spatial Domain Methods a Similarity StudyP.J.Arul Leena Rose, A.Murugan

Abstract

The fingerprint images of people always vary in quality. Fingerprint identification is one of the most popular biometric technologies and is used in criminal investigations, commercial applications and so on. The performance of a fingerprint imagematching algorithm depends heavily on the quality of the input fingerprint images. Fingerprint recognition is one of the basic tasks of the Automated Fingerprint Identification Service (AFIS) of the most famous police agencies. In this paper we introduce a special method called fine enhancement method to analyze the fingerprint images both in space and in frequency. This helps to eliminate the multispectral noise in the image, and then the image is filtered with median filter. From the filtered image we extract the minutiae. As a result more than 45 minutiae points are extracted. Further the orientation field is estimated with the specified angle. The spatial domain methods such as Contrast, Negative and Histogram image enhancement which operate directly on pixels are calculated. Experimental results show that our enhancement method improves the performance of the fingerprint Images and makes it more robust with respect to the quality of input compared to other methods.
Full Paper

IJCST/44/2/D-1784
    54 Survey Paper on of Component Based Software Quality ModelsKarnail Singh

Abstract

As systems continue to increase in size and complexity, researchers continue to investigate improvements in software engineering methodologies in order to build systems of high quality, in reduced time, and cost effectively. The use of commercial off theshelf (COTS) components is viewed as a solution to these problems. The systematic use of COTS components is a complex problem. Issues include how to select components that match the functional and nonfunctional requirements, integrating (or gluing) the components, evaluating the maintenance impact, and determining if components from different vendors can be used together.
Full Paper

IJCST/44/2/D-1785
    55 Implementation of High Speed Self Switching Frequency Agile RADARK Jansi Lakshmi, K Surya Narayana Reddy

Abstract

The radar has to resist diversified jamming; High Speed selfadaptive frequency agility is an important and effective function for radars to resist jamming. The procedure to achieve this function are described, and the function is realized with FPGA using Hardware description Language, the validity is proved by on- line sampling and simulation. The High speed self-adaptive frequency agility module can analyze the type of jamming to select transmitting frequency to avoid the frequencies which have interference, under frequency diversity and fixed frequency, respectively. The general application on a searching radar shows that the module has good real-time and anti- jamming capacity.
Full Paper

IJCST/44/2/D-1786
    56 Packet-Hiding Methods for Preventing Selective Jamming AttacksNazeemaShaik, GVNKV Subba Rao

Abstract

The open nature of the wireless medium leaves it vulnerable to intentional interference attacks, typically referred to as jamming. This intentional interference with wireless transmissions can be used as a launch pad for mounting Denial-of-Service attacks on wireless networks. Typically, jamming has been addressed under an external threat model. However, adversaries with internal knowledge of protocol specifications and network secrets can launch low-effort jamming attacks that are difficult to detect and counter. In this work, we address the problem of selective jamming attacks in wireless networks. In these attacks, the adversary is active only for a short period of time, selectively targeting messages of high importance. We illustrate the advantages of selective jamming in terms of network performance degradation and adversary effort by presenting two case studies; a selective attack on TCP and one on routing. We show that selective jamming attacks can be launched by performing real-time packet classification at the physical layer. To mitigate these attacks, we develop three schemes that prevent real-time packet classification by combining cryptographic primitives with physical-layer attributes. We analyze the security of our methods and evaluate their computational and communication overhead.
Full Paper

IJCST/44/2/D-1787
    57 Study and Analysis of Multi – Viewpoint Clustering With Similarity Measures
Kanduri Swathi, GVNKV SUBBA RAO

Abstract

Clustering is a useful technique that organizes a large quantity of unordered text documents into a small number of meaningful and coherent cluster, thereby providing a basis for intuitive and informative navigation and browsing mechanisms. There are some clustering methods which have to assume some cluster relationship among the data objects that they are applied on. Similarity between a pair of objects can be defined either explicitly or implicitly. The major difference between a traditional dissimilarity/similarity measure and ours is that the former uses only a only a single viewpoint, which is the origin, while the latter utilizes many different viewpoints, which are objects assumed to not be in the same cluster with the two objects being measured. Using multiple viewpoints, more informative assessment of similarity could be achieved. Theoretical analysis and empirical study are conducted to support this claim. Two criterion functions for document clustering are proposed based on this new measure. We compare them with several well-known clustering algorithms that use other popular similarity measures on various document collections to verify the advantages of our proposal.
Full Paper

IJCST/44/2/D-1788
    58 Handling MANET Attacks using Risk Aware Response Mechanism With Extended D-S Theory
Dudipala Swetha, GVNKV SUBBA RAO

Abstract

Mobile Ad-Hoc Networks (MANET) have been highly vulnerable to attacks due to the dynamic nature of its network infrastructure. Among these attacks, routing attacks have received considerable attention since it could cause the most devastating damage to MANET. Even though there exist several intrusion response techniques to mitigate such critical attacks, existing solutions typically attempt to isolate malicious nodes based on binary or native fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure, and native fuzzy responses could lead to uncertainty in countering routing attacks in MANET. In this paper, we propose a risk-aware response mechanism to systematically cope with the identified routing attacks. Our risk-aware approach is based on an extended Dempster-Shafer mathematical theory of evidence introducing a notion of importance factors. In addition, our experiments demonstrate the effectiveness of our approach with the consideration of several performance metrics.

Full Paper

IJCST/44/2/D-1789
    59 Core Based Incremental ClusteringK. V.Lakshmi, V.Durga Prasada Rao, N. Tulasi Rad

Abstract

Clustering is a data mining activity that aims to differentiate groups inside a given set of objects, with respect to a set of relevant attributes of the analyzed objects. Generally, existing clustering methods, such as k-means algorithm, start with a known set of objects, measured against a known set of attributes. But there are numerous applications where the attribute set characterizing the objects evolves. We implement in this project a k-means based incremental clustering method, Core Based Incremental Clustering (CBIC) that is capable to re-partition the objects set, when the attributes set increases. The method starts from the partitioning into clusters that was established by applying k-means or CBIC before the attribute set changed. The result is reached more efficiently than running k-means again from the scratch on the feature-extended object set. Experiments proving the method’s efficiency are also reported

Full Paper

IJCST/44/2/D-1790
    60 Ameliorated a Neighbor Coverage Based Probabilistic Rebroadcast Protocol in MANETSaeedreza Tabatabaeifard, Seyed Amin Ahmadi Olounabadi, Dr. D Vasumathi

Abstract

Mobile circumstantial networks include Associate in nursing aggregation of mobile nodes which might travel freely. The nodes may be dynamically self-organized into capricious topology networks while not a mere infrastructure. Imputable to high quality of nodes in Eduard MANET, there exist frequent link breakages that result in frequent path failures and route discoveries. The route overhead of a route discovery can’t be neglected. We propose neighbor coverage primarily based probabilistic air protocol for reducing routing overhead in MANETs. So as to effectively exploit the neighbor coverage data, we have a tendency to propose a completely unique air delay to see the air order, so we will acquire the additional correct extra coverage quantitative relation by sensing neighbor coverage data.

Full Paper

IJCST/44/2/D-1791
    61 Decision Trees to Distribution-Based ApproachP. Anil Kumar, Lakshmi Ramani Burra, Praveen Tumuluru

Abstract

Classification is one of the most efficient and widely used data mining techniques. In the ofclassification, Decision trees can handle high dimensional data, and their representation is no rational and generally easy to take in by humans. Decision trees handle the data whose values are certain. We extend particulartype of classifiers. Value doubtfulness arises in many applications during the data collection process. Example sources of doubtfulness including data staleness, and multiple repetition measurements. Rather than abstracting changeable data by statistical derivations. We extendclassical decision tree building algorithms to handle data in rowwith uncertain values.
Full Paper

IJCST/44/2/D-1792
    62 Web Usage Mining using Incremental Clustering and Similarity MeasuresDeepanshu Mahdel, Brajesh Patel

Abstract

With the explosive growth of the World Wide Web, the amount of information available on-line is increasing rapidly. This certainly provides users with more options, but also makes it difficult to find the “right” or “interesting” information today. Web access log contains a lot of information about how the users explore the web. Mining this log, which is called Web Usage Mining, has been studied intensively these years. Web usage mining discovers user preference from this log and makes recommendations based on the extracted knowledge. More recently, a combination of web content, web structure and web usage mining has been studied and shows superior results in web recommendations. Clustering is a mechanism for filtering and grouping of data on the basis of certain characteristics such as time span, usage, occurrence etc. Clustering is a pivotal building block in many data mining applications and in machine learning. Classification of clustering algorithms can be done on multiple different aspects such as type of processing, data availability, Similarity of Data, Partitions, Center points etc. For this work, two types of processing has been considered 1) Off-line (batch) processing 2) Online or incremental Clustering. In Incremental clustering algorithm clusters data in dynamic form. Incremental Clustering requires initial clusters to be decided in advance i.e. they must pre exist for processing. If the initial clusters are to be fixed, then there are several ways it can be achieved. In this paper, we propose a new perspective of Web Usage Mining – mining the enterprise proxy log. Based on this, a novel WWWoriented web recommendation system, which we call EPWUM, is proposed and implemented.
Full Paper

IJCST/44/2/D-1793
    63 Medical Image Retrieval System Using an Improved Multilayer PerceptronMukkamula Avinash, V.Siva Parvathi, B.Srinivasa Rao, M.Sailaja

Abstract

Medical database contains huge volume of data, mostly in the form of digital medical images. Digital medical images such as X-Rays, MRI, CT is extensively used in diagnosis and planning intervention schedule. Large medical institutions produce Gbit of image data every month. For effective utilization of medical images from the archives for diagnosis, research and educational purpose, efficient image retrieval system is essential. Image retrieval systems extract features in the image to a feature vector and use similarity measures for retrieval of images. Thus the efficiency of the image retrieval system depends upon the feature selection and its categorizations. In this paper, a novel feature selection mechanism using Discrete Sine Transforms (DST) is proposing to implement and with Information Gain for feature reducing.
Full Paper

IJCST/44/2/D-1794
    64 Semantic Model Clone Detection in UML Domain ModelAnisha Rani, Raninder Kaur Dhillon, Pankaj Goel

Abstract

Model clone detection deals with the identification of duplicated parts in models [8].UML Models have to be implemented by an adequate combination of classes, attributes and methods. UML Models have two parallel structures are external, visual representation as diagrams and internal, tree-like structure [12]. In UML Models, similarity can be based on text, lexical, syntactic structure, semantics models based or functionally. They can even be similar if they follow the same pattern, that is, the same building plan [1]. This proposed paper proposes a way for the detection of semantic model clone detection in UML domain models using a high level language which parse XML of models.
Full Paper

IJCST/44/2/D-1795
    65 Software Reliability Prediction Using Neural Network With Encoded InputJ. Kannamma, B. Srinivasa Rao, P. Subba Rao, G. Lalitha Kumari

Abstract

In this paper we proposes a neural network based software reliability model to call the cumulative number of failures based on Feed onward building. Depending in the guide the on supply software failured count data of the execution time is encoded using by Exponential and Logarithmic function in order to provide the converted value as the input to the neural network. The effect of architecture of the neural network in terms of hidden nodes has been study. The presentation of the aim draw near has been tested using eighteen software failure data sets. Numerical results shown that the proposing approach is giving acceptable results across different software projects. The comparison results show that the proposing model has a good prediction potentiality.

Full Paper

IJCST/44/2/D-1796
    66 Classification of Cognition Identification for Users Preference in Web Learning System Using Particle Swarm Optimization TechniqueJayasimman. L, Dr. George Dharma Prakash Raj. E

Abstract

Web Learning is an important higher education aspect as it meets needs of an increasing pool of non-traditional students who need education to work in the present information age. It ensures a flexible, convenient and manageable way to learn. Through various learning and thinking approaches, researchers are attempting to understand and identify people’s online learning pattern and how this can be enhanced by including new ideas and technological tools available into instruction. Cognitive learning predicts web based and multimedia learning’s effectiveness. This research paper proposes a novel method to identify a user’s need based on the cognitive behavior of the user through questionnaires and also classify the user’s preference using MLP with PSO (Particle Swarm Optimization). Based on the response of the user, MLP is used with the PSO to predict the requirements of future users.

Full Paper

IJCST/44/2/D-1797
    67 Tag Classification in Social NetworksMarella Ramya, A. Madhuri

Abstract

In this paper we propose, now a days tagging is very popular in online social networks, as it facilitates search and retrieval of multimedia data. However, noisy and spam annotations often make it difficult to perform an well-organized search. Users may make mistakes in tagging and irrelevant tags and content may be maliciously added for advertisement or self-promotion. This article studies recent advances in techniques for fight against such noise and spam in social tagging. Qualitatively compare and dividing line them and outline open issues for future research.

Full Paper

IJCST/44/2/D-1798
    68 Investigating the Impact of 802.11 and CSMA ON AODV and DSR Routing Protocols in MANETS Using GloMoSimA.Venkataramana, Dr.S.Pallam Shetty

Abstract

A Mobile Ad-Hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless links. Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Mobile means moving and Ad Hoc means temporary without any fixed infrastructure, so mobile ad hoc networks are a kind of temporary networks in which nodes are moving without any fixed infrastructure or centralized administration. In this paper we are investigating the impact of MAC protocols 802.11 and CSMA on two reactive routing protocols AODV and DSR in MANETs with varying network size. Number of simulation scenarios was carried out by using Glomosim-2.03 with the simulation metrics like Throughput, End-to-End Delay and Packer Delivery Ratio. From simulation results we found that both 802.11 and CSMA is suitable for AODV where as only 802.11 is suitable for DSR.

Full Paper

IJCST/44/2/D-1799
    69 Operation and Restriction on Wireless Sensor NetworkSanjay Kumar, Dhiraj Kumar Banwal

Abstract

In Wireless Sensor Network or WSN the basic issues associated with it is sensors network topology and hardware architecture and it is still open for research. The intent of this paper is to investigate the limitations that affect the efficient operation of WSN, particularly when implementing security techniques, and more challenges that need to be taken into consideration to build efficient WSN.

Full Paper

IJCST/44/2/D-1800
    70 A Professional Procedure for Most Effective Use of Bloom Filter Settings in P2P N-keyword SearchingK. Ashok Kumar, Y. Sowjanya Kumari, Dr P.Harini

Abstract

An aspect of P2P files Distribution applications are used millions of end users. At the same time in p2p multi way searching requires some distributed operations union and intersection. In this way raising bulky amount of traffic cost and it give unsatisfactory results. Here also utilize the concept of Bloom Filter .It’s really reduce the traffic cost during the condition of applying union andintersection operations but not utilize in the proper way of the concept of Bloom Filter. That’s way in this paper we totally focus on most effective use of Bloom Filter Settings in p2p N-keyword Searching procedure. We also give some algebraic concepts in theway of the most effective use of BF settings in terms of falling the traffic cost. The involved reversed lists, not the minimized false positive rate as right by previous studies. For the better evaluate the performance of this aim, we perform inclusive on Text retrieval conference WT10G test collection and query logs of a major commercial web search engine. It is highly useful for significantly reduces the search traffic, latency and maximum gives good results of the earlier approaches.

Full Paper

IJCST/44/2/D-1801