Since nodes in a sensor network have limited energy, prolonging the network lifetime and improving scalability become important. In this paper, we propose a distributed weight-based energy-efficient hierarchical clust...
详细信息
ISBN:
(纸本)3540264221
Since nodes in a sensor network have limited energy, prolonging the network lifetime and improving scalability become important. In this paper, we propose a distributed weight-based energy-efficient hierarchical clustering protocol (DWEHC). Each node first locates its neighbors (in its enclosure region), then calculates its weight which is based on its residual energy and distance to its neighbors. The largest weight node in a neighborhood may become a clusterhead. Neighboring nodes will then join the clusterhead hierarchy. The clustering process terminates in O(1) iterations, and does not depend on network topology or size. Simulations show that DWEHC clusters have good performance characteristics.
The proliferation of networked embedded devices such as wireless sensors ushers in an entirely new class of computing platforms. We need new ways to organize and program them. Unlike existing platforms, systems such a...
详细信息
We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (a subgraph of the unit-disk graph) infrastructu...
详细信息
ISBN:
(纸本)3540264221
We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (a subgraph of the unit-disk graph) infrastructure in wireless sensor networks. More concretely, our proposed scheme constructs a subgraph of the unit-disk graph which is connected, planar and has power stretch factor of I (the well-known Gabriel graph intersected with the unit disk-graph) and - most importantly - deals explicitly with the problem of interference between nearby stations. Due to our interleaved approach of constructing low- and high-level infrastructure simultaneously, this results in considerable improvements in running time when applied in dense wireless networks. To substantiate the advantages of our approach, we introduce a novel distribution model inspired by actual sensing applications and analyze our new approach in that framework.
The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients "program" the sensors through queries in a high-level declara...
详细信息
ISBN:
(纸本)3540264221
The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients "program" the sensors through queries in a high-level declarative language permitting the system to perform the low-level optimizations necessary for energy-efficient query processing. In this paper we consider multi-query optimization for aggregate queries on sensor networks. We develop a set of distributed algorithms for processing multiple queries that incur minimum communication while observing the computational limitations of the sensor nodes. Our algorithms support incremental changes to the set of active queries and allow for local repairs to routes in response to node failures. A thorough experimental analysis shows that our approach results in significant energy savings, compared to previous work.
Recent research has shown that using a mobile element to collect and carry data mechanically from a sensor network has many advantages over static multihop routing. We have an implementation as well employing a single...
详细信息
ISBN:
(纸本)3540264221
Recent research has shown that using a mobile element to collect and carry data mechanically from a sensor network has many advantages over static multihop routing. We have an implementation as well employing a single mobile element. But the network scalability and traffic may make a single mobile element insufficient. In this paper we investigate the use of multiple mobile elements. In particular, we present load balancing algorithm which tries to balance the number of sensor nodes each mobile element services. We show by simulation the benefits of load balancing.
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.
暂无评论