流星余迹通信变速率编码研究

流星余迹通信是一种利用流星电离余迹反射电波实现数据传输的通信方式。衡量流星余迹通信系统性能的指标之一是所采用编码的数据包正确传输概率。通常采用的编码方式为固定速率编码,这种编码数据包传输正确概率较低,系统性能较差。变速率编码根据流星余迹通信信道特点,通过改变数据包中各个码字的码率,提高数据包正确传输概率,改善系统性能。理论分析和仿真结果表明,采用变速率编码系统性能提高。     

CDMA技术在流星突发通信中的应用

流星余迹通信就是通过离子化的流星余迹反射和散射无线电波进行流星突发通信,具有抗干扰,不易被截获,单跳通信距离远等特点,是一种理想的应急通信手段。根据流星余迹通信的大规模组网应用需求,针对多个余迹存在的接入碰撞问题,本文研究了一种基于CDMA技术的余迹多址接入方法,仿真结果表明此方法可以有效降低网络等待时间,提高网络容量,解决通信网中远端站的冲突问题,具有一定的实际应用价值。     

流星余迹信道建模与仿真分析

为检验流星余迹通信设备及软件在实战化环境中的应用效能,针对流星余迹通信信道规律复杂、实测代价高等问题,建立流星余迹信道仿真模型。通过对典型数学模型的深入研究,以欠密类流星余迹和过密类流星余迹信道模型为基础,融入了欠密类流星簇和多径信道两种特殊类型,按照概率论原理,建立了流星余迹信道混合模型,并结合流星余迹到达间隔模型,利用C++实现了流星余迹信道混合模型的仿真。该模型可生成包含单颗欠密类、单颗过密类、欠密类流星簇和多径信道等多种类型的复杂信道。仿真结果表明,所产生的流星余迹信道特征与实际信道基本相符,验证了该模型的可用性和合理性。     

流星余迹信道与组网技术仿真分析

通过对流星余迹信道观测数据的分析,恢复出信道分布规律,建立流星余迹信道模型。将信道模型应用到网络仿真中,结合流星余迹网络结构模型、节点模型和通信协议模型,对多种运行参数进行仿真分析,验证采用退N协议的星型网络在实际数据驱动下的网络性能,得到最小发包时延和最大网络吞吐量的条件,为流星余迹通信系统的技术突破和设备研制提供可靠依据。     

流星余迹通信信道建模与性能仿真

在已有经验数据和理论的基础上,结合实际的通信情况,利用通信、数理、几何、概率的知识建立了流星余迹通信信道的数学模型,并且应用C++程序模拟了该信道模型。利用该模型对流星余迹通信信道的特性进行了仿真,并对流星余迹通信的几项重要指标(如流星余迹平均通信时间、余迹的到达间隔、多径干扰的概率等)做了统计,统计结果表明所建立的信道模型与实际的信道特性基本一致。该信道模型被应用于流星余迹通信系统的软件开发过程中,以模拟实际的流星余迹通信链路。     

一种基于流星突发通信的分组无线网

流星余迹信道短时突发的特点使得流星突发通信呈现间歇性,在等待一颗适合的流星出现前往往需要等待很长的时间,同时由于流星突发通信的"足迹"和"热点"特性,使其通信距离受到限制。为解决上述问题,提出一种基于流星余迹通信的无线分组网,首先针对流星余迹信道特点给出了适合该网络的路由选择策略,其次介绍了工作流程,最后对分组长度进行了分析,并给出了仿真结果。     

流星余迹通信信道统计特性及模型仿真

流星余迹通信不同于传统的通信,它是低速率通信,具有突发、不连续以及不定时的特性。流星余迹通信的复杂性要求有必要对其通信信道进行研究。可用流星率、占空比、平均持续期、等待时间和通信通过量是影响流星余迹通信信道性能的重要参数。根据偶发流星日心空间和地心空间的几何关系,得到了流星突发通信信道参数预测模型;并对流星通信链路观测的数据进行统计分析,得到流星余迹通信信道的各参数,预测结果和通信链路观测结果比较一致,为流星通信系统的建立提供了技术支持。     

流星余迹通信最佳传输帧长设计

