Probabilistic analysis on fault tolerance of 3-Dimensional mesh networks

The probability model is used to analyze the fault tolerance of mesh. To simplify its analysis, it is as-sumed that the failure probability of each node is independent. A 3-D mesh is partitioned into smaller submeshes,and then the probability with which each submesh satisfies the defined condition is computed. If each submesh satis-fies the condition, then the whole mesh is connected. Consequently, the probability that a 3-D mesh is connected iscomputed assuming each node has a failure probability. Mathematical methods are used to derive a relationship be-tween network node failure probability and network connectivity probability. The calculated results show that the 3-D mesh networks can remain connected with very high probability in practice. It is formally proved that when thenetwork node failure probability is boutded by 0.45 %, the 3-D mesh networks of more than three hundred thousandnodes remain connected with probability larger than 99 %. The theoretical results show that the method is a power-ful technique to calculate the lower bound of the connectivity probability of mesh networks.

3-D fracture network dynamic simulation based on error analysis in rock mass of dam foundation

Accurate 3-D fracture network model for rock mass in dam foundation is of vital importance for stability,grouting and seepage analysis of dam foundation.With the aim of reducing deviation between fracture network model and measured data,a 3-D fracture network dynamic modeling method based on error analysis was proposed.Firstly,errors of four fracture volume density estimation methods(proposed by ODA,KULATILAKE,MAULDON,and SONG)and that of four fracture size estimation methods(proposed by EINSTEIN,SONG and TONON)were respectively compared,and the optimal methods were determined.Additionally,error index representing the deviation between fracture network model and measured data was established with integrated use of fractal dimension and relative absolute error(RAE).On this basis,the downhill simplex method was used to build the dynamic modeling method,which takes the minimum of error index as objective function and dynamically adjusts the fracture density and size parameters to correct the error index.Finally,the 3-D fracture network model could be obtained which meets the requirements.The proposed method was applied for 3-D fractures simulation in Miao Wei hydropower project in China for feasibility verification and the error index reduced from 2.618 to 0.337.

MODELING OF 3-D IMAGES AND SPACE MARKOV CUBIC MESH MODELS

Three-dimensional(3-D)Markov cubic random mesh models are presented andproved in the form of two theorems in details.Its applications to the modeling and description of3-D images are described.The model presented here is a appropriate mathematical tool for thesegmentation,modeling,classification and other processing.Finally,an example is given.

在3D-Mesh网络中的两种路由研究

在研究并行计算机系统容错时,路由算法是一个极为重要的研究课题。主要研究的是自适应路由算法和确定性路由算法在3D-Mesh网络上的性能。在每个结点具有独立的出错概率的模型下,提出的方法使得能够严格地推导出路由算法的成功概率,从而能够对算法进行分析和比较。研究结果表明,自适应路由算法具有明显的优势。一方面,自适应路由算法基于局部信息而变得高效;另一方面,自适应路由算法对于结点出错和网络规模具有更好的健壮性,而使其具有更高的成功概率。

无线Mesh网络先验式多树路由协议的研究与NS-3仿真

针对无线Mesh网络,提出一种支持多路径路由的先验式多树路由协议(Proactive Multi-Tree Routing Protocol,PMTRP).通过建立先验式多树及比较积累传播时链路度量(Accumulated Airtime Link Metric,AALM),来实现在数据传输过程中的路由选择.在NS-3网络仿真环境下实现PMTRP路由协议,将其与IEEE802.11s协议中缺省路由协议HWMP进行对比,证明PMTRP路由协议拥有更好的网络性能.

3-维Mesh网络容错性的概率分析研究

1引言 在众多的并行计算机系统的互联网络模型中,Mesh网络是研究者们研究得较早的,并且现在仍然是最为重要的和最有吸引力的网络模型之一.

基于3D-Tabu禁忌搜索的广域环境MESH网络节点部署优化算法研究

