A priority media access control protocol for video communication support on CSMA/CD LANs

Real-time multimedia communication applications demand performance requirements which differ significantly from conventional data communication applications. Current local area networks (LANs) provide efficient transport for bursty data traffic; however, they cannot necessarily provide quality of service guarantees for real-time communications. In this work we introduce and investigate an experimental priority protocol for supporting real-time communication on Ethernet, a popular implementation of multiple-access broadcast bus LANs. We examine the new protocol, known as Priority Mode-CSMA/CD (PM-CSMA/CD), providing a high priority (HP) class with CSMA/CD employed for standard priority (SP) traffic. PM-CSMA/CD performance is examined through computer simulation of videotelephony workstations operating over the shared bus LAN. Over all observed traffic conditions, the priority protocol provides performance satisfying real-time packet transport requirements of audio and video streams. The primary advantage of our protocol over similar priority schemes is its physical layer compatibility with standard CSMA/CD. The protocol also provides improved channel utilization with increasing high priority load, with no penalty in SP class performance at low to medium network loads.     

TCP over satellite...the final frontier

Communication satellites are now being used to transport TCP/IP traffic between distant locations, and to offer Internet access. Satellites have thus become the celestial link of the Internet, an “instant” infrastructure in the sky. The rapid growth of satellite communications is evolving the TCP/IP protocol suite in positive ways. In particular, enhancements to the Transmission Control Protocol (TCP) to address the challenges of satellite transmission will benefit all high-bandwidth TCP communications. TCP is the predominant unicast transport protocol used by Internet applications such as Telnet, FTP, and HTTP. The ability of TCP to maximize the link utilization of a satellite channel is being challenged by the inherent delays associated with space communications and some of TCP's own behaviors. The author discusses the basics of using TCP for satellite transmission and describes the changes you can expect to see in the TCP protocol itself as a result of the increase in use of satellites for TCP/IP traffic     

An X.25-compatible protocol for packet voice communications

Developments in packet-switched networks have generated interest in how to integrate voice and data traffic in such networks. The paper deals with a proposed communications protocol for voice transmission within X.25 packet-switched networks. Basic protocol procedures for handling voice communications are examined, and possible formats for the identified types of voice frame and packet fitting for current CCITT standards governing packet data communications are presented.     

一种新型基于格上LWE问题密钥交换协议的设计

基于格上困难问题设计高效、安全的后量子密钥交换协议具有非常重要的理论意义和实用价值。提出了一种新型高效实用的基于格上错误学习问题被动安全密钥交换协议。该协议采用加密机制的构造方式并使用了密文压缩技术,与2016年Bos等人基于错误学习问题并使用Peikert错误调和机制设计的密钥交换协议Frodo相比,通信量只增加了1.09%,但方案复杂度有效降低,计算更加简洁高效,且协议在被动攻击下可证明安全,可有效抵御量子攻击。该协议与现有的基于错误学习问题设计的密钥交换协议相比,具有很强的竞争力。     

基于工业以太网的动态通信平滑过滤器研究

针对工业控制系统的特点,在不改变以太网协议的条件下,采用一种新的动态通信平滑过滤器来控制网络负荷以满足控制系统的实时通信要求。研究表明:该动态通信平滑过滤器不仅可以为非实时数据提供合理的网络吞吐率,并且可以显著地控制实时数据传输的超时比率,其性能明显优于静态通信平滑过滤器。     

MANET中基于邻居节点权值的可验证组密钥更新算法

相对于传统有线网络集中化组密钥管理协议和算法,门限秘密共享技术能很好地适应移动自组网（MANET）的特点,提供高效可靠的安全保证。为了防止退出节点合谋重构组私钥威胁组通信安全,安全高效的组密钥更新算法是关键。在对合谋问题进行深入分析的基础上,本文提出了基于邻居节点权值的可验证的组密钥更新算法。该算法在保持组
私钥不变的情况下主动更新组成员的私钥份额,有效地解决了节点合谋、更新通信量大、恶意节点参与更新等问题。     

