Description: 本程序用资源分配网(Resource_Allocation Network,简称RAN)实现了Hermit多项式在线学习问题。训练样本产生方式如下，样本数400，每个样本输入Xi在区间[-4,4]内随机产生（均匀分布），相关样本输出为F(Xi) = 1.1(1-Xi + Xi2)exp(-Xi2/2),测试样本输入在[-4，+4]内以0.04为间隔等距产生，共201个样本。训练结束后的隐节点为：11个，训练结束后的平均误差可达：0.03
-this program resources distribution network (Resource_Allocation Network , RAN) to achieve the Hermit polynomial online learning problems. Training samples have the following manner, the number of 400 samples, each sample interval in the importation of Xi [-4, 4] within randomly generated (evenly distributed) sample output related to F (Xi) = 1.1 (1-Xi Xi2) exp (-Xi2 / 2), test samples of the imported [-4, 4] to within 0.04 of equidistant spacing have a total of 201 samples. After the training of hidden nodes : 11, after the end of the training error of up to the average : 0.03 Platform: |
Size: 8070 |
Author:刘波 |
Hits:
Description: 本程序用资源分配网(Resource_Allocation Network,简称RAN)实现了Hermit多项式在线学习问题。训练样本产生方式如下，样本数400，每个样本输入Xi在区间[-4,4]内随机产生（均匀分布），相关样本输出为F(Xi) = 1.1(1-Xi + Xi2)exp(-Xi2/2),测试样本输入在[-4，+4]内以0.04为间隔等距产生，共201个样本。训练结束后的隐节点为：11个，训练结束后的平均误差可达：0.03
-this program resources distribution network (Resource_Allocation Network , RAN) to achieve the Hermit polynomial online learning problems. Training samples have the following manner, the number of 400 samples, each sample interval in the importation of Xi [-4, 4] within randomly generated (evenly distributed) sample output related to F (Xi) = 1.1 (1-Xi Xi2) exp (-Xi2/2), test samples of the imported [-4, 4] to within 0.04 of equidistant spacing have a total of 201 samples. After the training of hidden nodes : 11, after the end of the training error of up to the average : 0.03 Platform: |
Size: 8192 |
Author:刘波 |
Hits:
Description: 实现DV-Hop定位算法的仿真,自动生成一定节点数的随即分布图，给出仿真结果的各点定位误差，用曲线图形显示，并可以计算平均误差。-DV-Hop simulation. Produce a randomly distributed nodes and then simulate and give the location error of each node, showing it in figure, and calculate the average error. Platform: |
Size: 2048 |
Author:sophia |
Hits:
Description: Wireless Sensor Networks (WSN) is different than the Cellular Networks as I mentioned earlier.
A WSN is composed of a large number of sensor nodes that communicate using a wireless medium (air).
The sensor nodes are deployed randomly in the environment to be monitored.
The sensor nodes distributed in ad hoc structure.
In WSN there is no base station and not all nodes hear each other.
The WSN is a multi-hop network.
Basic part of my code is to randomly place the sensor nodes in the given space then connecting each two nodes if the distance between them less than or equal to the communication radius. Platform: |
Size: 41984 |
Author:khala |
Hits:
Description: The cluster head is selected by the random number
generated by nodes in the hierarchical routing protocol which
is implementing Low Energy Adaptive Clustering Hierarchy
(LEACH). As a result, the cluster head may be chosen
randomly and be distributed asymmetrically. Focus on this
problem, this paper introduces a function to improve the
problem. This function uses the relative distance between
nodes and base station and the round number as its
parameters. Hence, the distribution of cluster head can be
symmetrical through changing parameters of the function,
and. With the increasing of running time, every node in the
network has the chance to be a cluster head, that is, the energy
consumption could be balance. The simulation result shows
that the lifetime of Wireless Sensor Network (WSN) has been
prolonged about 14 .
-The cluster head is selected by the random number
generated by nodes in the hierarchical routing protocol which
is implementing Low Energy Adaptive Clustering Hierarchy
(LEACH). As a result, the cluster head may be chosen
randomly and be distributed asymmetrically. Focus on this
problem, this paper introduces a function to improve the
problem. This function uses the relative distance between
nodes and base station and the round number as its
parameters. Hence, the distribution of cluster head can be
symmetrical through changing parameters of the function,
and. With the increasing of running time, every node in the
network has the chance to be a cluster head, that is, the energy
consumption could be balance. The simulation result shows
that the lifetime of Wireless Sensor Network (WSN) has been
prolonged about 14 .
Platform: |
Size: 261120 |
Author:mihir |
Hits:
Description: 线性化法仿真三个参考节点定位一个定位节点，随机噪声均方差随机分布在[4,10]，多径效应，权重分布在[0.85，1]。-Linearization method simulation of three reference nodes positioning a positioning node, the variance of random noise are randomly distributed in [4,10], multi-path effects, the weight distribution in [0.85,1]. Platform: |
Size: 1024 |
Author:刘京 |
Hits:
Description: 该运行实例中，令文本串长度为18，随机产生的文本串为asasasqmqmqmypypyp，分布在3个节点上；模式串长度为3，随机产生的模式串为qmq。最后，节点1上得到两个匹配位置，由+表示出来。-To the running instance, so that the text string length of 18 randomly generated text string asasasqmqmqmypypyp distributed in the three nodes pattern string of length 3, randomly generated pattern string qmq. Finally, the two matching locations on node 1, represented by the+. Platform: |
Size: 3072 |
Author:张勇 |
Hits:
Description: 该运行实例中，令文本串长度为7，随机产生的文本串为0010100，分布在3个节点上；模式串长度为2，随机产生的模式串为01。最后，节点0和1上分别得到一个匹配位置。
-The running instance, so that the text string length of seven randomly generated text string is 0.0101 million, distributed in three nodes the pattern string of length 2, the randomly generated pattern string 01. Finally, the nodes 0 and 1 respectively to get a matching position. Platform: |
Size: 2048 |
Author:张勇 |
Hits:
Description: 该运行实例中，令文本串长度为7，随机产生的文本串为asasbsb，分布在3个节点上；模式串长度为2，随机产生的模式串为as。最后，节点0、1和2上分别得到两个近似匹配位置-The running instance, so that the text string length is seven, randomly generated text string asasbsb distributed in the three nodes the pattern string of length 2, the randomly generated pattern string as. Finally, the nodes 0,1 and 2, respectively, the two approximate matching position Platform: |
Size: 3072 |
Author:张勇 |
Hits:
Description: 边长为L的正矩形范围内随机分布N个无线结点，每个结点辐射半径为R，最后连接结点间距离D<R的所有结点。-length of L positive rectangular range randomly distributed N nodes, each node radiation radius is R, and finally connect distance between two nodes D < R . Platform: |
Size: 44032 |
Author:lsheng |
Hits:
Description: Wireless Sensor Networks (WSN) is different than the Cellular Networks as I mentioned earlier. A WSN is composed of a large number of sensor nodes that communicate using a wireless medium (air). The sensor nodes are deployed randomly in the environment to be monitored. The sensor nodes distributed in ad hoc structure. In WSN there is no base station and not all nodes hear each other. The WSN is a multi-hop network. Basic part of my code is to randomly place the sensor nodes in the given space then connecting each two nodes if the distance between them less than or equal to the communication radius. Platform: |
Size: 3072 |
Author:Sapi |
Hits:
Description: 提出了一个分布式散射网形成算法. 首先发现邻居节点 , 根据收集到邻居信息生成匹克网 , 该步结束 时整个区域内 蓝牙节点形成一系列 互不相连 的初始匹克网 然后选择桥节点 , 互连初始匹克网形成一个连通散射网 并严格保证任意两个毗邻匹克网在互连过程 中建立唯一 的连接. 通过一个角色转换 , 图桥节点角色得以确定. 可以运行的动态源路由协议类似算法实现散射 网的路由查找. 仿真试验结果表明 , 散射网具有较好特性-An asynchronous and distributed
scatternet construction algorithm was proposed. First , each node collects information for neighbors Then
all randomly distributed Bluetooth nodes are self- organized into a series of ini tial pico nets Fi nally , select
bridge nodes , initial piconets a re bridg ed toge ther into scatternet , alg orithm guarantees that any two
neighboring pico nets can be connected by one path and every bridge is as signed with an exact role by the
role transitio n diagram. Route discov ery for the scatternet can be realized by using the similar dynamic
source routi ng protocol. The sim ulation results confirm good function of created Blue too th scatternet Platform: |
Size: 254976 |
Author:njkitty |
Hits:
Description: NETWORKING LAB PROGRAMS
In this paper, we use a wireless sensor network with 100 unknown nodes, which are randomly produced
and uniformly distributed in a square region of 5R*5R. Assuming that all nodes are located in the first
quadrant, the location of nodes is represented by a two-dimensional coordinates, simultaneously stands for
the absolute position, and all nodes are in a quiescent state after deployment. In the algorithm PGA, it
supposes population size equals 50 and crossover probability pc=0.8, mutation probability pm=0.01, the
number of iterations Iter=100 The RCDE algorithm parameters are set as the same to PGA outside of
scaling factor F=0.8. In order to facilitate comparison, the parameters of GAL algorithm are completely
equated to that of PGA algorithm.-NETWORKING LAB PROGRAMS
In this paper, we use a wireless sensor network with 100 unknown nodes, which are randomly produced
and uniformly distributed in a square region of 5R*5R. Assuming that all nodes are located in the first
quadrant, the location of nodes is represented by a two-dimensional coordinates, simultaneously stands for
the absolute position, and all nodes are in a quiescent state after deployment. In the algorithm PGA, it
supposes population size equals 50 and crossover probability pc=0.8, mutation probability pm=0.01, the
number of iterations Iter=100 The RCDE algorithm parameters are set as the same to PGA outside of
scaling factor F=0.8. In order to facilitate comparison, the parameters of GAL algorithm are completely
equated to that of PGA algorithm. Platform: |
Size: 58368 |
Author:ria |
Hits:
Description: 在圆内随机分布的传感器节点利用波束成形与卫星直接通信。(Distributed sensor nodes that is randomly distributed in the circle can create a direct communication with satellite using Beamforming.) Platform: |
Size: 1024 |
Author:朱圣祥
|
Hits:
Description: 改进DV-Hop定位算法
首先设置初始量，布置了一个范围为100×100m2的区域，其上随机分布100个传感器节点，其中有10个信标节点，节点的通信半径为30m。
第二步在正方形区域内产生均匀分布的随机拓扑，随机产生节点坐标并将其中十个选定为信标节点，其余九十个设为未知节点，然后画出节点分布图。
第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。
第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离，用跳数估计距离的方法得出未知节点到信标节点的距离。
第五步用极大似然估计法求未知节点坐标
(Improved DV-Hop localization algorithm first set the initial amount, layout 100100m2 the area of a range of 100 sensor nodes randomly distributed on the 10 beacon node, the node communication radius of 30m. The second step in the square area to generate uniformly distributed random topology, random coordinates of the nodes and ten of the selected beacon node, the remaining 90 is set to unknown node, and then draw the node distribution diagram. The third step is to calculate the minimum number of hops of the unknown node and each beacon node through the shortest path method. The fourth step according to the location information of the other beacon nodes in the previous record and away from hops to estimate the average hop distance and hop count to estimate the distance to come to the distance of the unknown node to beacon nodes. The fifth step maximum likelihood estimation method and the unknown coordinates of the nodes) Platform: |
Size: 1024 |
Author:robinkk4 |
Hits:
Description: 实现了传感器网络的拓扑控制，以循环的方式随机选择簇头节点，将整个网络的能量负载平均分配到每个传感器节点中，从而达到降低网络能源消耗、提高网络整体生存时间的目的。(The topology control of sensor network is realized, cluster head nodes are randomly selected in a cyclic way, and the energy load of the whole network is evenly distributed to each sensor node, so as to reduce the energy consumption of the network and improve the overall survival time of the network.) Platform: |
Size: 4096 |
Author:Tyrone_Allen |
Hits:
Search - randomly distributed nodes