无线自组织网络的组成及特点

无线自组织网络可以不必依托于基础设备,组网拥有了动态性.从现状看,自组织网络可被用作商业及军事,注重了网络本体的移动属性.在各个领域内,无线架构的自组织网络获取了明显进步.然而,受到自身约束,这类网络仍存有若干疑难有待于化解,例如隐暴终端、路由是否拥有最优的适应特性、系统配备的单向链路.为此,本文解析了无线自组织网络内在的组成,归结了网络的多样特点.     

分级有序路由无线传感器网络的研究与测试

本文提出了无线传感器网络分级组织的网络架构。在对这种网络的4层协议模型进行深入研究的基础上,在物理层利用超低功耗MCU和nRF905射频收发器设计了无线传感器节点,链路层上设计了双信道跳频媒体访问控制策略,网络层上提出了分级有序分配路由策略。网络测试结果表明,该分级有序路由无线传感器网络具有低功耗、自组织和稳定的特点。     

无线自组织网络对抗初探

无线自组织(Ad Hoc)网络凭借着组网灵活、无中心、自组织和自由移动的特点,在各种领域得到广泛的应用。从分析研究无线自组织通信网络的组网特点和网络特性入手,研究对无线自组织网络通信信号的截获、信号特征分析、协议特征提取及解析的方法,分析了几种无线自组织网络攻击技术的途径,给出利用无线信道对抗无线自组织通信网络的实现方案设想。     

基于同道干扰统计模型的无线自组织网络性能分析

基于无线自组织网络中节点的分布特征,结合对同道干扰的定量分析结果,给出了 一种适用于无线自组织网络的同道干扰统计模型。分析了无线自组织网络中同道干扰的统计 特性,并基于建立的同道干扰模型研究了无线自组织网络的系统性能。结果表明,同道干扰 对无线自组织网络的系统性能有严重影响,需建立合理的干扰模型才能更准确地评估自组织 网络的系统性能。     

长距离CSMA/CA协议的系统设计

文中研究载波监听多路访问/冲突避免(CSMA/CA)接入机制在航空无线自组织网络中的应用。航空无线自组织网络是一种长传播时延的自组织网络,首先对长传播时延背景下的CSMA/CA接入协议进行了理论分析,研究时隙长度(Slot),短帧间间隔(SIFS)和源节点等待ACK包的时间对系统性能的影响。通过分析得到不同传输半径下CSMA/CA的最优参数配置。通过仿真结果表明,长距离CSMA/CA可以基本保持CSMA/CA的吞吐量。     

无线宽带自组织网络在应急通信中的应用

无线宽带自组织网络是移动Ad hoc网络与蜂窝网技术融合的产物,是一种多跳的Ad hoc网络。无线宽带自组织网络具有自组织、自管理、自适应、多跳、高带宽的技术特点,可以动态实现移动宽带接入,支持多种业务、无线定位等,逐渐成为宽带无线接入的研究热点。文章介绍无线宽带自组织网络技术的概念,重点分析其技术特点,与现有通信网络的融合及其在应急通信中的应用,最后对无线宽带自组织网络的前景进行预测。     

基于UWB技术的无线自组织网络研究综述

随着无线自组织技术的发展和UWB技术的逐渐成熟,无线通信界开始考虑将UWB技术应用于无线自组织网络中。由于UWB技术本身固有的优点可以显著提高无线自组织网络的网络性能,扩展无线自组织网络的应用范围。因此,研究采用UWB技术对无线自组织网协议带来的影响,就变得非常迫切而且很有意义了。本文在简单地介绍了UWB技术和自组网技术后,描述了它们结合后的应用前景,探讨了把它们结合后需要研究的若干关键技术。     

自组织无线传感器网络的研究

低功耗无线电通信技术、嵌入式计算技术和微型传感器等技术的飞速发展和日益成熟 ,使得大量的、低成本的微型传感器通过无线链路自组织成无线传感器网络成为现实。本文介绍了自组织无线传感器网络的概念和特点 ,阐述了自组织无线传感器网络的有关理论、关键技术和研究热点。     

无线自组织网络中的路由技术研究

路由技术是无线自组织网络组网的基础和关键环节.文章介绍了当前无线自组织网络路由技术研究的现状,在此基础上,详述了无线自组织网络中具有代表性的路由协议,并对这一领域未来的发展趋势作了展望.     

无线传感器网络的自组织机制研究