SSL协议安全缺陷分析

近年来,随着对Internet上传输数据保密性的需要,安全套接字层(SSL)被广泛地使用。SSL协议基于公开密钥技术,提供了一种保护客户端/服务器通信安全的机制。但是,SSL协议仍存在一些安全缺陷,对使用SSL协议的通信带来安全隐患。文中简要介绍了SSL 3.0协议的内容,重点讨论了SSL 3.0协议的安全缺陷并针对缺陷提出了相应的改进方法,为协议的实现提供了参考。     

基于单向函数的多权限群组密钥管理协议

多权限组播通信存在多个数据流且组播组中用户权限因获得数据流的不同而不同,其安全问题较难处理。该文提出一种针对多权限组播通信的高效的密钥管理协议,为密钥图中的每个节点分配一个ID,根据节点ID之间的特殊关系,组播组中的用户只要知道密钥图中加入/退出/改变权限节点的ID便可利用单向函数计算出新的密钥,减少了服务器的密钥更新开销。模拟结果表明,与MGKMS协议相比,该协议最多可以减少70%的密钥更新开销。     

Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks

We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduce the interference effect of close-by transmissions. Unlike the previous studies that often assume a unit disk graph model, we assume that different terminals could have different transmission ranges and interference ranges. In our model, a communication link may not exist due to barriers or is not used by a predetermined routing protocol. Using a mathematical formulation, we develop interference aware joint routing and TDMA link schedulings that optimize the networking throughput subject to various constraints. Our linear programming formulation will find a flow routing whose achieved throughput (or fairness) is at least a constant fraction of the optimum. Then, by assuming known link capacities and link traffic loads, we study link scheduling under the RTS/CTS interference model and the protocol interference model with fixed transmission power. For both models, we present both efficient centralized and distributed algorithms that use time slots within a constant factor of the optimum. We also present efficient distributed algorithms whose performances are still comparable with optimum, but with much less communications. Our theoretical results are corroborated by extensive simulation studies.     

Contention-based forwarding with multi-hop connectivity awareness in vehicular ad-hoc networks

Recent vehicular routing proposals use real-time road traffic density estimates to dynamically select forwarding paths. Estimating the traffic density in vehicular ad hoc networks requires the transmission of additional dedicated messages increasing the communications load. These proposals are generally based on unicast sender-based forwarding schemes. The greedy nature of sender-based forwarding can result in the selection of forwarders with weak radio links that might compromise the end-to-end performance. To overcome these limitations, this paper presents TOPOCBF, a novel contention-based broadcast forwarding protocol that dynamically selects forwarding paths based on their capability to route packets between anchor points. Such capability is estimated by means of a multi-hop connectivity metric. The obtained results demonstrate that TOPOCBF can provide good packet delivery ratios while reducing the communications load compared to unicast sender-based forwarding schemes using road traffic density estimates.     

Design issues of uplink media access control (MAC) protocols for multimedia traffic over DS-CDMA systems

We propose an efficient uplink media access control (MAC) protocol for a variable spreading gain interference-limited wideband CDMA system. It can, with high spectral efficiency, support both real-time traffic like speech and video and also nonreal-time data traffic based on packet transmission. The schemes for power allocation, joint scheduling, and transmission rate adaptation for nonreal time data traffic are designed as integrated parts of the MAC, working together to improve the system performance in terms of capacity and delay. With these associated resource management mechanisms, the performances of the MAC protocol with two different channel-allocation methods for real-time traffic are numerically compared. One is demanding channel allocation, and the other is reserve channel allocation, in which a certain bandwidth is reserved for concurrent real-time traffic.     

基于Linux平台的WAP网关的设计与实现

