Relay selection for maximizing the number of successive transmission in cooperative networks

Relay selection has an important effect on improving the performance of cooperative communication system. However, the frequent operation of relay selection can bring enormous control message overhead, and then decrease the performance of cooperative communication. To reduce the relay selection frequency, in this paper, we propose a relay selection scheme to choose the best relay considering successive packets transmission. In this scheme, through the parameters of data transmission rate, the length of data packet and the estimated channel state information, the best relay is selected to maximize the number of successive packets transmission while guaranteeing the given outage probability. It is proven by numerical results that the proposed relay selection scheme can support the successive packets transmission in cooperative wireless networks and the maximum number of successive packets transmission is affected by the different network parameters, i.e. packet length, data transmission rate, signal to noise ratio and Doppler frequency. Compared to previous relay selection schemes by simulation results, it is shown that the proposed relay selection scheme can improve the throughput performance efficiently.     

Dual partitioning multicasting for high-performance on-chip networks

As the number of cores integrated onto a single chip increases, power dissipation and network latency become ever-increasingly stringent. On-chip network provides an efficient and scalable interconnection paradigm for chip multiprocessors (CMPs), wherein one-to-many (multicast) communication is universal for such platforms. Without efficient multicasting support, traditional unicasting on-chip networks will be low efficiency in tackling such multicast communication. In this paper, we propose Dual Partitioning Multicasting (DPM) to reduce packet latency and balance network resource utilization. Specifically, DPM scheme adaptively makes routing decisions based on the network load-balance level as well as the link sharing patterns characterized by the distribution of the multicasting destinations. Extensive experimental results for synthetic traffic as well as real applications show that compared with the recently proposed RPM scheme, DPM significantly reduces the average packet latency and mitigates the network power consumption. More importantly, DPM is highly scalable for future on-chip networks with heavy traffic load and varieties of traffic patterns.     

Some investigations on communication switching techniques in computer networks

In realizing computer communication networks, one of the most important decisions is the proper choice of the communication scheme to be implemented at the subnet level. The selection of the best scheme depends very heavily on the nature of the traffic to be handled by the network. While the bursty nature of the computer traffic, as well as continuously decreasing cost of computer hardware, cause packet switching to be attractive; advantages of flexibility reliability and efficiency seem to favor hybrid switching. In this paper, utilizing the results of the queueing theory, we analyze three basic communication switching schemes: circuit switching; packet switching; and hybrid switching. We investigate the effects on their throughput characteristics of the parameters such as channel density, transmission efficiency, and mixture rate. Behaviour of channel density with transmission efficiency has been studied and a linear relationship is found to exist between these. The study has led to some new and interesting results which should be helpful to a designer in the choice of the proper switching scheme in various applications.     

基于丢包统计的蓝牙信道质量估计和自适应分组策略

分析了蓝牙2.0协议的数据传输性能,给出了在不同的信道质量（接收信噪比）下所能达到的平均最大吞吐量,以及根据信道质量自适应选择分组的策略。提出了一种新的利用丢包统计估计信道质量的方法。根据最近发送的一定数目的分组的丢包情况求出这些分组的吞吐量,与已知的分组选择信噪比拐点的平均吞吐量进行比较,从而判断出信道质量所在的区段以及最适合传输的数据分组。从仿真结果来看,当判决所用的数据分组的数目N在30左右时,该方法达到的吞吐量十分接近平均最大吞吐量。该方法的软硬件开销极小,判决过程简单快速,可用于任何主控芯片的蓝牙系统。同时,该方法可在较短时间内（40 ms~180 ms左右）跟踪信道质量的变化,非常适合用于低速运动的蓝牙系统和蓝牙个人区域网。     

Throughput enhancement by exploiting spatial reuse opportunities with smart antenna systems in wireless ad hoc networks

