基于蚁群优化的能量有效Ad Hoc路由算法

由于传统的Ad Hoc网络路由算法不考虑能量因素,为了改善其能量约束问题,根据自然界蚁群的觅食行为[1]提出了一种能量有效的路由算法.在路由选择过程中综合考虑了路径长度和节点的剩余能量,并且利用蚁群优化的特点形成多路径的数据传输,有效地延长了节点有限能量的使用时间,进而延长网络的生存期.在仿真实验中与现有相关协议进行了对比,结果表明了该算法的有效性.     

移动自组网中能量有效的路由算法

在移动自组网中,减少移动节点电池能量消耗,延长网络总的使用时间,成为路由协议性能优劣的一个很重要的指标。该文提出了一种关于节点能量估价函数PCF(PowerCostFunction)新的计算方法,这个函数考虑了节点能量的剩余和当前能量的使用情况,能够很好地在一条路径中找到有效的关键节点。该文还结合路径的最小能量代价和PCF,提出了一种加权路由选择算法WRMPCF(theWeightedRouteMechanismbasedPCF),有效延长了瓶颈节点的生命和网络的使用时间。以DSR路由协议为例,通过ns-2模拟的结果显示WRMPCF路由算法比以前相关的路由算法具有更好的性能。     

Ergodic secrecy rate of two-user MISO interference channels with statistical CSI

This paper considers a two-user multiple-input single-output （MISO） interference channel with confidential messages （IFC-CM）, where the beamforming vectors at the two transmitters are jointly optimized using the closed-form Pareto-optimal parameterization. We prove that artificial noise cannot improve the secrecy rate performance, and coordinated beamforming is secrecy-rate optimal which is achieved by agreeing on the parameters between the two transmitters. We analyze the feasible set of the beamforming parameters that guarantees positiveness of the secrecy rates when the transmitters know only statistical CSI, and then analysis in the ergodic secrecy rate region is discussed. More importantly, we derive the closed form of the ergodic secrecy rates and illustrate the Pareto-optimal structure of the beamforming vectors.     

Energy-aware routing for delay-sensitive underwater wireless sensor networks

The energy reduction is a challenging problem in the applications of underwater wireless sensor networks （UWSNs）. The embedded battery is difficult to be replaced and it has an upper bound on its lifetime. Multihop relay is a popular method to reduce energy consumption in data transmission. The energy minimum path from source to destination in the sensor networks can be obtained through the shortest path algorithm. However, because of the node mobility, the global path planning approach is not suitable for the routing in UWSNs. It calls for an energy-efficient routing protocol for the high dynamic UWSNs. In this paper, we propose the modified energy weight routing （MEWR） protocol to deal with the energy-efficient routing of delay- sensitive UWSNs. MEWR is a low flooding routing protocol. It can tolerate the node mobility in UWSNs and achieve a low end-to-end packet delay. MEWR can provide lower energy consumption than the existing low delay routing protocols through the dynamic sending power adjustment. The simulation results demonstrate the effectiveness of MEWR.     

Malicious node prevention and mitigation in MANETs using a hybrid security model

Mobile ad-hoc network (MANET) has got tremendous success and attention due to its self-maintenance and self-configuration properties or behavior. Based on wired and wireless networks, the network topology of MANETs changes rapidly by means of routing attacks. Hence, providing security to this infrastructure-less network is a major issue. The routing protocols for ad-hoc networks cope well with the dynamically changing topology but are not designed to accommodate defense against malicious attacker. Malicious nodes have opportunities to modify or discard routing information or advertise fake routes to attract user data to go through themselves. In this article, we discuss a hybrid technique using anonymity, one-way trapdoor protocol, hash functions, and elliptic curve cryptographic to mitigate attacks in the MANET. The simulation is carried on NS-2 and the simulation results are dissected on different system execution measurements, for example, packet send and received, packet dropped, average network throughput, end-to-end delay, and packet delivery ratio.     

QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs

A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.     

基于功率调节的IWSN实时可靠路由研究

针对工业无线传感器网络对延迟、可靠传输以及成本的特殊要求,研究了一种基于功率调节的实时可靠路由协议,将两跳速度策略引入到路由算法中,提高工业无线传感器网络的实时性;将节点剩余能量以及能耗同时考虑,以平衡网络能量并提高网络寿命;引入功率调节机制以绕开路由空洞,提高节点可靠性.仿真结果显示,与已有方法相比,采用的方法在总可靠度、截止期错失率以及包平均延迟上有着显著改善.     

