Location:
Search - node density
Search list
Description: 现有的几个网络拓扑随机发生器，其实很难生成理想的网络拓扑结构，其主要原因在于很难控制节点的疏密和间距。我们提出来的这个改进算法，在随机抛撒节点的时候使用了K均值聚类，由本算法作为网络拓扑发生器，网络节点分布均匀且疏密得当，边的分布也比较均衡-The few existing random network topology generator, is in fact very difficult to generate the desired network topology, the main reason it is difficult to control the node density and spacing. We put forward the improved algorithm, throw in random nodes when using the K-means clustering, by the algorithm as a network topology generator, network nodes and spacing evenly distributed properly, the edge of a more balanced distribution of
Platform: |
Size: 2048 |
Author: ben |
Hits:
Description: 利用MANET工作小组推荐的Ns2 仿真
软件对DSR 进行模拟,从源节点个数、分组发送频率、移动速度、节点密度、节点个数五个方面分析DSR 的性能,-MANET working group recommended the use of the ns2 simulation software to simulate on the DSR, the number of nodes from the source, packet sent frequency, mobile speed, node density, the number of five-node analysis of the performance of DSR,
Platform: |
Size: 194560 |
Author: xdb |
Hits:
Description: 通过画出概率密度的的分布曲线，得到节点位置。-Through the draw probability density distribution curve, to be the node location.
Platform: |
Size: 1024 |
Author: zangyufeng |
Hits:
Description: The transmission range that achieves the
most economical use of energy in wireless ad hoc networks
is studied under homogeneous node distribution. By assuming
the knowledge of node location, we first proposed
a transmission strategy to ensure the progress of data
packets toward their final destinations. Then the average
packet progress for a transmission range universal for all
nodes is derived, which is accordingly used to determine
the optimal transmission range that gives the maximum
efficiency of energy consumption. Different from some
previous work, our analysis does not make the assumption
of large nodal density in the wireless ad hoc networks
studied. Numerical and simulation results are presented
to examine our analysis for wireless ad hoc networks.
Platform: |
Size: 104448 |
Author: Krishna |
Hits:
Description: A major issue with ad-hoc networks is energy consumption since nodes
are usually mobile and battery-operated. In this project we compared the
performance of ad-hoc routing protocols in a network where each participating
mobile node has a given battery life and will shut-down when a threshold is
reached. We studied two routing protocols, Dynamic Source Routing (DSR), and
Destination-Sequenced Distance-Vector Routing (DSDV), by comparing the node
termination rate as well as the over-all goodput of the network. From the
simulations we observed that in high node density, DSR performs better than
DSDV. The performance gap can be decreased by smaller number of nodes in the
network or more path loss and shadowing variance.
Platform: |
Size: 44032 |
Author: zipzap |
Hits:
Description: 改进的Salama网络拓扑随机生成算法通用Matlab程序，在随机抛撒节点的时候使用了K均值聚类，网络节点分布均匀且疏密得当，边的分布也比较均衡。-Improved algorithm for randomly generated network topology Salama General Matlab program, when the nodes in the random throw using K means clustering, the network node density distribution and appropriate, a more balanced distribution of the edge.
Platform: |
Size: 5120 |
Author: 成龙 |
Hits:
Description: 复杂网络研究与建模
总起来说这是一个关于矩阵的运算，用到了c语言里面的东西，实现一个矩阵的逆运算和矩阵的转置等，最终实现的是一个初始节点为4个节点的有向图，随即扩展为一个10000*10000的巨型矩阵，得到该有向图的图形，
与计算机图形学类似，该程序是在构建了一个算法后，用MATLAB实现了一个无标度网络的图形中的各个节点的概率密度，并根据各个节点的概率密度绘出该图
-将中文译成英语
And modeling complex networks
Collectively this is a computation on the matrix, use the stuff inside c language to realize the inverse of a matrix and a matrix, etc., and ultimately is an initial node to four nodes directed graph, then Expands to a huge matrix 10000* 10000, by the digraphs graphics,
And similar computer graphics, the program is built upon an algorithm, using MATLAB to achieve a scale-free network each node in the graph the probability density and probability density according to each node in the graph drawn
Platform: |
Size: 1024 |
Author: ymtian |
Hits:
Description: 在本次实验中，分为「移动节点无线区网」及「固定节点无线区网」两种环境来探讨。我调整MAC协议(共(2种)、路由协议(共2种)、网络拓扑(共5种)、节点数目(共3种)、节点密度(共1种)、传输距离(共1种)，因此固定节点实验的结果有2*2*5*(3)=60种。由于节点密度、传输距离该二项参数之变动与网络拓扑的维持造成很大的冲突，所以对于节点密度的影响，时间上只来得及作线状拓扑上的节点密度分析，其它种拓扑的密度皆不改变。而全部的传输距离只采用250m的设定，传输距离的设定见下文-In this experiment, divided into "mobile node wireless area networks"and the "fixed node in the wireless area network " to discuss the two environments. I adjusted the MAC protocol (a total of (2 species), routing protocols (2 species), the network topology (5 species), the number of nodes (3 species), the node density (total 1 species), distance (total 1 species) Therefore, the experimental results of fixed nodes, 2* 2* 5* (3) = 60. Since the node density, transmission range of the two parameters change in the maintenance of the network topology caused great conflict, so the impact of node density , the time just in time for the linear topology of the node density analysis, neither the density of other types of topology change. and all of the transmission distance of 250m using only the setting, the setting distance below
聆聽以拼音方式閱讀
Platform: |
Size: 2048 |
Author: james |
Hits:
Description: （1） 二维椭圆型流动和传热问题通用计算机程序算法方面的特点
1、 采用原始变量法，即以速度U、V及压力P作为直接求解的变量
2、 守恒型的差分格式，离散方程系对守恒型的控制方程通过对控制容积作积分而得出的，无论网格疏密程度如何，均满足在计算区域内守恒的条件；
3、 采用区域离散化方法B，即先定控制体界面、再定节点位置
4、 采用交叉网格，速度U、V与其他变量分别存储于三套网格系统中；
-(1) two-dimensional elliptic flow and heat transfer problems in general-purpose computer program is characterized by an algorithm, using the primitive variable method, that is, the speed U, V and pressure P as a direct solution of the variable 2, Conservative difference schemes, the discrete equation Department of Conservative control of the control volume by equation derived for the points, regardless of how the grid density, are calculated to meet the conditions of conservation of the region 3, use of discrete method B, the first fixed control volume interface, and then set the node positions 4, cross-grid use, speed, U, V and other variables are stored in three sets of grid systems
Platform: |
Size: 5120 |
Author: zmm |
Hits:
Description: 无线传感定位的一个入门算法，介绍了信标节点密度与定位精度的关系-Wireless sensor positioning as an entry algorithm introduced beacon node density and the relationship between positioning accuracy
Platform: |
Size: 1024 |
Author: shiming |
Hits:
Description: Application that extracts features from segments, retrieved from microscope cell images. Each segment represents one cell. Feature vector consists of following features:
- cell s area
- cell s centroid
- cell s weighted centroid
- cell s convex hull
- cell s maximal density
- cell s minimal density
- cell s density standard deviation
- minimal outwritten elipse
- cell circuit
For each segment found at the microscope image, new feature vector is computed. All of them are then transferred to the output.
That extrator could be used as a plugin to the KNIME Enironment. It is represented by separated node which has to be connected with ImageReader.
Platform: |
Size: 1580032 |
Author: Fenomen |
Hits:
Description: 本体的计算概念间语义相似度的方法，综合考虑了语义距离、节点深度和节点密度的影响，并加入了一个可调节的
参数，以适应不同场景下的灵活应用，最后简单介绍了语义相似度在搜索引擎领域的应用-Computing semantic similarity between concepts of ontology, considering the impact of the semantic distance from the node depth and node density, and add an adjustable
Parameters to adapt to the flexible application of different scenarios, and finally a brief introduction to the application of semantic similarity in the field of search engine
Platform: |
Size: 276480 |
Author: 王海涛 |
Hits:
Description:
In our work we extend the LEACH s cluster head selection algorithm in WSN based on different node characteristics like, density, centrality and energy. This paper focuses on increasing the lifetime of wireless sensor networks.
Platform: |
Size: 50176 |
Author: raj |
Hits:
Description:
In our work we extend the LEACH s cluster head selection algorithm in WSN based on different node characteristics like, density, centrality and energy. This paper focuses on increasing the lifetime of wireless sensor networks.
Platform: |
Size: 1091584 |
Author: raj |
Hits:
Description: <p >This is used in the manifest in the uses-configuration node and in the resource folder names as well as other places needing to know the density values.
Platform: |
Size: 1024 |
Author: rongqanghang |
Hits:
Description: 一种基于节点密度分割和标签传播的Web页面挖掘方法-A mining based on node density segmentation and labeling dissemination of Web pages
Platform: |
Size: 1193984 |
Author: xiaozhang |
Hits:
Description: This work is
an attempt towards a comprehensive performance uation
of commonly used reactive AODV protocol with hybrid GRP
routing algorithm under varying node density conditions in
terms of QoS using OPNET Modeler 17.5 Academic.-This work is
an attempt towards a comprehensive performance uation
of commonly used reactive AODV protocol with hybrid GRP
routing algorithm under varying node density conditions in
terms of QoS using OPNET Modeler 17.5 Academic.
Platform: |
Size: 152576 |
Author: SONIA |
Hits:
Description: Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their
capacity achieving/approaching property. This work studies the iterative decoding
also known as message-passing algorithms applied to LDPC codes. Belief propagation
(BP) algorithm and its approximations, most notably min-sum (MS), are popular
iterative decoding algorithms used for LDPC and turbo codes. The thesis is divided
in two parts. In the rst part, a low-complexity binary message-passing algorithm
derived the dynamic of analog decoders is presented and thoroughly studied.
In the second part, a modi cation for improving the performance of BP and MS
algorithms is proposed. It uses adaptive normalization of variable node message-Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their
capacity achieving/approaching property. This work studies the iterative decoding
also known as message-passing algorithms applied to LDPC codes. Belief propagation
(BP) algorithm and its approximations, most notably min-sum (MS), are popular
iterative decoding algorithms used for LDPC and turbo codes. The thesis is divided
in two parts. In the rst part, a low-complexity binary message-passing algorithm
derived the dynamic of analog decoders is presented and thoroughly studied.
In the second part, a modi cation for improving the performance of BP and MS
algorithms is proposed. It uses adaptive normalization of variable node message
Platform: |
Size: 400384 |
Author: rag |
Hits:
Description: Performance Evaluation of DSDV and MDSDV Routing Protocol with Varying Node Density
Platform: |
Size: 78848 |
Author: NP1
|
Hits:
Description: this code simulate random mobility models, random way point, random direction and random walk, data that produced from this code can be used to calculate node density, connectivity and moving area graphs, and any other needed data that can be generated from the main generated data.
Platform: |
Size: 20480 |
Author: 未央佛 |
Hits: