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

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

基于最优Path的Ad Hoc网络地理路由算法

对基于地理信息的自组网路由中的凹节点问题做了分析,并提出了一种新的解决方案——PGA算法及其改进算法.算法采用了最优Path的思想,在Path构造、基于Path的最优寻路、路由恢复等多个方面都应用了最优Path的概念,较好地解决了凹节点的问题.通过证明,该算法具有无环性,从而实现了基于局部路由信息的无状态路由,展示了算法的可扩展性和易维护性.实验表明,即使在大型网络中,算法依然可以保持很高的报文投递率、较短的路径长度、可接受的路由表大小及可控的协议带宽开销,同时该路由算法在动态环境中具有较强的鲁棒性.     

基于改进萤火虫群优化的无线自组网路由算法

针对无线自组网络拓扑结构多变、网络生存时间受限及数据包分组传输效率低下等问题,借鉴萤火虫群优化算法,提出了一种改进萤火虫群优化的无线自组网络路由算法.路由算法将萤火虫优化算法中的荧光素强度更新与无线自组网络中的节点移动速度、拥塞程度、节点剩余能量、节点间距离等因素进行相互映射,同时改进萤火虫群优化算法中的搜索萤火虫、驻留萤火虫及回溯萤火虫用于完成无线自组网络中路由协议的路由发现、路由选择及路由维护等过程,整个协议无须传送大量的控制分组,即可实现无线自组网络的稳定传输.仿真实验结果表明,与AODV及基于蚁群优化的路由算法AntRouting协议相比,本文所提出的路由算法在端到端延时、分组数据传输率及网络生存时间上均有良好的性能.     

Energy-efficient routing over coordinated sleep scheduling in wireless ad hoc networks

In this paper, we study how energy-efficient routing at the network layer can be coordinated with sleep scheduling at the link layer to increase network-wide energy efficiency in wireless ad hoc networks. We identify a trade-off between the reduced transmit power at senders with multi-receiver diversity and the increased receive power at forwarders with coordinated sleep scheduling. Moreover, we provide a comprehensive study of how coordinated sleep scheduling affects the energy-efficient routing performance based on a 2-D gird topology and time division multiple access (TDMA) medium access control (MAC). Simulation results demonstrate the effectiveness of the integrated routing and sleep scheduling, significant impact of coordinated sleep scheduling on the energy-efficient routing performance, and relationship between networking conditions (in terms of the traffic load and node density) and overall system performance achieved by different energy-efficient routing protocols.     

A Gossip-Based Energy Conservation Protocol for Wireless Ad Hoc and Sensor Networks

In this paper, we present an energy conservation scheme for wireless ad hoc and sensor networks using gossiping to place nodes in an energy saving sleep state. The technique is termed the Gossip-based Sleep Protocol (GSP). With GSP, each node randomly goes to sleep for some time with gossip sleep probability p. GSP is based on the observation that in a well connected network there are usually many paths between a source and destination, so a percentage of nodes can be in an energy conserving sleep mode without losing network connectivity. GSP needs few operations, scales to large networks and does not require a wireless node to maintain the states of other nodes. We propose two versions of GSP, one for synchronous networks and one for asynchronous networks, and afterward extend GSP to adapt to network traffic conditions. We show the advantages of the GSP approach through both simulations and analysis.     

基于自适应波束天线的局部优化拓扑控制算法

拓扑控制有助于提高ad hoc网络的性能,采用定向天线的自组网拓扑控制比全向天线网络更为复杂。基于自适应波束定向天线模型提出一种局部区域优化的拓扑控制算法。该算法利用分簇的思想将网络划分为可重叠的多个区域,区域内节点采用最小生成树（MST）的思想确定邻居关系,通过调整节点发射功率,改变天线波束的朝向、宽度和增益来构建拓扑。算法减小了节点的平均度数,降低了节点的发射功率,从而降低节点能耗,减少了节点间干扰,提高了网络吞吐量,仿真结果表明,算法显著提高了网络性能。     

A location routing protocol based on smart antennas for ad hoc networks

Ad hoc networks are a type of mobile networks that function without any fixed infrastructure. One of the weaknesses of ad hoc networks is that route between a source and a destination is likely to break during communication. Location-based routing algorithms are promising in reducing routing overhead in ad hoc networks. Existing location-based routing algorithms employ the Global Positioning System (GPS) as their location information provider, and synchronize information network-wide. Nonetheless, these protocols have some limitations because the use of GPS is not realistic in certain circumstances. Since smart antenna is able to infer direction and ranging information between pairs of ad hoc node, the obtained local position information can be used to improve routing mechanism. This work proposes a novel Location-Enhanced On-Demand (LEOD) routing protocol which is based on smart antenna technique. The LEOD protocol utilizes local position instead of global position to discover routes and make routing decision for the ad hoc network. Theoretical computation and simulation results show that data packet loss rate decreased significantly compared to other methods well-documented in the literature. In addition, this protocol reduces the network control overheads and the power consumption. It also improves network average throughput.     

