一种新的Ad Hoc分簇算法及其性能仿真

Ad Hoc网络是一种多跳的自组织网络,网络是由移动的节点组成。Ad Hoc网络的许多应用都依赖层次结构的支持,簇结构是Ad Hoc网络中应用最为广泛的层次结构,而这种层次结构的形成和维护依赖于某种分簇算法。提出了移动节点的平均连接度和能量状态的计算方法,并在此基础上提出了一种新的基于权值的分簇算法(NWBCA),通过对算法进行分析和仿真测试,证明了该算法的有效性。     

蓝牙个人区域网络视频流传输建模与仿真研究

目前无线ad hoc网络发展的目标是支持多媒体数据的传输,基于ad hoc网络的视频流传输有着巨大的应用前景。但是无线传输介质的不稳定特性决定了其支持视频流传输存在较大的挑战。在分析蓝牙技术特点的基础上,对蓝牙无线ad hoc网络视频流传输进行建模。设计基于所提模型的网络视频流传输模拟实验架构。在不同码率和不同路径长度的模拟环境下测试解码视频流的质量,研究分析蓝牙视频流传输性能。     

分层分布式Ad Hoc网络拓扑模型的研究

以战术互联网络应用环境为背景，对分层分布式Ad Hoe网络拓扑仿真模型进行了研究，提出了“分层分阶段拓扑生成算法”，拓扑仿真结果与实际网络拓扑特点相吻合。利用仿真平台Glomosim，将不同网络拓扑连接情况的组网性能参数相比较，发现分层分布式Ad Hoe网络拓扑对系统组网效率影响较大。     

基于战术互联网环境的自组织网络路由协议性能仿真与评估

战术互联网条件下的网络应用环境与民用网络相比，具有其特定的拓扑连接关系、移动方式和流量特征，而上述特点对于路由协议性能评估结果影响较大，针对应用背景结合路由协议评估体系，对自组织网络路由协议性能进行了仿真与评估，并得到如下结论：战术互联网环境下，移动性对路由协议的影响小于网络负载对协议性能的影响；同时，先应式路由协议比反应式路由协议更适合在网络负载较大的战术互联网环境中使用。     

QoS-aware multicast routing protocol for Ad hoc networks

1 .INTRODUCTIONA mobile ad hoc network ( MANET) is a multi-hopwireless network formed by a collection of mobilenodes without the intervention of fixedinfrastructure.Because an Ad hoc network is infrastructure-less andself-organized,it is used to provide i mpromptu com-munication facilities in harsh environments . Typicalapplication areas of mobile ad hoc networkinclude bat-tlefields ,emergency search,rescue sites and data ac-quisitionin remote areas . A mobile Ad hoc networkisalso usef…     

无线网卡能耗建模及在GloMoSim中的实现

参照笔记本电脑无线网卡各工作模式下功率消耗实测结果，建立了ad hoc网络结点无线网卡能耗模型，并介绍了如何在GloMoSim仿真环境中进行实现。此模型可广泛用于ad hoc网络无线结点能量消耗的研究中。运用新模型对IEEE 802．11节能模式的仿真表明：在流数目较多网络负荷较大时802．11节能模式并不能有效节省结点能耗，协议还需进一步改进。     

战术移动Ad hoc网络仿真中移动模型研究

移动Ad hoc网络仿真中，节点移动模型的选取是否合适对于仿真非常重要，它直接影响到能否正确评价各层技术方案对动态拓扑的适应性。通过对现有移动Ad hoc网络移动模型的研究比较，针对战术移动Ad hoc网络结构特点，归纳出战术移动Ad hoc网络中节点移动特征，提出并建立了战术移动Ad hoc网络移动模型。通过仿真比较得出，建立的移动模型符合战术移动Ad hoc网络作战想定，适合战术移动Ad hoc网络仿真。     

一种Ad Hoc网络信道接入退避算法及仿真分析

移动自组网络的应用环境以及其在商业上的潜在应用要求它支持QoS，高效合理的MAC协议对于保障Ad Hoc网络QoS具有重要的意义。在分析现有典型MAC协议及退避算法的基础上，提出了一种支特动态服务区分兼顾公平性的退避算法——服务区分动态退避（SDDB）算法。分析和仿真结果证明，与IEEE802．11等协议采用的退避算法相比，该算法在信道公平性和提供服务区分方面有较好的改善，并且在信道的吞吐量和提供服务区分、改善信道接入公平性之间能达到较好的折衷。     

