The research of cooperative routing algorithm in mobile Ad hoc networks

1 Introduction Ad hoc [1, 2] network is a dynamic-topological mobile self-organized network without any centralized access point. In such a network, each node acts as both host and router simultaneously, entering and departing from the network freely. How…     

移动自组织网络中能源信息熵的需求多路径路由协议(英文)

This paper provides a critical review of energy entropy theory in Mobile Ad Hoc Networks (MANETs) and proposes an Energy Entropy on Ad Hoc On-demand Distance Vector Multipath (EEAODVM) routing protocol. The essential idea of the protocol is to find every route which can minimize the node residual energy in the process of selecting path. It balances individual node battery energy utilization and hence prolongs the entire network lifetime. The results of simulation show that, with the proposed EEAODVM routing...     

基于概率可通链路的无线传感器网络栅格路由

该文基于一种通用的概率可通链路模型,分析了相邻栅格可通概率和路径可通概率,研究了节点密度和栅格大小对它们的影响,分别给出了以能量效率和网络平均分组递交率为目标的最佳栅格大小,并提出了将二者结合的最佳栅格选择标准,在满足用户需求的前提下网络寿命达到最大。最后对其性能进行了仿真分析,结果表明在考虑了概率可通链路后的最佳栅格大小与分析结果非常接近,且分组递交率和能量效率相结合的栅格大小选择标准能够很好的延长网络寿命。     

基于博弈的协作路由算法

协作虚拟多输入多输出（VMIMO）传输是一种有效的无线传输性能优化技术。将物理层协作VMIMO技术和网络层路由选择技术相结合,设计跨层VMIMO路由选择方案可以利用VMIMO的分集增益,显著地降低网络传输能耗。如何设计VMIMO协作路由协议抵抗无线网络的自私节点和欺骗行为,保证高数据转发率和低传输能耗成为路由设计中的重大挑战。为了提高自私网络的VMIMO路由性能,提出了一种基于重复路由博弈的VMIMO协作路由算法。该算法将网络划分成多个Group、Group间使用VMIMO传输数据。将Group间路由选择过程建模为重复路由博弈过程。为了提高数据转发的成功率,提出适用度函数评估节点参与数据分组转发的信誉。以此为基础,提出基于适用度的路由选择子算法和路由转发子算法。理论证明所提重复路由博弈可达到帕累托最优。仿真实验结果表明本算法可以促进自私节点相互合作,可获得较高的数据转发率,较好地减少数据传输时延以及能量消耗。     

机会网络中基于有权社团结构图的路由协议研究

基于社团检测的机会网络路由算法大多采用无权重网络拓扑划分社团,仅将节点间的关系抽象为一条简单的无权重的边,忽略了节点关系的强弱程度。本文通过引入权重策略改进了QCA社团更新算法,提出了一种基于有权社团结构的路由算法,该算法解决了社团关系定量化单一的问题,更能真实反映出社团成员之间的关系。算法中,节点间的交互信息转化为权重,根据不同的网络环境选择不同的权重转化方案———归一化权重（normalized weight）和非归一化权重（non-normalized weight）。路由算法在检测到周围网络环境变化时自动切换权重计算方案以适应网络环境的变化。通过在仿真环境和真实数据集上测试和分析,该算法能够将网络中的节点划分出合理的社团结构,并在保证较高的传输成功率的情况下降低网络开销。     

高动态Ad Hoc路由协议性能分析

Ad Hoc网络是一种没有固定设施的无线移动自组织网络,动态变化的拓扑结构对路由协议的性能有着重要影响。研究了动态源路由(DSR)协议、Ad Hoc按需距离矢量(AODV)路由协议和最优链路状态路由(OLSR)协议3种传统路由协议,利用OPNET软件作为仿真工具,设计了2种不同网络规模条件下空中飞行平台网络拓扑结构背景的高动态仿真方案,通过比较网络时延、归一化网络吞吐量、路由负载和数据传送成功率,分析了它们的性能。仿真结果表明,OLSR协议的综合性能优于其它协议,更适合于节点高速移动且网络拓扑结构频繁变化的Ad hoc网络,并为下一步研究打下基础。     

一种基于演化博弈的分簇协作路由算法

现有的分簇协作路由没有依据协作通信的特点选择簇头,也没能根据簇头节点的服务能力均衡簇成员负载,因而不能充分发挥协作通信能量高效的优势.本文提出了一种基于演化博弈的分簇协作路由算法CCREG.算法首先定义虚节点剩余能量作为簇头确立的指标,然后通过动态演化博弈为簇联盟问题建立模型.簇成员节点选择不同簇头结成联盟,可获得不同的收益.收益由簇头的能力、簇成员节点个数等因素决定.簇成员节点都可以根据自身得到的信息有限理性的选择簇结成联盟,直到网络中所有节点改变簇联盟都不能获得更高的收益.实验结果表明,与协作多输入多输出路由算法CMIMO相比,CCREG算法的网络生存周期在两个簇头情况下延长14%到70%,三个簇头情况下延长5%到80%.     

