基于直角Steiner树的片上网络互连算法

提出了一种基于最小直角Steiner树,在Manhattan平面上避免障碍物的互连算法,以实现片上网络中各IP核的互连.该算法在定制NoC中将Steiner树的生成算法用于互连设计.算法首先在初始阶段对有障碍两点间的边权重重新赋值,然后调用最小生成树算法,使生成的直角Steiner树总长度最小.实验表明,该算法可以使片上网络的总连线缩短.     

基于生成树的无线传感器网络分布式路由协议

在无线传感器网络中,节点具有有限的电池能量,为了延长网络的生存时间,提出了一种基于生成树的分布式路由协议STRP及其具有能量意识的改进版本STRP-PA.每个传感器节点根据相邻节点与基站的距离、剩余能量等信息寻找父节点,构造一棵以基站为根的近优最小生成树,节点采集的数据沿树传输,并在树杈节点进行聚合.仿真实验结果表明:STRP-PA协议能够节省网络能量,显著延长网络稳定工作的时间,性能明显好于LEACH协议.     

无线mesh网中最小编码代价低时延多播路由

提出了一种无线mesh网中最小网络编码代价低时延多播路由协议(MNCLDMR, minimal network coding and low delay multicast routing)。MNCLDMR的目标是选择合适的网络编码节点,最小化网络编码代价,降低网络时延。MNCLDMR主要思想是引入拓扑关键节点和网络编码关键节点的概念,以下一跳的节点是否是网络编码关键节点或拓扑关键节点作为路由判据,采用MNCLD算法构造多播树。仿真结果表明,MNCLDMR可以达到预定目标,合理形成网络编码机会,能实现最小网络编码代价低时延多播路由。     

传感器网络中基于最短路径树的低延时节能路由算法

借助图论中最短路径和最小生成树的原理,在无线传感器网络中构建若干棵以Sink节点为根的最短路径源路由树。与最小生成树相比,最短路径树能保证路径上大部分节点找到节点间RSSI较强的通讯路径并以较少的跳数把数据传输给Sink节点,而最小生成树中的节点则需较多跳数。因此,提出的算法在一定程度上降低了延时。算法通过事先设定最低RSSI和节点最大剩余能量MRE来构建路由树,并修改已存在的路由算法,从而保证节点通讯的可靠性和网络的节能。     

Ad Hoc多播路由协议研究与实现

文中研究了一种基于分割树的移动Ad Hoc网络（MANET）多播路由协议（TPBOM）,该协议中,信源基于成员节点的定位信息创建一个Steiner树覆盖图,为满足可扩展性的要求,信源利用最大权反向分割（MHRTP）的树分割算法将其分割为若干个区,并将每个区封装进一个树分发数据包中,以便将所创建的Steiner树分发至所有成员节点,封装的数据包中不包含目的地址列表,数据则沿该Steiner树进行传输,仿真实现表明,TPBOM在可扩展的多播群中获得了较高的性能。     

基于满Steiner树问题的水下无线传感器网络拓扑愈合算法研究

建立了水下无线传感器网络模型,对拓扑愈合问题进行了形式化描述,该问题最终映射到数学上的满Steiner树问题.针对满Steiner树问题设计了一种近似的拓扑愈合算法,通过把自移动节点迁移至合适位置,不仅使拓扑得以愈合,还能够改善时延和能耗指标.仿真实验结果表明,该算法能愈合通信拓扑至较优状态,降低了传输时延和能耗,并能有效地延长水下传感器网络生命期.     

无线传感器网络的一种低功耗拓扑控制算法DSPT

针对无线传感器网络环境下拓扑控制问题,提出一种基于最小成本路径的分布式拓扑控制算法,其基本思想是:针对无线传感器网络many-to-one的通讯模型,建立以Sink节点为根节点的拓扑控制树,使得整个网络的通讯成本最低,从而延长网络的生命周期,与传统Ad Hoc网络采用的最小生成树拓扑控制算法相比较,具有低功耗,算法时间复杂低,易于实现等特点。仿真结果表明,在节点稠密部署情况下,无线传感器网络的整体功耗比MST生成树降低25%,关键节点的功耗比MST生成树降低13%。     

基于定向扩散的最小连通支配集构造算法

针对区域覆盖算法未考虑节点的通信梯度问题,利用定向扩散路由在构造以sink节点为根的有向路由树时形成的递增梯度序列,提出了一种基于定向扩散的最小连通支配集构造算法.在路由信息扩散的同时逐级挑选出互不相邻的传感器节点构造出一个最大支撑集,然后在相邻层次的支撑集节点间寻找中间节点将独立集节点连通起来,最终得到一个近似的最小连通支配集.理论及仿真实验结果表明,该算法构造的连通支配集最小且计算耗时少,能多重有效覆盖热点区域,从而延长无线传感器网络的寿命.     