WAP协议是WAP论坛提出的一个开放通信协议;WAP网关进行协议的转换,是移动终端无线接人Internet的枢纽。在简要介绍了无线应用协议后,提出了一个在Linux操作系统平台下运行的WAP网关（数据通信网关）的设计与实现方案。其中详细介绍了该方案的实现方法和工作原理,并在实验室环境下对网关进行测试,给出了测试结果。     

Arranging cluster sizes and transmission ranges for wireless sensor networks

Hierarchical routing is an efficient way to lower energy consumption within a cluster. Due to the characteristics of wireless channels, multi-hop communications between a data source and a data sink are usually more energy efficient than direct transmission. However, because the cluster heads (CHs) closer to the data sink are burdened with heavy relay traffic, they drain much faster than other CHs.This paper presents a cluster-based routing protocol called “arranging cluster sizes and transmission ranges for wireless sensor networks (ACT).” The aim is to reduce the size of clusters near the base station (BS), as CHs closer to the BS need to relay more data. The proposed method allows every CH to consume approximately the same amount of energy so that the CHs near the BS do not exhaust their power so quickly. Furthermore, we separate the network topology into multiple hierarchical levels to prolong network lifetime. Simulation results show that our clustering mechanism effectively improves the network lifetime over LEACH (Low Energy Adaptive Clustering Hierarchy), BCDCP (Base Station Controlled Dynamic Clustering Protocol) and MR-LEACH (multi-hop routing with low energy adaptive clustering hierarchy).     

On the Effectiveness of the FDDI-M Medium Access Protocol for Real-Time Traffic

FDDI networks have been widely deployed to support real-time traffic such as voice and video communications. However FDDI's medium access control (MAC) protocol can transmit synchronous messages up to at most one half of the total bandwidth of the FDDI network. In a recent paper by K. Shin and Q. Zheng [Shin95], a modification to the FDDI MAC protocol, called FDDI-M, has been proposed to double a ring's ability to support synchronous traffic. In this paper we present an analytical study of the timing properties of the FDDI-M protocol. Using the Worst Case Achievable Utilization (WCAU) as the performance metric, we first evaluate the performance of various synchronous bandwidth allocation (SBA) schemes in guaranteeing synchronous message deadlines. It is found that, in comparison with FDDI, the FDDI-M protocol results in a higher WCAU for the normalized proportional SBA scheme. However, for the local SBA schemes, the WCAU values remain zero. Next, other performance metrics such as throughput and percentage of frames missing deadlines are examined using simulation. A series of simulations using actual MEPG video traffic confirms that FDDI-M does provide superior synchronous transmission characteristics.     

真实Ad hoc网络中多径视频传输的研究

无线Adhoc网络拓扑结构的频繁变化使得如何在多变的拓扑结构中快速找路,以及路径失效后的快速重新找路成为无线Adhoc网络中路由协议研究的主要目标之一。随着无线Adhoc网络带宽的增加,无线Adhoc网络中的视频业务逐渐变得现实起来,因此也成为了研究的重点,但是视频业务与普通业务比起来,在分组到达的延迟上要求很严,因此以上两个方面无疑是一对矛盾。论文重点讨论了在动态源路由协议(DynamicSourceRouting,以下简称DSR)基础上,视频业务所带来的诸多问题,结合DSR路由模块的试验床提出一种解决方法,并把改进后的DSR协议与原始的DSR协议在一些性能参数上作了分析与比较。     

A novel multi-channel MAC protocol with directional antenna for enhancing spatial reuse and bandwidth utilization in WLANs