Reinforcement learning movement path for multiple mobile sinks in wireless sensor networks

Mobile sink nodes play a very active role in wireless sensor network (WSN) routing. Because hiring these nodes can decrease the energy consumption of each node, end-to-end delay, and network latency significantly. Therefore, mobile sinks can soar the network lifetime dramatically. Generally, there are three movement paths for a mobile sink, which are as follows: (1) Random/stochastic, (2) controlled, and (3) fixed/ predictable/predefined paths. In this paper, a novel movement path is introduced as a fourth category of movement paths for mobile sinks. This path is based on deep learning, so a mobile sink node can go to the appropriate region that has more data at a suitable time. Thereupon, WSN routing can improve very much in terms of end-to-end delay, network latency, network lifetime, delivery ratio, and energy efficiency. The new proposed routing suggests a reinforcement learning movement path (RLMP) for multiple mobile sinks. The network in the proposed work consists of a couple of regions; each region can be employed for a special purpose, so this method is hired for any application and any size of the network. All simulations in this paper are done by network simulator 3 (NS-3). The experimental results clearly show that the RLMP overcomes other approaches by at least 32.48% in the network lifetime benchmark.     

一种面向无线视频传感器网络的多径QoS保障路由协议

针对无线视频传感器网络网络带宽有限、网络拓扑结构动态不稳定的特点,以及视频传输对实时性的要求,设计并实现了一种面向WVSN的多径QoS保障路由协议-EDQMR协议,该协议不仅考虑了跳数、时延、节点之间的距离等约束条件,也同时将节点剩余能量作为约束条件,以路径能量的消耗最小为代价函数进行最优路径的选择,不仅考虑单个节点的能耗,也均衡了整个网络的能耗.仿真结果表明,与现有的AOMDV协议相比,在时延满足需求的前提下,本文提出的EDQMR协议可以显著提高数据包的传输成功率,并能有效延长网络的工作寿命.     

分布式多网关无线mesh网公平协作路由算法

现有的协作路由协议不能公平地分配无线网络资源,无法满足网络最小流的吞吐量需求。将多并发流的协作路由问题形式化成一个最大化网络整体效用的凸优化问题,并基于对偶分解和子梯度,提出一种分布式的多网关无线mesh网公平协作路由算法FCRMG。实验结果表明,与基于期望传输时间的非协作路由和基于竞争感知的协作路由相比,FCRMG算法在保证网络吞吐量的前提下,能显著提高最小业务流的吞吐量。     

LEO卫星网络中一种安全的按需路由协议

低地球轨道(LEO)卫星网络的路由是当前卫星通信领域的研究热点,其安全问题也日益受到研究人员的重视。本文通过分析LEO卫星网络按需路由协议面临的安全威胁,使用基于身份的签密方案,提出了一种适合卫星网络拓扑特性的安全的按需路由协议。针对协议的密码算法处理时间开销较大的特点,设计了自适应的概率性延迟验证机制,能够降低协议的平均路由建立时间。安全性分析和仿真实验结果表明,该协议能够抵抗多种外部攻击行为,以有限的路由建立时间和路由开销为代价,保证了稳定的包传输率。      

Energy‐aware virtual multi‐input‐multi‐output‐based routing for wireless ad hoc networks

Virtual multi‐input‐multi‐output (vMIMO) technology is becoming a promising way to improve the energy efficiency of wireless networks. Previous research always builds up the vMIMO‐based routing on the fixed structure such as clusters, and the MIMO mode is omitted in most cases. So, they cannot fully explore the advantage of vMIMO in routing. In this paper, we study a general routing scheme in which no fixed structure is required, and any communication mode of vMIMO is allowed for sake of the energy efficiency. We define two vMIMO‐based routing problems aiming to energy‐minimization and lifetime‐optimization. The first problem can be solved by our distributed energy‐minimum vMIMO‐based algorithm. The algorithm constructs the virtual cooperative graph, and applies the shortest path method on the virtual cooperative graph to solve this problem. The second problem is non‐deterministic polynomial‐time hard, and we design the distributed lifetime‐oriented vMIMO‐based algorithm, which is based on the modified Bellman‐Ford method. It can reach approximation ratio of four. The simulations show that our algorithms can work well in many situations. For example, distributed lifetime‐oriented vMIMO‐based algorithm can prolong the lifetime about 20.2% in dense topologies compared with the cooperative routing algorithm on average. Copyright © 2015 John Wiley & Sons, Ltd.     

