Design of hybrid automatic repeat request （HARQ） for TDD-OFDM system

Reliability-based hybrid automatic repeat request （HARQ） （RB-HARQ） is a recently developed form of incremental-redundancy ARQ. It achieves good performance whereas large retransmission request packets should be fed back. In this paper, in order to reduce the number of the fed back bits, we propose a HARQ scheme applied in time duplex division orthogonal frequency division multiplexing （TDD- OFI）M） system over the slow fading channel which is named channel-based HARQ （CB-HARQ）. Because one bit which meets deep fading is always with small value of log likelihood ratio （LLR） during the process of decoding of LDPC code, the bits transmitted on the carrier with deep fading are retransmitted. At the receiver, the decoder will compute the locations of retransmission bits according to the channel fading values which are gotten by utilizing the feature of channel symmetry in TDD mode. So the indices of retransmission bits are avoided to be transmitted. Simulation results show that this method achieves better BER performance and requires much smaller request packets in feedback link.     

An ECN—based Optimal Flow Control Algroithm for the Internet

According to the Wide Area Network model,we formulate Internet flow control as a constrained convex programming problem,where the objective is to maximize the total utility of all sources over their transmission rates,Based on this formulation,flow control can be converted to a normal unconstrained optimization problem through the barrier function method.so that it can be solved by means of a gradient projection algorithm with properly rate iterations.We prove that the algorithm converges to the global optimal point,which is also a stable proportional fair rate allocation point,provided that the step size is properly chosen.The main difficulty facing the realization of iteration algorithm is the distributed computation of congestion measure.Fortunately,Explicit Congestion Notification (ECN) is likely to be used to improve the performance of TCP in the near future.By using ECN,it is possible to realize the iteration algorithm in IP networks.Our algorithm is divided into two parts,algorithms in the router and in the source.The router marks the ECN bit with a probability that varies as its buffer occupancy varies,so that the congestion measure of links can be communicated to the source when the marked ECN bits are reflected back from its destination.Source rates are then updated by all sessions according to the received congestion measure.The main advantage of our scheme is its fast convergence ability and robustness;it can also provide the network with zero packet loss by properly choosing the queue threshold and provide differentiated service to users by applying different utility functions.     

A Threshold Scheme under Peer-to-Peer Network

Resource sharing among peers is one of important application in Peer-to-Peer（P2P） network. Inexistenee of server makes P2P network to be a less trustable tool for property owners to distribute their resource. In order to protect intelligent property, reputation management strategy is adopted in many P2P network. As long as a P2P network reputation strategy is confirmed, application designer can employ a special detailed distribution scheme to fulfill content distribution within the net. Shmir （k, n） threshold scheme, for example, is an encryption scheme to enhance the distribution se curity of this kind of design. （k＊, n） threshold scheme is a new tool similar to Shmir scheme is proposed in this paper. The new scheme based on polynomial expansion and its security is decided by the one way function used in the secret distribution procedure. The scheme efficiency and its features as well as comparison between new and Shmir scheme are also discussed in this paper.     

Multi-Path Routing and Resource Allocation in Active Network

An algorithm of traffic distribution called active multl-path routing (AMR) in active network is proposed. AMR adopts multi path routing and applies nonlinear optimize approximate method to distribute network traffic among muhiple paths. It is combined to bandwidtb resource allocation and the congestion restraint mechanism to avoid congestion happening and worsen. So network performance can be improved greatly. The frame of AMR includes adaptive traffic allocation model, the conception of supply bandwidth and its‘ allocation model, the principle of congcstion restraint and its‘ model, and the implement of AMR based on multi-agents system in active network. Through simulations. AMR has distinct effects on network performance. The results show AMR is a valid traffic regulation algorithm.     

A ＂cluster＂ based search scheme in peer-to-peer network

This paper presents a “cluster“ based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.     

Congestion control for ATM multiplexers using neural networks：multiple sources／single buffer scenario

A new neural network based method for solving the problem of congestion control arising at the user network interface (UNI) of ATM networks is proposed in this paper. Unlike the previous methods where the coding rate for all traffic sources as controller output signals is tuned in a body, the proposed method adjusts the coding rate for only a part of the traffic sources while the remainder sources send the cells in the previous coding rate in case of occurrence of congestion. The controller output signals include the source coding rate and the percentage of the sources that send cells at the corresponding coding rate. The control methods not only minimize the cell loss rate but also guarantee the quality of information (such as voice sources) fed into the multiplexer buffer. Simulations with 150 ADPCM voice sources fed into the multiplexer buffer showed that the proposed methods have advantage over the previous methods in the aspect of the performance indices such as cell loss rate (CLR) and voice quality.     

