一种基于不完美信息博弈的多冲突域信道分配算法

无线网络中信道分配的好坏将极大地影响网络整体性能,为了解决和优化此问题,提出了一种基于不完美信息博弈的信道分配算法。假设网络场景为多跳Ad Hoc网络,因此对其采用多冲突域建模更符合实际。算法通过不断循环改变各用户无线电的信道试图接近纳什均衡点,仿真结果表明算法能够使信道分配策略接近纳什均衡信道分配,同时相比单冲突域情况在多冲突域中更能最大化信道使用率。     

定向Ad hoc网络中一种带冲突避免的邻居发现算法

定向天线应用于ad hoc网络,一方面能显著提升网络性能,另一方面也需要新的MAC和路由协议来控制定向天线系统。邻居发现算法作为其中最重要的协议之一,是定向ad hoc网络组网的基础和前提,针对现有文献中提出的各种邻居发现算法大多没有考虑同一定向波束扇区内存在多个节点时的冲突情况,提出一种带冲突避免的定向邻居发现算法DAND/CA。DAND/CA通过随机选择发送控制消息占用的微时隙,能有效避免碰撞冲突的发生。仿真结果表明,提出的DAND/CA算法在邻居发现时间和成功率等方面明显优于现有算法。     

无线ad hoc网络多性能指标基本性能边界

在无线ad hoc网络中,基本性能边界对路由算法和资源分配协议的分析和评价具有重要的意义。对无线ad hoc网络多性能指标基本性能边界进行了研究,包括理论上最优的性能边界和实际可以得到的性能边界。提出了一种稳定状态(steady state)下的网络基本性能指标分析模型。该模型考虑了无线网络广播特性和无线信道干扰,可同时分析多个性能指标,包括：吞吐量、端到端延迟和能量消耗。基于该模型,针对ad hoc网络中最常见的多流—单/双中继拓扑分析基本性能指标,求解多目标优化问题得到基本性能边界。仿真结果验证了模型的准确性,均方根误差小于10-3量级。     

增强Ad-hoc网络可生存性的健壮多维信任模型

针对目前攻击者可以结合多种攻击手段对ad hoc网络进行复合攻击的现状,提出了一种健壮的多维信任模型(RMTM)以增强ad hoc网络的可生存性.RMTM基于D-S证据理论,将节点的攻击证据分成多个维度,每个维度的信任根据基本信度分配函数计算,并通过多维信任融合实现对节点的综合评价.同时,为了应对攻击者对信任模型本身进行攻击,设计了相应容忍算法以提高RMTM的健壮性.仿真实验验证了RMTM可在较低系统开销内有效防御ad hoc网络复合攻击和信任模型攻击,进而大幅度地增强了ad hoc网络可生存性.     

一种基于信道阻力的Ad hoc网络多路径路由算法

该文提出了一种基于信道阻力的Ad hoc网络多路径动态源路由算法。算法中定义了信道阻力的概念,并以信道阻力为依据来进行多条路径的流量分配,由于信道阻力计算中综合考虑了链路质量的各个度量参数,因此能够根据各条路径的传输能力合理分配数据流量。NS2环境下的仿真表明,新算法能够有效地平衡网络负载,提高网络的吞吐量。     

移动ad hoc网络安全综述

移动ad hoc网络是由移动节点自组织形成的网络,由于其动态拓扑、无线通信的特点,容易遭受各种安全威胁.该文介绍了移动ad hoc网络安全研究的最新研究进展.首先从传输信道、移动节点、动态拓扑、安全机制、路由协议几方面,分析了移动ad hoc网络的安全弱点,然后将移动ad hoc网络安全方面的研究分为三个方向:密钥分配与管理、入侵检测、增强合作.对每个方向内一些典型安全方案也进行了分类论述,同时分析了各种方案的优点和缺点,并进行了综合比较.文中阐明了目前协议存在的一些问题并提出了相应的改进方法,最后指出了下一步研究方向.     

基于改进粒子群算法的Ad Hoc网络移动模型研究

 移动模型是研究ad hoc网络路由算法的基础.为解决基本粒子群算法的速度突变问题,使其适用于ad hoc网络移动模型,本文首先在基本粒子群算法的速度和位移更新公式中引入加速度和环境因子的概念,并提出用直角坐标系对其速度和位移进行分解.接着,我们建立了包含障碍物模型、速度初始化函数和无边界仿真区域的改进粒子群算法移动模型.为证实新移动模型的可行性和有效性,我们用Matlab和网络仿真软件OPNET进行仿真实验.结果表明,与传统的随机位点移动模型比较,基于改进粒子群算法的移动模型更贴近实际情景,并能够有效地应用在ad hoc网络中.     

ad hoc网络组播对于DoS攻击畦抵抗策略分析

与固定有线网络相比,无线ad hoc网络动态的拓扑结构、脆弱的无线信道、网络有限的通信带宽以及节点兼备主机和路由功能等特点,使得网络容易遭受拒绝服务（DOS）攻击。文章针对ad hoc网络的组播应用在抵御DoS攻击方面的不足,提出外部和内部两种组播DoS泛洪攻击模型,同时针对ad hoc网络组播组内的攻击提出相应的两种抵抗策略和具体实现步骤。     

