Research and Design of Network Management Construction Based on Mobile AGENT

The technical characters of mobile agent （MA） originated in the distributional artificial intelligence domain is introduced. A network management construction based on agent （NMCA） is then proposed. The NMCA structure features are elaborated in detail. A prototype design of NMCA is given by using the jKQML programming. The establishment of NMCA platform will be helpful to reduce the correspondence load of network management and improves the efficiency and the expansion ability of network management systems.     

Level of nodes in increasing trees revisited

Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

移动IP的关键技术

本详细描述了移动IP的工作过程，并介绍了移动IP的隧道技术和IPSec，最后对移动IP技术中存在几个热点问题进行了讨论。     

有限元节点编号优化

从分析最简单最优的矩形单元节点编号着手，分析其特点，得出各个节点的相邻单元节点编号总和除以该节点相邻单元数所得的节点商以及相邻单元最小最大节点编号和都为升序排列。总结出一种新型的有限元节点重编号方法，并举例说明该算法能减少有限元的带宽。     

A path planning model based on nested regular hexagons using weighted centroid localization

In many wireless sensor network (WSN) applications, the location of a sensor node is crucial for determining where the event or situation of interest occurred. Therefore, localization is one of the critical challenges in WSNs. Mobile anchor node assisted localization (MANAL) is one of the promising solutions for the localization of statically deployed sensors. The main problem in MANAL localization is that the path planning of the mobile anchor (MA) node should be done so that the localization error in the network will be minimal and that all unknown nodes in the network are covered. This paper proposes a new path planning approach called nested hexagons curves (NHexCurves) for MANAL. NHexCurves guarantees that it will receive messages from at least three non-collinear anchors to locate all unknown nodes in the network. The proposed model has compared six different path planning schemes in the literature using weighted centroid localization (WCL). In these comparisons, first of all, localization errors of the models are compared using some statistical concepts. Second, the variation of the localization error according to parameters such as resolution (R) and the standard deviation of noise (σ) is observed. Then, with similar approaches, the standard deviation of errors, localization ratio, scalability performances, and finally, path lengths of the models are examined. The simulation results show that the NHexCurves static path planning model proposed in this study stands out compared to other models with high localization error and localization ratio performance, especially at low resolutions, due to its path design. At the same time, the lowest error values according to σ are obtained with the proposed model among all models considered.     

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

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

基于多目标生物习性激励的WSN传感器节点部署

为确保无线传感器网络(WSN)覆盖和连通性最大化以及能量消耗最小化的有效监测,提出一种基于多目标生物习性激励(MOBHI)的传感器节点部署算法。首先,将传感器节点的区域(领地)根据诸如最大覆盖、最大连通性和最小能耗等多个目标,基于领地捕食者气味标记行为进行标记,并模仿气味匹配识别其监测的位置;其次,对多个目标的优化问题应用非受控Pareto最优,将其分解为多个单目标优化子问题并同时对它们进行优化,得到所需目标的解。仿真实验结果表明,本文提出算法在网络覆盖、连通性和能耗等性能指标方面都优于其他传感器节点部署的多目标和单目标优化算法。     

Performance characteristics of cascaded delay‐line node architectures in single‐path interconnection networks

Internally buffered multistage interconnection network architectures have been widely used in parallel computer systems and large switching fabrics. Migration from electrical domain to optical domain has raised the necessity of developing node architectures with optical buffers. Cascaded fibre delay line architectures can be seen as possible realizations of output and shared buffering in a 2 × 2‐switching element. These approaches can be used as buffered node architecture in a Banyan like interconnect. In this paper, we investigate and compare these approaches by using simulation methods. Different performance metrics, such as normalized throughput, average packet delay, packet loss rate and buffer utilization have been used under uniform and non‐uniform traffic models. Results show that the TC‐chain node Banyan network offer an improved normalized throughput and average packet delay performances under both traffic models without disrupting first‐in‐first‐out order of arrivals. The switched delay‐line requires fewer switching elements than TC and TTC architectures but at the cost of high packet delay. Copyright © 2004 John Wiley & Sons, Ltd.     

Resources Management in Active Networks

1　ＩｎｔｒｏｄｕｃｔｉｏｎＷｈｅｎａｒｏｕｔｅｒｆｏｒｗａｒｄｓａｐａｃｋｅｔｉｎｃｏｎｖｅｎｔｉｏｎ ａｌｎｅｔｗｏｒｋｓ,ｉｔｏｎｌｙｕｓｅｓｆｅｗｓｙｓｔｅｍｒｅｓｏｕｒｃｅｓ ,ｆｏｒｅｘａｍｐｌｅ,ｉｔｕｓｅｓｌｉｔｔｌｅｍｅｍｏｒｙｒｅｓｏｕｒｃｅｓｔｏｔｅｍ ｐｏｒａｒｉｌｙｓｔｏｒｅｔｈｉｓｐａｃｋｅｔａｎｄｆｅｗＣＰＵｒｅｓｏｕｒｃｅｓｔｏｓｅａｒｃｈｆｏｒｗａｒｄｉｎｇｒｏｕｔｅａｎｄｐｒｏｃｅｓｓＩＰｏｐｔｉｏｎｐａ ｒａｍｅｔｅｒｓ.Ｃｏｍｐａｒｅｄｔｏｃｏｎｖｅｎｔｉｏｎａｌ…