受限于广域环境的特殊三维地形及其大覆盖面积,需要一个能够基于三维地理广域场景的节点智能化部署方案。本文结合WiFi MESH网络、动态组网算法等知识,基于广域三维山区环境,提炼出数学模型,并运用MESH网络和启发式搜索算法的思想,在满足最小建设成本、最大覆盖率以及最优网络服务质量三个限制条件综合最优的前提下,提出了一种基于三维禁忌搜索算法的多目标优化节点部署方法。此外,还提出了一种可以针对不同应用场景的"加权求和"综合评价机制。仿真实验结果表明,提出的三维禁忌搜索算法可有效获得满足约束条件的优化部署方案;通过对加权系数的分析验证了评价机制的科学优化程度。此外,本文提出的搜索算法可以根据不同的应用场景获得一个最优化的智能基站部署方案,推动了智能基站自动部署规划在广域场景中的应用。

A study on 3-D velocity structure of crust and upper mantle in Sichuan -Yunnan region, China

Based on the first arrival P and S data of 4 625 regional earthquakes recorded at 174 stations dispersed in the Yunnan and Sichuan Provinces, the 3-D velocity structure of crust and upper mantle in the region is determined, incorporating with previous deep geophysical data. In the upper crust, a positive anomaly velocity zone exists in the Sichuan basin, whereas a negative anomaly velocity zone exists in the western Sichuan plateau. The boundary between the positive and negative anomaly zones is the Longmenshan fault zone. The images of lower crust and upper mantle in the Longmenshan fault, Xianshuihe fault, Honghe fault and others show the characteristic of tectonic boundary, indicating that the faults likely penetrate the Moho discontinuity. The negative velocity anomalies at the depth of 50 km in the Tengchong volcanic area and the Panxi tectonic zone appear to be associated with the temperature and composition variations in the upper mantle. The overall features of the crustal and the upper mantle structures in the SichuanYunnan region are the lower average velocity in both crust and uppermost mantle, the large crustal thickness variations, and the existence of high conductivity layer in the crust or/and upper mantle, and higher geothermal value. All these features are closely related to the collision between the India and the Asia plates. The crustal velocity in the SichuanYunnan rhombic block generally shows normal value or positive anomaly, while the negative anomaly exists in the area along the large strike-slip faults as the block boundary. It is conducive to the crustal block side-pressing out along the faults. In the major seismic zones, the seismicity is relative to the negative anomaly velocity. Most strong earthquakes occurred in the upper-mid crust with positive anomaly or normal velocity, where the negative anomaly zone generally exists below.

Three-Dimensional Dynamic Based Borrowing Scheme for Wireless Cellular Networks

Mobility metrics of wireless networks such as link availability, number of neighboring nodes, link duration, link state, and link stability make it difficult to provide a node with quality of services guarantee. In previous research on Quality of Service (QoS) for cellular networks especially for handling handoff connections, the design was based on a flat 2D hexagon cells. However, in reality Base Station antenna coverage is in a 3D space and there exists a blind spot;the area which is just above and bellow the radiated antenna. In this paper we introduce the concept of Blind Spot (BS) in which there is no signals to initiate a call or accepting a handoff one. In BS, the signal power equal zero. Even if there is enough bandwidth to initiate or accept a handoff call, it will be blocked or dropped respectively. We present an implementation of Static Borrowing Scheme (SBS) and we extend the dynamic-rate based borrowing scheme [1] into 3-Dimentional structure and call it 3-Dimensional Dynamic Based Borrowing Scheme (3D DBBS). The proposed new technique for resource sharing is to ensure the continuity for both originating and handoff connections in 3-D cellular networks based on Dynamic-Based Borrowing Scheme (3D BBS). This technique aims to minimize the blocking probability of the originating calls by minimizing the dropping probability of the handoff requests and maximizing the channel utilization. The results revealed that 3D DBBS outperformed the static based schemes by 5% on average even when the blind spot of the base station antenna is taken into consideration. When moving to a 3D space, the results of the simulation showed the 3D DBBS outperformed the static scheme by 2% on average. As a result, considering nodes in a 3D space will have better QoS guarantee as the blocking and dropping probabilities are decreased. Thus, the bandwidth utilization is increased.