Ad hoc网络中基于多波束天线的集中式低时延调度算法

UxDMA算法是一种高效的集中式算法,是用于时分多址、频分多址和码分多址信道分配的统一算法。在UxDMA的基础上,利用多波束天线的多波束形成能力,针对低时延定向ad hoc网络提出了一种集中式调度算法——CLSM(Centralized Low-delay Scheduling Algorithm Based on Multi-beam Antennas)。CLSM通过不同时延等级限制的报文来比较着色后发送链路的优先级,优先选择高优先级链路传输。通过仿真验证了CLSM的性能：与UxDMA相比,该算法在多时延限制的发送端调度中表现出了更好的吞吐量和时延性能。     

适于ad hoc网络安全通信的新签密算法

首先提出了一个基于身份的新签密算法,并对其安全性和效率进行了分析及证明;结果表明,该算法在随机预言机模型下是可证明安全的,而且与已有基于身份的签密算法相比,其计算量和传输代价小,特别适合用于ad hoc网络的密钥管理、安全路由等通信安全协议.最后,以ad hoc网络分布式门限密钥管理中各服务节点所拥有的系统密钥份额的更新为例,说明了将新签密算法用于ad hoc网络安全协议的方法及其意义.     

Optimal resource allocation in wireless ad hoc networks: a price-based approach

The shared-medium multihop nature of wireless ad hoc networks poses fundamental challenges to the design of effective resource allocation algorithms that are optimal with respect to resource utilization and fair across different network flows. None of the existing resource allocation algorithms in wireless ad hoc networks have realistically considered end-to-end flows spanning multiple hops. Moreover, strategies proposed in wireline networks are not applicable in the context of wireless ad hoc networks, due to their unique characteristics of location-dependent contention. In this paper, we propose a new price-based resource allocation framework in wireless ad hoc networks to achieve optimal resource utilization and fairness among competing end-to-end flows. We build our pricing framework on the notion of maximal cliques in wireless ad hoc networks, as compared to individual links in traditional wide-area wireline networks. Based on such a price-based theoretical framework, we present a two-tier iterative algorithm. Distributed across wireless nodes, the algorithm converges to a global network optimum with respect to resource allocations. We further improve the algorithm toward asynchronous network settings and prove its convergence. Extensive simulations under a variety of network environments have been conducted to validate our theoretical claims.     

Channel access-based self-organized clustering in ad hoc networks

An ad hoc network is a self-organized and distributed entity consisting of a number of mobile stations (MS) without the coordination of any centralized access point. Clustering is one of the fundamental problems in ad hoc networks. In this context, we describe a distributed clustering algorithm for multihop ad hoc networks. We first propose a randomized control channel broadcast access method to maximize the worst-case control channel efficiency, based on which a distributed clustering algorithm is proposed. Both theoretical analysis and simulations indicate that the proposed clustering algorithm takes much less time and overhead to cluster a given network with more stable cluster structure, while incurring very small maintenance overhead in a dynamic network resulting from the mobility of the MS.     

移动Ad HOc网络中的公平按需多址接入协议

基于快速、有效竞争预约接入、无冲突轮询传输的思想和带冲突预防的冲突分解策略,本文提出了适于移动Ad Hoc网络的公平按需多址接入(FODA)协议.该协议在分群结构的基础上,利用公平冲突预防算法预约信道资源获得轮询服务,从而完全消除了载波侦听方式下多跳无线网络业务传输中的隐藏终端和暴露终端问题.另外,公平冲突预防算法解决了节点竞争接入时的冲突问题和不公平现象.最后,仿真结果表明,与带冲突避免的载波侦听多址接入(CSMA/CA)和轮询协议相比,FODA协议可以提供较高的信道吞吐量、较低的平均消息丢弃率和平均消息时延.     

Channel Allocation Scheme for Handoff Control in Wireless Ad Hoc Network with Group Mobility

Because a wireless ad hoc network does not have a fixed backbone network and the mobile base station moves randomly, the conventional channel allocation scheme cannot efficiently predict group mobility and is not feasible to support a burst handoff traffic due to group mobility. In this paper, we propose an channel allocation scheme to solve this problem. Our scheme efficiently support burst handoff using guard channel and hello message in wireless ad hoc network with group mobility. We developed an analytical Markov model for the proposed scheme and evaluate our scheme in terms of new call and handoff blocking probability and channel utilization via simulation study. Simulation results show that our scheme offers better performance than the conventional schemes.     

ICAM: integrated cellular and ad hoc multicast