在分析流星余迹通信原理及其传输信道物理特性基础上,根据流星余迹电子线密度的分布特性,构建出流星余迹信号初始接收功率的概率密度函数.针对以信号帧为单位的自适应变速率传输机制,推导出欠密类余迹平均信息通过量与传输帧长的关系,提出最佳帧长设计原则,得到自适应传输帧长的理论最佳值.仿真结果表明,在满足通信可靠性及实时性的要求下,所得最佳帧长能使系统平均信息通过量达到最大,有效提高流星余迹信道利用率.     

流星余迹通信技术特征及影响

流星余迹通信利用流星电离余迹进行通信,它是一种突发的通信方式。流星余迹通信方式特殊,它具有很好的隐蔽性、很强的抗干扰能力,使其成为一种受到物理或电子攻击时的有效通信保障手段。这里给出描述流星余迹信道参数（流星达到率、可用时间比、平均持续期等）的数学表达及实测结果。制订2种流星突发通信的握手协议,并基于该协议和信道实测结果,估算得到流星突发通信的通过量和突发等待时间。     

流星余迹通信技术应用研究

简单介绍了流星余迹通信的原理,详细说明了流星余迹通信的特点及组网方式,并对流星余迹通信技术的应用提出了想法和思路。     

On Broadcast Stability of Queue-Based Dynamic Network Coding Over Erasure Channels

The transmission of packets is considered from one source to multiple receivers over single-hop erasure channels. The objective is to evaluate the stability properties of different transmission schemes with and without network coding. First, the throughput limitation of retransmission schemes is discussed and the stability benefits are shown for randomly coded transmissions, which, however, need not optimize the stable throughput for finite coding field size and finite packet block size. Next, a dynamic scheme is introduced for distributing packets among virtual queues depending on the channel feedback and performing linear network coding based on the instantaneous queue contents. The difference of the maximum stable throughput from the min-cut rate is bounded as function of the order of erasure probabilities depending on the complexity allowed for network coding and queue management. This queue-based network coding scheme can asymptotically optimize the stable throughput to the max-flow min-cut bound, as the erasure probabilities go to zero. This is realized for a finite coding field size without accumulating packet blocks at the source to start network coding. The comparison of random and queue-based dynamic network coding with plain retransmissions opens up new questions regarding the tradeoffs of stable throughput, packet delay, overhead, and complexity.      

区分服务中一种拥塞感知的单速三色标记算法

确保服务的实现依赖于在边界路由器执行的数据包标记策略和在核心路由器执行的队列管理策略.TCP流由于其拥塞自适应的特点对丢包很敏感,网络拥塞对其吞吐量影响很大.为此,我们设计了一种拥塞感知的单速三色标记算法CASR3CM.仿真实验表明,该算法不仅提高了AS TCP流的平均吞吐量,而且增强了吞吐量的稳定性.另外该算法也提高了AS TCP流之间占用带宽的公平性.     

Low-complexity multiple access protocols for wavelength-divisionmultiplexed photonic networks

Media access control protocols for an optically interconnected star-coupled system with preallocated wavelength-division multiple-access channels are discussed. The photonic network is based on a passive star-coupled configuration in which high topological connectivity is achieved with low complexity and excellent fault tolerance. The channels are preallocated to the nodes with the proposed approach, and each node has a home channel it uses either for data packet transmission or data packet reception. The performance of a generalized random access protocol is compared to an approach based on interleaved time multiplexing. Semi-Markov analytic models are developed to investigate the performance of the two protocols. The analytic models are validated through extensive simulation. The performance is evaluated in terms of network throughput and packet delay with variations in the number of nodes, data channels, and packet generation rate     

Buffered Type-II Hybrid ARQ Protocol for DS-SSMA Packet Radio Systems

The performance and stability of a slotteddirect-sequence spread-spectrum multiple-access (DSSSMA)packet radio network employing the type-II hybridautomatic-repeat-request (ARQ) protocol withfinite-length transmitter buffers are considered. Theequilibrium point analysis (EPA) technique is employedto analyze the system stability and to approximatelycompute the system throughput, delay, and packetrejection probability. It is found that the systemexhibits bistable behavior in some situations. Issues ofsystem design, such as the required length of thetransmitter buffers and the desirable region ofoperation based on a predetermined performancerequirement for packet rejection, are alsoinvestigated.     

