无线自组织网络的网络编码技术

网络编码作为一种新的技术在宽带无线自组织网络中有很好的应用,通过网络编码,中间节点可以将接收信息进行编码并发送出去,提高了网络吞吐量和健壮性。为不对现有网络的软硬件设备和相应的协议做很大的修改,可以选择在高层实现网络编码。无线传感器网络、无线格状网（Mesh）等无线自组织网络都可以使用网络编码技术显著提高多跳链路的传输性能。目前网络编码的研究热点集中在网络编码节点选取方案、网络编码算法的设计、网络编码复杂度分析、网络编码的性能分析、网络编码与系统安全性分析、网络编码在无线分布式网络中的应用等方面。     

网络编码在无线通信网络中的应用

网络编码是一种可以逼近网络容量传输理论极限的有效方法,在无线网络环境。中有着广泛的应用前景。在无线中继网络中采用网络编码技术,可以使中继节点同时为多个用户转发数据,从而获得较高的转发效率。网络编码在无线中继网络中的典型应用方案包括噪声中继采用置信传播算法实现网络编码,复数域网络编码算法以及信道编码和网络编码联合设计方法,它们均可在获得较高网络吞吐量的同时实现完全分集。在多用户协作通信网络中采用网络编码技术,可获得更高的分集增益以及更低的符号错误概率。     

无线网络中的物理层网络编码技术

文章介绍了无线网络中的物理层网络编码技术。首先介绍了一种在物理层实现的结合网络编码和纠错编码的方法。然后介绍了一种模拟网络编码方法,该方法可以充分利用无线介质的广播特性,挖掘无线广播信道和无线多址接入信道的容量,从而提高数据吞吐量。最后介绍了物理层网络编码的研究热点。     

一种可靠的无线传感器网络路由算法

在基于分簇的无线传感器网络中,为了有效地转发数据,研究者们提出了各种簇组织和簇首选举机制,但是这些机制缺少关注簇首与汇聚节点之间数据传输的可靠性.针对该问题,提出一种可靠的数据路由方案,通过链路代价函数和动态的簇首间路由,控制簇首到汇聚节点的数据转发.仿真结果表明,该方案不仅有效地增加数据包的投递率,也能够均衡网络的能量消耗.     

基于网络编码的无线自组织网数据分发机制

 无线自组织网络中,移动台能量有限,为了延长生存期,需要减少中间节点之间的数据包交换次数,本文提出一种基于网络编码的数据分发机制CRNC,同基于泛洪的传统数据分发机制相比,CRNC在大幅度减少传输次数的同时,只增加了少量时延.理论分析及仿真试验,证明了采用网络编码的CRNC可以在传输时延和能量消耗上取得更好的均衡.     

软件定义FiWi网络中网络编码控制方法

针对传统FiWi(光纤无线混合接入)网络中网络编码控制过程中大量Gate、Report信息交换导致的网络信息复杂、编码时延增大等问题,设计了一种支持编码功能的软件定义FiWi网络架构和基于Openflow协议的网络编码控制方法。仿真结果表明,所提出的软件定义FiWi网络架构中的集中编码控制方法及其实现方案能够减少网络中控制信息数量,提高带宽利用率,有效降低数据传输时延并提高网络吞吐量。     

无线通信中网络编码技术应用研究

围绕网络编码这一热点,详细分析讨论网络编码的原理、应用在有线和无线中的网络编码方案以及在无线通信中的物理层网络编码,并且分析了其性能。得出物理层网络编码技术是可以逼近无线网络传输容量极限的有效方法。对比传统的中继方式,由于物理层网络编码的应用信源节点可以同时发送信息到中继节点,使得传递信息的时隙从原来的4时隙减为2时隙,从而将系统的吞吐量提高了一倍。     

无线Mesh网络可扩展性相关技术

无线移动通信中传输的数据密度持续增长对无线Mesh网络的系统性能提出了挑战。在无线自组织网络中,由于存在随着节点数目的增加而平均节点容量逐步降低的规律,因此无线Mesh网络的大规模组网难以实施。无线Mesh网络可扩展性对于增强无线Mesh网络的自适应组网能力至关重要,因此,文章对在Mesh基站和Mesh移动台上采用的与可扩展性相关的关键技术,如信道分配技术、智能路由技术、多天线技术、节点分类和QoS分级技术、协作传输技术等,进行了探讨。     

无线自组织网络TCP容量优化

为了计算无线自组织网络中准确的TCP容量,并利用其进行有效的窗口控制,以避免拥塞窗口增长过速的问题,提出一种适用于无线自组织网络TCP容量的优化计算。此方法基于时延和空间复用率,考虑网络中竞争干扰,解决了以往的计算方法对拓扑不能广泛适用的问题。模拟结果显示,基于文章的TCP容量进行拥塞窗口调节,能有效地提高网络的吞吐量。     

无线自组织网络对抗初探

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

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…     

无线多跳Ad hoc网络中MAC机制的公平性与网络容量利用率

高效、公平的MAC协议是目前无线多跳Ad hoc网络研究的关键问题之一。该文在给出一种新的无线多跳Ad hoc网络的网络模型前提下,定义了MAC协议公平性、网络容量利用率两个性能参数。给出了一种能在竞争节点间公平共享无线信道并充分利用网络容量的MAC协议(FMAC),仿真比较了FMAC和IEEE 802.11 DCF的公平性和网络容量利用率。结果表明FMAC能在充分利用网络容量的前提下,实现无线信道在竞争节点间的公平共享。     

博弈论在无线Mesh网中的应用

