Wireless sensor network (WSN) has been considered to be the next generation paradigm of structural health monitoring (SHM) systems due to its low cost, high scalability and flexibility. However, some inherent limitati...
详细信息
Mesh router (MR) placement is one of the fundamental issues that need to be addressed carefully to achieve a desired performance of a wireless mesh network (WMN). The objective of the MR placement schemes is to system...
详细信息
ISBN:
(纸本)9781424451142
Mesh router (MR) placement is one of the fundamental issues that need to be addressed carefully to achieve a desired performance of a wireless mesh network (WMN). The objective of the MR placement schemes is to systematically determine the minimal number of MRs and their positions while satisfying various constraints, such as coverage, connectivity, traffic demand, etc. This paper explores the solution for placing the MRs with multiple transmission rates, which influence both transmission range and wireless link capacity. In the paper, we first formulate the problem with a mixed integer programming model. We then present a heuristic placement algorithm called ILSearch which takes into account both multiple transmission rates and co-channel interference. The ILSearch consists of two components: (1) Coverage MR determination which greedily exploits the capability of each selected MR to cover mesh clients (MCs);and (2) Relay MR determination that incrementally chooses the additional MRs for traffic relaying through the local search. Our simulation has not only shown that ILSearch can effectively obtain the MR placement that meets all the constraints, but also demonstrated that a MR placement which considers the variable transmission rates outperforms those don't.
This paper discusses a grid-type sensor network with reconfigurable PSoCs as sensor nodes, and details the middleware routines that support the high-level model for distributed programming. The advantages of using rec...
详细信息
This paper discusses a grid-type sensor network with reconfigurable PSoCs as sensor nodes, and details the middleware routines that support the high-level model for distributed programming. The advantages of using reconfigurable PSoCs over other architectures, like MICA2 motes, are also discussed. The paper refers to a case study to illustrate the capabilities of the proposed network concept.
In this paper we propose an adaptive random walk for wireless networks. The lifetime of the walk is varied in such a way that at least a given fraction of nodes is covered, in expectation. The only parameter of the ra...
详细信息
In this paper we propose an adaptive random walk for wireless networks. The lifetime of the walk is varied in such a way that at least a given fraction of nodes is covered, in expectation. The only parameter of the random walk, alpha, depends on the nominal network size N and on the required coverage. For sizes lower than N the required coverage is satisfied with lifetime slightly higher than the optimal one. The paper reports performance results obtained through analytical study backed up with simulations.
We extend the probabilistic key-based approach for wireless sensor networks concerning the slow rekeying and path key reestablishment processes. By introducing a novel, energy efficient, distributed, and faster scheme...
详细信息
We extend the probabilistic key-based approach for wireless sensor networks concerning the slow rekeying and path key reestablishment processes. By introducing a novel, energy efficient, distributed, and faster scheme, we attempt to replace the existing ordinary rekeying method of probabilistic key management scheme through a deterministic algorithm that works on both the base station and on each communicating pair of sensor nodes. The node predetermines the backup link key for a future key revocation and switches to the backup key when needed without further interrupting the base station or the key server. This scheme assures high level of security in rekeying operation, and at the same time reduces the rekeying cost very significantly.
Embedded sensor networks are distributedsystems for sensing and in situ processing of spatially and temporally dense data from resource-limited and harsh environments such as seismic zones, ecological contamination s...
详细信息
Coverage is an essential task in sensor deployment for the design of wireless sensor networks. While most existing studies on coverage consider homogeneous sensors, the deployment of heterogeneous sensors represents m...
详细信息
ISBN:
(纸本)9781424444816
Coverage is an essential task in sensor deployment for the design of wireless sensor networks. While most existing studies on coverage consider homogeneous sensors, the deployment of heterogeneous sensors represents more accurately the network design for real-world applications. In this paper, we focus on the problem of connected k-coverage in heterogeneous wireless sensor networks. Precisely, we distinguish two deployment strategies, where heterogeneous sensors are either randomly or pseudo-randomly distributed in afield. While the first deployment approach considers a single layer of heterogeneous sensors, the second one proposes a multi-tier architecture of heterogeneous sensors to better address the problems introduced by pure randomness and heterogeneity.
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile environments. However, these methods can on...
详细信息
ISBN:
(纸本)9781424444816
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile environments. However, these methods can only protect neighbor relations between benign nodes. A compromised node can easily circumvent them and setup false neighbor relations with sensor nodes in many places, impacting the network at a large scale. This paper presents a theoretic model for neighbor discovery in sensor networks and describes a fundamental security limitation and a generic attack against this model. The paper then proposes an efficient and localized solution based on a security property achievable during sensor deployment. This technique provides a threshold security guarantee in dealing with compromised sensor nodes. The analytical and simulation studies show that the technique is practical and effective for sensor networks.
The members of a self-organizing distributed system have ability to automatically organize themselves into a specific structure. The functionality of the system is achieved by collaboration of the members in this stru...
详细信息
The members of a self-organizing distributed system have ability to automatically organize themselves into a specific structure. The functionality of the system is achieved by collaboration of the members in this structure. Through automatic (re)organization, such a system is able to recover from various temporary faults which may disturb the established structure. In this paper, we propose a technique to identify all recoverable faults as well as to analyze fault tolerance and recovery from temporary faults by reorganization in self-organizing systems.
Building a ldquostraightforwardrdquo path in wireless ad hoc sensor networks (WASNs) not only avoids wasting energy in detours, but also incurs less interference in other transmissions when fewer nodes are involved in...
详细信息
Building a ldquostraightforwardrdquo path in wireless ad hoc sensor networks (WASNs) not only avoids wasting energy in detours, but also incurs less interference in other transmissions when fewer nodes are involved in the transmission. This plays an important role in recent WASN applications that require a streaming service to deliver large amount of data. In this paper, we extend our early work on the straightforward path routing in WASNs in the presence of the ldquolocal minimardquo, where the routing is blocked due to the lack of available forwarding successors. We bring some new insights of the safety information model for a forwarding routing that is limited in the request zone. A new routing is proposed to make a more intelligent decision in greedy advance and achieve more straightforward paths. The experimental results show substantial improvements of our approach compared with the best result known to date.
暂无评论