无线ad hoc网络中多路径负载平衡性能分析

提出了一种新颖的分析模型来计算无线ad hoc网络中多路径情况下的负载。该模型考虑到多路径的数目、路由的选取方法以及网络中节点的密度等条件，能够对不同网络条件下的负载进行较好的分析与理论计算。仿真结果与理论计算有良好的一致性，结果表明在无线ad hoc网络中简单地使用多路径路由并不能有效地平衡网络负载。这一结论与目前普遍认定的结论（在无线ad hoc网络中使用多路径路由和在有线网络中使用多路径路由一样，可以很好地平衡网络负载、增加网络的吞吐量）是不一致的。     

蜂窝ad hoc网络概述

一、ad hoc网络与蜂窝网络的结合 在移动无线通信网络原有的网络构架技术中通常包括蜂窝移动通信网络和无线局域网,蜂窝移动通信网络移动终端接入固定网络是基于基站的中心接人方式,而无线局域网则要通过接入点（AP）完成终端接入固定网络,这两种网络都是单跳网络。ad hoc技术所标称的是一种有别于中心接人和单跳的特征,强调多跳和无中心接入,移动终端不仅具有主机的功能,还具有路由器的功能,使得无线移动ad hoc网络被认为是下一代移动通信系统解决方案中最有希望被采用的末端网络。     

盲区环境下集成移动蜂窝和ad hoc网络的系统性能分析

首先介绍了一种在盲区环境下集成移动蜂窝和ad hoc网络的系统结构,接着分析了在这种环境下集成系统可获得中继节点的概率。然后结合这个概率,建立了集成移动蜂窝和ad hoc网络系统的解析模型,并且在这个模型的基础上,通过数学解析方法分别得到了传统蜂窝和集成网络系统的会话丢弃概率。最后通过数值仿真比较了在盲区环境中2种系统的性能,并分析了各种系统参数对集成移动蜂窝和ad hoc网络系统性能产生的影响。     

移动无线ad hoc网络吞吐量的计算

在网络拓扑满足网络各种不同性能指标下,本文提出了一种新的转发策略和功率控制策略来估计ad hoc网络的吞吐量.实验结果证明:该方法能够有效的估算和提高ad hoc网络的吞吐量.     

D-PRMA：一种新的无线Ad Hoc网络资源预留MAC机制

支持资源预留的介质访问控制(MAC)机制是无线ad hoc网络提供服务质量保证的关键。本文在分析分组预留多址接入(PRMA)的基础上，给出了一种新的支持资源预留的无线ad hoc网络MAC机制：分布式PRMA(D-PRMA)。D—PRMA的主要特点是分布式的，这适合无线ad hoc网络无中心的特点，同时，D—PRMA具有很短的碰撞持续时间，支持不同速率的实时业务，避免了对分组的分片和重组。通过仿真，本文进一步分析了D—PRMA的性能，仿真结果表明D—PRMA能保证实时业务的带宽和时延。     

ad hoc网络中一种基于信任模型的机会路由算法

由于ad hoc网络具有缺乏足够的物理保护、拓扑结构动态变化、采用分布式协作、节点的带宽和计算能力有限等特点,导致传统的路由安全机制不再适合ad hoc网络路由协议的设计。最近当前研究热点之一的机会路由能够在链路不可靠的情况下充分利用无线广播和空间多样性的特性提高网络的吞吐量。因此,考虑在机会路由中引入信任相似性概念设计信任机会路由,建立了基于节点信任度和最小成本的信任机会转发模型,提出了最小成本的机会路由算法MCOR,并对算法进行了理论上的分析和证明。最后采用仿真实验对该算法进行验证,又与经典机会路由协议ExOR以及其他经典的信任路由协议TAODV和Watchdog-DSR进行性能对比。仿真结果表明,MCOR算法能够防范恶意节点的攻击,在吞吐量、端到端时延、期望转发次数(ETX)和成本开销等方面都比其他3种协议表现出性能上的优势。     

ad hoc网络中跨层设计方法的研究

