一种改进的多跳分组无线网路由协议

对于多跳分组无线网来说,路由协议非常重要.而传统的主动式路由、按需路由和混合路由由于自身的缺陷,都不能保证多跳分组无线网传输的可靠性.为了适应网络拓扑不断变化的客观环境,提高数据通信的可靠性,提出了一种相邻矩阵路由协议,它克服了传统路由协议的缺点,大大提高了多跳分组无线网的链路性能.     

无线Ad hoc 网络及其研究难点

无线Ad hoc网络作为没有基础设施的网络，在军事和民用方面具有广阔的应用前景，是目前网络研究中的热点问题。本文对无线Ad hoc网络进行了详细的论述，指出了目前研究中存在的一些难点。     

An Energy-Efficient Routing and Self-Organization Algorithm in Wireless Sensor Networks

1IntroductionAs the development of MEMStechnology,the microsensors whichintegrate manyfunctions such as sensing,signal processing and communication have been widelyused[1]. Wireless Sensor Network ( WSN) is construct-ed with hundreds to thousands of sensors and one ormore SINKs .Sensors can sense (monitor) many physi-cal signals such as sound,light ,electronics ,tempera-ture and humidity of the objects in a given region[2 ~3].Sensors transfer these signalsinto sensing data and sendsensin…     

一种改进的静态资源优化利用路由算法

提出了一种基于遗传算法的静态资源优化利用路由算法,该算法在考虑网络资源消耗的基础上,以网络负载平衡为优化目标,从而达到合理利用网络资源,增强网络生存性的目的。最后给出了仿真实验结果,并对结果进行了分析。     

物联网分布式路由中基于Beta函数的抗攻击信任管理模型

With the rapid development of Internet of Things (IoT), the issue of trust in distributed routing systems has attracted more research attention. The existing trust management frameworks, however, suffer from some possible attacks in hostile environments, such as false accusation, collusion, on-off, and conflicting behavior. Therefore, more comprehensive models should be proposed to predict the trust level of nodes on potential routes more precisely, and to defeat several kinds of possible attacks. This paper makes an attempt to design an attack-resistant trust management model based on beta function for distributed routing strategy in IoT. Our model can evaluate and propagate reputation in distributed routing systems. We first describe possible attacks on existing systems. Our model is then proposed to establish reliable trust relations between self-organized nodes and defeat possible attacks in distributed routing systems. We also propose a theoretical basis and skeleton of our model. Finally, some performance evaluations and security analyses are provided to show the effectiveness and robustness of our model compared with the existing systems.     

自组网路由协议综述

自组网路由协议用于监控网络拓扑结构变化,交换路由信息,定位目的节点位置,产生、维护和选择路由,并根据选择的路由转发数据。本文综述了自组网路由协议研究方面的一些最新工作,描述了设计自组网路由协议所面临的问题,并着重对该研究开展以来所提出的各种主要协议进行了对比、分析和分类阐述,为进一步的研究提出了新的课题。     

Implementation of depth‐based routing and its enhancement in AquaSim–Next Generation for underwater wireless sensor networks

In the last decade, underwater wireless sensor networks have been widely studied because of their peculiar aspects that distinguish them from common terrestrial wireless networks. Their applications range from environmental monitoring to military defense. The definition of efficient routing protocols in underwater sensor networks is a challenging topic of research because of the intrinsic characteristics of these networks, such as the need of handling the node mobility and the difficulty in balancing the energy consumed by the nodes. Depth‐based routing protocol is an opportunistic routing protocol for underwater sensor networks, which provides good performance both under high and low node mobility scenarios. The main contribution of our work is presenting a novel simulator for studying depth‐based routing protocol and its variants as well as novel routing protocols. Our simulator is based on AquaSim–Next Generation, which is a specialized tool for studying underwater networks. With our work, we improve the state of the art of underwater routing protocol simulators by implementing, among other features, a detailed cross‐layer communication and an accurate model of the operational modes of acoustic modem and their energy consumption. The simulator is open source and freely downloadable. Moreover, we propose a novel and completely distributed routing protocol, named residual energy–depth‐based routing. It takes into account the residual energy at the nodes' batteries to select the forwarder nodes and improve the network lifetime by providing a more uniform energy consumption among them. We compare its performance with that of depth‐based routing protocol and a receiver‐based routing protocol implementing a probabilistic opportunistic forwarding scheme.     

无线Ad Hoc网络中一种基于DSR的QoS路由协议

QoS是无线Ad Hoc网络中的一个重要问题,而QoS路由技术是解决这一问题的关键技术之一.假定无线AdHoc网络中的每个节点的MAC子层能够提供一个参量,这个参量可以量化地表示该节点的忙闲状态,在这个假设的基础上,本文提出一种以DSR路由协议为基础的改进路由,在新的路由协议中,路由请求包中增加一个参量,用这个参量来表示路由请求包所经过的所有节点的状态总和,当路由请求包到达目的节点就找到了源节点到目的节点的路径,并且可以得到每条路径的状况.通过这些信息可以使得发现的路径是状况最好的路径,从而来满足QoS.     

基于元胞自动机的无线传感器网节能路由协议

节能是设计无线传感器网路由协议首先要解决的问题.针对无线传感器网拓扑演化过程所呈现的时空动力学特性,基于源自生物学的元胞自动机理论,提出无线传感器网节能路由协议(AODV-ECA).仿真结果及分析表明,该算法能有效减少传感节点能量消耗,延长无线传感器网生存时间.     

Balancing CapEx reduction and network stability with stable routing–virtual topology capacity adjustment (SR–VTCA)

This paper investigates the merits of the SR–VTCA (stable routing–virtual topology capacity adjustment) approach as a mechanism to find a beneficial trade-off between network stability and reduction in capital expenditures (CapEx). These are two main objectives for the entities that own the optical infrastructure, such as network operators (NOs), and those also acting as Internet service providers (ISPs). The SR–VTCA scheme is a novel approach to adapt transparent optical networks to time-varying traffic by adjusting the number of lightpaths between node pairs, while keeping the IP routing unchanged. Lightpath bundling (LB) and anycast (AS) switching are combined in SR–VTCA operation to advertise lightpath additions/removals to the IP layer as mere adjustments (increments or decrements) in the capacity, allowing to keep the IP routing stable, and thus, simplifying control plane operations. On the contrary, a fully-reconfigurable (FR) network design, where IP routing can be also modified, would increase the burden in the control plane, but at a higher CapEx reduction, since the optical infrastructure is used more efficiently. In this work, we investigate the CapEx overprovision introduced by SR–VTCA with respect to a FR scheme. In order to do this, SR–VTCA planning problem is first modeled as a MILP formulation. A heuristic procedure based on traffic domination is then proposed to solve large instances of the problem. Exhaustive experiments are conducted comparing the SR–VTCA solutions obtained by the aforementioned MILP and heuristic proposal with solutions found by other optimization methods presented in the literature to solve the FR planning problem. Finally, the results show that SR–VTCA can achieve similar results to the FR case in terms of CapEx reduction, while a huge number of IP reroutings are saved by maintaining IP stability. Thus, SR–VTCA provides an advantageous balance between CapEx overprovisioning and the control plane overhead associated with IP rerouting.