In surveillance and tracking applications, wireless sensor nodes collectively monitor the existence of intruding targets. In this paper, we derive closed form results for predicting surveillance performance attributes...
详细信息
ISBN:
(纸本)3540264221
In surveillance and tracking applications, wireless sensor nodes collectively monitor the existence of intruding targets. In this paper, we derive closed form results for predicting surveillance performance attributes, represented by detection probability and average detection delay of intruding targets, based on tunable system parameters, represented by node density and sleep duty cycle. The results apply to both stationary and mobile targets, and shed light on the fundamental connection between aspects of sensing quality and deployment choices. We demonstrate that our results are robust to realistic sensing models, which are proposed based on experimental measurements of passive infrared sensors. We also validate the correctness of our results through extensive simulations.
The changeover of client-server to distributed embedded,systems, discussed in the area of ubiquitous computing (UC), entails a large automated processing of tasks due to the fact that the user cannot interact with eac...
详细信息
ISBN:
(纸本)0769522777
The changeover of client-server to distributed embedded,systems, discussed in the area of ubiquitous computing (UC), entails a large automated processing of tasks due to the fact that the user cannot interact with each !application in an explicit way. This technical situation,gives cause to consider the repercussions of technology on organisational forms. On the basis of scheduling processes in hospital, the EMIKA project shows the automatability of scheduling under the computing paradigm of self-organization.
The literature on programming sensor networks has focused so far on providing higher-level abstractions for expressing local node behavior. Kairos is a natural next step in sensor network programming in that it allows...
详细信息
ISBN:
(纸本)3540264221
The literature on programming sensor networks has focused so far on providing higher-level abstractions for expressing local node behavior. Kairos is a natural next step in sensor network programming in that it allows the programmer to express, in a centralized fashion, the desired global behavior of a distributed computation on the entire sensor network. Kairos' compile-time and run-time subsystems expose a small set of programming primitives, while hiding from the programmer the details of distributed-code generation and instantiation, remote data access and management, and inter-node program flow coordination. In this paper, we describe Kairos' programming model, and demonstrate its suitability, through actual implementation, for a variety of distributed programs-both infrastructure services and signal processing tasks-typically encountered in sensor network literature: routing tree construction, localization, and object tracking. Our experimental results suggest that Kairos does not adversely affect the performance or accuracy of distributed programs, while our implementation experiences suggest that it greatly raises the level of abstraction presented to the programmer.
In 2002 a devastating oyster parasite (MSX) was found in the Bras d'Or Lakes of Cape Breton. Environmental parameters affecting the transmission and life cycle of MSX are not well understood. However field observa...
详细信息
ISBN:
(纸本)3540264221
In 2002 a devastating oyster parasite (MSX) was found in the Bras d'Or Lakes of Cape Breton. Environmental parameters affecting the transmission and life cycle of MSX are not well understood. However field observations so far indicate temperature and salinity are critical. Wireless sensor technology can provide robust, reliable and near real time field data collection of such parameters. This paper addresses an implementation of wireless sensors for the timely and cost-effective monitoring and dissemination of bio-physical parameters of interest in the Bras d'Or Lakes.
sensor nodes in a distributedsensor network can fail due to a variety of reasons, e.g., harsh weather conditions, sabotage, battery failure, and component wear-out. Since many wireless sensor networks are intended to...
详细信息
ISBN:
(纸本)3540264221
sensor nodes in a distributedsensor network can fail due to a variety of reasons, e.g., harsh weather conditions, sabotage, battery failure, and component wear-out. Since many wireless sensor networks are intended to operate in an unattended manner after deployment, failing nodes cannot be replaced or repaired during field operation. Therefore, by designing the network to be fault-tolerant, we can ensure that a wireless sensor network can perform its surveillance and tracking tasks even when some nodes in the network fail. In this paper, we describe a fault-tolerant self-organization scheme that designates a set of backup nodes to replace failed nodes and maintain a backbone for coverage and communication. This scheme has been implemented on top of an energy-efficient self-organization technique for sensor networks. The proposed fault-tolerance-node selection procedure can tolerate a large number of node failures, without losing either sensing coverage or communication connectivity.
Every physical event results in a natural information gradient in the proximity of the phenomenon. Moreover, many physical phenomena follow the diffusion laws. This natural information gradient can be used to design e...
详细信息
ISBN:
(纸本)3540264221
Every physical event results in a natural information gradient in the proximity of the phenomenon. Moreover, many physical phenomena follow the diffusion laws. This natural information gradient can be used to design efficient information-driven routing protocols for sensor networks. Information-driven routing protocols based on the natural information gradient, may be categorized into two major approaches: (i) the single-path approach and (ii) the multiple-path approach. In this paper, using a regular grid topology, we develop analytical models for the query success rate and the overhead of both approaches for ideal and lossy wireless link conditions. We validate our analytical models using simulations. Also, both the analytical and the simulation models are used to characterize each approach in terms of overhead, query success rate and increase in path length.
This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor network. A key advantage of MobiQuery li...
详细信息
ISBN:
(纸本)0769523315
This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor network. A key advantage of MobiQuery lies in its capability to meet stringent spatiotemporal performance constraints crucial to many applications. These constraints include query latency, data freshness and fidelity, and changing query areas due to user mobility. A novel just-in-time prefetching algorithm enables MobiQuery to maintain robust spatiotemporal guarantees even when nodes operate under extremely low duty cycles. Furthermore, it significantly reduces the storage cost and network contention caused by continuous queries from mobile users. We validate our approach through both theoretical analysis and simulation results under a range of realistic settings.
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (possibly) very large number of clients. We...
详细信息
ISBN:
(纸本)3540264221
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (possibly) very large number of clients. We show that a variation of the problem can be solved using a local algorithm. Local algorithms are extremely useful in a sensor network scenario. This is because they allow the communication range of the sensor to be restricted to the minimum, they can operate in routerless networks, and they allow complex problems to be solved on the basis of very little information, gathered from nearby sensors. The local facility location algorithm we describe is entirely asynchronous, seamlessly supports failures and changes in the data during calculation, poses modest memory and computational requirements, and can provide an anytime solution which is guaranteed to converge to the exact same one that would be computed by a centralized algorithm given the entire data.
This paper suggests a distributed algorithm named (SEEMLESS) Survivable Energy Efficient Multihop wireLESS sensor networks which determines a transmission power level for each sensor in a wireless sensor network (WSN)...
详细信息
ISBN:
(纸本)0769522947
This paper suggests a distributed algorithm named (SEEMLESS) Survivable Energy Efficient Multihop wireLESS sensor networks which determines a transmission power level for each sensor in a wireless sensor network (WSN) with guaranteeing survivability of WSN topology and minimizing the energy consumption of each sensor. The SEEMLESS algorithm provides a mechanism to make WSN topology survivable by letting each sensor have two closest neighbors and by letting each cluster head have one additional neighbor.
sensor network localization continues to be an important research challenge. The goal of localization is to assign geographic coordinates to each node in the sensor network. Localization schemes for sensor network sys...
详细信息
ISBN:
(纸本)3540264221
sensor network localization continues to be an important research challenge. The goal of localization is to assign geographic coordinates to each node in the sensor network. Localization schemes for sensor network systems should work with inexpensive off-the-shelf hardware, scale to large networks, and also achieve good accuracy in the presence of irregularities and obstacles in the deployment area. We present a novel approach for localization that can satisfy all of these desired properties. Recent developments in sensor network clustering algorithms have resulted in distributed algorithms that produce highly regular clusters. We propose to make use of this regularity to inform our localization algorithm. The main advantages of our approach are that our protocol requires only three randomly-placed nodes that know their geographic coordinates, and does not require any ranging or positioning equipment (i.e., no signal strength measurement, ultrasound ranging, or directional antennas are needed). So far, only the DV-Hop localization mechanism worked with the same assumptions [1]. We show that our proposed approach may outperform DV-Hop in certain scenarios, in particular when there exist large obstacles in the deployment field, or when the deployment area is free of obstacles but the number of anchors is limited.
暂无评论