ad hoc网络与传统有线和无线蜂窝网络有着显著的区别,基于传统的分层协议栈的设计方法不再适合ad hoc网络,而应采用一种新型的跨层协议栈和跨层设计方法.本文首先阐述了ad hoc网络的特点和传统的分层协议栈的弊端,介绍了跨层设计的概念.然后,详细分析了ad hoc网络中跨层设计的方法,包括策略、体系结构和信令交互方式,探讨了跨层设计的相关技术和面临的挑战.最后,总结了全文并指出了今后的工作方向.     

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

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

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

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

Ad Hoc认知网络中基于梯度算法的协作压缩频谱感知方法

ad hoc认知网络(CRAHNs)比起传统ad hoc网络有很多优势,如分布式多跳结构及动态变化的网络拓扑等。频谱感知是认知无线电技术的基础,采用压缩感知方法以低于奈奎斯特采样率的速率来获得较好的重构信号,同时可减轻数字处理设备的压力。本文使用多跳模型,每个认知用户感知的频谱不仅包括主用户的主频谱,也包括认知用户自身收到其他认知用户干扰的更新频谱。由于具有动态特性的ad hoc网络缺少融合中心,所以本文中提出一种基于梯度的分布式协作感知算法。该算法基于能量检测,具有可靠的感知性能和较少的能量消耗,并能快速收敛。仿真实验验证了算法的有效性。      

Stable routing algorithm for mobile ad hoc networks using mobile agent

Wireless ad hoc networks are growing important because of their mobility, versatility, and ability to work with fewer infrastructures. The mobile ad hoc network is an autonomous system consisting of mobile nodes connected with wireless links. Establishing a path between two nodes is a complex task in wireless networks. It is still more complex in the wireless mobile ad hoc network because every node is no longer as an end node and an intermediate node. In this paper, it focuses on design of connectionless routing protocol for the wireless ad hoc networks based on the mobile agent concept. The proposed model tries to discover the best path taking into consideration some concerns like bandwidth, reliability, and congestion of the link. The proposed model has been simulated and tested under various wireless ad hoc network environments with the help of a different number of nodes. The results demonstrate that the proposed model is more feasible for providing reliable paths between the source and destination with the minimum control message packets over the network. It has delivered more number of packets to the destination over the network. Copyright © 2012 John Wiley & Sons, Ltd.     

On the capacity region of wireless ad hoc relay networks

I. Introduction Wireless ad hoc network regarded as a risingnetwork model has been discussed widely. Thestudy of the capacity of wireless ad hoc networkshas received significant attention recently. Guptaand Kumar in Ref.[1] proposed a model for studyingthe capacity of fixed ad hoc networks, where nodesare randomly located but are stationary. They madea somewhat pessimistic conclusion that the trafficrate per Source-to-Destination (S-D) pair will go tozero as the number of nodes per unit are…     

Transmission capacity of wireless ad hoc networks with outage constraints

In this paper, upper and lower bounds on the transmission capacity of spread-spectrum (SS) wireless ad hoc networks are derived. We define transmission capacity as the product of the maximum density of successful transmissions multiplied by their data rate, given an outage constraint. Assuming that the nodes are randomly distributed in space according to a Poisson point process, we derive upper and lower bounds for frequency hopping (FH-CDMA) and direct sequence (DS-CDMA) SS networks, which incorporate traditional modulation types (no spreading) as a special case. These bounds cleanly summarize how ad hoc network capacity is affected by the outage probability, spreading factor, transmission power, target signal-to-noise ratio (SNR), and other system parameters. Using these bounds, it can be shown that FH-CDMA obtains a higher transmission capacity than DS-CDMA on the order of M/sup 1-2//spl alpha//, where M is the spreading factor and /spl alpha/>2 is the path loss exponent. A tangential contribution is an (apparently) novel technique for obtaining tight bounds on tail probabilities of additive functionals of homogeneous Poisson point processes.     

An analytical study of the communication cost of data-centric storage in mobile ad hoc networks