无线传感器网络的自组织包含不依赖于固定通信基础设施的有规则联系和运动,本文在特定应用中研究这一过程.在定性分析无线传感器网络的自组织特性之后,提出自组织度和自组织单位能耗的自组织评价方法,在典型应用中以此量化分析无线传感器网络的自组织演化机制.仿真表明,在特定应用中的无线传感器网络表现出孕育、发育、成熟、衰退和死亡的自组织过程,自组织能耗依赖于特定的部署方式和无线模型.     

Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime

This paper deals with throughput scaling laws for random ad hoc wireless networks in a rich scattering environment. We develop schemes to optimize the ratio lambda(n) of achievable network sum capacity to the sum of the point-to-point capacities of source-destinations (S-D) pairs operating in isolation. Our focus in this paper is on fixed signal-to-noise ratio (SNR) networks, i.e., networks where the worst case SNR over the S-D pairs is fixed independent of n. For such fixed SNR networks, which include fixed area networks as a special case, we show that collaborative strategies yield a scaling law of lambda(n)=Omega(1/n^1/3) in contrast to multihop strategies which yield a scaling law of lambda(n)=Theta(1/radicn). While networks where worst case SNR goes to zero do not preclude the possibility of collaboration, multihop strategies achieve optimal throughput. The plausible reason is that the gains due to collaboration cannot offset the effect of vanishing receive SNR. This suggests that for fixed SNR networks, a network designer should look for network protocols that exploit collaboration     

Improving throughput in multihop wireless networks

One of the main characteristics of wireless ad hoc networks is their node-centric broadcast nature of communication, leading to interferences and spatial contention between adjacent wireless links. Due to such interferences, pessimistic concerns have been recently raised with respect to the decreasing network capacity in wireless ad hoc networks when the number of nodes scales to several orders of magnitude higher. Such studies assume uniformly distributed nodes in the network and randomized traffic patterns. In this paper, we argue that in all cases of end-to-end data communications-including one-to-k unicast and multicast data dissemination as well as k-to-one data aggregation-the maximum achievable end-to-end data throughput (measured on the sources) heavily depends on the strategy of arranging the topology of transmission between sources and destinations, as well as possible per-node operations such as coding. An optimal strategy achieves better end-to-end throughput than an arbitrary one. We present theoretical studies and critical insights with respect to how these strategies may be designed so that end-to-end throughput may be increased. After all, under all circumstances-in either a lightly loaded or a congested network-increasing end-to-end throughput from its baseline is always beneficial to applications using ad hoc networks to communicate.     

Enabling Real-Time H.264 Video Services over Wireless Ad Hoc Networks Using Joint Admission and Transmission Power Control

In a wireless ad hoc network, packets are sent from node-to-node in a multihop fashion until they reach the destination. In this paper we investigate the capacity of a wireless ad hoc network in supporting packet video transport. The ad hoc network consists of n homogeneous video users with each of them also serving as a relay node for other users. We investigate how the time delay affects the video throughput in such an ad hoc network and how to provide a time-delay bounded packet video delivery service over such a network. The analytical results indicate that appropriate joint admission and power control have to be employed in order to efficiently utilize the network capacity while operating under the delay constraint as the distance between source and destination changes.     

Capacity of ad hoc wireless networks with infrastructure support

We determine the asymptotic scaling for the per user throughput in a large hybrid ad hoc network, i.e., a network with both ad hoc nodes, which communicate with each other via shared wireless links of capacity W bits/s, and infrastructure nodes which in addition are interconnected with each other via high capacity links. Specifically, we consider a network model where ad hoc nodes are randomly spatially distributed and choose to communicate with a random destination. We identify three scaling regimes, depending on the growth of the number of infrastructure nodes, m relative to the number of ad hoc nodes n, and show the asymptotic scaling for the per user throughput as n becomes large. We show that when m /spl lsim/ /spl radic/n/logn the per user throughput is of order W//spl radic/n log n and could be realized by allowing only ad hoc communications, i.e., not deploying the infrastructure nodes at all. Whenever /spl radic/n/log n /spl lsim/ m /spl lsim/ n/log n, the order for the per user throughput is Wm/n and, thus, the total additional bandwidth provided by m infrastructure nodes is effectively shared among ad hoc nodes. Finally, whenever m /spl gsim/ n/log n, the order of the per user throughput is only W/log n, suggesting that further investments in infrastructure nodes will not lead to improvement in throughput. The results are shown through an upper bound which is independent of the routing strategy, and by constructing scenarios showing that the upper bound is asymptotically tight.     

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.     

CAPACITY EVALUATION OF MULTI-CHANNEL WIRELESS AD HOC NETWORKS