Smart antenna (or multi-beam antenna) systems can support simultaneous transmissions (or receptions) of multiple packets in different beams using the same channel. However, network performance is highly dependent on transmission scheduling. This study develops two transmission-scheduling schemes for use with smart antenna systems to improve network throughput and reduce transmission delay. The proposed scheduling mechanisms, which are designed to minimize the average latency and maximize network throughput, exploit the opportunities for parallel transmissions and consider communication restrictions and packet sizes. The performance results indicate that the proposed schemes outperform previous schemes in network throughput and transmission delay.     

一种基于跨层功率控制的Ad hoc网络路由算法*

在无线Ad Hoc网络路由协议中引入功率控制不但可以降低网络能量消耗,同时还能改善网络的吞吐量、投递率等性能,已成为当前Ad Hoc网络的一个研究热点.本文提出了一种基于跨层功率控制的按需路由算法CPC-AODV(Cross-layer Power Control Ad hoc On-demand Distance Vector).算法按需建立多个不同功率级的路由,节点选择到目的节点最小功率级的路由来传递分组,并对网络层的数据分组、路由分组和MAC层控制帧的传输采用不同功率控制策略来降低能量消耗.仿真结果表明:算法有利于降低通信能量开销,延长网络寿命,提高网络投递率及改善网络时延.     

一种基于接收节点控制的无线传感器网络媒体访问控制协议

为了提高无线传感器网络数据包传输效率,提出一种基于时间同步、接收节点控制的无线传感器网络媒体访问控制协议。该协议在保持节点低功耗工作的前提下,使父节点在一个操作周期内,通过多次邀请机制和迸发传输机制,能够与多子节点进行数据包的多次传输。该多次邀请机制,使父节点具备了在单个操作周期内,从多个子节点接收数据包的能力,本质上减少了子节点之间的竞争、提高了信道利用率,增强了父节点对数据包传输的控制力。迸发传输机制,使得父节点可以在一次通讯中连续接收多个数据包,进一步提高了信道的利用率。仿真结果表明:当网络载荷强度增大时,该协议使网络中的节点能够充分利用信道,显著提高了网络中数据包的传输效率,随着网络载荷增加,使网络吞吐量增大近50%。     

A reliable opportunistic routing for smart grid with in-home power line communication networks

The topology of in-home power line communication (PLC) networks varies frequently, which makes traditional routing algorithms failure. To solve this problem, an end-to-end transmission time for remaining path (TTRP) metric-based opportunistic routing (TTRPOR) is proposed. Since a local broadcasting scheme is adopted, the algorithm can find the optimal path for forwarding packets in a dynamic PLC network. The closed-form of the outage probability for a PLC channel is derived to estimate the TTRP. It is proved that the average throughput can achieve maximum as the metric TTRP is utilized to sort candidate forwarding nodes. Numerical results show that the end-to-end throughput of networks with TTRPOR, outperforms that of the network adopting DSR and EXOR, especially for the case of varying-topology in-home PLC networks.     

An efficient broadcast scheduling algorithm for TDMA ad-hoc networks

In this paper, we propose an efficient algorithm to find a collision-free time slot schedule in a time division multiple access frame. In order to minimize the system delay, the optimal schedule must be defined as the one that has the minimum frame length and provides the maximum slot utilization. The proposed algorithm is based on the sequential vertex coloring algorithm. Numerical examples and comparisons with the algorithm in previous research have shown that the proposed algorithm can find near-optimal solutions in respect of the system delay.Scope and purposeAn ad-hoc network was introduced in order to apply packet switching communication to a shared radio channel. Using a radio channel as the broadcast medium to interconnect users, an ad-hoc network provides flexible data communication services among a large number of geographically distributed, possibly mobile, radio units. In an ad-hoc network, since all users share a single channel by multiple access protocol, unconstrained transmission may lead to the time overlap of two or more packet receptions, called collision, resulting in damaged useless packets at the destination. Collided packets increase the system delay because they must be retransmitted. Therefore, the transmission for each station must be scheduled to avoid any collision, that is, collision-free transmission should be guaranteed. The time division multiple access (TDMA) technology can be used to schedule collision-free transmission. In this paper, we propose an efficient algorithm to find a collision-free time slot schedule in a TDMA ad-hoc network.     