Correction to: Detection of Epileptical Seizures Based on Alpha Band Statistical Features

Intra-WBSN are generally short range wireless health monitoring networks, consisting of strategically placed miniaturized, intelligent and low powered bio-sensors. They perform various applications in healthcare, fitness, military, sport and consumer electronics. The network stability and the network longevity of such networks have prime focus in current research. Routing schemes have a significant potential to make such network energy efficient by sending the sensing data properly and promptly. In this paper, we have proposed a relay based cooperative routing scheme to achieve high energy efficiency. Sensing data from the bio-sensor node have been delivered on the basis data priority. The sensing data with high priority has been directly transmitted to body network controller (BNC). The delivery of normal sensing data from bio-sensor to the BNC through relay nod or cooperative node. These nodes are deployed in clothes, they can be easily replaced or recharged, it provide effective, easy and comfortable health monitoring. Through simulation results, the proposed routing protocol achieved improved performance in terms of energy efficiency, network stability, network lifetime, path-loss and throughput in comparison to the existing routing schemes.

     

A reliable and energy‐efficient routing protocol for underwater wireless sensor networks

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP²R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP²R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP²R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP²R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd.     

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.     

Energy‐efficient multihop routing in WSN using the hybrid optimization algorithm

The technical growth in the field of the wireless sensor networks (WSNs) has resulted in the process of collecting and forwarding the massive data between the nodes, which was a major challenge to the WSNs as it is associated with greater energy loss and delay. This resulted in the establishment of a routing protocol for the optimal selection of the multipath to progress the routing in WSNs. This paper proposes an energy‐efficient routing in WSNs using the hybrid optimization algorithm, cat–salp swarm algorithm (C‐SSA), which chooses the optimal hops in progressing the routing. Initially, the cluster heads (CHs) are selected using the low‐energy adaptive clustering hierarchy (LEACH) protocol that minimizes the traffic in the network. The CHs are engaged in the multihop routing, and the selection of the optimal paths is based on the proposed hybrid optimization, which chooses the optimal hops based on the energy constraints, such as energy, delay, intercluster distance, intracluster distance, link lifetime, delay, and distance. The simulation results prove that the proposed routing protocol acquired minimal delay of 0.3165 with 50 nodes and two hops, maximal energy of 0.1521 with 50 nodes and three hops, maximal number of the alive nodes as 39 with 100 nodes and two hops, and average throughput of 0.9379 with 100 nodes and three hops.     

无线传感器网络优化生存时间的动态路由算法

 节能和延长网络生存时间是无线传感器网络研究领域的热点问题.该文综合考虑网络中节点的剩余能量和节点间传输数据的能耗,基于最短路径树算法,通过构造两种不同的权值函数,提出了"比例权值路由算法"(Ratio-W)与"和权值路由算法"(Sum-W).仿真分析表明,所提出的算法可以延长网络生存时间,并使能耗经济有效,比一些已有知名算法更优.     

多射频无线mesh网中的联合协作路由与信道分配算法

现有的协作路由算法没有考虑多射频无线mesh网中的信道分配问题.为了给多并发业务流提供更优质的网络服务,本文结合多射频多信道技术和协作通信技术来降低同信道干扰并获得协作分集增益.基于协作通信模块虚拟化的方法,本文将联合协作路由和信道分配问题简化为联合直接路由和信道分配问题,将其建模为一个混合整数线性规划问题,并证明该问题为NP-hard问题.为了解决该问题,提出了一种宽松的联合协作路由选择和信道分配算法(Loose Joint Cooperative Routing and Channel Assignment algorithm,L-JCRCA).仿真实验结果表明,L-JCRCA可以有效提升网络整体吞吐量.     

DTN中概率选择的散发等待路由

目前的Internet体系结构和许多协议无法很好地适应延迟较高和间歇性链接的网络,这些网络有它们自己的专有协议,即聚束层协议,而不采用TCP/IP协议。为了实现这样的网络之间的互联,国际上提出了一种在端到端链接和节点资源都受限的新型网络体系和应用接口,即容迟网络（DTN）。文中主要讨论DTN网络的路由算法,在DTN路由算法中,蔓延路由和概率路由能提供较高的报文投递率,较小的投递延迟,但是开销很大。散发等待路由虽然具有较小的开销,但是投递率低、延迟较大,提出了投递效用的概念。在融合概率选择路由和散发等待路由的基础上,提出了具有概率选择的散发等待路由。通过仿真,与其它已有算法相比,显著提高了报文投递效用。     

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

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