In third generation (3G) wireless data networks, multicast throughput decreases with the increase in multicast group size, since a conservative strategy for the base station is to use the lowest data rate of all the receivers so that the receiver with the worst downlink channel condition can decode the transmission correctly. This paper proposes ICAM, integrated cellular and ad hoc multicast, to increase 3G multicast throughput through opportunistic use of ad hoc relays. In ICAM, a 3G base station delivers packets to proxy mobile devices with better 3G channel quality. The proxy then forwards the packets to the receivers through an IEEE 802.11-based ad hoc network. In this paper, we first propose a localized greedy algorithm that discovers for each multicast receiver the proxy with the highest 3G downlink channel rate. We discover that due to capacity limitations and interference of the ad hoc relay network, maximizing the 3G downlink data rate of each multicast receiver's proxy does not lead to maximum throughput for the multicast group. We then show that the optimal ICAM problem is NP-hard, and derive a polynomial-time 4-approximation algorithm for the construction of the multicast forest. This bound holds when the underlying wireless MAC supports broadcast or unicast, single rate or multiple rates (4(1 + /spl isin/) approximation scheme for the latter), and even when there are multiple simultaneous multicast sessions. Through both analysis and simulations, we show that our algorithms achieve throughput gains up to 840 percent for 3G downlink multicast with modest overhead on the 3G uplink.     

Self-coordinating localized fair queueing in wireless ad hoc networks

Distributed fair queueing in a multihop, wireless ad hoc network is challenging for several reasons. First, the wireless channel is shared among multiple contending nodes in a spatial locality. Location-dependent channel contention complicates the fairness notion. Second, the sender of a flow does not have explicit information regarding the contending flows originated from other nodes. Fair queueing over ad hoc networks is a distributed scheduling problem by nature. Finally, the wireless channel capacity is a scarce resource. Spatial channel reuse, i.e., simultaneous transmissions of flows that do not interfere with each other, should be encouraged whenever possible. In this paper, we reexamine the fairness notion in an ad hoc network using a graph-theoretic formulation and extract the fairness requirements that an ad hoc fair queueing algorithm should possess. To meet these requirements, we propose maximize-local-minimum fair queueing (MLM-FQ), a novel distributed packet scheduling algorithm where local schedulers self-coordinate their scheduling decisions and collectively achieve fair bandwidth sharing. We then propose enhanced MLM-FQ (EMLM-FQ) to further improve the spatial channel reuse and limit the impact of inaccurate scheduling information resulted from collisions. EMLM-FQ achieves statistical short-term throughput and delay bounds over the shared wireless channel. Analysis and extensive simulations confirm the effectiveness and efficiency of our self-coordinating localized design in providing global fair channel access in wireless ad hoc networks.     

A detailed study of a CDMA based approach to enhance ad hoc network performance

Random access schemes operate typically on a contention based common channel, which brings problems with increasing traffic load. These problems are emphasized in a multi-hop wireless ad hoc network environment. Efficient collision avoidance methods are needed, but they also tend to decrease the spatial capacity of the network. With CDMA (Code Division Multiple Access), it is possible to make multiple simultaneous co-located successful transmissions and thus increase network capacity within the limits of multiple access interference (MAI). Bi-code channel access (BCCA) is a method to apply CDMA in ad hoc networking, providing also a common access channel for network connectivity maintenance and self-configuration. With BCCA, collisions are rare, and thus, more straightforward medium access control (MAC) methods can be used. A MAC solution designed especially for BCCA (BC-MAC) and ad hoc networking increases the efficiency of the channel usage. As BCCA is based on receiver code CDMA, the spreading code of the next hop node is needed. A novel network layer spreading code distribution (NSCD) method is proposed for this purpose. The spreading codes are distributed within routing protocol control packets at the route establishment phase.A detailed study on the performance behavior of different methods is provided. Also, interesting aspects considering the ad hoc network operation are discussed. Instead of the widely used unrealistic cut propagation model, a propagation model with realistic MAI calculation is used in this study. It is shown that the use of NSCD increases the network control load only slightly, and that the performance is practically the same as it is with the assumption of known spreading codes. BCCA with its dedicated MAC and NSCD clearly outperforms commonly used methods (like IEEE 802.11) and yet is easy to implement, robust for design parameters under different conditions while maintaining the original idea of ad hoc networking.     

Random walk for self-stabilizing group communication in ad hoc networks

We introduce a self-stabilizing group communication system for ad hoc networks. The system design is based on a mobile agent, collecting and distributing information, during a random walk. Three possible settings for modeling the location of the mobile nodes (processors) in the ad hoc network are presented: slow location change, complete random change, and neighbors with probability. The group membership algorithm is based on a mobile agent collecting and distributing information. The new techniques support group membership and multicast, and also support resource allocation.     

基于载波监听的Ad Hoc网络双信道接入协议研究

双信道接入协议在解决隐终端和暴露终端问题上具有独特的优势.基于报文监听的Ad Hoc网络双信道接入协议无法消除数据报文的冲突.本文对基于载波监听的Ad Hoc网络双信道接入协议进行了研究,提出了DCMA载波监听信道接入协议.其中DCMA_CSBI通过载波监听和BI控制报文完全解决了隐终端和暴露终端问题.文章通过仿真对DCMA协议的性能进行了分析和比较.分析结果表明DCMA_CSBI是一种非常高效实用的Ad Hoc网络双信道接入协议,载波监听对Ad Hoc网络信道接入协议而言是至关重要的.