基于并行BP神经网络的路由查找算法

结合Bloom-filter算法和并行反向传播神经网络,提出了一种新的基于并行神经网络的路由查找算法(BFBP)。该算法满足路由查找的需求,只需学习路由条目的网络ID,且易于扩展到IPv6地址查询。研究结果表明,相比于己有的神经网络路由查找方法,该算法需要学习的条目数平均减少了520倍,提高了学习效率,为神经网络应用于路由查找创造了有利条件。     

TREE: Routing strategy with guarantee of QoS for industrial wireless sensor networks

As considerable progress has been made in wireless sensor networks (WSNs), we can expect that sensor nodes will be applied in industrial applications. Most available techniques for WSNs can be transplanted to industrial wireless sensor networks (IWSNs). However, there are new requirements of quality of service (QoS), that is, real‐time routing, energy efficiency, and transmission reliability, which are three main performance indices of routing design for IWSNs. As one‐hop neighborhood information is often inadequate to data routing in IWSNs, it is difficult to use the conventional routing methods. In the paper, we propose the routing strategy by taking the real‐time routing performance, transmission reliability, and energy efficiency (TREE, triple R and double E) into considerations. For that, each sensor node should improve the capability of search range in the phase of data route discovery. Because of the increase of available information in the enlarged search range, sensor node can select more suitable relay node per hop. The real‐time data routes with lower energy cost and better transmission reliability will be used in our proposed routing guideline. By comparing with other routing methods through extensive experimental results, our distributed routing proposal can guarantee the diversified QoS requirements in industrial applications. Copyright © 2012 John Wiley & Sons, Ltd.     

自组网内的延迟限制QoS路由算法研究

介绍了自组网内的延迟限制 ＱｏＳ（Ｑｕａｌｉｔｙ－ｏｆ－Ｓｅｒｖｉｃｅ）路由算法，并对它进行了仿真。该算法可在网络状态信息不精确的情况下，同时并行寻找多条路径，以优化路径选择。当节点移动、离开、加入时，引入容错机制，以便于路径保持。通过仿真可以看出，该算法在适度的寻路代价下，可以得到较高的呼叫接收率。     

校园网中的三层交换和虚拟局域网技术

讨论了局域网技术的发展，校园网采用虚拟局域网技术的原因和必要性，虚拟局域网的概念、分类和特点以及三层交换和路由的区别。并用一些例子介绍了在校园网中利用三层交换和基于端口的虚拟局域网技术的网络配置方法。     

A survey and comparison of wormhole routing techniques in a meshnetworks

The growing demand for high processing power in various scientific and engineering applications has made multiprocessing architectures increasingly popular. These multiprocessing systems consist of processing elements or nodes which are connected together by interconnection networks in various topologies. One of the design methodologies used for parallel machines has fed to the development of distributed memory message-passing concurrent computers, commonly known as multicomputers. They consist of many processing nodes that interact by sending messages (containing both data and synchronization information) over a communication link, between nodes. Thus, efficient communication in multicomputers is one of the important research areas in parallel computing today, and it depends on the underlying scheme for routing. For this reason it is essential to know which routing techniques are suitable and practical. Although an extremely wide number of routing algorithms have been proposed and implemented in hardware and software, it is difficult for the designer of a multicomputer to choose the best routing algorithm given a particular architectural configuration. In an attempt to overcome this difficulty, we present a survey and comparison of wormhole routing techniques in mesh interconnection networks. The mesh topology is important because of its scalability. Moreover, it has already been implemented in many commercial multicomputers     

多芯片组件的布线

布线是多芯片组件（ＭＣＭ）ＣＡＤ中的一个关键步骤，由于ＭＣＭ的封装密度很高，因此，因此，其布线问题也较传统的ＩＣ或ＰＣＢ布线更为困难，指出了ＭＣＭ布线中存在的问题，介绍了当前用于ＭＣＭ布线的几种方法，着重讨论了ＳＬＩＣＥ布线法和４通孔布线法，对这几种方法进行了比较，４通孔布线法可直接产生详细布线结果，有利于节省成本和提高布线效率。     

Energy Efficiency Routing with Node Compromised Resistance in Wireless Sensor Networks

For the energy limited wireless sensor networks, the critical problem is how to achieve the energy efficiency. Many attackers can consume the limited network energy, by the method of capturing some legal nodes then control them to start DoS and flooding attack, which is difficult to be detected by only the classic cryptography based techniques with common routing protocols in wireless sensor networks (WSNs). We argue that under the condition of attacking, existing routing schemes are low energy-efficient and vulnerable to inside attack due to their deterministic nature. To avoid the energy consumption caused by the inside attack initiated by the malicious nodes, this paper proposes a novel energy efficiency routing with node compromised resistance (EENC) based on Ant Colony Optimization. Under our design, each node computes the trust value of its 1-hop neighbors based on their multiple behavior attributes evaluation and builds a trust management by the trust value. By this way, sensor nodes act as router to achieve dynamic and adaptive routing, where the node can select much energy efficiency and faithful forwarding node from its neighbors according to their remaining energy and trust values in the next process of data collection. Simulation results indicate that the established routing can bypass most compromised nodes in the transmission path and EENC has high performance in energy efficiency, which can prolong the network lifetime.     

