The connected dominating set (CDS) has been widely used for efficient routing in wireless sensornetworks. Although finding the minimum connected dominating set (MCDS) in an arbitrary graph is a NP-hard problem, many ...
详细信息
ISBN:
(纸本)9781424413119
The connected dominating set (CDS) has been widely used for efficient routing in wireless sensornetworks. Although finding the minimum connected dominating set (MCDS) in an arbitrary graph is a NP-hard problem, many algorithms have been proposed to construct an approximation of the MCDS for efficient routing in wireless sensornetworks. To address the weaknesses of these existing algorithms, we propose a new distributed MCDS approximation algorithm, CDS-HG, to construct the CDS for wireless sensornetworks. This algorithm models a wireless sensor network as a hierarchical graph and uses a competition-based strategy to select nodes at a certain hierarchical level to route messages for nodes in the next level of the hierarchical graph. Formal analysis and simulation studies show that our CDS-HG algorithm generates smaller CDS sizes while requiring less communication overhead compared with the existing distributed MCDS approximation algorithms.
We propose a novel routing framework called PWave that supports multi-source multi-sink anycast routing for wireless sensornetworks. A distributed and scalable potential field estimation algorithm and a probabilistic...
详细信息
ISBN:
(纸本)97830540726050
We propose a novel routing framework called PWave that supports multi-source multi-sink anycast routing for wireless sensornetworks. A distributed and scalable potential field estimation algorithm and a probabilistic forwarding scheme are proposed to ensure low overhead and high resilience to network dynamics. Key properties of this framework are proved through theoretical analysis and verified through simulations. Using network lifetime maximization problem as one example, we illustrated the power of this framework by showing a 2.7 to 8 times lifetime extension over Directed Diffusion and up to 5 times lifetime extension over the energy-aware multipath routing.
The paper describes new method for routing classification of the packets in the networks with static routing. Static routing is mostly used in the stable and well-controlled networks, which are sensitive to the additi...
详细信息
ISBN:
(纸本)9780819469335
The paper describes new method for routing classification of the packets in the networks with static routing. Static routing is mostly used in the stable and well-controlled networks, which are sensitive to the additional complexity introduced by the dynamic routing schemes. For example, it is a straightforward choice for the embedded networks on terminal. The available solutions for the static routing require full-size or longest prefix-based aggregated routing table, which is inefficient taking into account static nature of the performed routing decisions. The standard approach is based on the full implementation of the route lookup procedure, which for every packet performs search for the longest prefix match in the routing table. As a result, it increases implementation complexity of the network end points and switches, requires high speed memory for storing routing tables, and leads to an additional processing delay and energy consumption for each transmitted packet. This work is based on the observation that clever planning of the networks with static routing allows applying new principles of route lookup. As a consequence it allows significantly reduce complexity of the packet classification and forwarding procedures and minimize amount of consumed resources. Complexity reduction of the packets classification and forwarding procedures allows simplifying implementation of the networking part of the protocol stack, which results in reduction of the device components cost, decrease of the power and memory consumption, as well as the packet processing delay. The paper contains a description of the proposed route classification method and discusses its applicability for broad range of networks with static routing.
The proceedings contain 220 papers. The topics discussed include: designing strategies on frame structure in the rate adaptive communication;alternative packet forwarding for otherwise discarded packets;generalized pa...
ISBN:
(纸本)0769530486
The proceedings contain 220 papers. The topics discussed include: designing strategies on frame structure in the rate adaptive communication;alternative packet forwarding for otherwise discarded packets;generalized partially bent functions;an architecture of policy-based application-aware network QoS management for large-scale heterogeneous networks;codes with low peak-to-average power ratio for multi-code CDMA;threshold signatures in dynamic groups;lightweight session key management scheme in sensornetworks;home device authentication method based on PKI;typical behavior patterns extraction and anomaly detection algorithm based on accumulated home sensor data;search system for behavior time segments from accumulated sensor data in room environment;active RFID-based object management system in sensor-embedded environment;and novel wireless mesh networking architectures for future smart homes.
Many techniques have been developed recently for establishing pairwise keys in sensornetworks. However, they are either vulnerable to a few number of compromised sensor nodes or involve expensive protocols for establ...
详细信息
ISBN:
(纸本)97830540726050
Many techniques have been developed recently for establishing pairwise keys in sensornetworks. However, they are either vulnerable to a few number of compromised sensor nodes or involve expensive protocols for establishing keys. This paper introduces a much better alternative for achieving high resilience to node compromises and high efficiency in key establishment. The main idea is to deploy additional sensor nodes, called assisting nodes, to help the key establishment between sensor nodes. The proposed approach has many advantages over existing approaches. In this approach, a sensor node only needs to make a few local contacts and perform a few hash operations to setup a key with any other sensor node in the network at a very high probability. The majority of sensor nodes only need to store a single key in their memory space. Besides these benefits, it still provides high resilience to node compromises. The implementation of this approach on TelosB motes also demonstrates its feasibility for pairwise key establishment in sensornetworks.
The proceedings contain 220 papers. The topics discussed include: designing strategies on frame structure in the rate adaptive communication;alternative packet forwarding for otherwise discarded packets;generalized pa...
ISBN:
(纸本)0769530486
The proceedings contain 220 papers. The topics discussed include: designing strategies on frame structure in the rate adaptive communication;alternative packet forwarding for otherwise discarded packets;generalized partially bent functions;an architecture of policy-based application-aware network QoS management for large-scale heterogeneous networks;codes with low peak-to-average power ratio for multi-code CDMA;threshold signatures in dynamic groups;lightweight session key management scheme in sensornetworks;home device authentication method based on PKI;typical behavior patterns extraction and anomaly detection algorithm based on accumulated home sensor data;search system for behavior time segments from accumulated sensor data in room environment;active RFID-based object management system in sensor-embedded environment;and novel wireless mesh networking architectures for future smart homes.
This paper presents a novel MAC protocol for Wireless sensornetworks (WSN)s designated Tone-Propagated MAC (TP-MAC). This protocol is specially suited for early warning and tracking applications, where sensor nodes g...
详细信息
ISBN:
(纸本)9783540709688
This paper presents a novel MAC protocol for Wireless sensornetworks (WSN)s designated Tone-Propagated MAC (TP-MAC). This protocol is specially suited for early warning and tracking applications, where sensor nodes generate sporadic asynchronous traffic (mainly consisting of uplink alert messages and downlink control messages) with stringent latency requirements. This protocol aims to maximize energy-efficiency while minimizing latency in source-to-sink and sink-to-source communication. This difficult objective is achieved integrating scheduled channel polling (i.e. synchronized low power listening) with rapid fast path establishment based on the propagation of short wake-up tones. An analytical model was used to compare TP-MAC with SCP-MAC. The results show that TP-MAC is able to achieve better target latencies even when its duty-cycle is lower during periods of inactivity. The results also show that the advantage of using TP-MAC increases with the hop-distance between source and sink.
Target classification is important in wireless sensor network (WSN). This paper proposes a collaborative peer-to-peer (P2P) training and classifying method with support vector machine (SVM) for WSN. The proposed metho...
详细信息
ISBN:
(纸本)9780769530482
Target classification is important in wireless sensor network (WSN). This paper proposes a collaborative peer-to-peer (P2P) training and classifying method with support vector machine (SVM) for WSN. The proposed method incrementally carries out the training process with the collaboration of sensor nodes in P2P paradigm. For decreasing energy consumption and improving accuracy, the collaboration of sensor nodes is implemented by autonomously selecting the proper set of sensor nodes to carry out the training process according to several feasible measures of energy consumption and information utility. Because of the purposeful sensor nodes selection, dynamic collaborative SVM can conquer the inevitable missing rate and false rate of samples in WSN. Results demonstrate that the proposed dynamic collaborative SVM can effectively implement target classification in WSN. It is also verified that the proposed dynamic collaborative SVM has outstanding performance in energy efficiency and time delay.
To balance energy consumption among cluster-heads in multi-hop wireless sensornetworks, we propose an energy-efficient distance based probabilistic clustering scheme. Our scheme considers a distance from the sink(bas...
详细信息
ISBN:
(纸本)9783540754756
To balance energy consumption among cluster-heads in multi-hop wireless sensornetworks, we propose an energy-efficient distance based probabilistic clustering scheme. Our scheme considers a distance from the sink(base station) to each node as well as the residual energy of each node as the criterion of cluster-head election. Through simulation experiments, we show that our scheme is more effective than LEACH and EEUC in prolonging the lifespan of multi-hop wireless sensornetworks.
Target numeration is of great importance for activity monitoring applications in wireless sensornetworks (WSNs);however it is also a challenging problem in a WSN only equipped with simple amplitude sensors. Only a fe...
详细信息
ISBN:
(纸本)0769530486
Target numeration is of great importance for activity monitoring applications in wireless sensornetworks (WSNs);however it is also a challenging problem in a WSN only equipped with simple amplitude sensors. Only a few algorithms have been proposed to solve the problem of target counting, and their accuracy and computational complexity is not satisfactory. This paper provides a two-step energy-based target numeration (EBTN) algorithm that firstly groups the sensor nodes that detect a target into separate clusters, and then calculates the number of targets covered by each cluster based on the total signal energy collected over the cluster A polynomial regression function is used to approximate the signal strength over a cluster and the total energy is estimated by taking the integral of the function over the area. By combining with preliminary clustering step, energy-based target counting greatly improves the counting accuracy. Experiments also show that EBTN requires lower node density and computational complexity compared with other algorithms.
暂无评论