Routing with adaptive path and limited flooding for mobile ad hoc networks

In MANET, each mobile host can freely move around and the network topology is dynamically changing. To send a datagram, a source host broadcasts a route discovery packet to the network. All neighboring nodes receiving this packet will rebroadcast this packet until it reaches the destination. It will have large flooding overhead, poor network performance and undesirable battery power consumption. To improve network performance, we design a novel routing protocol called RAPLF (Routing with Adaptive Path and Limited Flooding) for mobile ad hoc networks. Simulation results show that our protocol has better performance especially in packet delivery rate and flooding overhead when compared to similar protocols.     

MANETs中分段式的节点不相交多路径QoS路由

随着多媒体应用日益普及,在移动自组网中提供QoS成为了一个重要的研究领域。提出一种移动自组网中分段式的节点不相交的多路径QoS路由协议。该协议将一条路径划分为多段,在每个段中建立满足多QoS约束的多条节点不相交路径,并在每个段中独立地进行路由维护。模拟研究表明该路由协议具有开销小和路径成功率高的特点。     

适用于AdHoc网络具有能量约束的QoS路由协议

为了有效利用网络带宽和能量资源,延长网络生存时间,提出一种用于AdHoc网络基于节点剩余能量和路由传输能量的Qos路由协议（QRETP）。该协议通过计算节点带宽保证路由协议对QoS的要求,同时,综合考虑节点剩余能量和传输能量的状况,一方面以避免网络分割为目标,均衡节点能量耗损;另一方面从网络能量有限的角度出发,节省网络能耗。仿真表明,该协议在网络生存时间、节点平均能量消耗以及分组投递率等方面都有一定程度的改善。     

一种能量感知的无线移动自组网路由协议

无线移动自组网中的大多数节点都是由有限寿命的电池来提供的,能量保护策略就成为设计网络协议的一个重要条件。提出一种能量感知的无线移动自组网路由协议,综合考虑了节点的剩余能量和路由跳数,有效保护网络中能量低的节点,减少了节点能量损耗,延长了网络的使用时间。该路由协议中采用了局部路由修复机制,减少了数据包丢失,提高了数据传输率。最后,仿真结果证明了协议的有效性。     

蚁群优化和能量管理的ZigBee网络路由

延长ZigBee网络的寿命是设计ZigBee路由协议的一个重要目的,通过对ZigBee网络协议的研究提出一种基于能量管理的ACO-AODV路由协议,能降低网络延时并延长ZigBee网络寿命。仿真结果表明,ACO-AODV协议的方法是可行的和节能的,可以在保持较低数据分组的平均端到端时延的同时降低能量开销,达到了低开销、低时延的设计目标。     

基于AODV协议的路由预测及预修复

针对移动Ad Hoc网络中节点链路断裂、路由需要不断进行维护的问题,在按需距离矢量路由(AODV)协议基础上结合链路质量指示器,添加对节点电池电量的监测功能,根据节点剩余能量进行路由预测及预修复,在对链路状况提前做出判断的基础上及时进行路由切换,避免路由频繁中断.仿真表明,改进协议提高了数据包投递率,降低了端到端延迟时间,使网络更加稳定高效.     

一种基于跨层功率控制的Ad hoc网络路由算法*

在无线Ad Hoc网络路由协议中引入功率控制不但可以降低网络能量消耗,同时还能改善网络的吞吐量、投递率等性能,已成为当前Ad Hoc网络的一个研究热点.本文提出了一种基于跨层功率控制的按需路由算法CPC-AODV(Cross-layer Power Control Ad hoc On-demand Distance Vector).算法按需建立多个不同功率级的路由,节点选择到目的节点最小功率级的路由来传递分组,并对网络层的数据分组、路由分组和MAC层控制帧的传输采用不同功率控制策略来降低能量消耗.仿真结果表明:算法有利于降低通信能量开销,延长网络寿命,提高网络投递率及改善网络时延.     

Improvement of battery lifetime in software-defined network using particle swarm optimization based cluster-head gateway switch routing protocol with fuzzy rules