In this paper, the capacity of multi-channel, multi-hop ad hoc network is evaluated.In particular, the performance of multi-hop ad hoc network with single channel IEEE 802.11 MAC utilizing different topologies is shown. Also the scaling laws of throughputs for largescale ad hoc networks and the theoretical guaranteed throughput bounds for multi-channel grid topology systems are proposed. The results presented in this work will help researchers to choose the proper parameter settings in evaluation of protocols for multi-hop ad hoc networks.     

Scalability and Performance Evaluation of Hierarchical Hybrid Wireless Networks

This paper considers the problem of scaling ad hoc wireless networks now being applied to urban mesh and sensor network scenarios. Previous results have shown that the inherent scaling problems of a multihop ldquoflatrdquo ad hoc wireless network can be improved by a ldquohybrid networkrdquo with an appropriate proportion of radio nodes with wired network connections. In this work, we generalize the system model to a hierarchical hybrid wireless network with three tiers of radio nodes: low-power end-user mobile nodes (MNs) at the lowest tier, higher power radio forwarding nodes (FNs) that support multihop routing at intermediate level, and wired access points (APs) at the highest level. Scalability properties of the proposed three-tier hierarchical hybrid wireless network are analyzed, leading to an identification of the proportion of FNs and APs as well as transmission range required for linear increase in end-user throughput. In particular, it is shown analytically that in a three-tier hierarchical network with nA APs, nF FNs, and nM MNs, the low-tier capacity increases linearly with nF, and the high-tier capacity increases linearly with nA when nA = Omega(radic{nF}) and n _A = O(nF). This analytical result is validated via ns-2 simulations for an example dense network scenario, and the model is used to study scaling behavior and performance as a function of key parameters such as AP and FN node densities for different traffic patterns and bandwidth allocation at each tier of the network.     

On the improvement of scaling laws for large-scale MANETs with network coding

This paper investigates the problem of how much benefit network coding can contribute to the network performance in terms of throughput, delay, and storage requirements for mobile ad hoc networks (MANETs), compared to when only replication, storage and forwarding are allowed in relay nodes. We characterize the throughput-delay-storage tradeoffs under different node mobility patterns, i.e., i.i.d. and random walk mobility, with and without network coding. Our results show that when random linear coding instead of replication is used in MANETs, an order improvement on the scaling laws of MANETs can be achieved. Note that previous work showed that network coding could only provide constant improvement on the throughput of static wireless networks. Our work thus differentiates MANETs from static wireless networks by the role network coding plays.     

Queuing network models for delay analysis of multihop wireless ad hoc networks

In this paper we analyze the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes. We present an analytical model that takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC. We model random access multihop wireless networks as open G/G/1 queuing networks and use the diffusion approximation in order to evaluate closed form expressions for the average end-to-end delay. The mean service time of nodes is evaluated and used to obtain the maximum achievable per-node throughput. The analytical results obtained here from the queuing network analysis are discussed with regard to similarities and differences from the well established information-theoretic results on throughput and delay scaling laws in ad hoc networks. We also investigate the extent of deviation of delay and throughput in a real world network from the analytical results presented in this paper. We conduct extensive simulations in order to verify the analytical results and also compare them against NS-2 simulations.     

Capacity and delay of hybrid wireless broadband access networks

An optical network is too costly to act as a broadband access network. On the other hand, a pure wireless ad hoc network with n nodes and total bandwidth of W bits per second cannot provide satisfactory broadband services since the pernode throughput diminishes as the number of users goes large. In this paper, we propose a hybrid wireless network, which is an integrated wireless and optical network, as the broadband access network. Specifically, we assume a hybrid wireless network consisting of n randomly distributed normal nodes, and m regularly placed base stations connected via an optical network. A source node transmits to its destination only with the help of normal nodes, i.e., in the ad hoc mode, if the destination can be reached within L (L /spl geq/ 1) hops from the source. Otherwise, the transmission will be carried out in the infrastructure mode, i.e., with the help of base stations. Two transmission modes share the same bandwidth of W bits/sec. We first study the throughput capacity of such a hybrid wireless network, and observe that the throughput capacity greatly depends on the maximum hop count L and the number of base stations m. We show that the throughput capacity of a hybrid wireless network can scale linearly with n only if m = Ω(n), and when we assign all the bandwidth to the infrastructure mode traffics. We then investigate the delay in hybrid wireless networks. We find that the average packet delay can be maintained as low as Θ(1) even when the per-node throughput capacity is Θ(W).