Linux系统策略性路由查找算法的分析与改进

文中结合linux2.4版的源代码,分析了Linux策略性路由查找的方法,并指出该方法的一些缺陷,提出一种通过应用DIR-24-8-INT算法来提高路由查找效率以及避免冲突漏洞的方法.     

Performance issues in the design of dynamically controlledcircuit-switched networks

The evolution of circuit-switched networks is analyzed with respect to the functional innovations that allowed for new traffic controls. The technical alternatives for routing techniques and their integration with congestion and flow control are considered. The performance of dynamically controlled networks is analyzed in the framework of research done at the Centre National d'Etudes des Telecommunications (CNET) together with studies carried out in other research laboratories. Comparisons are made of dynamic routing versus fixed hierarchical routing and time-dependent routing versus adaptive routing. For adaptive routing, centralized and isolated methods are compared. The benefits of advanced control methods are summarized     

A survey and analysis of multipath routing protocols in wireless multimedia sensor networks

The main objective of this research is to conduct a performance analysis of various multipath routing protocols in wireless multimedia sensor networks for the efficient transmission of the image, audio and video data. To provide efficient routing for the large sized multimedia content, various multipath routing protocols such as energy-aware routing, QoS based routing and geographical routing methods are analyzed. In this analysis, the efficient routing techniques including geographical routing techniques such as GPSR, DGR, PW-DGR presented for wireless multimedia sensor networks are studied and the performance of each technique is evaluated to determine the efficient multipath routing technique. Comparisons are made for evaluated protocols and it is proved that the PW-DGR provides better routing performance for the multimedia data. The findings of the research also show that the PW-DGR method efficiently overcomes the routing problems such as energy bottleneck problem, energy-hole, reduced network lifetime and high delay in packet transmission.     

双环网络并行最优寻径策略及宽直径的研究

将双环网络拓扑结构映射到平面直角坐标系,基于直角坐标系研究双环网络的并行最优寻径方法。首先研究坐标轴上节点及其等价节点的分布规律,建立等价节点分布模型,得出基于等价节点的并行最优寻径策略及双环网络宽直径求解方法。在双环网络最小路径图（MDD）的基础上拓展,提出并行路径图（PDD）的设计思路并予以仿真实现,基于PDD图,设计两点间2条内点不交的并行最短路径的快速求解方法。仿真实验表明,宽直径分布随步长的变化呈现一定波动性,相对于传统的寻径方式,并行最优寻径明显提高了网络传输效率。     

自动布线的并行化

并行自动布线是在并行处理技术飞速发展的基础上提出的一项提高布线速度的有效措施，值得研究与探讨。文章从串行布线过程入手，研究布线的并行性，分析了主要的并行布线策略，并给出了我们的实验结果以及今后的研究方向。     

GGNMOS叉指宽度与金属布线对ESD防护性能的影响

栅接地NMOS(GGNMOS)器件具有与CMOS工艺兼容的制造优势,广泛用于静电放电(ESD)保护。鉴于目前GGNMOS的叉指宽度、叉指数及金属布线方式等外部因素对ESD鲁棒性的影响研究较少,设计了不同的实验对此开展对比分析。首先,基于0.5μm Bipolar-CMOS-DMOS(BCD)工艺设计并制备了一系列GGNMOS待测器件;其次,通过传输线脉冲测试,分析了叉指宽度与叉指数对GGNMOS器件ESD失效电流(It2)的影响,结果表明,在固定总宽度下适当减小叉指宽度有利于提高It2;最后,比较了平行式与交错式两种金属布线方案对It2的影响,结果表明,平行式金属布线下GGNMOS器件的ESD鲁棒性更好。     

An overview of routing techniques for road and pipeline monitoring in linear sensor networks

Wireless sensor networks are often utilized in different kinds of applications like healthcare, military operations, border security, road and pipeline monitoring etc. The majority of these applications use fixed network topology and place sensors in a linear form defined as a linear sensor network (LSN). The Linear sensor networks have gained much attraction of the researchers due to their several positive aspects including easy deployment for linear structures and robustness in different environments. The details about the LSN models and routing techniques are mostly overlooked in the previous studies. This study, therefore, explores the concept of LSNs models and routing techniques in various types of applications. Besides, it highlights the LSN design, classification, challenges and issues as well. The core motivation for this study is to summarize the types of LSNs and analyze their routing parameters i.e. energy efficiency, reliability, route discovery, route maintenance, coverage, delay, heterogeneity and mobility of sensors. Moreover, recent LSN techniques are classified according to the similarities of routing procedures. Further, this study has investigated and discussed various proposed solutions, future directions and opportunities that would serve as a milestone for other researchers so that they could explore further the LSN routing techniques more deeply.     