一种有效的分布式节能广播算法及性能分析

给出了有效的应用于无线Ad Hoc网络的分布式节能广播算法。在确定转播结点时,该算法让那些拥有较多未覆盖邻结点和较大新增覆盖面积的结点进行转播,选取尽可能少的邻结点为转播结点,以减小广播分组在网络中的重复。所提广播算法的分布式设计解决了其他节能广播算法中存在的开销太大的问题,使其更加适用于无线Ad Hoc网络的特殊环境。通过大量的仿真对广播算法的性能进行分析,结果表明与其他算法相比,所提算法能够大幅降低转播冗余、有效增加网络寿命。     

Multilevel security model for ad hoc networks

Modern battlefield doctrine is based on mobility, flexibility, and rapid response to changing situations. As is well known, mobile ad hoc network systems are among the best utilities for battlefield activity. Although much research has been done on secure routing, security issues have largely been ignored in applying mobile ad hoc network theory to computer technology. An ad hoc network is usually assumed to be homogeneous, which is an irrational assumption for armies. It is clear that soldiers, commanders, and commanders-in-chief should have different security levels and computation powers as they have access to asymmetric resources. Imitating basic military rank levels in battlefield situations, how multilevel security can be introduced into ad hoc networks is indicated, thereby controlling restricted classified information flows among nodes that have different security levels.     

Ad hoc distributed mutual exclusion algorithm based on token-asking

The solution of distributed mutual exclusion is difficult in Ad hoc networks owing to dynamic topologies and mobility. Based on the analysis of the properties of Ad hoc networks and the disadvantages of the traditional algorithms, an improved Ad hoc system model was given and a novel algorithm was presented as AHDME (Ad Hoc Distributed Mutual Exclusion); it was based on the token-asking algorithms. It utilized broadcast to search for the token and to decrease the message complexity of multi-hop Ad hoc networks. Lamport's timestamp was improved to ensure the time sequence and to prevent nodes from starvation. When compared to traditional algorithms, AHDME does not require the fixed size of request queues and the global system information, which adapts itself to the frequent arrival/departures and the limited computing capability of nodes in Ad hoc networks. Performance analysis and simulation results show that the AHDME algorithm has low message complexity, small space complexity, and short response delay.     

Reliable adaptive multicast protocol in wireless Ad hoc networks

1.INTRODUCTIONA wireless ad hoc networkis a multi-hop wireless net-workformed by a collection of mobile nodes withoutthe intervention of fixed infrastructure.Because awireless ad hoc networkis infrastructureless and self-organized,it is used to provide i mpromptu communi-cationfacilities in harsh environments.Typical appli-cation areas of wireless ad hoc networkinclude battle-fields,emergency search,rescue sites and data acqui-sitionin remote areas.A wireless ad-hoc network isalso useful …     

Distributed intrusion detection for mobile ad hoc networks

Mobile ad hoc networking （MANET） has become an exciting and important technology in recent years, because of the rapid proliferation of wireless devices. Mobile ad hoc networks is highly vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective for those features. A distributed intrusion detection approach based on timed automata is given. A cluster-based detection scheme is presented, where periodically a node is elected as the monitor node for a cluster. These monitor nodes can not only make local intrusion detection decisions, but also cooperatively take part in global intrusion detection. And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing （DSR）. The monitor nodes can verify the behaviour of every nodes by timed automata, and validly detect real-time attacks without signatures of intrusion or trained data. Compared with the architecture where each node is its own IDS agent, the approach is much more efficient while maintaining the same level of effectiveness. Finally, the intrusion detection method is evaluated through simulation experiments.     

Distributed intrusion detection for mobile ad hoc networks

