一个基于AODV的渐进式分簇路由策略

在AODV的基础上提出了一种渐进式的分簇路由协议(AODV-clustering),协议在开始时以AODV方式工作,并逐渐演变为一种分簇式的路由策略。仿真结果表明,协议既保持了AODV的优点,又提高了网络的可扩展性能,特别是在网络的节点数较多时,性能明显优于AODV。     

基于OLSR的大规模组网路由

随着战场无线自组网的通信规模增大，平面网络架构由于开销太大而不适合，需要采用分簇网络架构。常用的簇内路由协议是优化的链路状态路由（Optimized Link State Routing,OLSR），但是OLSR的多点中继（Multi Point Relay,MPR）选举过程有冗余，因此运用统一连通支配集（Unifying Connected Dominating Set,UCDS）算法来进行MPR选举，选出更好的MPR集。常用的簇间路由协议是群首网关交换路由（Clusterhead Gateway Switch Routing,CGSR）,CGSR簇间业务必须先经过簇首，具有健壮性差和负载不均衡的缺点。通过簇首广播全网簇间邻居关系和簇内成员信息，簇间业务不用经过簇首，可以简便地获得簇间路由。对基于OLSR的分簇路由协议和平面下标准OLSR进行仿真对比，结果表明分簇网络架构在大规模组网情况下能够大幅降低网络开销。     

无线传感器网络簇间节能路由算法

针对基于分簇网络的无线传感器网络簇间路由协议,让簇首和Sink节点直接通信或通过簇首节点转发数据造成能耗不均,节点过早死亡的缺陷。文中提出一种基于网关节点模型的无线传感器网络簇间路由算法,通过簇头与网关节点、网关节点自身建立虚电路,制定存储转发路由,将数据转发给Sink节点。并引入延时等待机制,增强了簇间信息的融合度,此算法适用于大规模无线传感器网络,有良好的可扩展性。仿真表明在能量节省等性能上与传统簇间路由算法相较有较大提高。     

基于双簇头非均匀分簇的LEACH协议的改进

在无线传感器网络中的LEACH协议是一种自适应聚类路由算法．由于LEACH协议存在着无法控制簇首在网络中的分布位置、簇首选择方式限制条件不够等缺点导致能量消耗太大．基于簇头能量限制和双簇头路由方式,对LEACH协议进行了改进,设计了一种降低能耗的双簇头非均匀分簇路由协议．双簇头非均匀分簇路由协议采用NS2进行网络仿真实验,通过仿真结果的分析以及与LEACH协议的对比,证明双簇头非均匀分簇路由协议有效提高了网络能耗的均衡性．     

基于数据融合的无线传感器网络路由算法

在分簇协议LEACH和链状协议PEGASIS的基础上,提出一种新的基于数据融合的分簇路由算法.簇首节点采用多跳方式传输数据,并根据周围节点的密集程度构造不同大小的簇;簇内节点计算上行和下行节点构造数据融合树,采用时分复用调度算法进行多跳路由.NS2仿真结果表明该路由算法均衡了各个节点的能量消耗,延长了网络存活时间,并降低了网络延迟.     

WSN中能量有效分簇多跳路由算法

针对现有无线传感器网络(WSN)分簇路由算法存在的能耗不均衡问题,提出一种能量有效分簇多跳路由算法,该算法包括两个方面:一是选举簇首时引入簇内平均剩余能量因子,根据上一轮结束后簇内各节点剩余能量和簇内节点的平均剩余能量的比值更新簇首在所有节点中所占的百分比;二是要求簇首根据MTE多跳路由协议与基站通信,从而均衡WSN整...     

基于剩余能量和睡眠控制的改进LEACH算法

无线传感器网络（WSN）路由协议研究的一个重要的目标是如何在有限的能源下降低整个网络的能耗,提高网络的生存时间。以分簇路由协议LEACH为研究基础,提出了一种改进算法。该算法改进了簇首选择规则,引入协调件协议算法,通过在成簇阶段降低剩余能量低的节点被选择成为簇首的概率,在稳定运行阶段使簇首节点尽可能多的保持睡眠状态,从而降低了网络能耗。仿真结果表明,与原LEACH算法相比,改进的算法能够明显地延长网络生存时间。     