Block-Interlaced LDPC Decoders With Reduced Interconnect Complexity

Two design techniques are proposed for high-throughput low-density parity-check (LDPC) decoders. A broadcasting technique mitigates routing congestion by reducing the total global wirelength. An interlacing technique increases the decoder throughput by processing two consecutive frames simultaneously. The brief discusses how these techniques can be used for both fully parallel and partially parallel LDPC decoders. For fully parallel decoders with code lengths in the range of a few thousand bits, the half-broadcasting technique reduces the total global wirelength by about 26% without any hardware overhead. The block interlacing scheme is applied to the design of two fully parallel decoders, increasing the throughput by 60% and 71% at the cost of 5.5% and 9.5% gate count overhead, respectively.     

On the performance analysis of the minimum-blocking and bandwidth-reallocation channel-assignment (MBCA/BRCA) methods for quality-of-service routing support in mobile multimedia ad hoc networks

Quality-of-service (QoS) routing is the key to support multimedia services in wireless multihop networks. The goal of QoS routing is to find satisfactory paths that support the end-to-end QoS requirements of the multimedia flows. Previous work has demonstrated a framework for supporting QoS routing in mobile ad hoc networks, where two novel mechanisms for dynamic channel assignment, called the minimum-blocking and bandwidth-reallocation channel-assignment (MBCA/BRCA) algorithms, were proposed. MBCA/BRCA are on-demand channel assignment methods that reactively provide a differentiated service treatment to multimedia traffic flows at the link level using novel techniques for end-to-end path QoS maximization. Efficient QoS routing is then accomplished by giving the routing mechanism access to QoS information, thus coupling the coarse grain (routing) and fine grain (congestion control) resource allocation. In this paper, the specifics and individual mechanisms of the MBCA/BRCA algorithms are presented, whereas their effectiveness and the manner in which they interact in order to contribute to the overall protocol performance is examined and documented. The system performance is studied through simulations experiments under various QoS traffic flows and network scenarios. The protocol's behavior and the changes introduced by variations on some of the mechanisms that make up the protocol is further investigated. As demonstrated, the MBCA/BRCA methods are able to increase system's aggregate traffic by 2.8 Kb/s, on average, comparing to a non-MBCA/BRCA dynamic channel-allocation scheme.     

无线传感器网络基于分簇路由的数据融合研究

无线传感器网络节点资源有限,所以需要采用有效的路由算法与数据融合机制来节省资源,延长网络寿命,提升数据采集效率。LEACH是经典分簇路由协议,针对其在簇头选择机制、数据融合以及簇头与基站通信的路由方面的不足,提出了几点改进方法,在簇头选择的算法中加入了能量控制条件,簇头与基站的路由改为更适合数据融合的多跳反向组播树,并基于信息熵提出了有效数据融合机制。仿真实验表明,改进之后的算法比原LEACH算法更有效地利用了节点资源,延长了网络生存时间。     

Betweenness centrality based connectivity aware routing algorithm for prolonging network lifetime in wireless sensor networks

Network lifetime is the key design parameter for wireless sensor network protocols. In recent years, based on energy efficient routing techniques numerous methods have been proposed for enhancing network lifetime. These methods have mainly considered residual energy, number of hops and communication cost as route selection metrics. This paper introduces a method for further improvement in the network lifetime by considering network connectivity along with energy efficiency for the selection of data transmission routes. The network lifetime is enhanced by preserving highly connected nodes at initial rounds of data communication to ensure network connectivity during later rounds. Bassed on the above mentioned concept, a connectivity aware routing algorithm: CARA has been proposed. In the proposed algorithm, connectivity factor of a node is calculated on the basis of Betweenness centrality of a node and energy efficient routes are found by using fuzzy logic and ant colony optimization. The simulation results show that the proposed algorithm CARA performs better than other related state-of-the-art energy efficient routing algorithms viz. FML, EEABR and FACOR in terms of network lifetime, connectivity, energy dissipation, load balancing and packet delivery ratio.     

A new QoS routing algorithm based on self-organizing maps for wireless sensor networks

For the past ten years, many authors have focused their investigations in wireless sensor networks. Different researching issues have been extensively developed: power consumption, MAC protocols, self-organizing network algorithms, data-aggregation schemes, routing protocols, QoS management, etc. Due to the constraints on data processing and power consumption, the use of artificial intelligence has been historically discarded. However, in some special scenarios the features of neural networks are appropriate to develop complex tasks such as path discovery. In this paper, we explore and compare the performance of two very well known routing paradigms, directed diffusion and Energy-Aware Routing, with our routing algorithm, named SIR, which has the novelty of being based on the introduction of neural networks in every sensor node. Extensive simulations over our wireless sensor network simulator, OLIMPO, have been carried out to study the efficiency of the introduction of neural networks. A comparison of the results obtained with every routing protocol is analyzed. This paper attempts to encourage the use of artificial intelligence techniques in wireless sensor nodes.