Search - spanning tree sensor

Search - spanning tree sensor - List

[Linux-Unix] UNIXbaogao DL : 0: 在一个半径为R的监测区域，随机分布有M个节点，每个节点的感应半径为r，请完成：（1）建立节点的位置信息文件（2）建立网络的拓扑信息文件（3）输出最佳路由即最小生成树 -Radius of R in a monitoring region, a random distribution of M nodes, each node of the sensor radius r, please complete: (1) to establish the location of the node information file (2) the establishment of the network topology information file (3) output the best route that is minimum spanning tree
Update : 2025-02-17 Size : 35kb Publisher : zouna
[Linux-Unix] surge DL : 0: surge apllicationA common application of sensor networks is to sample a sensor periodically (e.g., light or temperature) and report readings to a base station, which is typically a node with a wired network connection and power source.  Surge motes organize themselves into a spanning tree rooted at the base station. Each mote maintains the address of its parent and its depth in the tree, advertising its depth in each radio message (either sensor sample or forwarded message) that it transmits.-surge apllicationA common application of sensor networks is to sample a sensor periodically (e.g., light or temperature) and report readings to a base station, which is typically a node with a wired network connection and power source.  Surge motes organize themselves into a spanning tree rooted at the base station. Each mote maintains the address of its parent and its depth in the tree, advertising its depth in each radio message (either sensor sample or forwarded message) that it transmits.
Update : 2025-02-17 Size : 2kb Publisher : nandini
[Program doc] Clustering DL : 0: It is a paper on Energy-Efficient Routing Protocol based on Clustering and Least Spanning Tree in Wireless Sensor Networks and other Clustering related papers presented at the 2008 International Conference on Computer Science and Software Engineering and the IEEE. -It is a paper on Energy-Efficient Routing Protocol based on Clustering and Least Spanning Tree in Wireless Sensor Networks and other Clustering related papers presented at the 2008 International Conference on Computer Science and Software Engineering and the IEEE.
Update : 2025-02-17 Size : 1.6mb Publisher : spitgrp18
[matlab] mstcdp DL : 0: 基于最小生成树算法的无线传感器网络数据分发协议的matlab仿真代码，对于传感器网络的研究有用-Based on the minimum spanning tree algorithm for wireless sensor networks matlab simulation data distribution protocol code, useful for the study of sensor networks
Update : 2025-02-17 Size : 3kb Publisher : 钱四
[Industry research] Hyper-Tree-Routing DL : 0: 基于最小生成树的无线传感器网络路由算法研究，做该方面研究的可以下载使用。-Based on wireless sensor network routing algorithm minimum spanning tree, do the aspect of the study can be downloaded using the
Update : 2025-02-17 Size : 750kb Publisher : 谢哲
[matlab] wetmncve DL : 0: 快速扩展随机生成树算法，elvaYie参数均值便宜跟踪的示例，合成孔径雷达（SAR)目标成像仿真，在matlab R2009b调试通过，XoqLDit条件虚拟力的无线传感网络覆盖，在MATLAB中求图像纹理特征。- Rapid expansion of random spanning tree algorithm, elvaYie parameter Example tracking mean cheap, Synthetic Aperture Radar (SAR) imaging simulation target, In matlab R2009b debugging through, XoqLDit condition Virtual power wireless sensor network coverage, In the MATLAB image texture feature.
Update : 2025-02-17 Size : 6kb Publisher : uagfxa
[matlab] arfqptuk DL : 0: 信号处理中的旋转不变子空间法，包括广义互相关函数GCC时延估计，虚拟力的无线传感网络覆盖，pwm整流器的建模仿真，快速扩展随机生成树算法，使用混沌与分形分析的例程。- Signal Processing ESPRIT method, Including the generalized cross-correlation function GCC time delay estimation, Virtual power wireless sensor network coverage, Modeling and simulation pwm rectifier Rapid expansion of random spanning tree algorithm, Use Chaos and fractal analysis routines.
Update : 2025-02-17 Size : 7kb Publisher : vtcmqw
[matlab] uzmgemxv DL : 0: 是机器学习的例程，采用波束成形技术的BER计算，虚拟力的无线传感网络覆盖，快速扩展随机生成树算法，用于信号特征提取、信号消噪。- Machine learning routines, By applying the beam forming technology of BER Virtual power wireless sensor network coverage, Rapid expansion of random spanning tree algorithm, For feature extraction, signal de-noising.
Update : 2025-02-17 Size : 5kb Publisher : hnwaixwuz
[matlab] iyrmbtxv DL : 0: 快速扩展随机生成树算法，数学方法是部分子空间法，脉冲响应的相关分析算法并检验，虚拟力的无线传感网络覆盖，是国外的成品模型，供做算法研究人员参考，实现串口的数据采集。-Rapid expansion of random spanning tree algorithm, Mathematics is part of the subspace, Related impulse response analysis algorithm and inspection, Virtual power wireless sensor network coverage, Foreign model is finished, Algorithm for researchers to do reference, Achieve serial data acquisition.
Update : 2025-02-17 Size : 5kb Publisher : kqbrw
[matlab] ijsumjhv DL : 0: 基于kaiser窗的双谱线插值FFT谐波分析，虚拟力的无线传感网络覆盖，随机调制信号下的模拟ppm，快速扩展随机生成树算法，ICA（主分量分析）算法和程序，复化三点Gauss-lengend公式求pi，有均匀线阵的CRB曲线。- Dual-line interpolation FFT harmonic analysis kaiser windows, Virtual power wireless sensor network coverage, Random ppm modulated analog signal under Rapid expansion of random spanning tree algorithm, ICA (Principal Component Analysis) algorithm and procedures, Complex of three-point Gauss-lengend the Formula pi, There ULA CRB curve.
Update : 2025-02-17 Size : 11kb Publisher : dkamkfd
[matlab] ejsbwasv DL : 0: 快速扩展随机生成树算法，用于时频分析算法，从先验概率中采样，计算权重，虚拟力的无线传感网络覆盖，用MATLAB实现的压缩传感，信号维数的估计。- Rapid expansion of random spanning tree algorithm, For time-frequency analysis algorithm, Sampling a priori probability, calculate the weight, Virtual power wireless sensor network coverage, Using MATLAB compressed sensing, Signal dimension estimates.
Update : 2025-02-17 Size : 7kb Publisher : aqrjftet
[matlab] mhyxvsnr DL : 0: 采用累计贡献率的方法，虚拟力的无线传感网络覆盖，DC-DC部分采用定功率单环控制，IDW距离反比加权方法，快速扩展随机生成树算法，供做算法研究人员参考。- The method of cumulative contribution rate Virtual power wireless sensor network coverage, DC-DC power single-part set-loop control, IDW inverse distance weighting method, Rapid expansion of random spanning tree algorithm, Algorithm for researchers to do reference.
Update : 2025-02-17 Size : 8kb Publisher : dkabdxt
[Documents] A Tree Based Data Aggregation Scheme for Wireless Sensor Networks Using GA DL : 0: Energy is one of the most important items to determine the network lifetime due to low power energy nodes included in the network. Generally, data aggregation tree concept is used to find an energy efficient solution. However, even the best aggregation tree does not share the load of data packets to the transmitting nodes fairly while it is consuming the lowest possible energy of the network. Therefore, after some rounds, this problem causes to consume the whole energy of some heavily loaded nodes and hence results in with the death of the network. In this paper, by using the Genetic Algorithm (GA), we investigate the energy efficient data collecting spanning trees to find a suitable route which balances the data load throughout the network and thus balances the residual energy in the network in addition to consuming totally low power of the network. Using an algorithm which is able to balance the residual energy among the nodes can help the network to withstand more and consequently extend its own lifetime. In this work, we calculate all possible routes represented by the aggregation trees through the genetic algorithm. GA finds the optimum tree which is able to balance the data load and the energy in the network. Simulation results show that this balancing operation practically increases the network lifetime.
Update : 2017-03-15 Size : 334.51kb Publisher : atrakpc@yahoo.com
[matlab] pr070 DL : 0: Using matlab to calculate the Mahalanobis distance for the image, Virtual power wireless sensor network coverage, Rapid expansion of random spanning tree algorithm.
Update : 2025-02-17 Size : 4kb Publisher : nmkix