Search results for: Yongan Wu
chapter
The fundamental issue in sensor networks is providing a certain degree of coverage and maintaining connectivity under the energy constraint. In this paper, the connected k-coverage problem is investigated under the probabilistic sensing and communication models, which are more realistic than deterministic models. Furthermore, different weights for nodes are added in order to estimate the real power...
chapter
Lecture Notes in Computer Science > Wireless Algorithms, Systems, and Applications > Session 8A: Algorithms and Protocols > 632-642
The growing popularity of wireless sensor network applications has stimulated strong interest in extending quality of service support to existing routing protocols. Conventional wireless sensor network routing protocols usually concentrate on the constrained condition of ‘shortest path’ with minimum used energy. However, the path with minimum used energy can’t provide the minimum end to end delay...
chapter
LEBKM for Wireless Sensor Networks (WSN) is proposed in this paper, which employs the localized strategy. The key for each node is integrated from two keys separately provided by other two key managements. Once the nodes have been deployed, the localized strategy is adapted to update the pre-distributed keys in nodes within the same cluster. The resilience of the network is significantly enhanced...
chapter
2010 2nd International Conference on Computer Engineering and Technology > 5 > V5-460 - V5-464
Wireless sensor networks (WSNs) are commonly used in many applications now. According to the capability of sensor nodes, there are two types of WSN: homogeneous sensor networks and heterogeneous sensor network (HSN). Large-scale homogeneous sensor networks require high computation overhead, communication overhead and large memory storage. To achieve better performance and scalability, large-scale...
chapter
The fundamental issue in sensor networks is the quality of monitoring provided by the networks under the energy constraint. The quality is usually measured by coverage. In this paper, unlike previous research, the k-coverage problem is investigated in the directional sensor networks with turnable orientation. Furthermore, probabilistic sensing model is adopted for more realistic than deterministic...
