移动Ad hoc网络中基于链路稳定性预测的按需路由协议

移动Ad hoc网络拓扑的高度动态变化是造成传统按需路由协议的路由频繁通断的主要原因,因此在传统按需路由协议的基础上进行链路稳定性预测扩展,增强路由稳定性具有十分重要的意义。该文利用分组的接收功率把节点间的相对运动划分为靠近和远离两种类型,然后在不同相对运动类型下根据节点间距离得到了的链路平均维持时间。在路由过程中,中间节点利用得到的链路平均维持时间设置请求报文的转发延迟,通过一定转发规则选择稳定性较强的链路构成路径。仿真结果表明进行链路稳定性预测扩展后的按需路由协议能够有效增强路由的稳定性,并提高网络性能。     

基于COPE协议改进的网络编码感知机会路由算法

提出一种网络编码感知机会路由算法,将COPE协议中的机会监听和网络编码技术引入现有的机会路由机制,采用新的路由度量即LQM(链路质量度量)标准来选择备选转发节点集,在确保选择路径的编码机会的同时也在一定程度上保证了链路质量。仿真结果表明,此方法能提高网络的整体吞吐量,增加编码机会,降低平均端到端的时延。     

一种机会网络中节点转发策略的改进

在分析现有机会网络转发策略及机会网络中节点的运动特性的基础上,通过改进节点的转发策略提出一种新的机会网络路由算法(Delayed Spray and Wait,DSW).算法假设的应用场景为节点均沿着预先存在的路径移动,通过延迟发送转发数据包,可以显著减少网络中的低效数据包转发的数量.仿真结果表明,在合适的应用场景下该算法可以显著的降低网络中数据包的转发数量并略微提高传输成功率,这对于减少节点能耗和改善网络拥塞状况都具有实际意义.     

移动自组织网络环境中负载均衡策略研究

针对移动自组织网络中负载分布不均所导致的网络性能恶化问题,提出了一种基于分组转发行为不确定度量的网络负载计算方法,并以此为基础提出了负载均衡按需路由协议,通过监测分组转发过程中的行为变化特征,采用信息熵的形式对其进行量化和度量,并在路由发现过程中利用节点负载监测信息合理规避网络热点区域,以达到网络负载均衡分布的目的。仿真结果表明,基于负载均衡策略的路由协议能够有效提高分组递交成功率,降低分组传输延迟。     

基于智能天线的定向传播路由协议在WSAN中的应用

在无线传感器及执行器网络(WSAN)中,节点的协作需要通过路由协议进行大量的信息转发。传统使用全方向天线的节点存在能耗高、传输延迟高、数据包传递率低的问题。文中基于智能天线,将定向传播路由协议(ADA)应用于WSAN网络中,通过定向的转发信息减小节点能耗,降低传输延迟,提高数据包传递率。最后,通过Matlab对ADA协议和其他使用全方向天线的节点通信协议的性能进行仿真对比。实验结果表明,在节点能耗、数据包传送延迟和数据包传递率方面,基于智能天线的ADA协议优于其他使用全方向天线的节点通信协议。     

用于降低网络开销的改进ODMRP算法研究

ODMRP组播路由协议适用于带宽窄、移动性强和节点分散的移动自组织网络(Mobile AdHoc Network,MANET)。为了进一步提高该协议的性能,设计了一种改进方案,首次提出"备用转发节点"的概念,将其应用于原协议中,以降低网络的负载。理论分析表明,改进方案通过控制备用转发节点能动态的控制路由数量,进而控制转发分组节点数据,从而降低网络负载。所以,该改进方案有效地提高了ODMRP协议的性能,使之更加适用于大规模的MANET网络。     

无线mesh网中一种基于博弈论的公平性路由协议

提出一种基于博弈论的以树为拓扑结构的公平性路由协议.新的协议综合了先验式路由和按需路由,并且将路由计算和信道资源分配控制分布到树中的每个枝节点上,降低了根节点的负担,使其更适合于无线 mesh网的通信需求.仿真结果表明,新的路由协议改进了AODV、HWMP路由协议的端到端平均延迟和网络吞吐量,并且网络中各个无线节点占有的信道资源基本相近,满足公平性原则.     

一种贪婪地理路由协议的改进算法

贪婪转发策略广泛应用于无线传感网络(WSNs)的地理路由协议中,但是,该协议存在数据包丢失严重以及在遭遇路由空洞时路由效率低下的不足。为此,提出一种贪婪地理路由协议的改进算法,记为GPSR-I算法。GPSR-I算法在选择下一跳转发节点时,利用节点离目的节点距离、方向以及节点密度信息计算度量值,然后依据该度量值决策下一跳转发节点。仿真数据表明,与GPSR相比,GPSR-I算法能够有效降低平均端到端传输时延、路由开销,并提高了数据包传输率。     