Analysis of a Randomized Congestion Control Scheme with DSDV Routing in ad Hoc Wireless Networks

Ad hoc wireless networks are expected to play an increasingly important role in future civilian and military settings where wireless access to a wired backbone is either ineffective or impossible. However, frequent topology changes caused by node mobility make routing in ad hoc wireless networks a challenging problem. In addition, limited capabilities of mobiles require a control on node congestion due to message forwarding.  In this paper, we present a randomized version, called R-DSDV, of the known destination-sequenced distance vector (DSDV) routing protocol for ad hoc networks and analyze its capabilities for distributed congestion control. The analysis is based on a novel approach that uses Markov chains for representing the distribution of routing information over the network. Our results indicate that a probabilistic congestion control scheme based on local tuning of protocol parameters is feasible and that such a mechanism can be effective in reducing the amount of traffic routed through a node which is temporarily congested. The traffic reduction is almost linear with respect to the decrease in the R-DSDV routing table advertisement rate of the congested node. On an average, the convergence time is relatively small as compared to the transmission rates of protocol messages.     

一种基于三角模糊数的VANETs机会路由算法*

分析了现有车用自组织网络（VANETs）的路由算法,提出一种新的基于三角模糊数的机会路由算法。新算法将转发结点距离目标结点的距离、到达目标结点的方向、行驶速度向量、重传次数、车流状况等因素作为目标函数进行分析计算,采用熵权系数法确定各因素权重。路由过程中,贪婪选择向量值最大的节点转发数据包;遇到网络不连续时,将采用“存储－携带－转发”的机会路由策略。仿真结果表明,该算法能够较好的适用于VANETs各种场景。     

A token based distributed algorithm for supporting mutual exclusion in opportunistic networks

Opportunistic networks are essentially distributed networks with transient connectivity among nodes. Nodes in opportunistic networks are resource constrained, mobile and opportunistically come in contact with each other. In such a distributed network, nodes may require exclusive access to a shared object or resource. Ensuring freedom from starvation is a challenging problem in opportunistic networks due to limited pairwise connectivity and node failures. In this paper, we review mutual exclusion algorithms proposed for generic mobile ad hoc networks (MANETs) and discuss their applicability to opportunistic networks. Further, we propose a novel token based algorithm¹ and prove its correctness. Simulation results show that our algorithm is communication efficient as compared to other algorithms proposed for generic mobile ad hoc networks. We also propose a timeout based fault detection algorithm that exploits the intercontact time distributions.     

基于热点簇的Ad hoc网络拥塞回避算法

Adhoc网络由于其节点具有随机移动性和分布密度不均匀的特征,容易引起网络局部的拥塞,但目前常用的Adhoc网络路由算法大多不具有拥塞响应机制。基于簇的网络结构易于实现对网络及节点的管理,论文定义热点簇,并提出基于热点簇的拥塞回避算法(CMHA),能实现对拥塞的快速响应,达到防止拥塞加剧的目的。算法利用多个节点的状态参数(如MAC延迟,或者缓冲区占有量)判断拥塞,并快速找到一条新的路径避开拥塞区域以降低拥塞区域负载。仿真结果表明此算法满足Adhoc网络中分级结构的要求,明显改善端到端的投递率,节省了能量,保证了服务质量。     

RBC-OLSR: Reputation-based clustering OLSR protocol for wireless ad hoc networks

We consider the problem of assuring the trustworthiness (i.e. reliability and robustness) and prolonging the lifetime of wireless ad hoc networks, using the OLSR routing protocol, in the presence of selfish nodes. Assuring the trustworthiness of these networks can be achieved by selecting the most trusted paths, while prolonging the lifetime can be achieved by (1) reducing the number of relay nodes (MPR) propagating the topology control (TC) messages and (2) considering the residual energy levels of these relay nodes in the selection process. In this paper, we propose a novel clustering algorithm and a relay node selection algorithm based on the residual energy level and connectivity index of the nodes. This hybrid model is referred to as H-OLSR. The OLSR messages are adapted to handle the cluster heads election and the MPR nodes selection algorithms. These algorithms are designed to cope with selfish nodes that are getting benefits from others without cooperating with them. Hence, we propose an incentive compatible mechanism that motivates nodes to behave truthfully during the selection and election processes. Incentive retributions increase the reputation of the nodes. Since network services are granted according to nodes’ accumulated reputation, the nodes should cooperate. Finally, based on nodes’ reputation, the most trusted forwarding paths are determined. This reputation-based hybrid model is referred to as RH-OLSR. Simulation results show that the novel H-OLSR model based on energy and connectivity can efficiently prolong the network lifetime, while the RH-OLSR model improves the trustworthiness of the network through the selection of the most trusted paths based on nodes’ reputations. These are the two different processes used to define the reputation-based clustering OLSR (RBC-OLSR) routing protocol.     

移动自组织网络基于极端预测的节能路由算法

