基于定位的超宽带传感器网络路由算法研究

超宽带定位技术应用于移动传感器网络路由算法是目前研究热点,该文提出一种基于超宽带定位的源动态路由算法,通过超宽带定位建立网络拓扑,并根据节点移动速度来反映节点的移动效应;通过受限泛洪和移动预测两种路由机制来提高路由性能.仿真结果表明,该算法能提高移动节点的路由成功率,降低路由平均延时.     

Ad hoc网络路由协议的仿真及研究

Adhoc网络是一种由节点任意移动、拓扑结构动态、随机且快速变化的自组网。由于其复杂性和多样性,常规路由无法传输信息。所以自组网路由协议一直是无线网络研究中的热点之一。本文对Adhoc网络目前常用的路由协议在OPNET平台上进行了仿真,通过比较和研究网络吞吐量,延时和路由开销等性能参数分析出各路由协议适应的网络环境。     

无线网络中基于DSDV的最大化吞吐量的协作路由算法

为最大化无线自组织网络的吞吐量,提出一种自适应的协作路由算法。在算法中,协作分集技术与路由选择相结合,通过在路由的每一跳选择最佳的中继节点协作发送节点传输信息来改善网络吞吐量。首先通过目的序列距离矢量路由协议（DSDV）初步建立最短路由路径,在每条链路的发送节点和接收节点根据邻节点表选出公共邻居节点,建立候选中继集合;进一步,每一跳根据链路吞吐量,在候选中继集合中自适应选择最多两个中继来协助发送节点进行传输,并根据选出的中继节点数动态分配节点发射功率。在保证系统发射功率一定的情况下,最大化网络吞吐量。仿真结果表明,在相同的发射功率下,相对于非协作路由DSDV算法,采用固定数量中继的协作路由算法提高了整个网络的吞吐量,而自适应的协作路由算法可进一步提高吞吐量;同时仿真了网络吞吐量与网络规模和节点最大移动速度的变化关系。      

基于带宽预测的多媒体通信路由拥塞节点调度方法

为提高多媒体通信吞吐量,降低端与端传输延时,开展基于带宽预测的多媒体通信路由拥塞节点调度方法设计研究。将TCP/IP协议作为传输指令,建立多媒体通信路由节点通信模型;根据拥塞情况,预测通信过程中的链路带宽,计算通信路由节点有效传输量;引进QOS协商机制,控制节点流量,并结合不同节点的状态量,进行调度设计。实验证明,提出的方法有效提升多媒体通信路由吞吐量,降低通信过程延时,进一步提高通信数据传输速率。     

一种改进的链路容量优化路由策略

设计能够适应高移动环境下的空基自组网路由协议是目前研究的重点方向。提出了基于负载均衡的优化路由协议,该协议在获得位置信息的前提下,首先预测出通信链路的有效时间,然后在满足数据的时延、带宽以及链路有效性等多约束条件下,路由协议以均衡节点负载为优化目标,使得网络节点都能合理承担数据传输任务。仿真结果表明,设计的路由协议能够保证网络节点合理分担传输任务,充分利用链路资源,提高网络的吞吐量。     

一种面向小型无人机自组网的路由判据

针对小型无人机自组网节点数量多、位置动态变化、续航时间有限等特点,对经典航空路由协议(The Aeronautical Routing Protocol, AeroRP)中的判据进行改进,设计了一种基于节点生存时间的路由判据,综合考虑网络内无人机节点的剩余飞行时间、当前矢量速度、相关节点间距离和单跳最大传输距离等参数,通过对上述参数的无纲化处理得到判距,进而选取最优的下一跳节点。利用ns-3网络软件对改进判据进行仿真实现和性能分析,结果表明,新的路由判据在AeroRP中应用后,网络的传输吞吐量、准确度和时延等指标都明显好于经典的主动式路由协议——优化链路状态路由协议(Optimized Link State Routing Protocol, OLSR);并且相比经典AeroRP协议中的判据,改进判据在数据传输准确度提高的前提下,当网内节点数量超过70个时网络数据传输的吞吐量明显提升,更适合节点数量较多的应用场合。     

网络编码调度策略的研究

网络编码是通信领域的一项重大突破,其基本思想是建立在网络信息流的基础之上,通过网络节点对来自不同链路的信息流进行编码处理,使其既能实现传统路由功能,又能实现对信息的编码处理。分析了等速率的网络编码调度策略,并把自适应传输技术应用到网络编码的调度策略,然后通过Matlab仿真分析,验证了自适应的网络编码策略可提高通信系统的网络编码增益、吞吐量和减少数据传输延时方面的贡献。     

