The proceedings contain 33 papers. The topics discussed include: stabilizing consensus in mobile networks;when birds die: making population protocols fault-tolerant;distributed model-free stochastic optimization in wi...
详细信息
ISBN:
(纸本)3540352279
The proceedings contain 33 papers. The topics discussed include: stabilizing consensus in mobile networks;when birds die: making population protocols fault-tolerant;distributed model-free stochastic optimization in wireless sensor networks;the virtual pheromone communication primitive;efficient and robust data dissemination using limited extra network knowledge;distance-sensitive information brokerage in sensor networks;distributed user access control in sensor networks;COTA: a robust multi-hop localization scheme in wireless sensor networks;contour approximation in sensor networks;a distortion-aware scheduling approach for wireless sensor networks;network power scheduling for tinyOS applications;a distributed linear least squares method for precise localization with low complexity in wireless sensor networks;and consistency-based-on-line localization in sensor networks.
In this paper we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in wireless ad hoc and sensor networks, whe...
详细信息
ISBN:
(纸本)9781424431748
In this paper we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with different radii. We derive the size relationship of any maximal independent set and the minimum connected dominating set in geometric k-disk graphs, and apply it to analyze the performances of two distributed connected dominating set algorithms we propose in this paper These algorithms have a bounded performance ratio and low communication overhead, and therefore have the potential to be applied in real ad hoc and sensor networks.
Low power radios, such as the CC2420, have been widely popular with recent sensor platforms. This paper explores the potential for energy savings from adding a high-power high-bandwidth, radio to current sensor platfo...
详细信息
ISBN:
(纸本)9781424431748
Low power radios, such as the CC2420, have been widely popular with recent sensor platforms. This paper explores the potential for energy savings from adding a high-power high-bandwidth, radio to current sensor platforms. High-bandwidth radios consume more power but significantly reduce the time for transmissions. Consequently, they offer net savings in total communication energy when there is enough data to offset wake-up energy overhead. The analysis on energy characteristics of several ieee 802.11 radios show that a feasible crossover point exists (in terms of data size) after which energy savings are possible. Based on this analysis, we present a bulk data transmission protocol for dual radio systems. The results of simulations and prototype implementation show significant energy savings at the expense of introducing acceptable delay.
While symmetric-key schemes are efficient in processing time for sensor networks, they generally require complicated key management, which may introduce large memory and communication overhead. On the contrary, public...
详细信息
ISBN:
(纸本)9781424431748
While symmetric-key schemes are efficient in processing time for sensor networks, they generally require complicated key management, which may introduce large memory and communication overhead. On the contrary, public-key based schemes have simple and clean key management, but cost more computational time. The recent progress of elliptic curve cryptography (ECC) implementation on sensors motivates us to design a public-key scheme and compare its performance with the symmetric-key counterparts. This paper builds the user access control on commercial off-the-shelf sensor devices as a case study to show that the public-key scheme can be more advantageous in terms of the memory, usage, message complexity, and security resilience. Meanwhile, our work also provides insights in integrating and designing public-key based security protocols for sensor networks.
In sensor network applications, sensors often need to retrieve data from each (other. Information brokerage is a scheme that stores data (or index files of data) at rendezvous nodes, so that every sensor can efficient...
详细信息
ISBN:
(纸本)9781424431748
In sensor network applications, sensors often need to retrieve data from each (other. Information brokerage is a scheme that stores data (or index files of data) at rendezvous nodes, so that every sensor can efficiently finds the data it needs. A very useful property for information brokerage is locality sensitivity, which means that a sensor close the original source of the data should also be able to retrieve the data with c small communication cost. Given the locality sensitivity requirement, the key is to design an information brokerage scheme that minimizes the storage cost. In this paper, we present a locality sensitive information brokerage scheme. It is designed for general locality-sensitive requirements, which include the linear data-retrieval cost (a frequently studied scenario) as a special case. We also prove that for a large class of networks, in the scenario of linear data-retrieval cost, our scheme achieves the asymptotically optimal storage cost. The result also proves the optimality of a few other schemes in the literature.
Wireless sensor Networks (WSNs) are employed in many applications in order to collect data. One key challenge is to minimize energy consumption to prolong network lifetime. A scheme of making some nodes asleep and est...
详细信息
ISBN:
(纸本)9781424431748
Wireless sensor Networks (WSNs) are employed in many applications in order to collect data. One key challenge is to minimize energy consumption to prolong network lifetime. A scheme of making some nodes asleep and estimating their values according to the other active nodes' readings has been proved energy-efficient. For the purpose of improving the precision of estimation, we propose two powerful estimation models, Data Estimation using Physical Model (DEPM) and Data Estimation using Statistical Model (DESM). DEPM estimates the values of sleeping nodes by the physical characteristics of sensed attributes, while DESM estimates the values through the spatial and temporal correlations of the nodes. Experimental results on real sensor networks show that the proposed techniques provide accurate estimations and conserve energy efficiently.
For queries in wireless sensor networks, empty sets may be returned as query results which could confuse users a lot and users obtain no useful information about the monitored objects from the empty sets. To solve the...
详细信息
ISBN:
(纸本)9781424431748
For queries in wireless sensor networks, empty sets may be returned as query results which could confuse users a lot and users obtain no useful information about the monitored objects from the empty sets. To solve the problem, this paper proposes methods to provide users with approximate answer sets in the case where no sensing data satisfies the query conditions. The opproximate answer sets can be used not only to answer the query approximately but also to guide users to modify their queries for further probing the monitored objects. The distance between sensing data and a query and the dominating relationship between sensing data are first defined. Then, three algorithms for processing probing queries am proposed, which compute the best approximate answer sets that consist of the sensing data with the smallest distance from given queries. All the algorithms utilize the dominating relationship to reduce the amount of data transmitted in sensor networks by filtering out the unnecessary data. Experimental results on real and synthetic data sets show that the proposed algorithms have high performance and energy efficiency.
In a realistic sensor network, in particular with a non-uniform deployment, sensor nodes inevitably have varying workloads. This causes a natural problem that some sensor nodes are subject to excessive power consumpti...
详细信息
ISBN:
(纸本)9781424431748
In a realistic sensor network, in particular with a non-uniform deployment, sensor nodes inevitably have varying workloads. This causes a natural problem that some sensor nodes are subject to excessive power consumption and thus become hot. These hot nodes deplete much earlier resulting in system performance degradation. This paper proposes a systematic approach to design a hotness-aware sensor network where each node is able to obtain its own hotness information. Based on these vital information, the system is able to provide various technologies to protect the critical set of hot nodes. More specifically, we design a centralized optimal algorithm to derive the precise hotness of each node. In addition, we develop a completely distributed algorithm to estimate hotness with high accuracy An effective hotness-aware MAC is developed to offer medium access priority to the nodes with higher hotness to protect and prolong their lifetimes. It is demonstrated, through both theoretical analysis and comprehensive simulations, that our approach is valuable to improving system performance of practical sensor networks.
Mobile sensors can move and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes mostly over-simplify the conditions for network connectivity: they either assume that the...
详细信息
ISBN:
(纸本)9781424431748
Mobile sensors can move and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes mostly over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neigh borhoods to obtain each other's location by local communications, or assume a dense network that remains connected. At the same time, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not restricted by these assumptions, and thus adapt to a much wider range of application scenarios. While maximizing sensing coverage, our schemes can achieve connectivity for a network with arbitrary sensor communication/sensing ranges or node densities, at the cost of a small moving distance;the schemes do not need any knowledge of the field layout, which can be irregular and have obstacles/holes of arbitrary shape. Simulations results show that the proposed schemes achieve the targeted properties.
A central problem in sensor network security is that sensor, are susceptible to physical capture attacks. Once a sensor is compromised, the adversary can easily launch clone attacks by replicating the compromised node...
详细信息
ISBN:
(纸本)9781424431748
A central problem in sensor network security is that sensor, are susceptible to physical capture attacks. Once a sensor is compromised, the adversary can easily launch clone attacks by replicating the compromised node, distributing the clones throughout the network, and starting a variety of insider attacks. Previous works against clone attacks suffer from either a high communication/storage overhead or a poor detection accuracy. In this paper, we propose a novel scheme for detecting clone attacks in sensor networks, which computes for each sensor a social fingerprint by extracting the neighborhood characteristics, and verifies the legitimacy of the originator for each message by checking the enclosed fingerprint. The fingerprint generation is based on the superimposed 8-disjunct code, which incurs, a very light communication and computation overhead. The fingerprint verification is conducted at both the base station and the neighboring sensors, which ensures a high detection probability. The security and performance analysis indicate that our algorithm can identify clone attacks with high detection probability at the cost of a low computation/communication/storage overhead. To our best knowledge, our scheme is the first to provide realtime detection of clone attacks in an effective and efficient way.
暂无评论