Data-centric storage is a fundamental data management paradigm in wireless multihop networks. Originally introduced for wireless sensor networks, existing approaches are in principle also applicable in mobile ad hoc networks. However, the mobility of such networks strongly impacts storage performance in general and communication cost in particular. While this is recognized in the research community, a detailed account of the performance in terms of communication cost is lacking.In this article, we provide a detailed study of the communication cost of previously proposed data-centric storage mechanisms that are viable in mobile ad hoc networks. We first introduce a comprehensive analytical model that suitably characterizes the communication cost of data-centric storage mechanisms from the literature. We then use our model to evaluate the considered mechanisms in comparative terms as a function of relevant system parameters, including the amount of considered data, the frequency of data updates and queries, and node speed. Our results give a detailed account of data-centric storage performance and are able to identify the most suitable ranges of operation for each of the considered mechanisms.     

Upper bounding service capacity in multi-hop wireless SSMA-based ad hoc networks

Upper bounds on the service carrying capacity of a multi-hop, wireless, SSMA-based ad hoc network are considered herein. The network has a single radio band for transmission and reception. Each node can transmit to, or receive from, multiple nodes simultaneously. We formulate the scheduling of transmissions and control of transmit powers as a joint, mixed-integer, nonlinear optimization problem that yields maximum return at minimum power subject to SINR constraints. We present an efficient tabu search-based heuristic algorithm to solve the optimization problem and rigorously assess the quality of the results. Through analysis and simulation, we establish upper bounds on the VoIP call carrying capacity of the network as function of various parameters. We discuss the pros and cons of using SSMA as a spectrum sharing technique in wireless ad hoc networks.     

Performance benchmarking of wireless Web servers

The advent of mobile computers and wireless networks enables the deployment of wireless Web servers and clients in short-lived ad hoc network environments, such as classroom area networks. The purpose of this paper is to benchmark the performance capabilities of wireless Web servers in such an environment. Network traffic measurements are conducted on an in-building IEEE 802.11b wireless ad hoc network, using a wireless-enabled Apache Web server, several wireless clients, and a wireless network traffic analyzer. The experiments focus on the HTTP transaction rate and end-to-end throughput achievable in such an ad hoc network environment, and the impacts of factors such as Web object size, number of clients, and persistent HTTP connections. The results show that the wireless network bottleneck manifests itself in several ways: inefficient HTTP performance, client-side packet losses, server-side packet losses, network thrashing, and unfairness among Web clients. Persistent HTTP connections offer up to 350% improvement in HTTP transaction rate and user-level throughput, while also improving fairness for mobile clients accessing content from a wireless Web server.     

On hop count and euclidean distance in greedy forwarding in wireless ad hoc networks

In this letter, a probabilistic analysis is presented that captures the bounds on hop count from a given Euclidean distance between two nodes and vice versa in a greedy forwarding in wireless ad hoc networks. Accuracy of the analysis is verified via network simulations. The results could be useful in ad hoc and sensor network design and performance evaluation.     

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.     

Capacity Scaling of Wireless Networks with Inhomogeneous Node Density: Upper Bounds

We analyze the capacity scaling laws of wireless ad hoc networks comprising significant inhomogeneities in the node spatial distribution over the network area. In particular, we consider nodes placed according to a shot-noise Cox process, which allows to model the clustering behavior usually recognized in large-scale systems. For this class of networks, we introduce novel techniques to compute upper bounds to the available perflow throughput as the number of nodes tends to infinity, which are tight in the case of interference limited systems.     

Approximate minimum-energy multicasting in wireless ad hoc networks

A wireless ad hoc network consists of mobile nodes that are equipped with energy-limited batteries. As mobile nodes are battery-operated, an important issue in such a network is to minimize the total power consumption for each operation. Multicast is one of fundamental operations in any modern telecommunication network including wireless ad hoc networks. Given a multicast request consisting of a source node and a set of destination nodes, the problem is to build a minimum-energy multicast tree for the request such that the total transmission power consumption in the tree is minimized. Since the problem in a symmetric wireless ad hoc network is NP-complete, we instead devise an approximation algorithm with provable approximation guarantee. The approximation of the solution delivered by the proposed algorithm is within a constant factor of the best-possible approximation achievable unless P = NP.