MANET网络中改进本地修复机制的AODV路由协议

针对移动AdHoc网络中,AODV路由协议在本地修复过程中存在路由发现币口路由维护的巨大开销。提出了一种改进本地修复机制的AODV路由协议。通过OPNET分别对普通AODV协议和提出的改进本地修复机制的AODV路由协议进行仿真。仿真结果表明,该机制有效地减少了路由开销和端到端的数据传输延时,提高了协议效率和整个网络的性能。     

一种联合路由层信息设计的多跳Ad Hoc MAC层协议

提出了一种单信道多跳Ad Hoc网络的媒体接入层协议.利用全向天线的特点,协议控制帧捎带路由信息,使邻居节点获知节点间路由状态.上游节点的ACK应答直接触发下游节点的CTS握手,形成CTS/DATA/ACK三维交互机制.协议可有效减少网络的握手开销,降低重负载时握手帧的冲突概率.仿真表明,协议可适应不同的拓扑.最好情况下,协议较IEEE 802.11协议的吞吐量约提升16.1%,端到端延时约降低16.8%.改善了多跳Ad Hoc网络性能.     

基于自相似业务的移动Adhoc网络路由算法研究

该文分析了移动Adhoc网络中普遍存在但被忽视的自相似业务的路由和排队性能,提出了基于网络规划模型的多径备份路由优化功率(MBOP)算法。该算法利用多路径和备份路由,并对网络的发射功率进行优化,适用于网络结构动态变化的移动无线自组织网络。仿真结果表明,该算法可以显著改善节点的排队性能,提高网络的吞吐量改进时延性能。     

Purposeful mobility for relaying and surveillance in mobile ad hoc sensor networks

We consider a mobile ad hoc sensor network. The mobility of the sensor nodes is designed with the cost of communication and mobility in mind along with consideration of the possible scanning tasks of the nodes. Our mobility algorithm is developed in the context of a distributed system where, for any single mobile node, only local information about associated energy costs is known. We use a distributed simulated annealing framework to govern the motion of the nodes and prove that, in a limiting sense, a global objective function comprising mobility and communication energy costs are minimized. This paper concludes with a simulation study focusing on mobile sensors with dual roles of scanning and relaying higher priority tracking traffic from tracking nodes.     

组移动模型中基于模型特点的数据收集分簇算法

如今移动传感器网络在各个领域已起到重要作用。目前,移动传感器网络在军事、民用、科研等领域的应用价值都很高。而数据收集问题一直是这方面科研中必须被突破的难题。组移动模型是移动传感网络中的一个重要的移动模型,在本领域内都起到重要作用,然而有关移动传感器网络组模型的数据收集算法却屈指可数。提出了一种组移动模型中基于模型特点的数据收集分簇算法——MCBC算法。该算法根据节点的速度和角度之间的关系确定两节点是否同组,再从中选择簇头,有效地利用了组移动模型中节点的移动特征。仿真结果表明,在组移动模型中,该算法能取得较好的性能。     

MOBILITY AIDED LOCALIZATION OF WIRELESS SENSOR NETWORKS WITH INACCURATE RANGE MEASUREMENTS

This paper studies the relationship between mobility, navigation and localization in the context of wireless sensor networks with mobile beacons. It is observed that mobility can aid in network node localization and that once localized, the network nodes can localize and track a mobile object and guide its navigation. A distributed kernel-based algorithm is proposed that enables the nodes to establish confident position estimates in the presence of ranging inaccuracies. The proposed approach features robustness with respect to range measurement inaccuracies, low complexity and distributed implementation, using only local information. Simulation validates our approach viable.     

一种基于无线局域网的移动检测优化方案

无线局域网采用移动IP实现移动性管理.移动IP切换存在切换时延大,数据包易丢失的问题.切换时延由移动检测时延和注册时延组成,而移动检测时延在其中占主要部分.文章提出了一种移动检测优化方案,采用了自适应绑定的算法,同时充分考虑了域内小范围高频度切换的情况,使移动节点在无线局域网环境中进行快速有效的切换.     

Extending the Lifetime of Wireless Sensor Networks Through Mobile Relays

