Since there is no fixed infrastructure or centralized management in Wireless sensor Network (WSN), a Connected Dominating Set (CDS) has been proposed as a virtual backbone. the CDS plays a major role in routing, broad...
详细信息
ISBN:
(纸本)9781424425747
Since there is no fixed infrastructure or centralized management in Wireless sensor Network (WSN), a Connected Dominating Set (CDS) has been proposed as a virtual backbone. the CDS plays a major role in routing, broadcasting, coverage and activity scheduling. To reduce the traffic during communication and prolong network lifetime, it is desirable to construct a Minimum CDS (MCDS). For the MCDS problem, this kind of the networks usually has been modeled in Unit Disk Graph (UDG), in which each node has the same transmission range. In this paper, a new distributed algorithm for MCDS problem in UDG with constant approximation ratio is introduced which has outstanding time complexity of 0(l) and message complexity of O(n). theoretical analysis and simulation results are also presented to verify efficiency's our approach.
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.
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.
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 boththeoretical analysis and comprehensive simulations, that our approach is valuable to improving system performance of practical sensor networks.
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 boththe 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.
High delivery ratio with low energy consumption and transmission delay is one of design challenges for wireless sensor network routing protocol. hi this paper, we proposed a grid-based distributed multi-hop routing pr...
详细信息
ISBN:
(纸本)9780769534923
High delivery ratio with low energy consumption and transmission delay is one of design challenges for wireless sensor network routing protocol. hi this paper, we proposed a grid-based distributed multi-hop routing protocol (GDRP) for wireless sensor network. At one time there is only one node is selected as grid head per grid and the remaining nodes perform grid head tasks by rotating dynamically For the sake of decreasing the energy consumed by grid heads, the inter-grid communication uses multi-hop routing pattern. In GDRP each grid head executes a distributed algorithm and chooses an optimal next h-hop routing path independently according to the routing cost, distance and residual energy of neighboring grid heads. the experiment results show GDRP balances energy consumption well, thus leads to a high data delivery ratio, low transmission delay and prolonged network lifetime.
Self-localization is a key function in Wireless sensor Networks (WSNs). Many applications and internal mechanisms require nodes to know their location. Based on two different application environments and from the view...
详细信息
ISBN:
(纸本)9780769532875
Self-localization is a key function in Wireless sensor Networks (WSNs). Many applications and internal mechanisms require nodes to know their location. Based on two different application environments and from the view of anchor nodes density, this paper proposes two new algorithms for distributed cooperative localization: Centroid-based with Preplaced Beacon Localization and Centroid-based with Scalable Node Localization. Both of them are simulated and analyzed in a two-dimensional (2-D) space simulation model of Matlab.
Wireless sensor networks (WSN) can report large volumes of slowly varying routine data, while important or significant events can be relatively rare. An important challenge is then to offer the significant or unusual ...
详细信息
ISBN:
(纸本)9781424425747
Wireless sensor networks (WSN) can report large volumes of slowly varying routine data, while important or significant events can be relatively rare. An important challenge is then to offer the significant or unusual data an adequate routing policy that will allow it to rapidly reach the sink nodes, despite the large volume of routine packets in the network. In this paper we introduce Randomized Re-Routing (RRR), to detect the unusual events in a distributed manner, and dynamically transfer routine data packets to secondary paths in the network, while offering a fast track path with better QoS for the packets carrying unusual data. In this paper we describe the RRR algorithm and evaluate it with extensive simulations.
the contribution of this paper aims to show how collective intelligence systems as multiagent systems can be specialized and used to build wireless sensor embedded decision software. the paper focuses on methodologica...
详细信息
ISBN:
(纸本)9781605580463
the contribution of this paper aims to show how collective intelligence systems as multiagent systems can be specialized and used to build wireless sensor embedded decision software. the paper focuses on methodological, architectural and design aspects of embedded multiagent systemsthrough the experimentation of the DIAMOND multiagent method on an application to distributed location services in Ultra Wide Band sensor networks. Copyright 2008 ACM.
暂无评论