一种基于能量高效的多路径路由编码算法

针对如何降低无线传感网络中的节点能量消耗问题,文章提出了一种基于能量高效的网络模型和编码模型,给出了相应的网络编码策略和能量消耗模式,建立了一种新的基于网络编码多路径路由技术的节点能量有效算法,并以误码率为参照基准,与有关的多路径路由协议算法做了相应的实验比较。仿真结果表明,文章所提出的方法在能量高效、网络生命延长及数据分组传递方面有较好的改进。     

一种增加时限和延迟的AODV协议改进方法

AODV协议是目前比较成熟的应用于移动自组网(MANET)中的一种反应式路由协议,其缺点主要是协议开销比较大,运动情况下路由优化性能不理想。利用为RREQ消息设置时限和为中间节点根据自身队长设置回复RREP消息延迟的方法,提出了一种改进的AODV协议(AODV-DL),有效地提高了网络的投包率和路由优化性能,降低了网络的协议开销。提出了将路由优化性能作为协议的一项新的评价标准。描述了其实现策略,并给出了NS2下的仿真结果。     

无线多媒体传感器网络中一种改进路由算法

随着网络负载增加,经典的TPGF( Two-Phase geographic Greedy Forwarding)算法难以找到节点分离路径,会导致网络吞吐量、投递率以及端到端时延性能下降。此外,当网络拓扑变动不大时, TPGF中每条路径所包含节点要消耗比其他节点更多的能量,会导致其过快死亡,从而影响网络性能。为此,将联合网络编码技术引入 TPGF,提出一种编码与能量感知的 TPGF 路由算法( NE-TPGF)。该算法综合考虑节点的地理位置、编码机会、剩余能量等因素,同时利用联合网络编码技术进一步扩展编码结构,充分利用网络编码优势来建立相对最优的传输路径。仿真结果表明, NE-TPGF能够增加编码机会,提高网络吞吐量和投递率,降低端到端时延,并且还有利于减少和平衡节点的能量消耗。     

无线传感器网络中利用随机网络编码的低能耗可靠机会路由

无线传感器网络中节点大多采用电池供电,让节点以低能耗将采集的数据传递到信宿,对无线传感器网络有效运行极为重要.该文提出了能量有效的可靠机会路由EROR（Energy-efficient Reliable Opportunistic Routing）,它利用结合节点剩余能量和链路上收发双方的总能耗的转发代价,选择转发节点集合（简称“转发集”）、主转发节点和协助转发节点,让节点调节发射功率并利用随机线性编码把数据包分片编码发送到转发集,进而以多跳方式把数据可靠低能耗地传递到信宿.仿真结果表明：在网络生存时间和能耗方面,EROR比已有路由策略CodePower更优.     

Performance analysis of slotted ALOHA and network coding for single-relay multi-user wireless networks

Deployment of wireless relay nodes can enhance system capacity, extend wireless service coverage, and reduce energy consumption in wireless networks. Network coding enables us to mix two or more packets into a single coded packet at relay nodes and improve performances in wireless relay networks. In this paper, we succeed in developing analytical models of the throughput and delay on slotted ALOHA (S-ALOHA) and S-ALOHA with network coding (S-ALOHA/NC) for single-relay multi-user wireless networks with bidirectional data flows. The analytical models involve effects of queue saturation and unsaturation at the relay node. The throughput and delay for each user node can be extracted from the total throughput and delay by using the analytical models. One can formulate various optimization problems on traffic control in order to maximize the throughput, minimize the delay, or achieve fairness of the throughput or the delay. In particular, we clarify that the total throughput is enhanced in the S-ALOHA/NC protocol on condition that the transmission probability at the relay node is set at the value on the boundary between queue saturation and unsaturation. Our analysis provides achievable regions in throughput on two directional data flows at the relay node for both the S-ALOHA and S-ALOHA/NC protocols. As a result, we show that the achievable region in throughput can be enhanced by using network coding and traffic control.     

无线网络中最小延迟代价网络编码的研究

网络编码能极大地提高网络吞吐量和传输可靠性.编码机会易受到数据包数量不公平性的影响,提出一个具有最小延迟代价的网络编码方法（MDCNC）.首先找到一条固定路由并确定该路由所经过的每一节点的编码能力,然后根据数据流在不同节点处以及不同时隙的可编码情况,灵活地应用该延迟发送策略,以牺牲较小的端到端延迟时间换取更多的编码机会.仿真结果表明,MDCNC能够带来更多的编码机会,进而使网络拥有更高的吞吐量.     

