Deployment of sensor networks in real-world settings is a labor-inten-sive and cumbersome task: environmental influences often trigger problems that are difficult to track down due to limited visibility of the network...
详细信息
ISBN:
(纸本)9783540730897
Deployment of sensor networks in real-world settings is a labor-inten-sive and cumbersome task: environmental influences often trigger problems that are difficult to track down due to limited visibility of the network state. In this paper we present a framework for passive inspection (i.e., no instrumentation of sensor nodes required) of deployed sensor networks and show how this framework can be used to inspect data gathering applications. The basic approach is to temporarily install a distributed network sniffer alongside the inspected sensor network, with overheard messages being analyzed by a data stream processor and network state being displayed in a graphical user interface. Our tool can be flexibly applied to different sensor network operating systems and protocol stacks, and can deal well with incomplete information.
sensor networks are often used to sense the physical world and provide observations for various uses. In hostile environments, it is critical to control the network access to ensure the integrity, availability, and at...
详细信息
ISBN:
(纸本)9783540730897
sensor networks are often used to sense the physical world and provide observations for various uses. In hostile environments, it is critical to control the network access to ensure the integrity, availability, and at times confidentiality of the sensor data. This paper develops efficient methods for distributed access control in sensor networks. The paper starts with a baseline approach, which provides a more flexible and efficient way to enforce access control when compared with previous solutions. This paper then extends the baseline approach to enable privilege delegation, which allows a user to delegate its privilege to other users without using a trusted server, and broadcast query, which allows a user to access the network at a large scale efficiently. The privilege delegation and broadcast query are very useful in practice;none of the current solutions can achieve these two properties.
In this paper, we explore two important issues for distributed target detection in wireless sensor network (WSN): (1) How to increase efficient-energy for each sensor;(2) How to improve the detection precision about w...
详细信息
ISBN:
(纸本)9781424413119
In this paper, we explore two important issues for distributed target detection in wireless sensor network (WSN): (1) How to increase efficient-energy for each sensor;(2) How to improve the detection precision about whether a target is occurring in the event region. We present a neighbor collaboration detection (NCD) scheme that introduces a clustered fusion into target detection process. Based on MAP decision criterion, we propose an optimal fusion decision. We mathematically show that the NCD Scheme vastly improves the target detection precision, when the number of neighbor sensor is large.
Efficient scheduling of time slots in a time division multiple access scheme (TDMA) is important for low power wireless sensor networks. Existing algorithms are either centralized with poor scalability, or distributed...
详细信息
ISBN:
(纸本)9781424413119
Efficient scheduling of time slots in a time division multiple access scheme (TDMA) is important for low power wireless sensor networks. Existing algorithms are either centralized with poor scalability, or distributed but with high complexity. In this paper, we explain how TDMA could be more energy efficient by careful slot scheduling in wireless sensor networks. Then we propose a deterministic distributed TDMA scheduling algorithm (DD-TDMA). In DD-TDMA, each sensor node schedules its own TDMA slot based on its neighborhood information, and packet collisions are gracefully avoided during scheduling. The experimental results show that compared to other centralized and distributed scheduling algorithms, DD-TDMA achieves better performance in terms of schedule length, running time and message complexity.
sensor networks have a wide range of potential, practical and useful applications. However, there are issues that need to be addressed for efficient operation of sensor network systems in real applications. To extend ...
详细信息
ISBN:
(纸本)9781424413119
sensor networks have a wide range of potential, practical and useful applications. However, there are issues that need to be addressed for efficient operation of sensor network systems in real applications. To extend the lifetime of a sensor network, clustering algorithm is a kind of key technique used to reduce energy consumption, which can increase network scalability and lifetime. In this paper, we proposed a distributed Energy Balance Clustering (DEBC) protocol for heterogeneous network. Cluster heads are selected by a probability depending on the ratio between remaining energy of node and the average energy of network. The high initial and remaining energy nodes have more chances to be the cluster heads than the low energy nodes. Simulation result shows that our protocol provides longer lifetime than the existing clustering protocol and uses the best of energy in heterogeneous network.
In this paper, we consider how to localize individual nodes in a wireless sensor network when some subset of the network nodes can be in motion at any given time. For situations in which it is not practical or cost-ef...
详细信息
The lifetime is a critical parameter for wireless sensor networks, which is defined as the maximum time of delivering certain data to the sink node before sensor node runs out of energy under an initial energy is give...
详细信息
ISBN:
(纸本)9781424413119
The lifetime is a critical parameter for wireless sensor networks, which is defined as the maximum time of delivering certain data to the sink node before sensor node runs out of energy under an initial energy is given. In this paper, we propose a distributed algorithm for data gathering in wireless sensor networks with the assistance of network coding, such that the network lifetime is maximized. We prove rigorously that the proposed algorithm converge to the optimal solution of regularized problem.
computing model of nodes has an important effect on the network performance and the mobile agent computing model for the next generation network has attracted more and more attentions. The background of mobile agent a...
详细信息
ISBN:
(纸本)9781424413119
computing model of nodes has an important effect on the network performance and the mobile agent computing model for the next generation network has attracted more and more attentions. The background of mobile agent applied In the wireless sensor network is first analyzed. Then a framework based on mobile agent is proposed from two levels, namely network and nodes. After introducing the basic elements, functional definitions and interfaces of the framework, an implementation mechanism based on directed diffusion for mobile agent is presented in detail.
This paper presents an adaptive distributed TDMA slot assignment algorithm, called A-DRAND, which is an improved version of DRAND in clustered wireless sensor networks where cluster heads need more slots and will be a...
详细信息
ISBN:
(纸本)9781424413119
This paper presents an adaptive distributed TDMA slot assignment algorithm, called A-DRAND, which is an improved version of DRAND in clustered wireless sensor networks where cluster heads need more slots and will be alternated afterwards by other cluster members for energy balance reason. It utilizes cluster info to allocate slots discriminately for different kind of sensor node and adapts its operation depending on the requirements of the application. The overhead is reduced significantly by reserving a special slot number range for slot reassignment. Simulation results show that running time and transmission cost of slot reassignment is only at most 1/m of that of all-participating assignment, where m is the proportion of cluster heads and other sensors with changing slots demanding in the network
Wireless sensor networks are often densely deployed for environmental monitoring applications. Collecting raw data from these networks can lead to excessive energy consumption. Thus using the spatial and temporal corr...
详细信息
ISBN:
(纸本)9783540730897
Wireless sensor networks are often densely deployed for environmental monitoring applications. Collecting raw data from these networks can lead to excessive energy consumption. Thus using the spatial and temporal correlations that exist between adjacent nodes we appoint a few as representative nodes that perform in-network aggregation. This reduces the total number of transmissions. Our distributed scheduling algorithm autonomously assigns a particular node to perform aggregation and reassigns schedules when network topology changes. These topology changes are detected using cross-layer information from the underlying MAC layer. We also present theoretical performance estimates and upper bounds of our algorithm and evaluate it by implementing the algorithm on actual sensor nodes, demonstrating an energy-saving of up to 80% compared to raw data collection.
暂无评论