一种新型的光分组交换环网体系结构

提出了一种以波长为标签的新型全光变长分组交换环网的体系结构、网络节点的光分组数据包收发模型,以及防止光分组冲突的多令牌协议。使用多令牌协议的环网在进行光分组交换时,不需要高速的光子器件,无需使用延迟线、电中继以及解决光分组的冲突问题。通过数值仿真,分析了4节点、8节点和16节点环网巾光分组各种的时延特性以及网络的吞吐量特性。结果表明,当网络负载增大时,数据包的平均时延增大,同时网络节点的吞吐量和资源利用率也随之增大;网络节点数目越多,网络的吞吐率也越大。     

Adaptive Spatial Filtering for an FH/SSMA Packet Radio Network with Packet Combining

In this paper, packet throughput is analyzed and simulated for a show FH/SSMA packet radio network with adaptive antenna array and packet combining in a Rayleigh fading channel with shadowing. The packet throughput is defined as the average number of captured packets per slot. To enhance the throughput performance, an adaptive spatial filtering through adaptive antenna array and a packet combining scheme are employed. As a random access protocol, slotted ALOHA is considered, and synchronous memoryless hopping patterns are assumed. A packet consists of codewords from an (n, k) RS (Reed-Solomon) code. The tap weights of an adaptive processor is updated by RLS (recursive-least-square) algorithm. From the simulation results, it is shown that a pre-processing by adaptive antenna array and a post-processing by packet combining are very effective to improve reception performance of an FH/SSMA network.     

Outage Probability Analysis of Multi-relay Cooperative Decode-and-Forward System Over Generalized η–μ and κ–μ Fading Channels

In present scenario of wireless sensor networks and communications, efficient sensed data transmission among nodes is being a great confrontation because of the impulsive and volatile nature of sensors in the network. For providing that and enhancing network lifetime, there are several approaches are developed, specifically using clustering techniques. Still, there are requirements for energy based efficient routing in WSN. With that note, this paper develops anEnergy Aware Efficient Data Aggregation (EAEDAR) and Data Re-Schedulingwith the incorporation of clustering techniques. Moreover, the model used energy based cluster formation and cluster head selection for increasing the network stability and data delivery rate. The model comprises four main phases, namely, Energy factor based cluster formation, Aggregator_SN (Sensor Node) Selection, Efficient Data Aggregation (EDA) and Data Re-Scheduling based on delay and processing time. Furthermore, the model is updated with respect to the status of the nodes and links, for providing consistent network with improved reliable data transmissions. The simulation results portrays the effectiveness of the proposed model over other compared works in terms of the performance factors such as, throughput, packet delivery ratio, network lifetime, transmission delay and packet drop.

     

基于双频通信的空间飞行器自组网动态时隙分配

针对分布式空间飞行器自组网使用传统时分多址(Time Division Multiple Access,TDMA)时隙分配方式时网络时延大、传输效率不高的问题,提出了一种基于双频通信的动态时分多址时隙分配(Dual Frequency Dynamic Time Division Multiple Access,DF-D...     

基于分组密码的跳频序列多址接入性能分析

基于3DES迭代型分组密码产生的跳频序列,构造了一种跳频组网的随机多址接入方案模型。在此基础上分析了跳频码分多址的系统接入性能,从理论上推导出跳频图案碰撞引起的误分组率、跳频组网的吞吐量和归一化吞吐率,证明数据分组长度M与可用频隙数q的比值是决定跳频码分多址系统性能的重要因素。计算机仿真结果验证了理论的正确性,同时也证明了基于分组密码的跳频序列具有较好的跳频多址组网性能。     

分布式队列服务算法在无线网状网包调度中的应用

根据无线网状网的包调度特点,结合已有的差分队列服务算法和分布式贝尔曼-福特算 法,将有线网络中的差分队列服务算法改进为分布式队列服务算法（DQS）,使之实用于无 线网状网中多任务条件下实现系统的吞吐量最大化。仿真实验证明了DQS算法能有效地避免 传统多径传输中的按“类”或 “流”来进行调度的缺陷,有效地减少了数据包的端到端 延时和缓冲区需求,尤其是DQS算法的实际平均吞吐量性能有了很大的提高。