Wireless sensor networks (WSNs) deployed for mission-critical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes with limited sensing capacity, Althoug...
详细信息
ISBN:
(纸本)9781424431748
Wireless sensor networks (WSNs) deployed for mission-critical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes with limited sensing capacity, Although advance network planning and dense node deployment may initially achieve the required performance, they often fail to adapt to the unpredictability of physical reality. This paper explores efficient we of mobile sensors to address the limitations of static WSNs in target detection. We propose a data fusion model that enables static and mobile sensors to effectively collaborate in target detection. An optimal sensor movement scheduling algorithm is developed to minimize the total moving distance of sensors, while achieving a set of spatiotemporal performance requirements including high detection probability, low system false alarm rate and bounded detection delay. The effectiveness of our approach is validated by extensive simulations based on real data traces collected by 23 sensor nodes.
In wireless sensor networks, filters, which suppress data update reports within predefined error bounds, effectively reduce the traffic volume for continuous data collection. All prior filter design, however, are stat...
详细信息
ISBN:
(纸本)9781424431748
In wireless sensor networks, filters, which suppress data update reports within predefined error bounds, effectively reduce the traffic volume for continuous data collection. All prior filter design, however, are stationary in the sense that each filter is attached to a specific sensor node and remains stationary over its lifetime. In this paper, we propose mobile filter, a novel design that explores migration of filters to maximize overall traffic,reduction. A mobile filter moves upstream along the data collection path, with its residual size being updated according to the collected data. Intuitively, this migration extracts and relays unused filters, leading to more proactive suppressing of update reports. We start by presenting an optimal filter migration algorithm for a chain topology The algorithm is then extended to general multi-chain and tree topologies. Extensive simulations demonstrate that, for both synthetic and real data traces, the mobile filtering scheme significantly reduces data traffic and extends network lifetime against a state-of-the-art stationary filtering scheme.
Many event-driven localization methods have been as low cost, energy efficient solutions for wireless senor networks. In order to eliminate the requirement of accurately controlled events in existing approaches, we pr...
详细信息
ISBN:
(纸本)9781424431748
Many event-driven localization methods have been as low cost, energy efficient solutions for wireless senor networks. In order to eliminate the requirement of accurately controlled events in existing approaches, we present a practical design using totally uncontrolled events for stationary sensor node positioning. The novel idea of this design is to estimate both the event generation parameters and the location of each sensor node by processing node sequences easily obtained from uncontrolled event distribution. To demonstrate the generality of our design, both straight line scan and circular wave propagation events are addressed in this paper, and we evaluated our approach through theoretical analysis, extensive simulation and a physical testbed implementation with 41 MICAz motes. The evaluation results illustrate Mat with only randomly generated events, our solution can effectively localize sensor nodes with excellent flexibility while adding no extra cost at the resource constrained sensor node side. In addition, localization using uncontrolled events provides a nice potential option of achieving node positioning through natural ambient events.
Communication between arbitrary pairs of nodes has become critical to support in emerging sensor networking applications. Traditional routing techniques for multihop wireless networks either require high control overh...
详细信息
ISBN:
(纸本)9781424425747
Communication between arbitrary pairs of nodes has become critical to support in emerging sensor networking applications. Traditional routing techniques for multihop wireless networks either require high control overhead in computing and maintaining routes, or may lead to unbounded route-stretch. In order to bound the route-stretch, we propose a distributed shortest-path roadmap based routing paradigm that embodies two ideas: routing hole approximation that summaries the critical information about hole boundaries and controlled advertisement that advertises the boundary information of each hole within limited neighborhoods. We show that our approach makes a desired tradeoff between the worst case route-stretch and the message overhead through both analysis and simulations.
This paper addresses issues associated with modeling and simulation of wireless, mobile, and ad hoc networks. Particular attention is paid to an approach for federating parallel and distributed ad hoc networks simulat...
详细信息
ISBN:
(纸本)9780769533933
This paper addresses issues associated with modeling and simulation of wireless, mobile, and ad hoc networks. Particular attention is paid to an approach for federating parallel and distributed ad hoc networks simulators. We describe the design, functionality, implementation and performance of MobASim system. It is a Java-based software platform for MANETs simulation performed on parallel computers or computer clusters. The practical application is provided to illustrate the operation and efficiency of the presented software tool.
The proliferation of wireless and mobile devices has fostered the demand of context aware applications. Location is one of the most significant contexts. Multi-lateration, as a basic building block of localization, ho...
详细信息
ISBN:
(纸本)9781424431748
The proliferation of wireless and mobile devices has fostered the demand of context aware applications. Location is one of the most significant contexts. Multi-lateration, as a basic building block of localization, however have not yet overcome the challenges of (1) poor ranging measurement;(2) dynamic and noisy environments;(3) fluctuations in wireless communications. Hence, they often suffer poor accuracy and can hardly be employed in practical applications. In this study, we propose Quality of Trilateration (QoT) that quantifies the geometric relationship of objects and the ranging noise. Based on QoT, we design a confidence based iterative localization scheme, in which nodes dynamically select trilaterations with the highest quality for localization. To validate this design, a wireless sensor network prototype is deployed and results show that QoT well represents trilateration accuracy, and the proposed scheme significantly improve localization performances.
Aiming at a realistic mobile connectivity model for vehicular sensor networks in urban environments, we propose the combination of large-scale traffic simulation and computational tools to characterize fundamental gra...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
Aiming at a realistic mobile connectivity model for vehicular sensor networks in urban environments, we propose the combination of large-scale traffic simulation and computational tools to characterize fundamental graph-theoretic parameters. To illustrate the proposed approach, we use the DIVERT simulation framework to illuminate the temporal evolution of the average node degree in this class of networks and provide an algorithm for computing the transitive connectivity profile that ultimately determines the flow of information in a vehicular sensor network.
In wireless sensor networks, each sensor node has very small memory space compared with any other embedded computingsystems. For this reason, operating systems running on the sensor nodes cannot allocate sufficient f...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
In wireless sensor networks, each sensor node has very small memory space compared with any other embedded computingsystems. For this reason, operating systems running on the sensor nodes cannot allocate sufficient fixed-size stack space for all threads. In the previous work, SESAME was proposed to allocate stack space more space-efficiently, but there is a problem of time overhead. In this paper, we present SESAME-P, which is a dynamic stack allocation scheme based on memory pool. The size of memory pool is predetermined by using static analysis of each function's stack usage information. Using the determined memory pool, SESAME-P reduces the dynamic stack allocation cost. Our experimental results show that SESAME-P significantly reduces the time overhead compared with the existing SESAME.
Connected dominating sets (CDSs) are probably the most common way of constructing virtual backbones for broadcasting operation in wireless sensor networks. This is because such backbones guarantee to reduce unnecessar...
详细信息
ISBN:
(纸本)9780769534343
Connected dominating sets (CDSs) are probably the most common way of constructing virtual backbones for broadcasting operation in wireless sensor networks. This is because such backbones guarantee to reduce unnecessary message transmissions or flooding in the network. In this paper we propose a simple localized algorithm to construct a small-sized CDS. Considering the sensors deployed in the plane, our main idea is based on the computation of convex hulls of sensor nodes (nodes are considered points in the plane) in a localized manner and a simple coloring scheme, which produces a CDS in unit disk graphs whose size is at most 38 * vertical bar MCDS vertical bar where vertical bar MCDS vertical bar is the size of a minimum CDS. To the best of our knowledge, this is a significant improvement over the best published results in the same context [5]. We also analyze grids and trees to compute the exact approximation ratios for the problem. We show that our algorithm produces an optimal CDS if the graph is a tree and in the case of grids the approximation factor is 2.
distributed stream processing systems (DSPSs) have many important applications such as sensor data analysis, network security, and business intelligence. Failure management is essential for DSPSs that often require hi...
详细信息
ISBN:
(纸本)9781424431748
distributed stream processing systems (DSPSs) have many important applications such as sensor data analysis, network security, and business intelligence. Failure management is essential for DSPSs that often require highly-available system operations. In this paper, we explore a new predictive failure management approach that employs online failure prediction to achieve more efficient failure management than previous reactive or proactive failure management approaches. We employ light-weight stream-based classification methods to perform online failure forecast. Based on the prediction results, the system can take differentiated failure preventions on abnormal components only. Our failure prediction model is tunable, which can achieve a desired tradeoff between failure penalty reduction and prevention cost based on a user-defined reward function. To achieve low-overhead online learning, we propose adaptive data stream sampling schemes to adaptively adjust measurement sampling rates based on the states of monitored components, and maintain a limited size of historical training data using reservoir sampling. We have implemented an initial prototype of the predictive failure management framework within the IBM System S distributed stream processing system. Experiment results show that our system can achieve more efficient failure management than conventional reactive and proactive approaches, while imposing low overhead to the DSPS.
暂无评论