一种基于簇首成链的分层分簇路由协议

基于LEACH和PEGASIS算法,设计了一种基于簇首成链的分层分簇路由协议CHCRP(A Chain-cluster Based Hierarchical Clustering Routing Protocol).CHCRP算法把网络分成多个层次,对LEACH协议的簇首选取机制进行改进,采用一跳竞争机制使得簇首分布均匀.为了减少链式路由的时间延迟,簇首间通过分层形成"主链"和"从链"多跳通信.仿真结果表明该算法能够均衡簇首间通信能耗,延长无线传感器网络生存周期并且降低了数据传输的滞后性.     

无线传感器网络能量均衡分簇路由协议

LEACH是无线传感器网络(Wireless Sensor Network,WSN)中一种经典的分层式路由协议,在此基础上通过对LEACH成簇算法及簇间路由的改进,提出了一种新的均衡能量消耗分簇路由协议。该协议在无线传感器网络成簇过程中充分考虑了传感器节点的能量状态,同时簇首向基站的通信采用基于能量的簇间路由。理论分析及仿真结果表明,改进的协议能够均衡传感器节点的能量消耗,有效地延长网络寿命。     

基于LEACH的改进型无线传感器网络路由算法研究

针对经典分簇路由算法LEACH在选取簇头时没有充分考虑节点剩余能量的问题,在LEACH协议的基础上,改进了簇首选择、最优簇首数和簇形成过程,提出一个自适应分布式算法,即ADCP-LEACH算法,该算法可以应用干周期性的采集数据,根据每个节点竞选簇头时的阈值不同,让剩余能量大的节点当选簇头的概率更大.NS2仿真实验表明,改进的协议有效延长了网络的存活时间,性能优于LEACH协议.     

基于选播机制的无线Mesh网络网关选取路由算法

提出了一种基于选播的无线Mesh网络网关选取模型和相应的网关选取路由算法。该模型将所有网关节点抽象成一个选播组,将所有的网关节点组成一个网关树,实现对网关组成员的管理与维护。网关选取路由算法以时延为度量,通过有效的选播机制自适应地查找"最优"网关节点为客户节点服务,以提供响应最快的高质量的因特网接入服务。实验结果表明,该算法能在合理的时间内有效地解决多网关选取问题。     

基于网关信息素更新的MANET接入Internet开销控制方法

 寻找可用网关是MANET接入Internet过程中产生开销最大的一个环节。为了有效控制接入过程中的路由开销,根据蚂蚁寻径与移动节点寻找网关的相似性,提出了一种基于网关信息素更新的接入网络开销控制算法。该算法模仿蚁群算法中信息素更新方式,运用路由应答报文中携带的信息对网关信息素进行更新。节点在寻路时根据路径上的信息素浓度、链路带宽和时延等参数计算转发概率并进行转发。通过运用NS2.29对该算法进行仿真,结果表明该算法虽然平均端到端时延略有增加,但是有效地减少了归一化路由开销,并提高了分组投递率,验证了算法的有效性。     

Multi‐topology routing based egress selection approach to achieve hybrid intra‐AS and inter‐AS traffic engineering

Hot‐potato routing is a border gateway protocol policy that selects the ‘closest’ egress router in terms of interior gateway protocol cost. This policy imposes inherent interactions between intra‐AS (Autonomous System) and inter‐AS traffic engineering. In light of this observation, we present a hybrid intra‐AS and inter‐AS traffic engineering scheme named egress selection based upon hot potato routing. This scheme involves link weight optimization, which can not only minimize the time that IP (Internet Protocol) packets travel across the network by assigning specified egress router but also balance the load among the internal links of the transit network. Egress selection based upon hot potato routing also incorporates multi‐topology routing technique to address the problem that one set of link weights might not guarantee specified egress routers. Accordingly, we formulate the link weights optimization problem using multi‐topology routing as a mixed integer linear programming model. And we present a new heuristic algorithm to make the problem tractable. Numerical results show that only a few topologies are needed to guarantee specified egress router, and maximum link utilization is also reduced. Copyright © 2014 John Wiley & Sons, Ltd.     