This paper aims at developing an efficient MAC protocol for wireless LAN by considering multi-channel and directional antennae. Extending IEEE 802.11 to a multi-channel environment not only exploits the bandwidth utilization but also reduces the degree of contentions. Involving directional antennae in designing multi-channel MAC protocol additionally increases the spatial reuse, allowing more parallel communications. This study proposes an efficient Multi-Channel MAC protocol with a Directional Antenna (MCDA) for WLAN. Since each station is only equipped with a single antenna, communicating pairs that progress their communications on data channels cannot maintain the channel usage information which is only obtained from the control channel, raising the channel collision problem. The proposed protocol adopts the channel switch sequence (CSS) mechanism to cope with the channel collision problem and to reduce message exchange overhead for switching channels. According to the state management, MCDA then controls directional antenna transmitting data on a selected channel to exploit the opportunities of spatial reuse, and to maintain fairness among communicating pairs. Simulation results show that the proposed MCDA protocol maintains the fairness and significantly improves bandwidth utilization and throughput.     

AVP: A Highly Efficient Transport Protocol for Low Bit Rate Multimedia Communications

Utilization of Internet communications in distance learning, distributed simulation, and distributed work groups involves multimedia transmission of animation, voice and video clips. Highly compressed audio-video data protocols are required for efficient Internet multimedia communications. Addressing this requirement, a new transport protocol called Audio-Video Protocol (AVP) for highly efficient multimedia communications on the Internet is presented. While providing similar real-time delivery functions as Real-Time Transport Protocol (RTP) and Real-Time Control Protocol (RTCP), AVP adopts a novel audio-based synchronization scheme. This synchronization scheme has two advantages. One is the overhead reduction through eliminating the timestamp in each transmitted data packet. The other is the packet rate reduction by putting multiple audio frames or mixed audio-video frames in a single AVP packet. As a result, the end-to-end media unit delay is reduced while achieving implicit synchronization. Furthermore, AVP provides adaptive quality of service (QoS) by the prioritized packetization scheme. Simulation results are presented to verify the advantages of the AVP protocol.     

Performance analysis of an adaptive,energy-efficient MAC protocol for wireless sensor networks

We propose an adaptive and energy-efficient TDMA-based MAC protocol that significantly reduces energy consumption in the network, while efficiently handling network traffic load variations and optimizing channel utilization through a timeslot stealing mechanism and a timeslot reassignment procedure. We have analytically derived the average delay performance of our MAC protocol, with and without the timeslot stealing mechanism. Our delay model, validated via simulations, shows that the timeslot stealing mechanism can substantially improve the protocol throughput in scenarios with varying and asymmetric traffic patterns. Evaluation results show that the timeslot reassignment procedure is efficient in handling the longer timescale changes in the traffic load, while the timeslot stealing mechanism is better in handling the shorter timescale changes in the traffic patterns.     

ATM communications network control by neural networks

A learning method that uses neural networks for service quality control in the asynchronous transfer mode (ATM) communications network is described. Because the precise characteristics of the source traffic are not known and the service quality requirements change over time, building an efficient network controller which can control the network traffic is a difficult task. The proposed ATM network controller uses backpropagation neural networks for learning the relations between the offered traffic and service quality. The neural network is adaptive and easy to implement. A training data selection method called the leaky pattern table method is proposed to learn precise relations. The performance of the proposed controller is evaluated by simulation of basic call admission models.     

An evaluation of hardware-based and compiler-controlled optimizations of snooping cache protocols

Coherence misses and invalidation traffic limit the performance of bus-based multiprocessors using write-invalidate snooping caches. This paper considers optimizations of a write-invalidate protocol that remove such overhead. While coherence misses are attacked by a hybrid update/invalidate protocol and another technique where update instructions are selectively inserted by a compiler, invalidation traffic is reduced by three optimizations that coalesce ownership acquisition with miss handling: migrate-on-dirty, an adaptive hardware-based scheme, and compiler-controlled insertion of load-exclusive instructions.

The relative effectiveness of these optimizations are evaluated using detailed architectural simulations and a set of four parallel programs. We find that while both of the update-based schemes effectively remove most coherence misses, the hybrid update/invalidate scheme causes lower traffic. By contrast, the compiler-based approach to cut invalidation traffic is slightly more efficient than the adaptive hardware-based scheme. Moreover, the migrate-on-dirty heuristic is found to have devastating effects on the miss rate.