We investigate the benefits of a heterogeneous architecture for wireless sensor networks (WSNs) composed of a few resource rich mobile relay nodes and a large number of simple static nodes. The mobile relays have more energy than the static sensors. They can dynamically move around the network and help relieve sensors that are heavily burdened by high network traffic, thus extending the latter's lifetime. We first study the performance of a large dense network with one mobile relay and show that network lifetime improves over that of a purely static network by up to a factor of four. Also, the mobile relay needs to stay only within a two-hop radius of the sink. We then construct a joint mobility and routing algorithm which can yield a network lifetime close to the upper bound. The advantage of this algorithm is that it only requires a limited number of nodes in the network to be aware of the location of the mobile relay. Our simulation results show that one mobile relay can at least double the network lifetime in a randomly deployed WSN. By comparing the mobile relay approach with various static energy-provisioning methods, we demonstrate the importance of node mobility for resource provisioning in a WSN.      

LOMM:移动网格中的移动性管理机制

基于移动网格的覆盖网体系结构,本文提出基于分层覆盖网络的移动性管理机制LOMM.移动节点在入网和移动时,动态的将其位置信息向固定节点构成的核心覆盖网络中进行注册和更新;通信节点则通过核心覆盖网络的结构化路由方式来解析移动节点的当前位置.最后对移动性管理机制的性能进行理论分析和仿真分析.     

Mobility prediction in mobile ad hoc networks using a lightweight genetic algorithm

A mobile ad hoc network is a collection of wireless mobile nodes creating a network without using any existing infrastructure. Much research has been carried out to find out an optimal routing protocol for the successful transmission of data in this network. The main hindrance is the mobility of the network. If the mobility pattern of the network can be predicted, it will help in improving the QoS of the network. This paper discusses a novel approach to mobility prediction using movement history and existing concepts of genetic algorithms, to improve the MANET routing algorithms. The proposed lightweight genetic algorithm performs outlier removal on the basis of heuristics and parent selection using the weighted roulette wheel algorithm. After performing the genetic operations a node to node adjacency matrix is obtained from which the predicted direction of each node is calculated using force directed graphs and vector calculations. The technique proposes a new approach to mobility prediction which does not depend on probabilistic methods and which is completely based on genetic algorithms.     

节点密集型传感器网络中路由算法的研究

传感器网络的路由协议越来越引起人们的关注。针对节点高密度部署并且存在部分移动节点的网络环境,当前常用的各类路由算法都不能有效地降低能耗。论文提出了改进型GAF算法,将网络划分成若干个单元格,不同移动速度的节点以不同的权重竞选簇头,竞选失败者将进入休眠状态,以此来降低网络总能耗。通过分析和仿真,验证了该算法在节能方面的优势。     

Energy and delay efficient dynamic cluster formation using hybrid AGA with FACO in EAACK MANETs

MANET is a set of mobile nodes which works in a dynamic changing network and it is capable of communicating with each other efficiently where all the nodes perform a dual role as that of a transmitter and a receiver. MANETs do not use any centralized administration for communication. The performance of a MANET can be further enhanced by adapting a cluster mechanism with the help of CEAACK to provide security from penetrators. In this paper we propose a new improved ant colony optimization algorithm with two strategies to reduce the overhead in communication by predicting mobility of node and cluster formation. Firstly, a dynamic mechanism is designed for determining one or more heuristic parameters for improving the performance of the MANET. Secondly a dynamic list of nodes are maintained which helps in forming clusters and electing the cluster head faster. In addition a dynamic broadcast approach algorithm is incorporated to provide the information about the status of the nodes to the hybrid fuzzy-ant colony algorithm. This approach ensures low maintenance cost and is expected to be robust against node failures and network topology changes. The positive outcome of these two techniques consumes low energy and in the process provides better efficiency in data transmission in MANETs. It also achieves correct delivery of packets without unnecessary delay.     

A Green Clustering Protocol for Mobile Sensor Network Using Particle Swarm Optimization

Energy consumption of sensor nodes is one of the crucial issues in prolonging the lifetime of wireless sensor networks. One of the methods that can improve the utilization of sensor nodes batteries is the clustering method. In this paper, we propose a green clustering protocol for mobile sensor networks using particle swarm optimization (PSO) algorithm. We define a new fitness function that can optimize the energy consumption of the whole network and minimize the relative distance between cluster heads and their respective member nodes. We also take into account the mobility factor when defining the cluster membership, so that the sensor nodes can join the cluster that has the similar mobility pattern. The performance of the proposed protocol is compared with well-known clustering protocols developed for wireless sensor networks such as LEACH (low-energy adaptive clustering hierarchy) and protocols designed for sensor networks with mobile nodes called CM-IR (clustering mobility-invalid round). In addition, we also modify the improved version of LEACH called MLEACH-C, so that it is applicable to the mobile sensor nodes environment. Simulation results demonstrate that the proposed protocol using PSO algorithm can improve the energy consumption of the network, achieve better network lifetime, and increase the data delivered at the base station.