蓝牙散射网的数据传输性能分析

在蓝牙微微网中,主设备决定跳频序列.由于各主设备独立跳频,因此在多个微微网中数据分组会由于跳至同一频隙而产生较高的误包率.文中建立了散射网下数据分组相互干扰的分析模型,在此基础上得出了蓝牙散射网在进行ACL分组传输时的网络吞吐量.针对不同的跳频方式和网络是否全局时隙同步的四种情况对单一类型的分组发送成功率进行了具体的分析,并进一步得出采用混合分组时的网络最大吞吐量,并得出达到最大吞吐量是应当采用的最佳分组及最佳分组的传输延迟.     

Performance analysis of some random access systems having an intelligent central node

We consider a computer communication network in which users communicate with each other via a central node. The available channel is divided into the up- and downlink subchannels. Users contend for the uplink according to the pure ALOHA protocol. The central node is capable of recognizing erroneous packets, rejecting duplicate packets, and storing error-free packets. Given that the total available channel capacity is the limiting resource, the system throughput and the average packet delay are derived. Aiming at the improvement of system performance, we found the channel capacity divisions that maximize the throughput and minimize the average packet delay (numerically). In order to obtain the above-mentioned performance characteristics, we have assumed the infinite users' population model.     

蓝牙数据广播性能分析与自适应分组选择策略

分析了蓝牙GFSK调制方式在加性高斯白噪声信道(AWGN)下的比特错误率(BER)与平均接收信噪比的关系,推导了ACL数据分组的重传概率与平均接收信噪比的函数表达式,并且计算出了各个数据分组在不同信噪比的情况下广播重传次数和传输吞吐量.为了提高蓝牙在噪声环境下的广播性能,提出了一种自适应数据分组选择策略,通过在不同的信噪比情况下选择合适的分组类型进行广播而获得最大的广播吞吐量,给出了分组类型切换的信噪比门限值.仿真计算结果表明了该策略的有效性.     

一种基于复数域网络编码的双层卫星通信系统

针对卫星通信网络吞吐量不足、可靠性不高的问题,提出一种基于复数域网络编码(Complex Field Network Coding,CFNC)的卫星通信方案。该方案在信号发送前对源信息作预编码处理,即在复数域上选取一个大小合适的参数化空时码与源信号相乘,编码后的信号与源信号在复数域上有着一一映射关系。对该方案的吞吐量和成对差错概率(Pairwise Error Probability,PEP)做了详尽的理论分析,结果表明,采用该编码方案的卫星通信系统在终端发射功率不变的情况下,吞吐量比路由模式提高了100%以上,比传统的CFNC方式至少可提高75%。该方案还可以扩展至更多的地面源节点,从而支持多用户网络通信。最后,仿真实验表明,在较高的信噪比下,PEP仿真值逼近于渐近值,验证了理论分析的正确性。     

Globally Synchronized Frames for guaranteed quality-of-service in on-chip networks

Future chip multiprocessors (CMPs) may have hundreds to thousands of threads competing to access shared resources, and will require quality-of-service (QoS) support to improve system utilization. This paper introduces Globally-Synchronized Frames (GSF), a framework for providing guaranteed QoS in on-chip networks in terms of minimum bandwidth and maximum delay bound. The GSF framework can be easily integrated in a conventional virtual channel (VC) router without significantly increasing the hardware complexity. We exploit a fast on-chip barrier network to efficiently implement GSF. Performance guarantees are verified by analysis and simulation. According to our simulations, all concurrent flows receive their guaranteed minimum share of bandwidth in compliance with a given bandwidth allocation. The average throughput degradation of GSF on an 8×8 mesh network is within 10% compared to the conventional best-effort VC router.     