The software-defined network (SDN) is one of the network architectures, in which the data plane and control plane is divided from each other, and the network can be handled using a sensibly centralized controller and this method is adopted to reconfigure the wireless sensor network automatically. In this article, to implement the SDN in MANET, in which control nodes can be chosen in SDN dynamically for the activation of MANET function to allocate the works to other mobile nodes to the base station. However, in the field of mobile ad hoc networks, the network lifetime, and battery lifetime is one of the major problems and the energy consumption can play a significant rule for the transmission of data in the SDN. Therefore, in this article, particle swarm optimization (PSO) based CGSR (cluster-head gateway switch routing protocol) algorithm with fuzzy rules is proposed to increase the network lifetime of battery powered mobile nodes by reducing the energy consumptions of each node in software-defined MANET. In this proposed method, a routing method that can permit various mobile nodes with low battery power to transmits the data from source node to base station. We design a PSO based CGSR routing protocol by selecting the routing mobile nodes using fuzzy rules for packet transmission. In CGSR process, the formation of cluster and selection of cluster head is executed depending on the particle swarm optimization method. This proposed routing protocol can be used to enhance the battery lifetime by extension of the network lifetime with numerical analysis for efficient route node selection.     

WIA-PA网络中的基于节能的AODV路由算法改进

能源问题对于WIA-PA工业无线网络是非常重要的;因为在恶劣的环境中它们只能依靠其有限的电池供电;传统的路由算法中,选路时没有考虑节省能量的策略,它会造成一些关键节点的过度使用而过早的退出无线网络;针对WIA-PA网络的能量受限问题,提出了一种基于搜索有较大可持续能量路由的节点方法,并对AODV协议进行改进,逸免了低能量节点的使用,从而延长了网络的生存时间;该路由协议经过了理论分析和计算机仿真的验证,具有可行性和有效性,对于WIA-PA网络的节能路由协议研究以及实现具有一定的参考价值。     

Performance analysis of sleep mode mechanisms in the presence of bidirectional traffic

Short battery life being a major impediment to a more widespread use of wireless devices, industry standards like WiMAX and 3GPP Long Term Evolution (LTE) embed power saving mechanisms in their protocol stack. Trading in network delay performance for extended battery life, these mechanisms require a careful balance to optimize overall network performance. Therefore, this paper assesses the impact of these mechanisms on network delay performance and battery life, thereby refining existing performance studies of the power saving mechanisms. In particular, this paper explicitly takes into account presence of both downlink and uplink traffic and their influence on the power saving mechanism. This contrasts with previous studies, where the analyses only accounted for downlink traffic. We obtain numerically efficient procedures to compute packet delay as well as energy efficiency characteristics under Markovian traffic. Then, performance of power saving is investigated by some numerical examples. Our results clearly indicate that uplink traffic heavily impacts the energy efficiency of the power saving mechanism.     

Ant based Pareto optimal solution for QoS aware energy efficient multicast in wireless networks

Most of the group communication technologies support real-time multimedia applications such as video conferencing and distributed gaming. These applications require quality-of-service (QoS) aware multicast routing protocol to deliver the same data stream to a predefined group of receivers. Since nodes in wireless networks are severely energy constrained due to finite battery source, hence it is of paramount importance that QoS aware multicast routing protocol be energy efficient. Transmission power control is one of the methods used to save energy. In this method, the nodes dynamically adjust the transmission power so that energy consumption in the tree is minimized. However, reduction in the transmission power increases the number of forwarding nodes in the multicast tree. This negatively impacts the QoS in terms of propagation delay, delay jitter, and packet loss etc. In wireless networks, there is a trade-off between the energy consumption and the QoS guarantees provided by the network. We unify these requirements into a multiobjective framework referred to as Energy Efficient QoS Multicast Routing (E²QoSMR). The goal is to simultaneously optimize the total power consumption and the QoS parameters in the multicast tree. We extend two algorithms based on metaphor of swarm intelligence for finding an energy efficient multicast tree satisfying the QoS guarantees. Extensive simulations have been conducted to validate the correctness and efficiency of the algorithms. The simulation result of the algorithms is compared with the nondominated sorting genetic algorithm, NSGA-III. The experimental results are consolidated by statistical analyses that demonstrate the ability of the algorithms to generate the Pareto optimal solution set.     

Towards A Game Theoretic Understanding of Ad-Hoc Routing

In this paper we present a new application of game theory, in which game theoretic techniques are used to provide a rigorous underpinning to the analysis of ad-hoc routing protocols. The explosion of interest in ad-hoc networks over the last few years has resulted in a very large number of routing protocols being proposed. Despite this, the science of analysing routing protocols is still relatively immature, and the question that remains is how to decide “how good” a given protocol is. We propose a game theoretic approach as a potentially effective means of answering this question. The conceptual mapping of routing into a game is, we believe, natural and simple. Furthermore, game theory provides an extensive repertoire of tools to analyse key properties. The paper describes how routing techniques can be modelled as games and presents some analytical results.