一种自适应的混合型无线传感器网络拓扑控制算法

针对特定应用场合的混合型拓扑控制算法是W SN拓扑控制领域的研究热点之一。在研究经典的面向事件驱动型网络拓扑控制算法—ASCENT基础上,提出了一种自适应的混合型拓扑控制算法—AHTC算法。针对大规模事件驱动型网络场景应用,解决了ASCNET算法不能适应于大规模网络、未考虑节点剩余能量、网络丢包率高等问题。仿真结果表明,改进的算法有更好的节能性和稳定性。     

基于平面矢量场的可视化方法的研究

平面矢量场可视化是科学计算可视化的重要研究内容。矢量场以直观的图形图像显示场的运动,透过抽象数据有效洞察其内涵本质和变化规律,广泛应用于计算流体力学、航空动力学、大气物理和气象分析等领域。对平面矢量场进行可视化的方法有很多种,常见的有点图标法、流线法、线积分卷积法和拓扑分析法等。论文主要研究常见的可视化方法,分析它们的性能,并通过实际的例子,对具体的可视化结果图像进行比较。通过该研究,能够给人们在选择可视化方法时提供依据。     

基于拓扑和形貌优化的驾驶室结构设计

为实现汽车零部件的创新设计,以某工程车驾驶室的简化有限元模型为研究对象,用HyperMesh作前处理,在OptiStruct中建立多工况条件下拓扑优化与形貌优化组合的整体优化模型,通过OSSmooth工具将优化后的结果导出后在CATIA V5中显示.拓扑和形貌组合优化技术的实践表明,该方法对产品部件的综合设计具有较好的适用性,可为设计人员提供设计思路.     

New insights on survivability in multi-domain optical networks

With the development of intelligent optical networks and the general multi-protocol label switching (GMPLS) technique, the seamless convergence between IP network and optical network is no longer be a dream but a practical reality. Similar to the Internet, current optical networks have been divided into multiple domains each of which has its own network provider and management policy. Therefore, the development of multi-domain optical networks will be the trend of new-generation intelligent optical networks, and GMPLS-based survivability for multi-domain optical networks will become a hot topic of research in the future. This paper provides a comprehensive review of the existing survivable schemes in multi-domain optical networks and analyzes the shortcomings of current research. Based on previous studies, we present possible challenges and propose new ideas to design efficient survivable schemes to guide the future work of researchers in multi-domain optical networks.     

虚拟计算环境中的覆盖网技术

互联网资源的成长、自治和多样等特性给资源的有效聚合带来了巨大挑战.通过覆盖网动态组织互联网资源并支持资源的高效搜索,是虚拟计算环境中资源按需聚合的重要途径之一.文中概述了虚拟计算环境中覆盖网技术的研究进展.针对互联网资源的成长性和自治性等特点,阐述了基于Kautz图的高效覆盖网拓扑构造方法,进而给出了适用于任意正则图的通用覆盖网拓扑构造方法;针对互联网资源的多样性等特点,提出了支持分组的覆盖网拓扑构造方法;在此基础上,阐述了基于覆盖网的高效区间搜索技术,并对覆盖网拓扑的优化方法及其它复杂搜索技术进行探讨.     

Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks

This paper proposes a method to reduce the cost of a core-based group-shared multicast tree, where the cost is evaluated by the total bandwidth consumption of multicasting packets among all group members. Due to the broadcast nature of radio transmissions, we find that the challenge of determining minimum cost multicast tree can be approximated by finding the multicast tree with a minimum number of non-leaves (the minimum non-leaf multicast tree problem). However, we also find that the minimum non-leaf multicast tree problem is NP-complete. Thus, a method is proposed to dynamically reduce the number of non-leaves in an existing multicast tree. Experimental results show that our method reduces the cost of the multicast tree in both geometrically and randomly distributed network models and the random waypoint mobility model.     

Topological Repairing of 3D Digital Images

We present here a new randomized algorithm for repairing the topology of objects represented by 3D binary digital images. By “repairing the topology”, we mean a systematic way of modifying a given binary image in order to produce a similar binary image which is guaranteed to be well-composed. A 3D binary digital image is said to be well-composed if, and only if, the square faces shared by background and foreground voxels form a 2D manifold. Well-composed images enjoy some special properties which can make such images very desirable in practical applications. For instance, well-known algorithms for extracting surfaces from and thinning binary images can be simplified and optimized for speed if the input image is assumed to be well-composed. Furthermore, some algorithms for computing surface curvature and extracting adaptive triangulated surfaces, directly from the binary data, can only be applied to well-composed images. Finally, we introduce an extension of the aforementioned algorithm to repairing 3D digital multivalued images. Such an algorithm finds application in repairing segmented images resulting from multi-object segmentations of other 3D digital multivalued images.

基于可连Cell的无线传感器网络拓扑控制算法

在无线传感器网络的拓扑控制(TC)中,基于Cell的TC算法被认为是一类可以节省传感器节点能量并延长网络生命周期的方法,但是其需要较多的骨干网节点并且无法保证连通性.通过分析现今算法的内在局限性,提出了一种1-Con思想:当一个Cell的头节点被加入当前骨干网时,所有其可以连接的Cell使用该节点连入拓扑结构,然后此新骨干网递归地继续扩大.基于此思想,设计了一种基于可连Cell的拓扑控制算(CCTC),并从理论上证明:1)CCTC可以保证其所形成的拓扑结构维持网络连通;2)每一轮用于形成骨干网的工作节点非常少.CCTC的计算复杂度是线性的,空间复杂度和信息交换量都是常数量级.仿真实验同样显示,CCTC可以在提供良好鲁棒性和较少的消息交换的情况下,更有效地节省节点能耗并延长网络生命周期.     

无线校园网规划与设计

随着校园网的不断普及,无线网络成为了有线网的有益补充。本文根据学校目前的有线校园网和校区环境布局的实际情况,结合科研和教学需要,采用实地测量和计算相结合的方法,确定室内、楼宇间、操场等无线覆盖区内的AP最佳定位点,对教学实验楼、学术活动中心和操场等有线网盲区分别进行无线AP接入覆盖。