一种Ad—hoc密钥维护优化方案

Ad-hoc网络节点之间的无线连接越多，网络通信跳数相对越少，但网络需要的密钥量越大，加重了密钥维护的负担，因此在通信跳数可接受的情况下应该尽量减少密钥量。定义了网络付出的代价，用来描述通信跳数和密钥量。以网络付出的代价最小为原则，设计了一种简单的密钥维护优化方案。将方案应用于一个Ad-hoc场景，推算结果表明该方案对密钥维护的优化是有效的。     

Hierarchical micro-mobility management in high-speed multihop access networks

1 Introduction A wireless multihop network or Ad-hoc network [1, 2] is a network of independent mobile hosts without any network infrastructure or connection to base stations. In many application areas, however, Internet connectivity and access to service…     

基于ARAN的按需安全路由协议

在鉴别路由协议ARAN的基础上，提出了一种改进型IARAN协议。该协议简化了路由查找过程及其协议分组定义，并结合民用应用特点，使路由查找更为简捷。IARAN相比ARAN路由性能好、计算复杂度低、存储需求量小，可更好地适用于不同领域。对于Ad hoc中通常资源受限的节点，IARAN更为实用。     

On supporting high-throughput routing metrics in on-demand routing protocols for multi-hop wireless networks

Researchers have proposed routing metrics other than hop count, such as ETX (expected transmission count) and ETT (expected transmission time), to find routes with high throughput. These metrics are inherently suitable to be used in source routing protocols such as DSR, because link state information needs to be collected for the calculation of the shortest path. In this paper, we propose an efficient and generalized approach called accumulated path metric (APM) for supporting high-throughput metrics (HTMs) in on-demand routing protocols. One advantage of APM is that it is able to find the shortest path, in terms of a particular metric, without collecting topology information and without running a shortest-path algorithm. This will significantly simplify the existing design of supporting HTMs in DSR. We present a proof of the correctness of APM. Moreover, we address the problem of duplicate RREQ (route request) transmissions with existing HTM schemes and present a broadcast ordering (BO) technique to suppress unnecessary RREQ transmissions. We study the performance of APM and BO in both AODV and DSR, and the results verify the effectiveness of the proposed approaches.     

Weighted cooperative routing for wireless mobile Ad-hoc network

A novel weighted cooperative routing algorithm (WCRA) is proposed in this article, which was on the basis of a weighted metric with maximal remaining energy (MRE) of the relays and the maximal received SNR (MRS) of the nodes. Moreover, a cooperative routing protocol was implemented on the basis of WCRA. Then simulation is done on network simulation (NS-2) platform to compare the performances of MRS, MRE and WCRA with that of noncooperative destination-sequenced destination-sequenced distance-vector (DSDV) protocol. The simulative results show that WCRA obtains a performance tradeoff between MRE and MRS in terms of delivery ratio and network lifetime, which can effectively improve the network lifetime at an acceptable loss of delivery ratio.     

异构车载自组网中两级资源调度机制研究

WiMAX网络和WAVE网络中资源调度方式不同,但又需要在移动网关节点处进行互通。为此,提出一种基于反馈的两级资源调度机制。在WiMAX网络中采用基于权重的轮询调度,针对WAVE网络提出一种基于反馈的EDCA接入方式,使节点各业务的发送速率契合WiMAX 网络中的调度规则。仿真结果表明,相比同类方法,该机制使系统的平均传输时延降低至20 ms,网关节点处的排队队长缩短了50%。     

基于分布传感的容迟自组织网络动态融合机制

为保证自组织容迟网络能够可靠并有效传输数据,以更好地实现在传输效率与网络开销之间的均衡,提出了一种基于分布传感的容迟自组织网络动态融合机制.该机制在分析自组织容迟网节点分布特性的基础上,通过分布式节点密度感知,实现快速获知整个网络中热点区域的节点分布,并利用热点区域节点之间的限跳函数实现动态路由,以最大程度减少在热点区域的冗余数据,有效地降低网络整体传输时延与开销.仿真结果表明,该算法在传输效率和时延方面展示具有明显优势,且有效降低网络冗余信息开销.     

VANET中基于跨层路由设计的协作通信研究

研究了无线车载Ad-hoc网络(VANET)中基于跨层路由设计的协作通信性能,首先构建了跨层协作通信系统模型,针对两种不同的性能要求,推导出所研究的跨层优化问题的目标函数公式,并作为协作通信路径决策的数量标准。仿真分析结果表明车辆间的协作通信模式可以显著降低无线链路开销,降低通信中断概率,提高车载网络的性能。     

基于WiFi的自组织网络路由协议算法研究

以基于WiFi的自组织网络为应用背景,本文利用仿真平台OPNET对四种经典自组网路由协议的性能进行了仿真比较。实验结果表明,反应式路由协议的性能总体优于先应式路由算法,而AODV协议由于其备份路由的特性,性能更优。为满足战场环境下车载自组织网的大规模组网要求,以及火控数据的时延传输要求,结合AODV算法的优势,本文提出了一种新的分层自组网路由算法CRP,其分簇结构的设计减少了网络拓扑变化对寻由过程的影响和路由发现过程中的洪泛开销,加速了路由的查找过程,仿真结果显示该算法的综合性能优于AODV算法及经典分簇路由协议ZRP算法,端到端传输时延明显减小。     

OGHAM: On-demand global hosts for mobile ad-hoc multicast services

Recent advances in pervasive computing and wireless technologies have enabled novel multicast services anywhere, anytime, such as mobile auctions, advertisement, and e-coupons. Routing/multicast protocols in large-scale ad-hoc networks adopt two-tier infrastructures to accommodate the effectiveness of the flooding scheme and the efficiency of the tree-based scheme. In these protocols, hosts with a maximal number of neighbors are chosen as backbone hosts (BHs) to forward packets. Most likely, these BHs will be traffic concentrations or bottlenecks of the network and spend significant amount of time forwarding packets. In this paper, a distinct strategy is proposed for constructing a two-tier infrastructure in a large-scale ad-hoc network. Hosts with a minimal number of hops to the other hosts rather than those with a maximal number of neighbors will be adopted as BHs in order to obtain shorter multicast routes. The problem of determining BHs can be formulated with linear programming. BHs thus found have the advantages of shorter relay and less concentration. Besides, BHs are selected on-demand and can be globally reused for different multicast groups without flooding again. Simulation results show that the proposed protocol has shorter transmission latency, fewer control/data packets and higher receiving data packet ratios than other existing multicast protocols. Besides, the two-tier infrastructure constructed by the proposed protocol is more stable.