在无线mesh网络中，每个源节点都独立的选择路由实现与网关的连接。本文应用博弈论来分析无线mesh网络的吞吐量。我们将无线meth曲网络中的路由方案定史为博弈。随后建立相应的纳什均衡并将所得吞吐量同随机路由选择方案的吞吐量相比较。     

Broadcast capacity of wireless networks

We present an upper bound on the broadcast capacity of arbitrary ad hoc wireless networks. The throughput obtainable by each node for broadcasting to-all-of the other nodes in a network consisting of n nodes with- fixed transmission ranges and C bits per second channel capacity is bounded by O(C/n), which is equivalent to the upper bound for per node capacity of a fully connected single-hop network.     

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.     

无线自组织网络极限信道容量增长规律研究

 为了分析和提高无线自组织网络的吞吐能力,提出了无线自组织网络的极限信道容量增长规律(capacity scaling laws)的一般表达式,研究发现单个节点的策略决定了整个无线自组织网络的吞吐能力,证明了使得整个网络吞吐能力最大化的最优策略的存在性。进一步通过应用博弈论,推导得出最优策略,并验证其满足纳什均衡且是演化稳定策略。     

REACA: An Efficient Protocol Architecture for Large Scale Sensor Networks

The emergence of wireless sensor networks has imposed many challenges on network design such as severe energy constraints, limited bandwidth and computing capabilities. This kind of networks necessitates network protocol architectures that are robust, energy-efficient, scalable, and easy for deployment. This paper proposes a robust energy-aware clustering architecture (REACA) for large-scale wireless sensor networks. We analyze the performance of the REACA network in terms of quality-of-service, asymptotic throughput capacity, and power consumption. In particular, we study how the throughput capacity scales with the number of nodes and the number of clusters. We show that by exploiting traffic locality, clustering can achieve performance improvement both in capacity and in power consumption over general-purpose ad hoc networks. We also explore the fundamental trade-off between throughput capacity and power consumption for single-hop and multi-hop routing schemes in cluster-based networks. The protocol architecture and performance analysis developed in this paper provide useful insights for practical design and deployment of large-scale wireless sensor network.     

Modeling throughput gain of network coding in multi-channel multi-radio wireless ad hoc networks

In this paper, we model the network throughput gains of two types of wireless network coding (NC) schemes, including the conventional NC and the analog NC schemes, over the traditional non-NC transmission scheduling schemes in multihop, multi-channel, and multi-radio wireless ad hoc networks. In particular, we first show that the network throughput gains of the conventional NC and analog NC are (2n)/(2n-1) and n/(n-1), respectively, for the n-way relay networks where n ges 2. Second, we propose an analytical framework for deriving the network throughput gain of the wireless NC schemes over general wireless network topologies. By solving the problem of maximizing the network throughput subject to the fairness requirements under our proposed framework, we quantitatively analyze the network throughput gains of these two types of wireless NC schemes for a variety of wireless ad hoc network topologies with different routing strategies. Finally, we develop a heuristic joint link scheduling, channel assignment, and routing algorithm that aims at approaching the optimal solution to the optimization problem under our proposed framework.     

TCP with delayed ack for wireless networks

This paper studies the TCP performance with delayed ack in wireless networks (including ad hoc and WLANs) which use IEEE 802.11 MAC protocol as the underlying medium access control. Our analysis and simulations show that TCP throughput does not always benefit from an unrestricted delay policy. In fact, for a given topology and flow pattern, there exists an optimal delay window size at the receiver that produces best TCP throughput. If the window is set too small, the receiver generates too many acks and causes channel contention; on the other hand, if the window is set too high, the bursty transmission at the sender triggered by large cumulative acks will induce interference and packet losses, thus degrading the throughout. In wireless networks, packet losses are also related to the length of TCP path; when traveling through a longer path, a packet is more likely to suffer interference. Therefore, path length is an important factor to consider when choosing appropriate delay window sizes. In this paper, we first propose an adaptive delayed ack mechanism which is suitable for ad hoc networks, then we propose a more general adaptive delayed ack scheme for ad hoc and hybrid networks. The simulation results show that our schemes can effectively improve TCP throughput by up to 25% in static networks, and provide more significant gain in mobile networks. The proposed schemes are simple and easy to deploy. The real testbed experiments are also presented to verify our approaches. Furthermore, a simple and effective receiver-side probe and detection is proposed to improve friendliness between the standard TCP and our proposed TCP with adaptive delayed ack.     

High transmission power increases the capacity of ad hoc wireless networks

In this paper, the effect of transmission power on the throughput capacity of finite ad hoc wireless networks, considering a scheduling-based medium access control (MAC) protocol such as time division multiple access (TDMA) and an interference model that is based on the received signal-to-interference-plus-noise ratio (SINR) levels, is analyzed and investigated. The authors prove that independent of nodal distribution and traffic pattern, the capacity of an ad hoc wireless network is maximized by properly increasing the nodal transmission power. Under the special case of their analysis that the maximum transmission power can be arbitrarily large, the authors prove that the fully connected topology (i.e., the topology under which every node can directly communicate with every other node in the network) is always an optimum topology, independent of nodal distribution and traffic pattern. The present result stands in sharp contrast with previous results that appeared in the literature for networks with random nodal distribution and traffic pattern, which suggest that the use of minimal common transmission power that maintains connectivity in the network maximizes the throughput capacity. A linear programming (LP) formulation for obtaining the exact solution to the optimization problem, which yields the throughput capacity of finite ad hoc wireless networks given a nodal transmit power vector, is also derived. The authors' LP-based performance evaluation results confirm the distinct capacity improvement that can be attained under their recommended approach, as well as identify the magnitude of capacity upgrade that can be realized for networks with random and uniform topologies and traffic patterns.