oalib
匹配条件: “” ,找到相关结果约100条。
列表显示的所有文章,均可免费获取
第1页/共100条
每页显示
Evaluation of Hop-distance Relationship for Sensor Networks in Internet of Things
一种物联网框架下传感节点间跳数与距离关系的研究

YU Fan-peng,NIU Yan-chao,
于樊鹏
,牛延超

计算机科学 , 2012,
Abstract: This paper presented an analytical method to evaluate the hop-distance relationship for wireless sensor network in a shadow fading envirorunent,where sensor nodes are randomly and independently deployed in a circular region by a Poisson process. Different from the UDG model, the shadow fading model has the non-uniformity property for connectivity. We derived an approximate recursive expression of the probability of the hop count by a given geographic dislance. The multi-hop dependence problem was also taken into consideration. Furthermore, we gave the expressions about the distribution of distance by a known hop count by the Bayer formula .The simulation results show that the analytical expressions can closely agree with the statistical data and the border effects cannot be ignored.
The Study on the Hierarchy of Internet Router-Level Topology  [PDF]
Jun ZHANG, Hai ZHAO, Chao LI, Xin GE
Int'l J. of Communications, Network and System Sciences (IJCNS) , 2009, DOI: 10.4236/ijcns.2009.24032
Abstract: Being a huge system, Internet topology structure is very complex. It can’t be treated as a plane simply, and its hierarchy must be analyzed. We used the k-core decomposition to disentangle the hierarchical structure of Internet Router-level topology. By analyzing the router-lever Internet topology measuring data from CAIDA (The Cooperative Association for Internet Data Analysis) ,we studied the characteristics of the nodes in the inner hierarchy and outer hierarchy respectively. The frequency-degree power law of the nodes which core-ness is lower and the regionally distribution of the nodes which coreness is higher were concluded. At last, the topology of every hierarchy was described by giving their figures. These descriptions can provide a valuable reference for modeling on the Internet topology.
Internet topology at the router and autonomous system level  [PDF]
A. Vazquez,R. Pastor-Satorras,A. Vespignani
Computer Science , 2002,
Abstract: We present a statistical analysis of different metrics characterizing the topological properties of Internet maps, collected at two different resolution scales: the router and the autonomous system level. The metrics we consider allow us to confirm the presence of scale-free signatures in several statistical distributions, as well as to show in a quantitative way the hierarchical nature of the Internet. Our findings are relevant for the development of more accurate Internet topology generators, which should include, along with the scale-free properties of the connectivity distribution, the hierarchical signatures unveiled in the present work.
FPGA implementation of IP packet segmentation and reassembly in internet router  [PDF]
Carevi? Marko,?i?a Zoran
Serbian Journal of Electrical Engineering , 2009, DOI: 10.2298/sjee0903399c
Abstract: Advanced packet scheduling algorithms in Internet routers work with fixed size cells. As IP packet length is not fixed, it is necessary to implement segmentation function for dividing IP packet in fixed sized cells. Also, it is necessary to reassemble original IP packet on output port of the router. Hardware implementation of these two functions will be presented in this paper.
Router-level community structure of the Internet Autonomous Systems  [PDF]
Mariano G. Beiró,Sebastián P. Grynberg,J. Ignacio Alvarez-Hamelin
Computer Science , 2015, DOI: 10.1140/epjds/s13688-015-0048-y
Abstract: The Internet is composed of routing devices connected between them and organized into independent administrative entities: the Autonomous Systems. The existence of different types of Autonomous Systems (like large connectivity providers, Internet Service Providers or universities) together with geographical and economical constraints, turns the Internet into a complex modular and hierarchical network. This organization is reflected in many properties of the Internet topology, like its high degree of clustering and its robustness. In this work, we study the modular structure of the Internet router-level graph in order to assess to what extent the Autonomous Systems satisfy some of the known notions of community structure. We show that the modular structure of the Internet is much richer than what can be captured by the current community detection methods, which are severely affected by resolution limits and by the heterogeneity of the Autonomous Systems. Here we overcome this issue by using a multiresolution detection algorithm combined with a small sample of nodes. We also discuss recent work on community structure in the light of our results.
基于跳数修正的dv-hop定位的改进算法  [PDF]
郑久虎,钱焕延,高德民,严筱永?
计算机科学 , 2013,
Abstract: dv-hop算法是一种最典型的非测距的节点定位算法。为了提高dv-hop算法的精度,引入了前序节点(previousnode,pn)和总平均每跳距离这两个概念,设计了改进的mhdv-hop算法,它只需很低的信标节点比例,不改变dv-hop算法的过程,也不需要额外硬件支持,通过pn的数量计算出未知节点到信标节点跳数的修正系数,使得定位精度有很大提高。
基于 RSSI 跳数连续的 DV-HOP 改进算法  [PDF]
邬春明,张金强,焦龙龙
重庆邮电大学学报(自然科学版) , 2015,
Abstract: 针对经典DV-HOP(distancevector-hop)算法中节点间跳数信息对定位精度有较大影响这一问题,提出了一种基于接收信号强度指示(receivesignalstrengthindicator,RSSI)的改进算法?该定位算法引入了连续跳数的定义,首先利用RSSI测距模型把直接邻居节点接收到的RSSI值转换为两节点之间的距离,再根据连续跳数的定义计算出两节点间的连续跳数?在相同的仿真网络环境里,与经典的DV-HOP算法相比,归一化定位误差降低了30%~45%;与其他改进定位算法相比,归一化定位误差也有不同程度的降低?仿真结果表明该改进算法大幅度地提高了定位精度?
DV-Hop localization algorithm based on improved average hop distance and estimate of distance
基于改进的平均跳距和估计距离的DV-Hop定位算法*

