MANET手机通信的资源互发现算法及其实现

针对现有的移动Ad hoc网络(MANET)资源互发现算法存在问题进行研究,提出用于MANET手机通信的移动资源互发现算法(MRDA).该算法中每个节点都是等价的,使用组播和单播相结合来发送信息,可以更合理利用带宽,解决了已有MA-NET资源互发现算法采用广播方式带来的信息泛滥,占用带宽高,节点计算能力下降等问题.MRDA算法使用分布式哈希表(DHTs)存储路由表项信息,减小了网络总开销,增强了设备计算能力.同时,针对手机内存、电力受限等特点,对报文的格式进行了设计,简化了报文结构,采用动态广告报文发送间隔,有效减少了内存占用和网络传输代价.最后,建立手机终端节点之间通信的MANET环境,利用MRDA算法实现手机终端即时通信原型.     

具有范围选择的传感网络再编程协议算法研究

已有的传感网络再编程协议大多假定网络中所有节点是同类的,运行同一版本的应用程序,而实际网络节点是异类的。提出了一种新的具有范围选择的再编程协议,该协议变传统的ADV-REQ-DATA三次握手该协议为路由形成、代码传送、请求丢失包三个阶段协议,有效地降低了参与代码转发的中间节点数;中间转发节点通过获取一跳范围内希望接收更新代码数据的节点序列,采取单播或组播方式有针对性传送更新代码,而不是泛洪式的广播,减少了REQ确认信息包,并能统计出参与代码更新的同类节点数和参与代码转发的异类中间节点数。性能分析与模拟实验表明:该协议在平均延时、能量消耗等方面优于传统的Aqueduct。     

服务于TCP的高移动性无线网络路由协议

提出了一种基于地理位置信息的无线网络路由协议LADRU,以增强高移动性网络TCP的性能。协议采用单播和广播相结合的礼花式广播来减少系统开销,以随机竞争方式探测路由,减少寻找新路由的代价。通过估计网络节点的运动速率来自动调节路由探测周期,使路由得到及时更新。采用标签路由方法传递数据包,解决源路由方式数据包头过大和路由切换问题。仿真结果表明LADRU能有效地提高数据传输率和系统吞吐率。     

无线传感器网络的安全地理位置跨层协议

许多无线传感器网络(WSN)协议设计过程中,没有考虑到安全问题。提出一种安全地理位置跨层协议(Secure Geo-graphic Integrated Protocol,SGIP)。在安全协议的设计过程中,同时考虑了安全引导过程。首先改进了基于位置的密钥引导方案,使其不但充分利用地理信息,而且可以同时为广播包和单播包加密,并且转发区域内所有节点都与源节点有共享密钥。在此基础上,采用基于MAC层竞争的地理路由选择算法,并对不同数据包采用不同的加密方式,设计了安全的路由/MAC跨层协议。分析表明协议具有很好的安全性能,并且开销较小。     

移动自组织网络中内部丢包的检测模型

无线移动自组织网络中数据的传输是基于中间节点的合作转发的,但由于内部自私节点为了节省带宽和电量或者网络受到恶意节点的攻击,导致丢包行为发生,网络性能严重降低。基于无线自组织网络常用的路由协议AODV,提出了一种新的针对内部丢包攻击的检测模型。该检测模型引入旁信道概念,旁信道节点和看门狗共同检测并记录节点转发报文行为,采用邻居信息表存放检测结果,当相应节点的记录值达到一定下限时就被隔离出网络。由于旁信道可以发送警报报文,该模型能够同时检测到自私节点或合作攻击节点引起的内部丢包攻击。     

基于滑动缓存的WSN可靠协议及其能耗分析

数据如何以较低的能耗进行可靠传输是无线传感器网络中数据采集亟需解决的问题。基于此,提出一种缓存位置滑动调整的可靠传输协议,该协议基于通信的中间节点缓存数据包,按照通信距离将链路上的节点划分为近源节点和近汇聚节点,根据链路质量动态调整缓存数据包的节点区域,数据包在相应节点区域的缓存呈正态分布。NS2仿真结果与基于马尔科夫链能耗分析结果表明,该协议中数据包的传输时延小于HHRA协议,吞吐量有较大程度的提高。     

MANET与Internet互联时的增强型机制研究

已有的移动自组网与Internet的互联协议由于无法克服网关发现过程中的单向链路并且因盲目转播网关发现报文形成广播风暴等原因而致使性能严重恶化。该文提出了一种增强型的综合互联协议,该协议一方面采用效率较高的综合方式进行网关发现,另一方面则通过交换携带有对称邻居列表和非对称邻居列表的HELLO分组而有效克服了网关发现过程中的单向链路,同时抑制了广播风暴的形成。基于NS2的仿真结果显示该增强型的综合互联协议在不引入新控制分组的前提下能显著提升互联性能,降低互联开销。     

VANET中一种基于概率转发的AODV路由协议