基于压缩感知的WSNs长生命周期数据收集方法

该文针对基于事件驱动的无线传感器网络(WSNs)数据收集查询的长期应用需求,基于压缩感知理论将混合压缩感知的数据收集技术与数据收集树的构建过程相结合,设计出一种长生命周期数据收集方法。该方法在数据收集查询到达时,构造一棵数据收集树。建树过程中,利用混合压缩感知思想,在分析转发节点和融合节点能耗的基础上,以收集查询后节点最小剩余能量最大化为目标,构造最大数据收集树集合。仿真实验表明,该方法能够充分利用节点能量资源,显著提高网络能量效率,达到延长网络生命周期的目标。     

WSN中基于粒子群算法改进的分簇路由算法

针对WSN中路由协议的能量消耗不均匀、簇头节点分布不均匀等问题基于粒子群算法提出了一种寻找最优簇头的方法：引入了剩余能量因子和位置均衡因子的概念，由节点的剩余能量因子和位置均衡因子生成适应度函数；利用Kruskal算法生成最小生成树，建立簇间最短路由。经仿真实验证明，相较于传统的WSN路由协议，该算法有效延长了网络的生命周期，并在一定程度上提高了均衡性。     

Utilizing Neighbours-Table to Improve Tree Routing Protocol in ZigBee Network

ZigBee is an industrial standard for wireless ad hoc networks based on IEEE 802.15.4. It has been developed for low cost, low data rate and low power consumption. ZigBee??s network layer defines two routing protocols namely Ad Hoc On-demand Distance Vector and Tree Routing (TR). TR protocol follows the tree topology (parent?Cchild) in forwarding the data packets from source nodes to the sink node. However, the source does not find rather nor the location of the sink is close to the source node or if it is not in the sub-tree. In this case it will follow the tree topology which will use a lot of hops to deliver data packets to the sink node. This paper present an improvement of TR protocol for ZigBee network and is called Improved Tree Routing (ImpTR) protocol which is computationally simple in discovering the better path to transmit data packets to the sink node, and does not need any addition in hardware. ImpTR determines the better path to the sink node depending on the tables of the neighbouring nodes, which is part of the existing ZigBee network specification. Results show that the proposed algorithm provides shorter average end-to-end delay, increase throughput, decrease the average number of hops and decrease the energy consumption from the network when compared to the original TR routing protocol.     

无线多跳Ad hoc网络中MAC机制的公平性与网络容量利用率

高效、公平的MAC协议是目前无线多跳Ad hoc网络研究的关键问题之一。该文在给出一种新的无线多跳Ad hoc网络的网络模型前提下,定义了MAC协议公平性、网络容量利用率两个性能参数。给出了一种能在竞争节点间公平共享无线信道并充分利用网络容量的MAC协议(FMAC),仿真比较了FMAC和IEEE 802.11 DCF的公平性和网络容量利用率。结果表明FMAC能在充分利用网络容量的前提下,实现无线信道在竞争节点间的公平共享。     

移动自组织网络中基于树结构的优化组播路由算法(英)

Mobile Ad hoc Networks(MANETs) play an important role in emergency communications where network needs to be constructed temporarily and quickly.Since the nodes move randomly,routing protocols must be highly effective and reliable to guarantee successful packet delivery.Based on the data delivery structure,most of the existing multicast routing protocols can be classified into two folders:tree-based and mesh-based.We observe that tree-based ones have high forwarding efficiency and low consumptions of bandwidth,and they may have poor robustness because only one link exists between two nodes.As a treebased multicast routing protocol,MAODV(Multicast Ad hoc On-demand Vector) shows an excellent performance in lightweight ad hoc networks.As the load of network increases,QoS(Quality of Service) is degraded obviously.In this paper,we analyze the impact of network load on MAODV protocol,and propose an optimized protocol MAODV-BB(Multicast Ad hoc On-demand Vector with Backup Branches),which improves robustness of the MAODV protocol by combining advantages of the tree structure and the mesh structure.It not only can update shorter tree branches but also construct a multicast tree with backup branches.Mathematical analysis and simulation results both demonstrate that the MAODV-BB protocol improves the network performance over conventional MAODV in heavy load ad hoc networks.     

一种无线自组织网络动态路由协议

