In this paper, we propose a Voronoi detection range adjustment method that utilizes distributed Voronoi diagram to delimit the area of responsibility for each sensor. We then use genetic algorithm to optimize the most...
详细信息
In this paper, we propose a Voronoi detection range adjustment method that utilizes distributed Voronoi diagram to delimit the area of responsibility for each sensor. We then use genetic algorithm to optimize the most suitable detection range for each sensor. Simulations show that VERA outperforms maximum detection range, K-covered [Huang and Tseng, 2003], and greedy [Cardei et al., 2006] methods in terms of reducing the overlaps among detection ranges, minimizing energy consumption, and prolonging network lifetime.
In this paper, we consider how to localize individual nodes in a wireless sensor network when some subset of the network nodes can be in motion at any given time. For situations in which it is not practical or cost-ef...
详细信息
ISBN:
(纸本)9783540730897
In this paper, we consider how to localize individual nodes in a wireless sensor network when some subset of the network nodes can be in motion at any given time. For situations in which it is not practical or cost-efficient to use GPS or anchor nodes, this paper proposes an Anchor-Free Mobile Geographic distributed Localization (MGDL) algorithm for wireless sensor networks. Taking advantage of the accelerometers that are present in standard motes, MGDL estimates the distance moved by each node. If this distance is beyond a threshold, then this node will trigger a series of mobile localization procedures to recalculate and update its location in the node itself. Such procedures will be stopped when the node stops moving. Data collected using Tmote Invent nodes (Moteiv Inc.) and simulations show that the proposed detection method can efficiently detect the movement, and that the localization is accurate and the communication is efficient in different static and mobile contexts.
In self-organizing networks of battery-powered wireless sensors that can sense, process, and communicate, energy is the most crucial and scarce resource. However, since sensor network applications generally exhibit sp...
ISBN:
(纸本)9783540730897
In self-organizing networks of battery-powered wireless sensors that can sense, process, and communicate, energy is the most crucial and scarce resource. However, since sensor network applications generally exhibit specific limited behaviors, there is both a need and an opportunity for adapting the network architecture to match the application in order to optimize resource utilization. Many applications-such as large-scale collaborative sensing, distributed signal processing, and distributed data assimilation-require sensor data to be available at multiple resolutions, or allow fidelity to be traded-off for energy efficiency. We believe that cross-layering and application-specific adaptability are the primary design principles needed to build sensor networking protocols. In previous work, we proposed an adaptive cross-layered self-organizing hierarchical data service under COMPASS architecture, that enables multi-scale collaboration and communication. In this paper we propose a time division multiplexing medium scheduling protocol tailored for this hierarchical data service, to take advantage of the communication and routing characteristics to achieve close to optimal latency and energy usage. We present an analytical proof on the bounds achieved by the protocol and analyze the performance via detailed simulations.
The combination of sensor networks and grid computing enables the complementary strengths and characteristics of sensor networks and grid computing to be realized on a single integrated platform. As each runs on diffe...
详细信息
The combination of sensor networks and grid computing enables the complementary strengths and characteristics of sensor networks and grid computing to be realized on a single integrated platform. As each runs on different platforms and uses different languages, the usage of Web services is the best choice to implement this integration. Stargate, a computer with sensor signal processing capabilities is used in the implementation. This combination called sensorGrid allows powerful applications to be built on it to capitalize on the real-time sensing and the huge computing ability. The application that will be examined in this project is car traffic optimization. Powerful Q-learning algorithms are running in distributed Stargates to vary the duration of green and red light at each traffic junction according to the traffic situation that is being sensed continuously. The benefits will be the huge time saved for cars travelling through the traffic network. The success of using sensorGrid with Q-learning algorithm on this traffic problem allows more sophisticated applications to be developed in the future.
Our work addresses the spatiotemporally varying nature of data traffic in environmental monitoring and surveillance applications. By employing a network-controlled mobile basestation (MB), we present a simple energy-e...
ISBN:
(纸本)9783540730897
Our work addresses the spatiotemporally varying nature of data traffic in environmental monitoring and surveillance applications. By employing a network-controlled mobile basestation (MB), we present a simple energy-efficient data collection protocol for wireless sensor networks (WSNs). In contrast to the existing MB-based solutions where WSN nodes buffer data passively until visited by an MB, our protocol maintains an always-on multihop connectivity to the MB by means of an efficient distributed tracking mechanism. This allows the nodes to forward their data in a timely fashion, avoiding latencies due to long-term buffering. Our protocol progressively relocates the MB closer to the regions that produce higher data rates and reduces the average weighted multihop traffic, enabling energy savings. Using the convexity of the cost function, we prove that our local and greedy protocol is in fact optimal.
Many emergent distributed sensing applications need to keep track of mobile entities across multiple sensor networks connected via an IP network. To simplify the realization of such applications, we present MLDS, a Mu...
ISBN:
(纸本)9783540730897
Many emergent distributed sensing applications need to keep track of mobile entities across multiple sensor networks connected via an IP network. To simplify the realization of such applications, we present MLDS, a Multi-resolution Location Directory Service for tiered sensor networks. MLDS provides a rich set of spatial query services ranging from simple queries about entity location, to complex nearest neighbor queries. Furthermore, MLDS supports multiple query granularities which allow an application to achieve the desired tradeoff between query accuracy and communication cost. We implemented MLDS on Agimone, a unified middleware for sensor and IP networks. We then deployed and evaluated the service on a tiered testbed consisting of tmote nodes and base stations. Our experimental results show that, when compared to a centralized approach, MLDS achieves significant savings in communication cost while still providing a high degree of accuracy, both within a single sensor network and across multiple sensor networks.
Smaller, faster, and cheaper sensors resulted from continuing advances in sensor, semiconductor, and communication systems technology makes it possible to have real sensor intensive networks of fixed and mobile device...
详细信息
Smaller, faster, and cheaper sensors resulted from continuing advances in sensor, semiconductor, and communication systems technology makes it possible to have real sensor intensive networks of fixed and mobile devices for use in many in-door and out-door applications. Several sensor network testbeds have been developed, but none of them consider how to incorporate smart sensor capability in the system. In this paper, we describe the design and implementation of a testbed, ToSS (Testbed of Smart sensors), developed in collaboration with NASA Stennis Space Center for testing and verifying ieee 1451-compatible sensorsystems with network performance monitoring capability for space shuttles and other space exploration relevant tasks.
sensor network troubleshooting is a notoriously difficult task, further exacerbated by resource constraints, unreliable components, unpredictable natural phenomena, and experimental programming paradigms. This paper p...
详细信息
ISBN:
(纸本)9783540730897
sensor network troubleshooting is a notoriously difficult task, further exacerbated by resource constraints, unreliable components, unpredictable natural phenomena, and experimental programming paradigms. This paper presents SNTS (sensor Network Troubleshooting Suite), a tool that performs automated failure diagnosis in sensor networks. SNTS can be used to monitor network conditions using simple visualization techniques as well as to troubleshoot deployed distributedsensorsystems using data mining approaches. It is composed of (i) a data collection front-end that records events internal to the network and (ii) a data processing back-end for subsequent analysis. We use data mining techniques to automate failure diagnosis on the back-end. The assumption is that the occurrence of execution conditions that cause failures (e.g., traversal of an execution path that contains a "bug" or occurrence of a sequence of events that a protocol was not designed to handle) will have a measurable correlation (by causality) with the resulting failure itself. Hence, by mining for network conditions that correlate with failure states the root causes of failure are revealed with high probability. To evaluate the effectiveness of the tool, we have used it to troubleshoot a tracking system called EnviroTrack [4], which, although performs well most of the time, occasionally fails to track targets correctly. Results show that SNTS can identify the major causes of the problem and give developers useful hints on improving the performance of the tracking system.
The geographic routing is an ideal approach to realize pointto-point routing in wireless sensor networks because packets can be delivered by only maintaining a small set of neighbors39; physical positions. The geogr...
ISBN:
(纸本)9783540730897
The geographic routing is an ideal approach to realize pointto-point routing in wireless sensor networks because packets can be delivered by only maintaining a small set of neighbors' physical positions. The geographic routing assumes that a packet can be moved closer to the destination in the network topology if it is moved geographically closer to the destination in the physical space. This assumption, however, only holds in an ideal model where uniformly distributed nodes communicate with neighbors through wireless channels with perfect reception. Because this model oversimplifies the spatial complexity of a wireless sensor network, the geographic routing may often lead a packet to the local minimum or low quality route. Unlike the geographic forwarding, the ETX-embedding proposed in this paper can accurately encode both a network's topological structure and channel quality to small size nodes' virtual coordinates, which makes it possible for greedy forwarding to guide a packet along an optimal routing path. Our performance evaluation based on both the MICA2 sensor platform and TOSSIM simulator shows that the greedy forwarding based on ETX-embedding outperforms previous geographic routing approaches.
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensors into groups such that a connected b...
ISBN:
(纸本)9783540730897
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensors into groups such that a connected backbone network can be maintained by keeping only one arbitrary node from each group in active status while putting others to sleep. Nodes within each group swap between active and sleeping status occasionally to balance the energy consumption. Unlike previous approaches that partition nodes geographically, CPA is based on the measured connectivity between pairwise nodes and does not depend on nodes' locations. In this paper, we formulate node scheduling as a constrained optimal graph partition problem, and propose CPA as a distributed heuristic partition algorithm. CPA can ensure k-vertex connectivity of the backbone network for its partition so as to achieve the trade-off between saving energy and preserving network communication quality. Moreover, simulation results show that CPA outperforms other approaches in complex environments where the ideal radio propagation model does not hold.
暂无评论