搜索资源列表
10060324
- 二叉树主要完成以下功能: 1. 建立二叉树 2. 计算结点所在的层次 3.统计结点数量(size)和叶结点数量 4.计算二叉树的高度 5.计算结点的度 6.找结点的双亲(Parent)和子女 7.二叉树的遍历 8.二叉树的输出-Main binary tree complete the following features: 1. The establishment of a binary tree. Calculate the junction point w
zuoye
- 二叉树遍历，包括前中后序递归遍历和计算椰子树和节点数-Binary tree traversal, including former in after sequence recursively traverse and calculation of coconut trees and the number of nodes
77885
- 程序产生N个随机的整数，存放在数组a中。然后根据数组a建立线性链表， 再删除链表中所有重复元素，并输出无重复元素结点的链表结点的值 -Program generates a random integer N, stored in the array a. Then establish a linear list of the array, Then delete all duplicate elements in the list, and output
LEACH
- LEACH [1] is an autonomous adaptive clustering protocol that distributes the energy load evenly among the sensors in the network using randomization. The nodes organize themselves into local clusters, with one node acting as the local base stat
Replica-Placement-Algorithm
- 针对分布式媒体服务系统中的副本放置问题，从优化节点间的传输代价出发，提出一种基于全局信息的启发式副本放置算法—— Zero2min，与现有算法相比，节省传输代价10 ~36 。根据Zero2min 算法的思路，给出媒体内容逐渐增加情况下的一种动态放置方法，仿真结果表明，其代价小于Max2min。-Aiming at the problem of replica placement in a distributed media system to reduce the cost of tran
Dissertation
- Wireless sensor networks are formed by a large number of sensor nodes which are commonly known as motes. These motes are small in size and have limited processing power, memory and battery life.
IEEEdata-for-BPA
- IEEE各种节点标准算例数据，并用输入到BPA文件当中，可直接打开，对数据进行读取。-IEEE various nodes Benchmarks data and input to BPA file which can be opened directly read the data.
manet-makale
- manet, wsn document with SCI sensor nodes and wireles nodes
dijkstra
- This a matlab code programmed for the dijkstra algorithm in order to find the shortest path among the nodes.-This is a matlab code programmed for the dijkstra algorithm in order to find the shortest path among the nodes.
minEnergy
- minimising energy consumption of nodes in wsn