基于极大权的最小连通支配集启发式算法

Ad hoc无线网络中基于最小连通支配集(MCDS)的路由是一个引人瞩目的方法,文中提出了一种基于极大权的MCDS的启发式算法,确保了性能强的主机担任网关节点的角色,能更好的协调管理网络中其他的节点,从而保持MCDS的相对稳固性并为全网中的广播和路由操作提供一个高效的通信基础.仿真结果表明,该算法能在保证生成权和极大的连通支配集的同时也确保它的极小性,因此能有效地用于基于MCDS的路由设计中.     

An adaptive load-aware routing algorithm for multi-interface wireless mesh networks

In wireless mesh networks, the number of gateway nodes are limited, when the nodes access to the internet by fixed gateway node, different requirements of nodes lead to the dataflow shows heterogeneity. Many new routing metrics and algorithms existing in traditional wired networks and the Ad Hoc network, can not be directly applied to wireless mesh networks, so how to design a routing metric and algorithm which can dynamically adapt to current networks topology and dataflow changes, avoid bottleneck node, and select the most stable and least congestion link to establish a route is very important. In this paper, we presented a new dynamic adaptive channel load-aware metric (LAM) to solve the link load imbalance caused by inter-flow and inner-flow interference, designed a self-adaptive dynamic load balancing on-demand routing algorithm through extending and improving AODV routing method with the LAM, to achieve flow balance, reduce the high packet loss ratio and latency because congestion and Packet retransmission, and can increase Network Throughput.     

Proficient selection of gateway and base station by adroit algorithm in cloud‐VMesh network

Cloud computing is alluring for the vehicular mesh (VMesh) network. Cloud computing stipulates the computing resources and services on demand using the Internet. The VMesh network is a type of networking where each vehicle must not only capture and disseminate its own data but also serve as a gateway for another vehicle. The cloud‐VMesh network is a convergent technology encompassed of three key technologies, namely, vehicular mesh network, cloud computing, and networking. In this paper, we propose a new routing algorithm for cloud‐VMesh network, dubbed as adroit algorithm. The proposed adroit algorithm addresses the choosing of an optimal gateway and base station in the network layer from and to the service requesters and cloud server. The simulation study shows that the adroit algorithm augments the routing issues such as delay, packet loss, congestion and deployment cost in the cloud‐VMesh network, and it is justified based on the packet delivery ratio, average response time, routing overhead ratio, and packet collision ratio. The simulation results demonstrate that the adroit algorithm outperforms the existing protocols. Copyright © 2016 John Wiley & Sons, Ltd.     

企业级VOIP网关的硬件设计与实现

介绍了一种基于Motorola RISC处理芯片 DSP体系结构的企业级VOIP网关,该网关集成路由协议ITU G.723.1语音编解码算法、本地交换、电话接口于一体,主要解决企业级用户的本地和长途话费问题,实现本企业市话全免,本地打出长话全免,给企业节省大部分话费成本。主要介绍了该系统的硬件设计与实现。     

Multilayered Distributed Routing for Power Efficient MANET Performance

In this paper a new power efficient routing algorithm for MANETs with self-organizing and self-routing features is described and its performance analyzed in different simulation scenarios. The algorithm has the logic of a non-cooperative routing algorithm based on the evaluation of a weight parameter, the latter being a function of properties of the MANET nodes related to the nominal available power and the transmission range. A self-estimation of this weight parameter for each node is introduced in the routing process based on the status and functional history of the node. The routing is based on network layering, formation of service areas in each layer and choice of nodes from these areas to have the functionality of default gateways. The proposed algorithm, named service zone gateway prediction (SZGP), is a hybrid type of routing mechanism, incorporating pre-computed multipath hop-by-hop distributed routing, with a periodically updated hierarchical multilayered structure. The results from the simulation experiments show that the performance of the proposed SZGP algorithm in relation to the basic performance parameters such as packet delivery ratio, delay and throughput are similar to those of the well-known AODV algorithm, but in relation to power efficiency the proposed algorithm outperforms AODV significantly. This is due to the fact that such an approach reduces the overall number of broadcasts in the network and ensures a reliable and energy efficient connection by balancing the load among the nodes.