Mobile ad hoc networking(MANET)has become an exciting and important technology in recent years,because of the rapid proliferation of wireless devices.Mobile ad hoc networks is highly vulnerable to attacks due to the open medium,dynamically changing network topology,cooperative algorithms,and lack of centralized monitoring and management point.The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective for those features.A distributed intrusion detection approach based on timed automata is given.A cluster-based detection scheme is presented,where periodically a node is elected as the monitor node for a cluster.These monitor nodes can not only make local intrusion detection decisions,but also cooperatively take part in global intrusion detection.And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing(DSR).The monitor nodes can verify the behaviour of every nodes by timed automata,and validly detect real-time attacks without signatures of intrusion or trained data.Compared with the architecture where each node is its own IDS agent,the approach is much more efficient while maintaining the same level of effectiveness.Finally,the intrusion detection method is evaluated through simulation experiments.     

一种无线局域网节能协议研究

提出了一种基于802.11DCF的分布式报文驱动节能协议802.11PS协议,通过使结点在既不能发送又无需接收时进入睡眠状态来节省其能量消耗。采用近似方法分析了协议在全互连网络中的节能性能,并通过仿真验证了近似分析的合理性。结果表明,在没有接入点的无线局域网环境中,当网络负荷较高时,802.11PS协议能够有效降低网络结点无线网卡总功耗(最多可节能70%以上),并且其时延和吞吐率性能仍与802.11DCF协议大体相当。协议无需全网同步,也可用于多跳ad hoc网络。     

采用平均加权的ad hoc网络分布式时隙同步算法

为了降低现有ad hoc网络分布式时隙同步算法复杂度,基于研究多个体系统行为特征的Vicsek模型,提出一种采用平均加权的分布式时隙同步算法。各节点通过计算自身及其邻节点时隙起始时刻的算术平均调整时隙位置,最终达到所有节点时隙位置的统一,实现全网同步。对算法在不同网络连接下的收敛性进行逐一分析,并对网络节点随机分布时的算法收敛性进行仿真,结果表明,算法适用于各种连通性网络且收敛速度较快。     

WSN节点重要性和网络抗毁性的分析方法

无线传感器网络的一个重要设计目标是网络可靠性,无线传感器网络条件受限,节点能源有限,布置环境恶劣,使得研究无线传感器网络的节点重要性和抗毁性变得至关重要.节点的剩余能量会对网络生存时间产生影响,同样节点在拓扑结构中的位置也会对网络各个指标产生影响.通过研究节点的剩余能量和节点在拓扑结构中的贡献,综合这两种因素,提出了计算节点重要性和网络抗毁性的方法.仿真结果及对比表明该方法效果较好,且算法并不复杂.     

基于拓扑维护的自适应多信道OLSR路由协议

OLSR是一种应用于无线移动Ad hoc网络的基于链路状态机制的先应式路由协议。在OLSR中,网络拓扑的动态变化会使节点掌握的拓扑信息失效,从而导致路由表项不全,影响路由性能。针对上述问题,提出了一种基于拓扑维护的自适应多信道路由协议MOLSR-TM,该协议把拓扑维护状况感知和自适应算法引入OLSR,以调整HELLO控制消息的发送频率和邻居记录表、拓扑记录表的刷新频率。性能分析和仿真结果表明,MOLSR-TM能改善节点的拓扑维护状况,增强动态拓扑适应能力,提高数据成功率、端到端时延和网络吞吐率等性能。     

Performance analysis of mobile ad hoc networks under flooding attacks

Due to their characteristics of dynamic topology, wireless channels and limited resources, mobile ad hoc networks are particularly vulnerable to a denial of service (DoS) attacks launched by intruders. The effects of flooding attacks in network simulation 2 (NS2) and measured performance parameters are investigated, including packet loss ratio, average delay, throughput and average number of hops under different numbers of attack nodes, flooding frequency, network bandwidth and network size. Simulation results show that with the increase of the flooding frequency and the number of attack nodes, network performance sharply drops. But when the frequency of flooding attacks or the number of attack nodes is greater than a certain value, performance degradation tends to a stable value.     

TDMA体制下的移动自组织网时隙同步方法

在TDMA体制下的移动网状自组织网络中,为了解决网络时隙同步问题,提出了一种不依赖GPS授时的网络时隙互同步算法。各节点通过计算相邻节点的时隙偏差,通过加权计算并调整本节点的时隙位置,使网内各节点的时隙起始都调整到同一位置上,达到时隙的互同步。通过仿真和实验,分析并验证了移动自组织网络时隙互同步的收敛性能和抗干扰性能。