It is difficult to design and operate a Wireless Sensor Network (WSN) that ensures timely data delivery. Hence, few time-critical WSNs are nowadays in operation despite numerous application scenarios that would benefi...
详细信息
Among several techniques proposed for indoor positioning using IEEE 802.11 Wireless Fidelity (Wi-Fi) based networks, those that rely on fingerprinting have been demonstrated to outperform those based on lateration, an...
详细信息
Among several techniques proposed for indoor positioning using IEEE 802.11 Wireless Fidelity (Wi-Fi) based networks, those that rely on fingerprinting have been demonstrated to outperform those based on lateration, angulation, and cell of origin in terms of accuracy. We compare and evaluate three Wi-Fi fingerprinting techniques that use the K-Nearest Neighbor (k-NN), Naive Bayes Classifier (NBC) and Support Vector Machine (SVM) algorithms. Our experiments show that SVM-based fingerprinting outperformed both k-NN and NBC-based fingerprinting, achieving accuracies of 2 meters or better within our testbed.
This paper proposes a path planning algorithm and a velocity control algorithm for underwater gliders to persistently monitor a patch of ocean. The algorithms address a pressing need among ocean scientists to collect ...
详细信息
This paper proposes a path planning algorithm and a velocity control algorithm for underwater gliders to persistently monitor a patch of ocean. The algorithms address a pressing need among ocean scientists to collect high-value data for studying ocean events of scientific and environmental interest, such as the occurrence of harmful algal blooms. The path planner optimizes a cost function that blends two competing factors: it maximizes the information value of the path, while minimizing the deviation from the path due to ocean currents. The speed control algorithm then optimizes the speed along the planned path so that higher resolution samples are collected in areas of higher information value. The resulting paths are closed circuits that can be repeatedly traversed to collect long term ocean data in dynamic environments. The algorithms were tested during sea trials on an underwater glider operating off the coast of southern California over the course of several weeks. The results show significant improvements in data resolution and path reliability compared to a sampling path that is typically used in the region.
This paper is about the performance of range queries on historic web page data set, i.e. requests into a data set of web pages that keeps record of historic versions of HTML data of URLs on the web for a subset of dat...
详细信息
The problem of scheduling a set of tasks on a multiprocessor architecture is addressed. Tasks are assumed to be sporadic with arbitrary deadlines and may migrate between processors. The execution of migrating tasks is...
详细信息
Initial deployment of secrets plays a crucial role in any security design, but especially in hardware constrained wireless sensor networks. Many key management schemes assume either manually pre-installed shared secre...
详细信息
Response time bounds are important for many application scenarios of wireless sensor networks (WSN). Often, during the planning phase of a WSN its topology is not known. It rather results from a deployment process. Th...
详细信息
Response time bounds are important for many application scenarios of wireless sensor networks (WSN). Often, during the planning phase of a WSN its topology is not known. It rather results from a deployment process. This makes the provision of deterministic response time bounds difficult. In this paper, we strive for statistical response time bounds in WSNs that take the stochastic nature of the deployment process into account. Based on a Monte Carlo method we derive estimates for quantiles of the maximum response time distribution under uncertainty about the topology. In numerical experiments we show that the long but light tail of this distribution causes considerably lower bounds compared to the deterministic one even under small violation probabilities and, yet, on the other hand compare favourably with the median of the distribution.
This paper is about the performance of range queries on historic web page data set, i.e. requests into a data set of web pages that keeps record of historic versions of HTML data of URLs on the web for a subset of dat...
详细信息
This paper is about the performance of range queries on historic web page data set, i.e. requests into a data set of web pages that keeps record of historic versions of HTML data of URLs on the web for a subset of data, the URLs and the timestamps of which satisfy the query conditions. To keep track of all versions of every web URL, the data set could easily scale up to terabytes. Hence, systems providing query services to such a data set would require much computing resource. We show that in this scenario data storage layout has significant impact on query performance and propose storage design principles for performance improvement through quantitative approaches.
Recent decades have witnessed an explosive growth in the amounts of digital data in various fields of arts, science and engineering. Such data is generally of interest to a large number of people spread over wide geog...
详细信息
Initial deployment of secrets plays a crucial role in any security design, but especially in hardware constrained wireless sensor networks. Many key management schemes assume either manually pre-installed shared secre...
详细信息
Initial deployment of secrets plays a crucial role in any security design, but especially in hardware constrained wireless sensor networks. Many key management schemes assume either manually pre-installed shared secrets or keys authenticated with the aid of out-of-band channels. While manually installing secret keys affects the practicability of the key deployment, out-of-band channels require additional interfaces of already hardware-limited wireless sensor nodes. In this work, we present a key deployment protocol that uses pair-wise ephemeral keys generated from physical layer information which subsequently enables an authenticated exchange of public keys. Hence, this work presents an elegant solution to the key deployment problem without requiring more capabilities than already available on common low-cost devices. To justify the feasibility of this solution, we implement and experimentally evaluate the proposed key deployment protocol using commodity wireless sensor motes.
暂无评论