在移动自组织网络中,减少移动节点电池能量消耗,延长网络生存时间,是路由协议性能优劣的一个重要指标.针对这一问题,提出了一种基于极端预测的路由算法,根据门限值划分节点稳定域,计算链路有效性,以最大最小路径有效性原则选路.同时,节点根据下一跳节点的位置自动调整发射功率,以达到节能的目的.仿真结果表明该算法与DSR相比能有效...     

An efficient hop count routing protocol for wireless ad hoc networks

An efcient hop count route fnding approach for mobile ad hoc network is presented in this paper.It is an adaptive routing protocol that has a tradeof between transmission power and hop count for wireless ad hoc networks.During the route fnding process,the node can dynamically assign transmission power to nodes along the route.The node who has received route request message compares its power with the threshold power value,and then selects a reasonable route according to discriminating algorithms.This algorithm is an efective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption.Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.     

移动自组网中基于节能的AODV路由协议改进

在AODV路由算法的基础上,综合考虑节点剩余能量和跳数,提出了一种新的节能路由策略。该策略同时对数据包和路由控制包进行功率控制,改进了Hello机制。仿真结果显示该策略显著地提高了节能效果,延长了网络的生存时间。     

Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks

In this paper, the problem of dynamic quality-of-service (QoS) multicast routing in mobile ad hoc networks is investigated. Lots of interesting works have been done on multicast since it is proved to be a NP-hard problem. However, most of them consider the static network scenarios only and the multicast tree cannot adapt to the topological changes. With the advancement in communication technologies, more and more wireless mobile networks appear, e.g., mobile ad hoc networks (MANETs). In a MANET, the network topology keeps changing due to its inherent characteristics such as the node mobility and energy conservation. Therefore, an effective multicast algorithm should track the topological changes and adapt the best multicast tree to the changes accordingly. In this paper, we propose to use genetic algorithms with immigrants schemes to solve the dynamic QoS multicast problem in MANETs. MANETs are considered as target systems because they represent a new generation of wireless networks. In the construction of the dynamic network environments, two models are proposed and investigated. One is named as the general dynamics model in which the topologies are changed due to that the nodes are scheduled to sleep or wake up. The other is named as the worst dynamics model, in which the topologies are altered because some links on the current best multicast tree are removed. Extensive experiments are conducted based on both of the dynamic network models. The experimental results show that these immigrants based genetic algorithms can quickly adapt to the environmental changes (i.e., the network topology changes) and produce high quality solutions following each change.     

Joint routing and flow rate optimization in multi-rate ad hoc networks

Typical radios in ad hoc networks can support multi-rate transmissions. However, traditional routing protocols do not use this feature well in multi-rate ad hoc networks and therefore, the network performance and resource utilization are not optimized. Some algorithms have been proposed to take advantage of the multi-rate transmission scheme, but their performance is not optimized either. In this paper, we show that a cross-layer optimization based approach can significantly improve the performance of multi-rate ad hoc networks over existing routing algorithms. For this, we consider link interference and propose joint routing and flow rate optimization for optimal performance in multi-rate ad hoc networks, i.e., a Cross-layer Optimization based Model for Multi-rate Ad hoc Networks (COMMAN). Considering the characteristics of multi-rate ad hoc networks, we design and implement a distributed heuristic of this centralized model. It is shown that the distributed heuristic algorithm can approximate the performance of COMMAN closely.     

A decentralized energy-based diffusion algorithm to increase the lifetime of MANETs

In this paper, we introduce a novel approach to improve overall lifetime in mobile ad hoc networks. Given the energy constraint on each node, this problem is formulated as an energy-controlled load balancing problem. Thus, our approach is quite different from usual energy-efficient routing or topology control methods. The proposed algorithm is fully distributed and ensures that each node will cooperate in proportion to its remaining energy, increasing the network lifetime. The relevance of the algorithm is evaluated through both theoretical analysis and simulations.     

A cost matrix agent for shortest path routing in ad hoc networks

Wireless ad hoc networks do not rely on an existing infrastructure. They are organized as a network with nodes that act as hosts and routers to treat packets. With their frequent changes in topology, ad hoc networks do not rely on the same routing methods as for pre-established wired networks; they require routing methods for mobile wireless networks. To select a path from a source to a destination in dynamic ad hoc networks, an efficient and reliable routing method is very important. In this paper, we introduce a cost-matrix-based routing algorithm. An agent node creates topology information in the form of the adjacency-cost matrix which shows link costs of the network.Based on the adjacency-cost matrix, the minimum-cost matrix and the next-node matrices can be calculated. Based on the minimum-cost matrix and the next-node matrices, the minimum cost between source and destination nodes and between intermediate nodes on the minimum-cost paths can be calculated.The matrices are periodically distributed by the agent to the other nodes. Based on the minimum-cost matrix and the next-node matrices, each node decides the minimum-cost path to its destination. Because none of the nodes except the agent needs to gather network topology information, the control overhead of the proposed method is small compared with those of the general table-driven routing protocols.