介绍了一种基于稀疏树的无线自组织网络动态路由协议,该协议采用了稀疏树路径生成算法来减少路由更新的数据量并减少网络链路的冗余,采用增量更新来降低路由协议开销并降低对传输带宽的占用,支持单向信道,采用快速路径查找算法消除网络拓扑动态变化过程中的环路与无穷计数问题。仿真结果显示它具有收敛快,开销小等特性,能够较好地适应窄带无线通信环境的需要。     

Topology sense and graph-based TSG: efficient wireless ad hoc routing protocol for WANET

Technologies such as wireless ad hoc have undergone rapid redesigning. The routing protocol plays an essential role in improving the performance of wireless networks. However, improving the routing efficiency of a WANET still faces two main challenging issues: the routing table size and routing protocol selection criteria from the source to destination. This paper propose an efficient routing protocol using the Graph theory. In reviewing previous work, so far no research has represented routing information by a Triangular Matrix Table (TMT). TMT is based on the graph theory to save the entire network topology in a small memory size. Due to node movement or shut down, all neighboring nodes can detect that, namely, topology sense. The proposed Topology Sense and Graph-base (TSG) protocol relies on the topology change only. Node can send update message to all nodes by a distributor-cast mechanism, thus guaranteeing that every node gets one updating message. This mechanism depends on the TMT and Spanning Tree algorithm. The simulation results show that the TSG performs better than the conventional routing protocols. As a consequence, the throughput, delay time, packet loss, and overhead message are significantly improved as verified by NS3.     

一种新型的Ad hoc QoS多播路由协议

无线自组织（Ad hoc）网络的应用环境要求其必须提供一定的服务质量（QoS）保证，然而，无线信道固有的特点及节点移动造成网络拓扑的频繁变化，使得在无线Ad hoc网络中支持QoS较困难。可以采用Ad hoc QoS多播（AQM）协议通过事先预约邻居节点以跟踪资源的有效性等措施来解决这一问题。通过考虑传输时延、丢失率、带宽要求、时延抖动、吞吐量等QoS指标，寻找满足特定QoS要求的路由，AQM协议可以明显地改善多播通信的性能。网络仿真结果表明AQM协议基本适合Adhoc网络。     

基于博弈论的无线自组网路由协议研究

Ad hoc网络,是无线自组织网络的简称.它没有固定的基础设施,网路中的每个节点具有双重身份,即通信终端和路由器.路由协议是Ad hoc网络的关键技术,但传统的协议在设计时并未考虑效率因素.本文基于博弈论提出一种平均场均衡的方法,能有效的减少信息泛洪,以满足节点移动性对自组网的性能要求.     

Energy efficient broadcast routing in static ad hoc wireless networks

In this paper, we discuss energy efficient broadcast in ad hoc wireless networks. The problem of our concern is: given an ad hoc wireless network, find a broadcast tree such that the energy cost of the broadcast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove that the problem is NP-hard and propose three heuristic algorithms, namely, shortest path tree heuristic, greedy heuristic, and node weighted Steiner tree-based heuristic, which are centralized algorithms. The approximation ratio of the node weighted Steiner tree-based heuristic is proven to be (1 + 2 ln(n - 1)). Extensive simulations have been conducted and the results have demonstrated the efficiency of the proposed algorithms.     

Invincible AODV to detect black hole and gray hole attacks in mobile ad hoc networks

Today's communication world is majorly driven by mobile nodes that demand wireless systems for their data relay. One such network is mobile ad hoc network, which is a purely wireless network with which communication is feasible instantly without any aid of preexisting infrastructure; due to this magnificent feature, it has a wide variety of applications. Mobile ad hoc network hinges on cooperative nature of the mobile nodes for relaying data. But at the same time, nodes relaying data for others may compromise, leading to various security attacks. Two main security attacks that drastically bring down the performance of mobile ad hoc network are black hole and gray hole attacks. In this paper, we propose 2 versions of invincible Ad hoc On‐Demand Distance Vector protocol to detect black hole and gray hole nodes that have bypassed preventive mechanism during route discovery process. First is the basic version, which is based on node‐to‐node frame check sequence tracking mechanism, and second is the enhanced version, which is based on signed frame check sequence tracking mechanism. They create a deterrent environment addressing all kinds of black and gray hole attacks. They also provide reliable data transmission to all the nonmalicious nodes in the network by using end‐to‐end authentication mechanism. Simulation results show better performance in packet delivery ratio when compared with other contemporary solutions while addressing all kinds of black and gray hole attacks. It shows significant improvement in end‐to‐end delay and normalized routing load over Ad hoc On‐Demand Distance Vector under black hole or gray hole attacks and also shows better throughput and packet delivery ratio than the existing solution.