三维Mesh网络容错路由算法及其概率分析

基于三维Mesh网络中k-Mesh子网连通的概念提出一个简单的基于局部信息和分布式的容错路由算法,并对其容错性进行概率分析.假设每个结点具有独立的出错概率,推导出路由算法成功返回由正确结点组成的路径的概率.结果表明即使三维Mesh网络上非常简单的路由算法也有相当高的成功概率.算法的时间复杂性是线性的,所构造的路由路径长度非常接近两点间的最优路径长度.另外,基于k-Mesh子网容错模型提出的容错路由算法是基于局部信息的和分布式的,因而具有很好的实际意义.

On Fault Tolerance of 3-Dimensional Mesh Networks

In this paper, the concept of k-submesh and k-submesh connectivity fault tolerance model is proposed. And the fault tolerance of 3-D mesh networks is studied under a more realistic model in which each network node has an independent failure probability. It is first observed that if the node failure probability is fixed, then the connectivity probability of 3-D mesh networks can be arbitrarily small when the network size is sufficiently large. Thus, it is practically important for multicomputer system manufacturer to determine the upper bound for node failure probability when the probability of network connectivity and the network size are given. A novel technique is developed to formally derive lower bounds on the connectivity probability for 3-D mesh networks. The study shows that 3-D mesh networks of practical size can tolerate a large number of faulty nodes thus are reliable enough for multicomputer systems. A number of advantages of 3-D mesh networks over other popular network topologies are given. Compared to 2-D mesh networks, 3-D mesh networks are much stronger in tolerating faulty nodes, while for practical network size, the fault tolerance of 3-D mesh networks is comparable with that of hypercube networks but enjoys much lower node degree.

故障三维Mesh网络中的容错路由

该文在k—Mesh子网连通概念的基础上提出了三维Mesh网络中局部k—Mesh子网弱连通的概念，证明了局部k—Mesh子网弱连通的三维Mesh网络存在全局连通性。基于局部k—Mesh子网弱连通的三维Mesh网络提出了单播、广播容错路由算法。这些算法提高了容错能力且是基于局部信息的，因而具有很好的实际意义。

ALGORITHMS FOR TETRAHEDRAL NETWORK(TEN) GENERATION

The Tetrahedral Network(TEN) is a powerful 3-D vector structure in GIS, which has a lot of advantages such as simple structure, fast topological relation processing and rapid visualization. The difficulty of TEN application is automatic creating data structure. Although a raster algorithm has been introduced by some authors, the problems in accuracy, memory requirement, speed and integrity are still existent. In this paper, the raster algorithm is completed and a vector algorithm is presented after a 3-D data model and structure of TEN have been introducted. Finally, experiment, conclusion and future work are discussed.

轨道交通环境下无线MESH网络中AODV协议的改进与仿真

AODV协议有许多明显的缺陷,广播控制信息严重增加了网络开销就是其中之一。针对这一缺陷,本课题对AODV协议进行了一些改进,提出了基于主动网关发现算法的AODV协议(PGD_AODV)。通过NS-3网络模拟器进行仿真,结果表明PGD_AODV协议相较传统AODV协议在同样的端到端时延水平下,提高了网络吞吐量,降低了丢包率。

Synthesis and Crystal Structure of a Novel Three-dimensional Manganese(Ⅱ) Coordination Polymer:[Mn(pdc)]_n (pdc=Pyridine-2,4-dicarboxylate)