泛洪被作为实现广播通信的最简单的技术,广泛应用于车联网VANET(vehicular Ad Hoc network)路由.然而,由于VANET中节点的快速移动以及网络拓扑动态变化,简单的泛洪容易导致大量的冗余数据包,并引发广播风暴.为此,以典型的按需式距离矢量路由协议AODV (Ad Hoc on-demand distance vector)为基础,提出基于概率转发的AODV路由协议,记为AODV_P.AODV_P协议利用概率转发机制替代AODV中的泛洪.节点利用距离、密度信息计算转发概率,并依据转发概率设置计时器.计时器时间越短,成为下一跳转发节点的可能性越大.仿真结果表明,提出的AODV_P能够有效降低冗余数据包,缓解广播风暴问题.与AODV协议相比,AODV_P在传输时延、数据包传输率方面得到了有效提高.     

一种基于稳定簇的混合路由协议CBHRP

移动算组网是一种没有有线基础结构支持的移动网络,具有带宽有限和拓扑结构易变的特点。这些特点使得设计一个合适的路由协议具有一定的挑战性。该文针对移动自组网提出了一种基于稳定簇结构、按需路由和预先路由混合、支持单播和组播通信的路由协议CBHRP。CBHRP具有路由控制开销小、主机移动对拓扑结构改变的影响小、通信的初始延迟低和应用范围广的特点。     

基于局部邻居节点和链路权值的改进AODV路由协议

在节点高速移动的Ad Hoc网络环境中,广播风暴对网络性能的影响尤为重要,且网络拓扑结构的频繁变化极易导致路由中断.传统的AODV路由协议在路由发现阶段直接使用广播转发RREQ(路由请求分组)机制,容易导致广播风暴降低网络性能;同时,协议选择跳数最少的路径作为路由,没有考虑到节点的快速移动导致路由频繁失效,因此无法适应...     

一种无线切换认证协议的性能改进*

切换认证协议是确保移动节点在无线网络中多个接入点之间进行快速安全切换的关键。在设计切换认证协议时,必须充分考虑移动节点计算、存储能力低以及电池容量小等特点。针对无线局域网的切换认证协议HashHand双线性对运算消耗资源大的缺陷,提出了一种新的快速切换认证协议。该协议不使用对运算,仅使用加法群的点乘运算替代,提高了协议的效率。并且具有用户匿名性与不可追踪性,有条件的隐私保护性。用户与认证服务器满足互认证性,能够安全地协商会话密钥并且周期性地更新。该协议能有效地抵制重放攻击和拒绝服务攻击。     

Performance evaluation of dynamic probabilistic broadcasting for flooding in mobile ad hoc networks

In mobile ad hoc networks (MANETs), flooding is a required message dissemination technique for network-wide broadcast. The conventional blind flooding algorithm causes broadcast storm problem, a high number of unnecessary packet rebroadcasts thus resulting in high contention and packet collisions. This paper proposes a new probabilistic approach that dynamically fine-tunes the rebroadcasting probability of a node for routing request packets (RREQs) according to the number of neighbour nodes. We evaluate the performance of the proposed approach for the ad hoc on demand distance vector (AODV) routing protocol and compared against the blind flooding, fixed probabilistic and adjusted probabilistic flooding [L.M.M.M. Bani-Yassein, M. Ould-Khaoua et al., Performance analysis of adjusted probabilistic broadcasting in mobile ad hoc networks, International Journal of Wireless Information Networks 13(2) (2006) 127–140; M.B. Yassein, M.O. Khaoua et al., Improving route discovery in on-demand routing protocols using local topology information in MANETs, Proceedings of the ACM international workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks, Terromolinos, Spain, ACM Press, 2006, pp. 95–99.] approaches. The simulation results show that our proposed approach demonstrates better performance than blind flooding, fixed probabilistic and adjusted flooding approaches.     

一种基于AODV改进的城市车载自组网路由协议研究

针对城市环境下车载自组网的特点及AODV协议广播式路由探测的不足,采用贪婪转发的单播式路由探测和经典AODV协议的广播式路由探测相结合的路由探测方式,并且单播路由探测在选择下一跳转发节点时同时考虑贪婪转发和链路稳定两个因素,减少了广播帧的发送,提高了路由的稳定性。仿真实验表明,改进后AODV协议比经典AODV协议更加适合城市车载自组网。     

Multi-constraint multi-objective QoS aware routing heuristics for query driven sensor networks using fuzzy soft sets

