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.
Low-cost and low-power sensor nodes forming Wireless sensor Networks have become suitable for a wide range of applications during recent years. These networks demand the implementation of energy-aware techniques and l...
详细信息
ISBN:
(纸本)9780769528892
Low-cost and low-power sensor nodes forming Wireless sensor Networks have become suitable for a wide range of applications during recent years. These networks demand the implementation of energy-aware techniques and low complexity protocols in all layers. Recently, a MIMO - based structure has been proposed to offer enhanced energy savings in WSNs, compared with simple SISO transmission. In this paper we consider the most common transmission structure for WSNs, using multiple hops. We examine and compare MIMO - based WSN with a multihop transmission in terms of energy efficiency. The results mainly depend on the channel conditions and the distance to the destination node. We reach analytical expressions to calculate threshold values of these parameters, which determine the areas where the MIMO - based structure outperforms multihop transmission.
The geographic routing is an ideal approach to realize point-to-point routing in wireless sensor networks because packets can be delivered by only maintaining a small set of neighbors' physical positions. The geog...
详细信息
ISBN:
(纸本)9783540730897
The geographic routing is an ideal approach to realize point-to-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.
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor tasking algorithm in which cameras se...
详细信息
ISBN:
(纸本)9783540730897
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor tasking algorithm in which cameras sense the environment independently of one another, thus reducing the communication overhead. Since constant monitoring is prohibitively expensive with complex sensors such as cameras, the amount of sensing done is also minimized. To be effective, a minimum detection probability must be guaranteed by the system over all possible paths through the space. The straightforward approach of enumerating all such paths is intractable, since there is generally an infinite number of potential paths. Using a geometric decomposition of the space, we lower-bound the detection probability over all paths using a small number of linear constraints. The camera tasking is computed for set of example layouts and shows large performance gains with our probabilistic scheme over both constant monitoring as well as over a deterministic heuristic.
We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports task-dependent node selection and aggregation through an announcement/biddin...
详细信息
ISBN:
(纸本)9783540730897
We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports task-dependent node selection and aggregation through an announcement/bidding/ selection strategy. It resolves node assignment conflicts by solving an equivalent constraint satisfaction problem. Our technique is scalable, as it lacks any central controller, and it is robust to node failures and imperfect communication. Another unique aspect of our work is that we advocate visually and behaviorally realistic virtual environments as a simulation tool in support of research on large-scale camera sensor networks. Specifically, our visual sensor network comprises uncalibrated static and active simulated video surveillance cameras deployed in a virtual train station populated by autonomously self-animating pedestrians. The readily reconfigurable virtual cameras generate synthetic video feeds that emulate those generated by real surveillance cameras monitoring public spaces. Our simulation approach, which runs on high-end commodity PCs, has proven to be beneficial because this type of research would be difficult to carry out in the real world in view of the impediments to deploying and experimenting with an appropriately complex camera network in extensive public spaces.
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 ba...
详细信息
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.
Reliability guaranteed data transmission with energy efficiency is one of the major challenges in wireless sensor networks (WSNs) in the presence of unreliable or lossy wireless link. In this paper, we propose a proto...
详细信息
ISBN:
(纸本)9781424413119
Reliability guaranteed data transmission with energy efficiency is one of the major challenges in wireless sensor networks (WSNs) in the presence of unreliable or lossy wireless link. In this paper, we propose a protocol called RTAM which could deliver packets at the desired reliability with low transmission cost by employing adaptive multi-coverage strategy. sensors are deployed either randomly or evenly distributed to K-cover the monitored region, such that any point or sub area information could be sensed and delivered by multiple sensors and the network guarantees the desired reliability. Furthermore, in order to control the overhead of the reliable transmission, we introduce two algorithms ORS and CRS in RTAM, which ensure sensors automatically join to detection and reporting according to the desired reliability and local knowledge. Thus, RTAM can jointly optimize both information reliability and energy efficiency in sensor networks.
Wireless sensor networks (WSNs) have an excellent prospect in the applications of monitoring, tracking, and distributed sensing. However, WSNs are highly vulnerable to various kinds of attacks, especially the physical...
详细信息
ISBN:
(纸本)9781424413119
Wireless sensor networks (WSNs) have an excellent prospect in the applications of monitoring, tracking, and distributed sensing. However, WSNs are highly vulnerable to various kinds of attacks, especially the physical attacks in hostile unattended environments. In this paper, the intrusion detection and localization for WSNs are considered, and a cooperative monitoring scheme to detect the displacements of sensor nodes by the cooperation of involved nodes in WSNs is presented. Our scheme is mainly based on the feasible received signal strength indicator (RSSI) values to collect the data of anomalous actions in WSNs. A fairly lightweight and cooperative decision-making process is adopted to decide anomalies. Our analysis and simulation results, including the false positive rates and the false negative rates, show that the proposed scheme based on RSSI values can effectively detect anomalies within a certain scope.
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.
In this paper, we study the two-tiered wireless sensor network (WSN) architecture and propose the optimal cluster association algorithm for it to maximize the overall network lifetime. A two-tiered WSN is formed by nu...
详细信息
ISBN:
(纸本)9783540730897
In this paper, we study the two-tiered wireless sensor network (WSN) architecture and propose the optimal cluster association algorithm for it to maximize the overall network lifetime. A two-tiered WSN is formed by number of small sensor nodes (SNs), powerful application nodes (ANs), and base-stations (BSs, or gateways). SNs capture, encode, and transmit relevant information to ANs, which then send the combined information to BSs. Assuming the locations of the SNs, ANs, and BSs are fixed, we consider how to associate the SNs to ANs such that the network lifetime is maximized while every node meets its bandwidth requirement. When the SNs are homogeneous (e.g., same bandwidth requirement), we give optimal algorithms to maximize the lifetime of the WSNs;when the SNs are heterogeneous, we give a 2-approximation algorithm that produces a network whose lifetime is within 1/2 of the optimum. We also present algorithms to dynamically update the cluster association when the network topology changes. Numerical results are given to demonstrate the efficiency and optimality of the proposed approaches. In simulation study, comparing network lifetime, our algorithm outperforms other heuristics almost twice.
暂无评论