A novel manganese（H） coordination polymer [Mn（pdc）]n （pdc = pyridine-2,4- dicarboxylate） has been synthesized under hydrothermal conditions. The crystal is of monoclinic, space group P211n with a = 6.506（4）, b = 9.392（6）, c = 11.217（7） A, β = 105.650（12）°, V= 660.0（7）A3, Z = 4, Mr = 220.04, Dc = 2.215 g/cm3,μ = 1.971 mm-1, F（000） = 436, Rint = 0.0345, R = 0.0360 and wR = 0.0778 for 1259 observed reflections with I 〉 2σ（I）. In the structure, the Mn（Ⅱ） atom is coordinated in a distorted octahedral arrangement by one pyridine N and five carboxylate O atoms from five pdc ligands, each of which coordinates to five Mn atoms to propagate a three-dimensional layered framework.

Multimodality image registration and fusion using neural network

Multimodality image registration and fusion are essential steps in building 3-D models from remotesensing data. We present in this paper a neural network technique for the registration and fusion of multimodali-ty remote sensing data for the reconstruction of 3-D models of terrain regions. A FeedForward neural network isused to fuse the intensity data sets with the spatial data set after learning its geometry. Results on real data arepresented. Human performance evaluation is assessed on several perceptual tests in order to evaluate the fusionresults.

3-D Shape Measurement of Complex Objects by Combining Color-Coded Fringe and Neural Networks

A new approach for three dimensional (3-D) shape measurement was proposed based on colorcoded fringe and neural networks. By applying the phase-shift technique to fringe projection, point clouds were generated with high spatial resolution and limited accuracy. The picture element correspondence problem was solved by using projected color-coded fringes with different orientations. Once the high accurate corresponding points were decided, high precision dense 3-D points cloud was calculated by the well trained net. High spatial resolution can be obtained by the phase-shift technique and high accuracy 3-D object point coordinates are achieved by the well trained net, which is not dependent on the camera model and will work for any type of camera. Some experiments verify the performance of this method.

A Secure Communication Framework for Drone Swarms in Autonomous Surveillance Operations

Drones have become indispensable tools in various domains, from surveillance and environmental monitoring to disaster response and communication relay. However, their growing use in critical missions necessitates robust security measures to protect against potential threats and ensure the integrity of operations. This research presents a novel secure architecture for a swarm of drones deployed on surveillance missions. Leveraging a reliable foundation established through Delaunay triangulation for communication among drones, this work introduces advanced security protocols to enhance the protection and integrity of the network. The architecture employs a mesh network topology connecting six drones, each configured for specific surveillance tasks, including perimeter monitoring, area scanning, thermal imaging, traffic observation, communication relay, and incident response. The mesh network design ensures extended coverage, redundancy, load balancing, and self-configuration, significantly improving reliability and resilience. Security validation was conducted using GNS3 and Ettercap, simulating various vulnerability scenarios. Comparative performance analysis between a classic drone network and the proposed secure mesh network demonstrates superior traffic management and robustness against potential attacks. The results underscore the architecture’s suitability for secure and reliable operations in critical surveillance environments.

一种三度网孔的性能分析

提出了一种新的互连网络模型,它可看作由普通网孔的每个结点删去一条边而产生.文中讨论了这种新式网孔的拓扑性能,并给出了有效的广播算法.

Deep 3D mesh watermarking with self-adaptive robustness

Robust 3D mesh watermarking is a traditional research topic in computer graphics,which provides an efficient solution to the copyright protection for 3D meshes.Traditionally,researchers need manually design watermarking algorithms to achieve suffcient robustness for the actual application scenarios.In this paper,we propose the first deep learning-based 3D mesh watermarking network,which can provide a more general framework for this problem.In detail,we propose an end-to-end network,consisting of a watermark embedding sub-network,a watermark extracting sub-network and attack layers.We employ the topology-agnostic graph convolutional network(GCN)as the basic convolution operation,therefore our network is not limited by registered meshes(which share a fixed topology).For the specific application scenario,we can integrate the corresponding attack layers to guarantee adaptive robustness against possible attacks.To ensure the visual quality of watermarked 3D meshes,we design the curvature consistency loss function to constrain the local geometry smoothness of watermarked meshes.Experimental results show that the proposed method can achieve more universal robustness while guaranteeing comparable visual quality.