SHEN Ming-yu,ZHANG Yin,
沈明玉
,张寅

计算机应用研究 , 2011,
Abstract: 为了提高DV-Hop定位算法在不规则网络中的精确度,针对该算法的不足之处,提出了一种基于平均跳距和估计距离的改进的DV-Hop算法。该算法考虑了未知节点到参考节点的路径与参考节点间的路径可能存在重合或部分重合这一特性,对平均跳距进行修改,并利用误差对距离进行修正。仿真实验结果表明,在不规则网络环境下,改进算法的定位精度得到明显提高。
Dk-hop:一个有向k跳无线干扰模型  [PDF]
徐朝农, 黄长喜, 胡存钢, 刘勇
自动化学报 , 2012, DOI: 10.3724/SP.J.1004.2012.01042
Abstract: ?无线链路调度算法的性能直接受无线干扰模型准确性的影响.尽管由于其简单性而被广泛采用,k跳干扰模型并不能准确建模真实的无线干扰特性,从而导致链路调度算法的理论性能与实际性能之间存在很大差异.本文考虑无线传输方向性因素对干扰的影响,提出了Dk-hop无线干扰模型.该模型有效排除了k跳隐藏链路,从而更准确地对无线干扰进行了建模.理论分析表明,当k值不超过IR+1时(IR为载波感知距离和传输距离之比),Dk-hop比k跳干扰模型更为准确,且仍然保持了k跳干扰模型的简单性.为与真实的无线干扰保持接近,k的合理取值范围应为[IR-2,IR+1].
Spectrum Density Analysis on Router-level Internet Macroscopic Topology
路由级Internet宏拓扑结构的谱密度分析

XU Ye ZHAO Hai ZHANG Wen-bo,
徐野
,赵海,张文波

计算机科学 , 2008,
Abstract: Analysis of spectrum density and SLS(signless Laplacian spectra) on router-level macroscopic toplogy was performed.Firstly,we found in experiments that five analysis results of spectrum density on five sampling topologies showed highly similarity proving that Internet is a system of self-similarity as well as the ability for sampling topology to resemble the whole Internet topology.Secondly,obvious difference between the spectrum density analysis results of sampling topology,ER graph and BA graph indicated ...
第1页/共100条
每页显示


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.