Eco is an ultra-compact wireless sensor node. Only 648 mm3 in volume and weighing under 1.6 grams, Eco was initially designed to monitor the spontaneous motion of preterm infants over 2.4GHz radio links at the maximum...
详细信息
One of the most important issues on the sensor network with resource-limited sensor nodes is prolonging the network lifetime by effectively utilizing the limited node energy. The most representative mechanism to achie...
详细信息
ISBN:
(纸本)3540297693
One of the most important issues on the sensor network with resource-limited sensor nodes is prolonging the network lifetime by effectively utilizing the limited node energy. The most representative mechanism to achieve a long-lived sensor network is the clustering mechanism which can be further classified into the single-hop mode and the multi-hop mode. In the single-hop mode, all sensor nodes in a cluster communicate directly with the cluster head (CH) via single hop, so the contention-less MAC protocol is preferred. In the multi-hop mode, sensor nodes communicate with the CH with the help of other intermediate nodes and the contention-less MAC protocol is not required. One of the most critical factors that impact on the performance of the existing multi-hop clustering mechanism (in which the cluster size is fixed to some value, so we call this the fixed-size mechanism) is the cluster size and, without the assumption on the uniform node distribution, finding out the best cluster size is intractable. Since sensor nodes in a real sensor network are distributed non-uniformly, the fixed-size mechanism may not work best for real sensornetworks. Therefore, in this paper, we propose a new dynamic-size multi-hop clustering mechanism in which the cluster size is adjusted according to the information on the load and the residual energy of a CH and that of other nodes near to the CH. We show that our proposed scheme outperforms other clustering mechanisms by carrying out simulations.
Recent researches on energy efficient coverage configuration in wireless sensornetworks mainly address the goal of 100% or near 100% coverage preserving. However, we find that a small percentage of loss of coverage, ...
详细信息
This work studies the allocation of bandwidth resources in wireless ad hoc networks. The highest-density clustering algorithm is presented to promote reuse of the spatial channel and a new slot allocation algorithm is...
详细信息
The following topics were dealt with: sensornetworks; biomedical informatics; informationprocessing; classification methods; audio signal processing; image processing; signal processing; target tracking; biometrics
The following topics were dealt with: sensornetworks; biomedical informatics; informationprocessing; classification methods; audio signal processing; image processing; signal processing; target tracking; biometrics
In this paper, we propose a distributed power-efficient data gathering and aggregation algorithm (DPEG), in which a node, according to its residual energy and the strength of signal received from its neighboring nodes...
详细信息
In fault-tolerant multistage interconnection design, the method of providing disjoint paths can tolerate faults, but it is complicated and hard to choose a collision-free path in disjoint paths networks. A disjoint pa...
详细信息
The importance of multiuser detection for CDMA-based ad hoc network is addressed in this paper. Conventionally, the terminal in CDMA-based ad hoc network uses matched filter to receive packets, so the performance (e.g...
详细信息
We study the problem of quantization for distributed parameter estimation in large scale sensornetworks. Assuming a maximum likelihood estimator at the fusion center, we show that the Fisher information is maximized ...
详细信息
We study the problem of quantization for distributed parameter estimation in large scale sensornetworks. Assuming a maximum likelihood estimator at the fusion center, we show that the Fisher information is maximized by a score-function quantizer. This provides a tight bound on best possible MSE for any unbiased estimator. Furthermore, we show that for a general convex metric, the optimal quantizer belongs to the class of score function quantizers. We also discuss a few practical applications of our results in optimizing estimation performance in distributed and temporal estimation problems
We study attacks by adversaries which aim to compromise links in a wireless sensor network through various techniques which are modeled using the set-covering problem. We discuss the effects of the attacks and present...
详细信息
We study attacks by adversaries which aim to compromise links in a wireless sensor network through various techniques which are modeled using the set-covering problem. We discuss the effects of the attacks and present techniques which can be used to mitigate the effects of the attacks. Furthermore, we analyze the performance of various key predistribution schemes with and without the mitigation techniques
暂无评论