基于位姿评估的无线传感器网络自主移动节点定位技术

 本文在研究自主移动节点运动特性的基础上,提出一种基于位姿评估技术的自主移动节点定位算法.该算法适用于可以获取速度信息以及具有射频定位功能的移动节点.该算法利用移动节点速度信息计算相对定位轨迹;然后对相对定位轨迹进行平移,旋转变换,使变换后的相对定位轨迹与射频定位轨迹的结果差别最小来修正累积误差;最后从修正后相对定位轨迹上获取最终定位结果.仿真实验结果表明,所提出的算法在参数取值合理的条件下,能够有效地提高移动节点定位精度.     

SDH自愈环网间互通问题的探讨

本文介绍在SDH环网大量采用的情况下,业务穿越两个甚至多个环网时,为提高环间互连节点和互连路径安全性所采用的双节点互连的保护方式.主要以单向通道保护环互连和复用段共享保护环互连应用为主.     

Location‐based distributed caching for device‐to‐device communications underlaying cellular networks

Device‐to‐device (D2D) communications have been viewed as a promising data offloading solution in cellular networks because of the explosive growth of multimedia applications. Because of the nature of distributed device location, distributed caching becomes an important function of D2D communications. By taking advantage of the caching capacity of the device, in this work, we explore the device storage and file frequent reuse to realize distributed content dissemination, that is, storing contents in mobile devices (named helpers). Specifically, we first investigate the average and lower bound of helper amount by dividing the network into small areas where the nodes are within each other's communication radius. Then, optimal helper amount is derived based on average helper amount and network topology. Subsequently, a location‐based distributed helper selection scheme for distributed caching is proposed based on the given optimal helper amount. In particular, nodes are selected as helpers according to their locations and degrees, and contents are placed in the manner for maximizing total user utility. Extensive simulation results demonstrate the factors that affect the optimal helper amount and the total user utility. Copyright © 2015 John Wiley & Sons, Ltd.     

面向异构无线传感器网络的节点调度算法

针对传感器网络中的节点冗余问题,提出了一种冗余判别方法来关闭冗余节点,以达到延长网络生命周期的目的.首先按邻居节点的不同位置对节点进行分类,研究了每组邻居节点的网络覆盖率与工作节点数k之间的约束关系,在此基础上,按不同的冗余法则对节点进行判断,关闭冗余节点.理论分析和实验结果表明,提出的算法能关闭网络中的冗余节点从而有效地延长网络的生存时间.     

基于节点安全预测的火场撤离路径规划

火场烟雾弥漫、能见度低,消防队员很难准确定位并找寻到合适的撤离路径.文中使用人机协作在火场中建立动态三角网基础上,以网络节点为参考点为消防员规划撤离路线.该方案使用基于相似函数的证据理论对火场中各节点采集的烟雾浓度、温度、氧气浓度进行数据融合,并确定节点位置的安全等级;引入预测机制,可以预测短时间内前进路径中节点位置的安全等级的变化.根据安全等级变化,剔除网络中危险节点,使用基于路程换算的A算法计算实时最短的安全路径.通过数据分析表明,该方案能更好的适应火场环境多变的特点.     

一种主动网络节点的带宽资源管理策略

主动网络由于允许用户将主动应用插入主动节点运行。因而比传统的被动网络需要更多的带宽资源。为了提高主动网络的服务质量QoS。必须对带宽资源进行合理的分配和管理。文章在分析主动网络与被动网络中带宽资源差别的基础上。提出了主动节点带宽资源管理策略，并在原型系统中实现了该方案。     

On properties of multicast routing trees

In the last several years we witnessed the proliferation of multimedia applications on the Internet. One of the unavoidable techniques to support this type of communication is multicasting. However, even a decade after its initial proposal, multicast is still not widely deployed. One of the reasons is the lack of a solid business model. If the gain and the cost of multicast could be predicted, network operators might be encouraged to deploy multicast on a larger scale. In this paper we propose analytical expressions that could be used to estimate the gain of network‐layer multicast. We show that the theoretical model matches extensive simulation and Internet measurement results remarkably well. Furthermore, we examine the reliability of traceroute data and of traceroutes‐based conclusions. We investigate the node degree distributions in the Internet maps obtained from CAIDA and RIPE and we show the divergency of our results with those obtained by other researchers. We further focus on the analysis of multicast trees based on traceroute data. Only few results have been available on the node degree distribution of multicast routing trees which provided contradictory conclusions. Our results seem to indicate that the node degrees follow power laws only for a large number of multicast users. Copyright © 2005 John Wiley & Sons, Ltd.     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

基于可分组设计的部分重复码研究

针对最小带宽再生情形下的有效修复问题,提出了一种新型部分重复(FR,fractional repetition)码设计。该设计由外部最大距离可分(MDS,maximum distance separable)码和内部重复码组成,称为GDDBFR(group divisible design based FR)码,可以达到随机访问模式下的系统存储容量,并且能够在很大范围内选择构造参数。理论分析指出,尽管GDDBFR码采用基于表格的修复方式,但通常具有大量的节点修复选择方案。此外,实验结果表明,与传统的RS(Reed-Solomon)码和再生码相比,GDDBFR码可以显著地减少失效修复时间。     

基于CC2420的无线传感器网络节点的设计

CC2420是Chipcon公司开发的一款符合Z igbee标准的低功耗射频芯片。在简要介绍无线传感器网络节点结构后,对CC2420芯片的功能特点进行了分析,并结合其工作原理和应用电路,设计了以ATmega128L为处理器、CC2420芯片为无线通信芯片的无线传感器网络节点。