A Buffer Management Scheme for Packet Queues in MANET

We introduce a new scheme of buffer management to handle packet queues in Mobile Ad hoc Networks （MANETs） for fixed and mobile nodes. In this scheme, we try to achieve efficient queuing in the buffer of a centrally communicating MANET node through an active queue management strategy by assigning dynamic buffer space to all neighboring nodes in proportion to the number of packets received from neighbors and hence controlling packet drop probabilities. Our simulation study reveals that the proposed scheme is a way to improve the buffer management for packet queues in MANET nodes in terms of packet loss ratio, transmission efficiency, and some other important system parameters.     

Impaction of Aggregated Network Traffic on Queueing Performance

The impaction of aggregated network traffic on queueing system is studied in this paper. It shows that the network traffic stayed in buffer has different impaction on queueing performance when it is aggregated at different scales. And its influence is related not only to traffic parameters but also to system parameter, such as buffer size. The increased buffer size can absorb the effect of short-range dependence （SRD） in network traffic and only the effect of long-range dependence （LRD） is expressed. The queueing length is asymptotic Weibull distribution with increasing buffer size, which is irrespective with the effect of short-range dependence character. Monte-Carlo based simulation confirmed the validity of these results.     

On the energy efficiency of relay selection in multi-relay cooperative network using Vickrey auction game~

This paper focuses on the energy efficient relay selection problem in a cooperative multi-relay network, aims to find the most energy efficient relay node for the source node while ensuring its min- imum data rate requirement. The interaction between the source node and the relay nodes is modeled as a Vickrey auction game, when the source node broadcasts a cooperation request, the relay nodes compete for the cooperation, and the one with the minimum bid will be chosen which denotes the cost of the source node during the cooperation process, but it only needs to provide the minimum bid provided by the other relay nodes, which can encourage all the relay nodes to give the true bid. Be- sides, the minimum rate requirement of the source node will be ensured and the relay node taking part in the cooperation will gain some reward and the reward can be maximized by reinforcement learning （RL）.     

A Practical Approach to Attaining Chosen Ciphertext Security

Strong security in public key cryptography is not enongh; the encryption has to be achieved in an efficient way. OAEP or SAEP is only suitable for special applications （e. g. key transport）, and securely transporting message of any length is a challenge. Motivated by the hybrid encryption, we present a practical approach to achieve the （adaptively） chosen eiphertext security. The time cost of encryption/decryption of proposed scheme is similar to OAEP and the bandwidth of message recovery is 92% for standard security parameter, while RSA-OAEP is 84%. The scheme is also provably secure against adaptively chosen ciphertext attacks in the random oracle model. We conclude that the approach is practical in more extensive application.     

随机可靠组播协议的改进