In this paper, a fuzzy based distributed power aware routing scheme considering both energy and bandwidth constraints, especially for query driven applications in the asynchronous duty-cycled wireless sensor networks are devised. The proposed multi-constraint, multi-objective routing optimization approach under strict resource constraints guarantees reliability and fast data delivery along with efficient power management in spite of unreliable wireless links and limited power supply. In query driven applications, the request from the sink to the individual sensor node will be a broadcast message, whereas the individual sensor nodes replies back to sink as unicast messages. In the proposed work, the fuzzy approach and “A Star” algorithm are utilized for satisfying energy and bandwidth constraints to route the broadcast messages of the sink while querying all the sensor nodes in the network. Every node will be provided with a guidance list, which is used to decide the next best neighbor node with good route quality for forwarding the received multi-hop broadcast messages. The route quality of the every node is estimated with fuzzy rules based on the network parameters such as maximum remaining energy, minimum traffic load and better link quality to increase the network lifetime. The provision of overhearing the broadcast messages and acknowledgements within the transmission range minimizes the effort to search for the active time of nodes while routing the broadcast messages with asynchronous scheduling. Further, in the proposed work only the time slot of its nearest neighbor relay node (to which packets are to be forwarded) is learnt to reduce the number of message transmissions in the network. For the unicast message replies, the fuzzy membership function is modified and devised based on the routing metrics such as higher residual energy, minimum traffic loads and minimum hop count under energy and bandwidth constraints. Also, the multi-hop heuristic routing algorithm called Nearest Neighbor Tree is effectively used to reduce the number of neighbors in the guidance list that are elected for forwarding. This helps to increase the individual sensor node’s lifetime, thereby maximizes the network lifetime and guarantees increased network throughput. The simulation results show that the proposed technique reduces repeated transmissions, decreases the number of transmissions, shortens the active time of the sensor nodes and increases the network lifetime for query driven sensor network applications invariant to total the number of sensor nodes and sinks in the network. The proposed algorithm is tested in a small test bed of sensor network with ten nodes that monitors the room temperature.     

一种新的主动链路修复AODV路由协议

利用移动自组网中节点的局部冗余性进行链路修复,提出一种新的基于监听的AODV路由协议.节点通过监听邻居节点数据包的发送,获得本地的局部拓扑信息,并在满足备份链路条件的情况下,通知源节点成为其备份链路.当发生链路断开时,直接用路由表中的备份链路进行修复,而不需要广播RREQ分组.NS2仿真结果表明,在不同的动态场景中,算法均表现出良好的性能.     

一种移动终端辅助的传感器网络数据收集协议

提出了一种利用具有传感器通信接口的移动终端设备（如手机、手提电脑、个人数字助理等）进行辅助数据获取的传感器网络数据收集协议。网络中固定汇聚节点与移动终端共存,全部传感器节点都维护到固定汇聚节点的路由,移动终端进入网络后定期向其附近小范围内的传感器节点扩散自己的存在信息,传感器节点向距自己跳数最小的汇聚节点或移动终端发送或转发数据包,移动终端和传感器节点之间通过应答和重传的机制来保证数据的可靠传输。仿真研究证明,该协议在延长网络生存时间的同时可以获得较高的数据传输成功率和较短的数据传输延迟,而且可靠性、灵活性、可扩展性较强。     

The role of congestion in probabilistic broadcasting for ubiquitous wireless multi-hop networks through mediation analysis

Broadcast schemes play an important role in the performance of mobile ad hoc networks, which are a clear example of ubiquitous wireless multi-hop networks where nodes collaborate in a distributed way. They are widely used as a dissemination mechanism and as a part of the discovery phase of routing protocols. The simple flooding algorithm is the usual mechanism employed in mobile ad hoc networks, but its inefficiency has been demonstrated in congested scenarios due to the high number of collisions and contentions. However, these problems can be partially alleviated by using a probabilistic broadcast approach in which every node forwards the incoming packets according to a certain forwarding probability. In this paper, we use a simple probabilistic broadcast protocol to evaluate the effects of congestion on the performance of broadcasting in ad hoc networks through a mediation analysis. We hypothesize that the congestion mediates in the relationship between the forwarding probability (independent variable) and the output metric (dependent variable). We consider several output metrics according to the application of the broadcasting protocol such as reachability, broadcasting delay, packet delivery fraction and end to end delay. The simulation results show the existence of the mediating effects and how such effects may be counterbalanced depending on the target use of the probabilistic broadcast scheme.     

无线传感网络的广播时效性研究

无线传感网络的节点采用时隙CSMA/CA协议获取信道并广播数据.为了度量信息广播的时效性,提出了广播信息年龄(broadcast age of information,bAoI)的概念.广播信息年龄等于当前时刻减去刚刚广播成功的那个数据包的生成时刻.bAoI量化了每个节点的数据包的新鲜度,并且描述了节点在网络上快速广播...     

基于NS2的Ad Hoc网络AODV协议研究与改进

无线自组网是由一组无线移动主机组成的无基础设施的临时网络,在与其相关的网络协议的研究中常涉及到修改及扩展问题。文章分析了经典按需路由协议AODV的路由发现和建立过程,通过NS2仿真软件的内核扩展及重编译,在控制台输出相关的扩展内容,包括RREQ和RREP包的传送、正反向路由表的建立和节点路由表的更新等信息。结果表明,在NS2仿真软件下对无线自组网路由协议的研究和调试分析是一种科学有效的方法。最后对AODV协议本身提出了几种改进的思路和方法。