煤矿井下ZigBee无线传感器网络路由协议的研究

文章介绍了无线传感器网络的发展及其特点,在分析比较了目前流行的几种无线传感器网络路由协议的基础上,结合煤矿井下掘进工作面的特点和需求,提出了一种适用于掘进工作面的网状拓扑结构的ZigBee无线传感器网络的路由算法,并从路由建立、路由维护、路由恢复等方面进行了详细描述。该路由算法对其它具有ZigBee网状拓扑结构的系统具有一定的参考价值。     

Degree-Optimal Routing for P2P Systems

We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency of randomized networks—e.g. optimal average path length O(log ² n/δlog δ) with δ degree—with the programmability and startup efficiency of a uniform overlay—that is, a deterministic system in which the overlay network is transitive and greedy routing is optimal. It is known that Ω(log n) is a lower bound on the average path length for uniform overlays with O(log n) degree (Xu et al., IEEE J. Sel. Areas Commun. 22(1), 151–163, 2004). Our work is inspired by neighbor-of-neighbor (NoN) routing, a recently introduced variation of greedy routing that allows us to achieve optimal average path length in randomized networks. The advantage of our proposal is that of allowing the NoN technique to be implemented without adding any overhead to the corresponding deterministic network. We propose a family of networks parameterized with a positive integer c which measures the amount of randomness that is used. By varying the value c, the system goes from the deterministic case (c=1) to an “almost uniform” system. Increasing c to relatively low values allows for routing with asymptotically optimal average path length while retaining most of the advantages of a uniform system, such as easy programmability and quick bootstrap of the nodes entering the system. We also provide a matching lower bound for the average path length of the routing schemes for any c. This work was partially supported by the Italian FIRB project “WEB-MINDS” (Wide-scalE, Broadband MIddleware for Network Distributed Services), .     

基于延迟合并嵌入的带障碍的时钟树布线算法

提出一种在带障碍情况下,基于延迟合并嵌入方法的时钟树构建算法,并在时钟树构造过程中引入了轨迹图以保证布线可以绕过障碍．该算法以已知障碍为布线约束,首先自底向上计算时钟树内部节点的可能位置,然后自顶向下确定每个节点的确切位置．实验结果表明,该算法能够正确、有效地实现有障碍存在时的时钟树布线,线长优化率超过7％．     

无线传感器网络路由协议及安全问题研究

无线传感器网络在军事和民用领域得到广泛的应用。由于传感器节点的资源有限以及通信的开放性使得其安全性显得尤为重要。出于对能量消耗的考虑,目前的路由协议设计得比较简单,作者对路由的安全性能以及可能受到的攻击进行分析,并给出相应的防范对策。     

Efficient realization of frequently used bijections on cube-connected cycles

CCC has lower hardware complexity than hypercube and is suited for current VLSI technology.LC-permutations are a large set of important permutations frequently used in various parallel computations.Existing routing algorithms for CCC cannot realize LC-permutations without network conflict.We present an algorithm to realize LC-permutations on CCC.The algorithm consists of two periods of inter-cycle transmissions and one period of inner-cycle transmissions.In the inter-cycle transmissions the dimensional links of CCC are used in a “pipeline” manner and in the inner-cycle transmissions the data packets are sorted by a part of its destination address.The algorithm is fast (O(log2N)) and no conflict will occur.     

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.     

A mathematical model for vehicle routing problem under endogenous uncertainty

In this study, a multistage stochastic programming (SP) model is presented for a variant of single-vehicle routing problem with stochastic demands from a dynamic viewpoint. It is assumed that the actual demand of a customer becomes known only when the customer is visited. This problem falls into the category of SP with endogenous uncertainty and hence, the scenario tree is decision-dependent. Therefore, nonanticipativity of decisions is ensured by conditional constraints making up a large portion of total constraints. Thus, a novel approach is proposed that considerably reduces the problem size without any effect on the solution space. Computational results on some test problems are reported.     

矿井采空区无线传感器网络路由协议研究

研究和设计了一种适用于煤矿采空区的无线传感器网络路由机制。首先对LEACH协议的簇头选举机制进行了改进,在计算阀值时添加剩余能量参数,然后采用改进后的协议和多径路由机制设计了煤矿采空区无线传感器网络路由算法,最后通过NS-2仿真平台进行了实验。实验结果表明,改进后的协议与原协议相比,提高了网络中节点的能量有效性,延长了网络的生命周期。     

“主导·主体”教学模式在配置路由选择协议实验中的应用

针对多数计算机网络实验课以学生为中心的实际情况,在分析其缺点的基础上,文章提出将"主导.主体"教学模式应用于计算机网络原理实验课中,并以配置路由选择协议为实验案例,探讨"主导.主体"教学模式在其中的应用,为该教学模式在计算机网络其他实验中的应用提供借鉴意义。     

求解最小MPR集的蚁群算法与仿真

在分析利用贪心策略启发式算法求解最小MPR集的缺陷基础上,引入蚁群算法对最小MPR集进行求解.首先定义了节点及其出度和入度,并根据节点的出度和入度限制,给出了求解最小MPR集的蚁群算法.然后,对蚁群算法的3种模型Ant-Cycle、Ant-Quantity和Ant-Density加以改进,并对这3种改进模型的收敛性进行分析与实验.实验采用了圆形分布和理想均匀分布2种拓扑结构,前者实验结果表明Ant-Cycle模型的收敛速度较快,后者结果表明Ant-Cycle模型和Ant-Density模型各有优势.因此,最小MPR集的蚁群算法的模型选择需依据拓扑结构确定.最后,使用OPNET基于该算法对数据链的点对多点的点名呼叫工作方式进行模拟仿真,选择的统计量显示了节点的连通性和数据一致性,验证了该算法的合理性.