In multiapplication sharing wireless sensor networks, various application queries exhibit similarity in their spatial, temporal, and sensing attribute requirements, thus result in redundant sensing tasks. The dissemin...
详细信息
In multiapplication sharing wireless sensor networks, various application queries exhibit similarity in their spatial, temporal, and sensing attribute requirements, thus result in redundant sensing tasks. The dissemination and execution of such redundant sensing tasks cause network traffic overhead and quick energy drop of the sensor nodes. Existing task scheduling and allocation mechanisms focus on reducing upstream traffic by maximizing data sharing among sensing tasks. However, downstream traffic due to sensing tasks dissemination plays a crucial role in large-scale WSNs and required to be addressed. This paper proposes a query similarity index based query preprocessing mechanism that prevents the generation of redundant sensing tasks by creating a common query corresponding to the overlapping functional requirements of the queries and reduces the downstream as well as upstream traffic significantly. The performance evaluation reveals approximately 60% reduction in downstream traffic, 20-40% reduction in upstream traffic, and 40% reduction in energy consumption when compared with state-of-the-art mechanisms.
The use of a wireless sensor network by multiple Internet of Things (IoT) devices results in a high volume of queries with similar attributes. To conserve limited resources such as communication and power, it's cr...
详细信息
ISBN:
(纸本)9798350333398
The use of a wireless sensor network by multiple Internet of Things (IoT) devices results in a high volume of queries with similar attributes. To conserve limited resources such as communication and power, it's crucial to minimize redundant queries. In this paper, we propose an effective strategy that decomposes queries into recognizable patterns, reducing the number of requests sent to sensors and reducing communication messages. One of the most relevant applications today is predicting temperature, pressure, and wind speed from data collected from IoT devices. By utilizing a Long-Short-Term-Memory (LSTM) model, we can decrease the number of messages sent to sensors and identify repetitive patterns to eliminate redundant requests. This approach significantly lowers energy consumption at the sensor level, thus extending their lifespan.
Now a day's web search engines processing billions of queries per day. This paper discusses the efficiency and effectiveness of URLs caching for the result quires submitted to search engines. Because of the expone...
详细信息
ISBN:
(纸本)9781479939251
Now a day's web search engines processing billions of queries per day. This paper discusses the efficiency and effectiveness of URLs caching for the result quires submitted to search engines. Because of the exponential growth of World Wide Web, we face several issues like network congestion and sever overloading. Web caching plays a vital role in improving the quality of service. In this proposed method we introduce a transparent caching a web cache proxy server, to improve the performance. When correctly deployed, the proxy cache server provides a reasonable improvement in band width savings, server load balancing, and increased access latency for the users. Initially the given user query get preprocessed and retrieve the information through the web cache proxy server from the origin server. We utilize wordNet lexicon ontology to find the related terms for the given query. The index data structure is used to store the terms along with the related urls. Finally we measure the effectiveness of web caching, our results and observations are measured at different levels of access.
As non-English languages have been growing exponentially on the Web with the expansion of multilingual World Wide Web, the number of online non-English speakers who realizes the importance of finding information in di...
详细信息
As non-English languages have been growing exponentially on the Web with the expansion of multilingual World Wide Web, the number of online non-English speakers who realizes the importance of finding information in different languages is enormously growing. However, the major general purpose search engines such as Google, Yahoo, etc have been lagging behind in providing indexes and search features to handle non-English languages. Hence, documents that are published in non-English languages are more likely to be missed or improperly indexed by major search engines. Amharic, which is the family of Semitic languages and the official working language of the federal government of Ethiopia, is one of these languages with a rapidly growing content on the Web. As a result, the need to develop bilingual search engine that handles the specific characteristics of the users' native language query (Amharic) and retrieves documents in both Amharic and English languages becomes more apparent. In this research work, we designed a model for an Amharic-English Search Engine and developed a bilingual Web search engine based on the model that enables Web users for finding the information they need in Amharic and English languages. In doing so, we have identified different language dependent query preprocessing components for query translation. We have also developed a bidirectional dictionary-based translation system which incorporates a transliteration component to handle proper names which are often missing in bilingual lexicons. We have used an Amharic search engine and an open source English search engine (Nutch) as our underlying search engines for Web document crawling, indexing, searching, ranking and retrieving. To evaluate the effectiveness of our Amharic-English bilingual search engine, precision measures were conducted on the top 10 retrieved Web documents. The experimental results showed that the Amharic-English cross-lingual retrieval engine performed 74.12% of its corresp
Reference strings are commonly used to characterize the reference behavior of a computation, and the definition of the optimal, though unrealizable, strategies MIN and VMIN was based on them. The description of the re...
详细信息
Reference strings are commonly used to characterize the reference behavior of a computation, and the definition of the optimal, though unrealizable, strategies MIN and VMIN was based on them. The description of the reference behavior in terms of locality-set sequences offers a flexible, higher-level alternative. We present a memory management model based on such locality-set sequences. Specialized for fixed-size buffers, this model is used to define the PSETMIN and SETMIN strategies which are proven to minimize the number of page faults in the presence and absence of prepaging, respectively. In contrast to MIN, they are also realizable for certain computations. We illustrate the methodology for obtaining the locality-set sequence of a computation in advance for relational database management systems with multiattribute-index catalogs and discuss the concomitant performance gains. In general, this preprocessing methodology is suitable for applications that maintain their own organized collections of data. For such applications, optimal locality-set management of individual computations provides an alternative to the widely used general-purpose strategies which are based on heuristics.
暂无评论