一种正交混合空时网络编码的中继通信算法

针对无线通信网络中频谱利用效率较低以及网络吞吐量不足等问题,提出一种正交混合空时网络编码的中继通信算法(QHNR)。该算法通过系统模型分析了在传输周期中的MAC阶段和BC阶段中的中继通信方式以及节点发送数据的出错率,采用分级增益的方法来提高信道利用效率,提升系统性能,并通过中继概率来选择较好的中继节点。通过网络吞吐量和网络功率分配情况来分析QHNR算法的性能。实验仿真结果表明,QHNR算法在提高网络吞吐量,提升信道利用效率上,相比采用TWR通信方案和MWR通信方案具有更好的效果。     

Improving TCP fairness and performance with bulk transmission control over lossy wireless channel

The traditional windows-based TCP congestion control mechanism produces throughput bias against flows with longer packet roundtrip times; the flow with a short packet roundtrip time preoccupies the shared network bandwidth to a greater extent than others. Moreover, the blind window reduction that occurs whenever packets are lost decreases the network utilization severely, especially in networks with high packet losses. This paper proposes a sender-based TCP congestion control, called TCP-BT. The scheme estimates the network bandwidth depending on the transmission behavior of applications, and adjusts the congestion window by considering both the estimated network bandwidth and the packet roundtrip time to improve fairness as well as transmission performance. The scheme has been implemented in the Linux platform and compared with various TCP variants in real environments. The experimental results show that the proposed scheme improves transmission performance, especially in networks with congestion and/or high packet loss rates. Experiments in real commercial wireless networks have also been conducted to support the practical use of the proposed mechanism.     

基于网络编码的输电线路WSN传输协议

根据输电线路监测对无线传感器网络实时性和可靠性要求高的特点,设计了一种基于网络编码的WSN传输协议。该协议充分利用信道广播特性和节点间的协作通信,结合了机会路由和网络编码各自优势,将网络编码经典蝶形结构应用到输电线路WSN长链拓扑结构中,在节点数据包具体接收状态不确定的情况下,采取主动网络保护机制,选择线性编码包作为冗余包进行传输,直到节点解码出源包。性能分析与仿真实验表明,该传输协议提高了数据传输可靠性和系统吞吐量,缩短了网络传输时延,提升了无线传感器网络的性能。     

一种适合于宽带卫星网络的均滑式慢启动策略

分析了标准慢启动策略在宽带卫星网络中性能下降的原因,提出了一种均滑式慢启动策略,通过定时器中断来控制数据发送,均匀网络负载,减少网络拥塞.NS仿真表明,均滑式慢启动在高带宽时延积的宽带卫星网络中平滑了数据突发,改善了传输性能.     

改进的高速长距离网络慢启动策略

分析了慢启动在高带宽时延积高速长距离网络中性能下降的原因,提出了一种改进的均滑式慢启动策略,该策略仅仅均匀了突发数据传输,没有破坏TCP的本质。NS仿真试验表明均滑式慢启动延迟了慢启动结束时间,获得了很好的最大窗口改善,在高带宽时延积网络中有效地改善了吞吐量性能。     

无线网络抗干扰攻击的自适应无速率通信

针对干扰攻击干扰信号解码、降低通信性能的问题,提出一种具备抗干扰攻击能力的自适应无速率通信机制。它将原始报文拆分为多个编码分片并分别传输,从而降低干扰攻击的影响并充分利用非连续的可用间隙。通过自适应调整分片的长度,在干扰攻击频繁时减少长度以获得更好的鲁棒性,在攻击概率较低时增大长度以提高效率。实验结果表明,当干扰攻击严重时,与直接通信相比,新机制的吞吐量平均提高50%以上,稳定性提高一个数量级。因此,自适应无速率通信可有效抵御干扰攻击并获得较高的通信效率。