The presence of soft faulty sensor nodes in wireless sensor networks (WSNs) creates problem for maintaining the consistent performance over the entire life span. For this, a distributed fault detection algorithm is pr...
详细信息
The presence of soft faulty sensor nodes in wireless sensor networks (WSNs) creates problem for maintaining the consistent performance over the entire life span. For this, a distributed fault detection algorithm is proposed which is based on the neighboring coordination technique. The sensor node characteristics are accumulated at a particular time instant to compute the faulty status. In this approach the number of message exchange to identify the faulty sensors is less and also saves substantial amount of energy of the sensor nodes. The proposed algorithm is implemented in NS3. The simulation result shows that the detection accuracy is better compared to other detection techniques.
Wireless sensor networks (WSNs) have major importance in distributed sensing applications. The important concern in the intend of wireless sensor networks is battery consumption which usually rely on non-renewable sou...
详细信息
Wireless sensor networks (WSNs) have major importance in distributed sensing applications. The important concern in the intend of wireless sensor networks is battery consumption which usually rely on non-renewable sources of energy. In this paper we have proposed a tailored Q-Learning algorithm for routing scheme in wireless sensor network. Our primary goal is to make an efficient routing algorithm with help of modified Q-Learning approach to minimize the energy consumption utilized by sensor nodes. This approach is a modified version of existing Q-Learning method for WSN that leads to the convergence problem.
Most of the DNA sequence comparison techniques are based on heuristic as it is the fastest even though it does not guarantees that the optimum results will be produced. In DNA sequence comparison - a basic operation i...
详细信息
Most of the DNA sequence comparison techniques are based on heuristic as it is the fastest even though it does not guarantees that the optimum results will be produced. In DNA sequence comparison - a basic operation in sequencing projects most of the methods uses heuristic approach. The algorithm proposed by Needleman and Wunsch obtains the best global alignments at the expense of very high computing power and huge memory requirements. In this paper we have presented and evaluated our experiments with two different methods to run the Needleman and Wunsch algorithm on a cluster of workstations using a distributed Shared Memory System. Our results on cluster of workstations which consist of total 24 cores presented very good speedups and shows that notable improvements can be achieved, depending on the methods used. Also, we present some theoretical remarks on how to reduce the amount of memory used.
The consumers in a wireless grid will prefer reliable and cost optimal resources for job execution, while the grid service providers prefer efficient utilization of their resources. Hence brokering of resources that m...
详细信息
The consumers in a wireless grid will prefer reliable and cost optimal resources for job execution, while the grid service providers prefer efficient utilization of their resources. Hence brokering of resources that meet the requirements of consumers and providers is a challenging task in presence of unstable (wireless) network connections, market dynamics and rational users. This paper models a resource pricing strategy using a non-cooperative bargaining game for resource allocation considering dynamics in the grid market. The proposed scheme is simulated to evaluate the performance parameters like offered price, surplus, negotiation time and job completion time. We observed that our scheme performs better than existing scheme in terms of negotiation time and job completion time.
This position paper is focused on the abstract model of Object Oriented Computer Architecture and specifically the memory unit of such a computing system which would be able to handle the type of object oriented compu...
详细信息
The distributed Web caching system provides fast retrievals of web pages but still limited by the delays incurred by servers. As these systems are affected by low robustness due to highly congested servers. As in real...
详细信息
The distributed Web caching system provides fast retrievals of web pages but still limited by the delays incurred by servers. As these systems are affected by low robustness due to highly congested servers. As in real time, servers get disconnected frequently providing tradeoff to service. Robust distributed Web Caching (RDWC) handles robustness but fails to deal with the frequent disconnections. So in this paper, we discussed effective distributed Web Caching (DWC), distributed Web Caching with Clustering (DWCC) and Robust distributed Web Caching techniques. Then a scheme is proposed and designed which can overcome frequent disconnections of proxy servers & more delays incurred in these schemes, it can send the replies back to clients in lesser time (by factor n- Best Case). Clustering of Proxy Servers is used with dynamic allocation of requests to less congested servers to achieve load balancing and robustness. Then a comparison of our Scheme is done with these and results are given in comparative table.
This paper presents an efficient combinatorial approach to compute the reliability of Folded Crossed cube topology. The reliability measure has been defined as Task-based Reliability (TBR).The model is based on decomp...
详细信息
This paper presents an efficient combinatorial approach to compute the reliability of Folded Crossed cube topology. The reliability measure has been defined as Task-based Reliability (TBR).The model is based on decomposition principle which is entirely task-based and can handle any degradation. The reliability results are obtained using recursive equation both optimistic and pessimistic are better than for the Crossed cube as well as for most of the other networks. We have utilized the method to generate the task-based reliability of some higher dimensional interconnection networks with various failure rates and coverage factors.
gridcomputing, inspired by electrical power grid, is an emerging trend for making easy access to computing resources. Its main objective is to solve computationally hard problems which otherwise cannot be solved by s...
详细信息
gridcomputing, inspired by electrical power grid, is an emerging trend for making easy access to computing resources. Its main objective is to solve computationally hard problems which otherwise cannot be solved by single CPU. This extremely high computing power is achieved by optimal utilization of geographically distributed heterogeneous resources which are lying idle. Load balanced task scheduling is very important problem in complex grid environment. So task scheduling which is one of the NP-Complete problems becomes a focus of research scholars in gridcomputing area. The traditional Min-Min and Max-Min algorithms are simple algorithms that produces a schedule that minimizes the makespan than the other traditional algorithms in the literature. In real scenario of Min-Min and Max-Min failed to produce a load balanced schedule. The proposed method has two-phases. In the first phase the traditional Max-Min algorithm is executed and in the second phase the tasks are rescheduled to use the unutilized resources effectively.
MANET is a self-configuring network of mobile nodes connected by wireless links and driven by battery power. Security and Energy are the two prime concerns in Mobile Ad hoc Networks (MANET). Intrusion Detection System...
详细信息
MANET is a self-configuring network of mobile nodes connected by wireless links and driven by battery power. Security and Energy are the two prime concerns in Mobile Ad hoc Networks (MANET). Intrusion Detection System (IDS) is one of the ways to provide security in MANET. Due to energy crisis, it is not possible to run an IDS throughout the life-time of MANET. Therefore IDS should be run in time sharing fashion in a cluster based MANET. In this paper a novel scheduling strategy is described, which will run all the IDS in a time shared fashion in a clique. This will help in conserving energy while giving desired level of security.
A general crawler downloads web pages that may be of any kind, thus forming a source of information for the search engine. Blog crawler is similar to a general crawler except that it restricts its crawl boundary to th...
详细信息
A general crawler downloads web pages that may be of any kind, thus forming a source of information for the search engine. Blog crawler is similar to a general crawler except that it restricts its crawl boundary to the blog space, thus downloading only the blog pages and ignoring rest of the web. Since blog is an emerging phenomenon and serve as very useful source of information, a blog crawler proves to be of great help in this regard. We propose a new algorithm for blog crawler and discuss a number of related issues. Also, as the result of analysis, it has been found that our proposed blog crawler is superior to the general crawler.
暂无评论