差错控制是保证组播可靠性的最基本技术,合理的缓存管理可以提高差错控制的效率.在随机可靠组播协议(RRMP)的基础上提出了改进的可靠组播协议(IRMP).IRMP使用短期缓存满足本地恢复需要,使用长期缓存满足远程恢复需要.在本地恢复时,利用组播发送重传请求,利用随机后退算法减少重复报文.在远程恢复时,使用指定修复节点(D...     

Internet的可靠多媒体多播协议

研讨多媒体多播应用中的允许延迟和分组丢失率问题，提出了一种基于转接节点概念的可靠多播协554(RMPRM)．RMPRM协议聚焦在允许延迟上提供多媒体服务质量保证，转接节点放置在多播树上，数据恢复在两个转接节点之间进行。RMPRM协议转接能满足重传需求和减少分组的复制数量。给出了RMPRM协议与不可靠多播协议的比较。仿真实验表明该协议具有较高的传输率和较低的端到端的传输延迟。研究表明RMPRM协议为多媒体多播传输提供了一种新的有效途径。     

An Efficient Multicast Source Authentication Protocol

We propose an efficient multicast source authentication protocol called efficient multi-tree-chains scheme （EMTC）, which shows more loss resistibility, less communication cost, and no delay at receivers. The EMTC scheme is based on combination of single Chain scheme and Hash Tree Chains scheme, and integrates the advantages of both. In this scheme, stream is firstly divided into blocks with n packets, and each block consists of m clusters, everyone of which contains a tree of packets. All clusters are chained together. Through EMTC, packets of one cluster can be authenticated by any packet of the previous cluster. Compared to other multicast authentication protocols, the proposed scheme has the following advantages： ① dramatically improves the resistance to burst packets loss; ② low computation and communication overhead; ③ imposes low delay on the sender side and no delay on the receiver side.     

IP网上可靠组播传输协议(RMSA)的研究

提出了一种新的IP网上可靠组播传输协议（RMSA）。RMSA协议设计方案中，首次使用了通过组播发送方驱动、动态为各个接收节点选择重传请求处理节点的方法。这种方法使得RMSA协议具有较强的可扩展性，较好地适应大规模组播应用中组播树的拓扑结构和网络传输状况发生动态变化的情况。仿真实验表明，RMSA具有差错修复时延较小和重复修复数据较少的优点。同时对现有IP网上路由器组播功能的改动量较现有的方案LMS（lightweight multicast service）和PGM（pragmatic general multicast）少，因此更加接近实用。     

A Lightweight Mobile RSVP for Unicast

This paper presents a lighter protocol, and it removes the multicast burdens from RSVP to adapt to unicast applications. At the same time, when RSVP is used in wireless networks, some issues about mobility raise popular concerns. The proposed protocol a lightweight mobile RSVP protocol, solves the problems by the following mechanisms： changeless flow identifier, a new state management and ＂refresh＂ mechanism.     

Comment Fail-Stop Blind Signature Scheme Design Based on Pairings

Fail-stop signature schemes provide security for a signer against forgeries of an enemy with unlimited computational power by enabling the signer to provide a proof of forgery when a forgery happens. Chang et al proposed a robust fail-stop blind signature scheme based on bilinear pairings. However, in this paper, it will be found that there are several mistakes in Chang et al＇s fail-stop blind signature scheme. Moreover, it will be pointed out that this scheme doesn＇t meet the property of a fail-stop signature： unconditionally secure for a signer. In Chang et al＇s scheme, a forger can forge a valid signature that can＇t be proved by a signer using the ＂proof of forgery＂. The scheme also doesn＇t possess the unlinkability property of a blind signature.     

基于主动节点的可靠组播差错控制

将主动网络的思想引入可靠组播差错控制，提出由主动节点负责差错检测和报告；结合已有的“NACK汇聚”策略，设计了在主动节点上的“NACK抑制”策略，从而大大减少了NACK消息的数目．基于上述两点，设计了一个新的主动可靠组播协议ADERM．实验证明ADERM协议很好地控制了带宽占用和恢复延迟，具有良好的可扩展性．     

Agglomerating Growth of One-Dimensional Carbon Nano-Materials Synthesized from Ethanol Flames

One-dimensional carbon nano-materials （ODCNMs） synthesized from ethanol flames exhibit various agglomerated morphologies, such as ＂chrysanthemum-like＂, ＂hairball-like＂ or ＂orange-peel-like＂, ＂vertically aligned＂ and ＂wrinkling-pileup＂. The present work studied the agglomerating process and the growth mechanism by using scanning electron microscopy （SEM） and transmission electron microscopy （TEM）. It is thought that the size and distribution of the catalyst particles produced from pretreatment of the substrates play a key role during the formation of agglomerations. It is expected that the steady growth of ODCNMs in flames will be improved through the preparation of the catalysts.     

光突发交换网络中带有可用性感知的快速恢复策略

为了解决光突发交换网络中传统恢复机制简单转发造成备用路径拥塞的问题,提出了一种带有可用性感知的快速恢复策略.该策略根据反馈的节点状态信息感知链路的可用性,对转发的受损业务进行自适应调整,从而有效避免简单转发而导致的节点拥塞现象.仿真结果表明:带有可用性感知的快速恢复策略具有较好的丢包性能,很好地实现了业务区分,增强了网路对高优先级业务的恢复能力.     

一种有线-无线异构网络的媒体感知ARQ控制方案

在基于IEEE802.11b协议的无线局域网(WLAN)中,针对MPEG4视频数据在有线-无线异构网络中最后一跳的传输,当无线网络出现较严重的拥塞和干扰情况下,会导致视频播放的图像质量下降。提出了一种基于路由代理的媒体感知ARQ(automatic repeat request)机制,该机制通过利用路由代理接收视频信息并将该信息反馈给无线接入点(AP)以实现选择性的视频数据包的重传,并根据时延要求进行优先数据包重传以保障时延的要求,提高异构IP网络的视频播放质量和用户感受质量。仿真结果表明,本算法对无线链路的丢包和队列拥塞丢包进行了保护,可以提高视频的播放质量。