A simple technique to estimate the position of a mobile node inside a building is based on the Received Signal Strength (RSS). In a previous publication, we investigated the feasibility of using circular array antenna...
详细信息
A simple technique to estimate the position of a mobile node inside a building is based on the Received Signal Strength (RSS). In a previous publication, we investigated the feasibility of using circular array antennas and beamforming in order to enable an access point to estimate the position of a mobile inside a building. The approach utilized the two dimensional information (i.e. RSS for various azimuth directions) that is captured in a priori measured radio map. Generating these radio maps is not only extremely labor-intensive and time consuming but also sensitive to changes in the environment and possible source of interference. It would be interesting to find out if a deterministic propagation model such as ray tracing can be used to construct a radio map that effectively replaces the off-line manual measurements. In this paper, we investigate this issue and provide a novel positioning methodology that exhibits acceptable performance without the need for extensive set of measurements in the off-line mode. The performance for various parameters and building model accuracy will be presented and discussed.
The proceedings contain 8 papers. The topics discussed include: processing proximity queries in sensornetworks;impact of multi-query optimization in sensornetworks;MeT: a real world oriented metadata management syst...
详细信息
The proceedings contain 8 papers. The topics discussed include: processing proximity queries in sensornetworks;impact of multi-query optimization in sensornetworks;MeT: a real world oriented metadata management system for semantic sensornetworks;network scheduling for data archiving applications in sensornetworks;transactional issues in sensor data management;energy-efficient handling of sensor failures;quality of service in stateful information filters;and intelligent system monitoring on large clusters.
information Filters play an important role in processing streams of events, both for filtering as well as routing events based on their content. Stateful information filters like AGILE [15], Cayuga [13] and SASE [24] ...
详细信息
information aggregation in Wireless sensornetworks provides for energy-efficiency for energy-constrained nodes to increase life-time of the network. This is achieved by processing data as it flows from information so...
详细信息
ISBN:
(纸本)9780780397866
information aggregation in Wireless sensornetworks provides for energy-efficiency for energy-constrained nodes to increase life-time of the network. This is achieved by processing data as it flows from information sources to sinks. The decision of when to "clock out" data as it is processed by nodes has significant performance impact in terms of energy-efficiency, data accuracy and freshness. Solis et al. have proposed 'Cascading timeout' in [1]. In this paper, we propose cascading timeout that is aware of the value or significance of data to be sent. By simulation results we show that this scheme achieves energy efficiency while keeping data accuracy same.
The proceedings contain 6 papers. The topics discussed include: caching context information in pervasive systems;supporting arbitrary Boolean subscriptions in distributed publish/subscribe systems;distributed data sto...
详细信息
ISBN:
(纸本)1595934189
The proceedings contain 6 papers. The topics discussed include: caching context information in pervasive systems;supporting arbitrary Boolean subscriptions in distributed publish/subscribe systems;distributed data storage for opportunistic grids;middleware support for transparency and user control in context-aware systems;reconfigurable middleware for sensor based applications;and using logical neighborhoods to enable scoping in wireless sensornetworks.
Energy consumption is one of the most crucial issues in wireless sensornetworks since sensor nodes are commonly battery-driven. Recently, several aggregation methods have been proposed to save energy by reducing the ...
详细信息
ISBN:
(纸本)1595935193
Energy consumption is one of the most crucial issues in wireless sensornetworks since sensor nodes are commonly battery-driven. Recently, several aggregation methods have been proposed to save energy by reducing the number of transmissions from source to the sink. They assumed a single sink for aggregation of data. In this paper, we propose an aggregation scheme for wireless sensornetworks with multiple sinks. In our scheme, each node caches the gradient information collected from its local neighbors to determine the aggregation point for merging data to be delivered to multiple sinks. The experimental results show that our scheme can reduce the number of transmissions and thus save the energy more than the greedy incremental tree scheme and the shortest path scheme. Copyright 2006 ACM.
Wireless sensornetworks (WSNs) are commonly used for continuously monitoring applications. Data gathering and in-network processing are techniques to efficiently gather the information from sensor nodes. Usually, the...
详细信息
ISBN:
(纸本)1595934871
Wireless sensornetworks (WSNs) are commonly used for continuously monitoring applications. Data gathering and in-network processing are techniques to efficiently gather the information from sensor nodes. Usually, these techniques have been analysed taking into account a global knowledge of the system. In this paper we propose a novel distributed data gathering algorithm for wireless networks and we evaluate the effect of having a, different number of cluster heads transmitting to the base station. We focus the attention on uniformly distributed nodes in a given area, to evaluate the effects on the energy consumption. Copyright 2006 ACM.
One of the major requirements for new wireless sensornetworks is to extend the lifetime of the network. Node scheduling techniques have been used extensively for this purpose. Some existing approaches rely mainly on ...
详细信息
ISBN:
(纸本)3540462872
One of the major requirements for new wireless sensornetworks is to extend the lifetime of the network. Node scheduling techniques have been used extensively for this purpose. Some existing approaches rely mainly on location information through GPS devices for designing efficient scheduling strategies. However, integration of GPS devices with sensor nodes is expensive and increases the cost of deployment dramatically. In this paper we present a location-free solution for node scheduling. Our scheme is based on a graph theoretical approach using minimum dominating sets. We propose a heuristic to extract a collection of dominating sets. Each set comprises of a group of working nodes which ensures a high level of network coverage. At each round, one set is responsible for covering the sensor field while the nodes in other sets are in sleep mode. We evaluate our solution through simulations and discuss our future research directions.
In this paper, a novel recognition system based on rough neural network is presented for the application of vehicle classification in wireless sensor network. The proposed system is evaluated using real-world signal d...
详细信息
Wireless sensornetworks consist of a large number of low-power, small-scale sensors with limited processing and communication capabilities. Such networks are usually applied to gather data from interested area or spe...
详细信息
ISBN:
(纸本)9781424404988
Wireless sensornetworks consist of a large number of low-power, small-scale sensors with limited processing and communication capabilities. Such networks are usually applied to gather data from interested area or specific environment and deliver to remote users for analyzing or monitoring. Because of sensing devices are usually powered by batteries, it is a great challenge to meet the performance of long system lifetime required by different applications under limited power. In the densely deployed sensornetworks, the area or data sensed by neighboring sensors may overlap. In recent researches, coverage preserved node scheduling has been proposed to conserve power and provide sensing reliability. By selecting appropriate sensors into sleep state, the system lifetime can be extended without losing coverage. In this paper, we propose a cluster-based coverage-preserved node scheduling scheme. We divide sensors into clusters and group cluster members into sponsor sets based on neighbor information. The proposed approach distributes the workloads among sponsor set nodes and ensures sufficient coverage as long as possible.
暂无评论