On the improvement of scaling laws for large-scale MANETs with network coding

This paper investigates the problem of how much benefit network coding can contribute to the network performance in terms of throughput, delay, and storage requirements for mobile ad hoc networks (MANETs), compared to when only replication, storage and forwarding are allowed in relay nodes. We characterize the throughput-delay-storage tradeoffs under different node mobility patterns, i.e., i.i.d. and random walk mobility, with and without network coding. Our results show that when random linear coding instead of replication is used in MANETs, an order improvement on the scaling laws of MANETs can be achieved. Note that previous work showed that network coding could only provide constant improvement on the throughput of static wireless networks. Our work thus differentiates MANETs from static wireless networks by the role network coding plays.     

Clustering routing protocol based on improved PSO algorithm in WSN

Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle.     

To Forward or not to Forward – that is the Question

We introduced the use of two-hop forwarding to increase the throughput of an 802.11 network in our earlier work (Narayanan et al., Proceedings of IEEE WCNC’05, March 2005). Other researchers have also considered the benefits of forwarding in the 802.11 infrastructure mode to increase the total network throughput. But the high-data rate node that forwards data for other nodes will have to spend its energy transmitting this data. Previous work on forwarding implicitly assumed that in an enterprise network, the collective good is sufficient to justify this increased energy expense. However, it is important to address the advantages and the cost of participating in such schemes from the individual forwarding node’s perspective. Since a node cannot know whether there are other high-data rate nodes in the network capable and willing to forward data, it needs to assume that it is the only node with the capability to do so. In this paper, we focus our analysis on the cost benefit for such a forwarding node. We quantify the throughput improvement, medium access delay reduction and energy consumption for the forwarding node in a saturated network. The analysis and simulation results demonstrate that in a saturated network, participation in forwarding provides the high-data rate node with significant benefits in throughput and media-access-delay, while increasing the number of bits-per-joule even if it is the only node participating in data forwarding as suggested in this paper. The increase in the bits-per-joule is due to the reduction in the total amount of time needed by the high data rate node to transmit a given number of its own application bits. This results in savings in energy expenditure for the forwarding node. Based on these benefits, we conclude that it is unequivocally in the interest of a high data rate node to participate in two-hop forwarding schemes in 802.11 networks.     

Energy conserving security mechanisms for wireless sensor networks

Since wireless sensor networks are emerging as innovative technologies for realizing a variety of functions through a number of compact sensor nodes, security must be justified and ensured prior to their deployment. An adversary may compromise sensor nodes, forcing them to generate undesired data, and propagation of these data packets through the network results in wasteful energy consumption. We develop a security mechanism to detect energy-consuming useless packets, assuming that a sensor node is able to generate multiple message authentication codes (MAC) using preshared secrets. The forwarding nodes along the path verify the validity of the packet by checking the authenticity of the attached MACs. This mechanism performs well when a malicious node does not have all the cryptographic keys. However, packets, generated by the malicious node having all the keys, would be considered as legitimate, and thus, the forwarding nodes become unable to detect and discard them. To deal with this problem, we devise another mechanism in which each forwarding node is capable of checking such suspicious nodes. We have quantified the security strength through analysis and simulations to show that the proposed mechanisms make the entire network energy conserving.     

带有编码冗余控制的机会网络数据转发机制

网络编码方法能有效提高数据传输效率,但采用该方法的机会网络数据转发机制均未考虑传输中的编码数据迭代冗余副本控制问题。为了充分降低译码复杂度并减少迭代冗余副本,提出了相遇持续时间估计及编码机会感知方法,进而设计了带有传输容量估计的编码冗余控制数据转发机制。节点以分布式的方式感知数据编码机会,为不同扩散程度的数据确定相应的优先级,并根据传输容量估计结果完成转发控制,以充分利用节点间的相遇持续时间。结果表明,所提出机制有效地减少了网络中的冗余副本,使译码所需的数据量趋于理论上的最小值,改善了网络资源利用率。     

基于拓扑感知的水下传感网络路由

由于水下传感网络的高时延、低带宽和高能耗等特性,建立路由协议仍存在挑战。为此,提出基于拓扑感知的水下传感网络路由(TAR)。TAR路由先通过交互Beacon包,使每个节点获取网络拓扑信息,并建立邻居信息表。再依据节点剩余能量和链路的可靠性,择优选择下一跳转发节点,进而提高路由的稳定性,平衡节点间能耗。仿真结果表明,提出的TAR路由增强了路由稳定性,并减少了节点的能耗。