Interference and SIR in integrated voice/data wireless DS-CDMAnetworks-a simulation study

The objective of this study is to characterize the multiple-access interference in a DS-CDMA integrated voice/data wireless network. The system model is designed to accommodate bursty packet-based data services in addition to stream-based services on a shared spectrum basis. A common packet data channel (CPDC) is employed to transport bursty data services, Consequently, this study incorporates features associated with packet-based services, such as higher transmitter power, short inter-arrival times, and short service time durations, as well as features associated with stream-based services, in order to provide a complete interference characterization. The results of a detailed and precise simulation study are presented in which the influence of traffic burstiness, voice activity, spatial distribution of mobiles, and transmitter powers on the fluctuation of the interference and signal-to-interference ratio (SIR) is assessed. The results obtained also quantify the impact of interference caused by CPDC services on stream-based services. The interference and SIR statistics are evaluated in terms of cumulative distribution functions. Since a DS-CDMA network is interference limited, studies of this type are essential for system design, capacity evaluation, and bandwidth management     

Integrated Services on High Altitude Platform: Receiver Driven Smart Selection of HAP-Geo Satellite Wireless Access Segment and Performance Evaluation

A renewed interest in the development of high-altitude platforms (HAPs), which are stratospheric aircraft or airship carrying payloads tailored for a wide range of applications in telecommunications and remote sensing, is becoming progressively widespread. HAPs offer a reduced propagation delay and they are especially suitable for interactive multimedia services. In this paper, the inter-working between HAP and satellite segments in an integrated QoS architecture has been addressed. A new way to manage integrated services over a new hybrid wireless platform has been proposed. A smart terminal device has been considered in order to perform an intelligent switching on the wireless access segment. The switching criteria applied in the HAP/satellite architecture is based on the available bandwidth and on the admissible data packet end-to-end delay. Performance evaluations of the integrated HAP–satellite platform have been evaluated in terms of bandwidth utilization and number of admitted calls. The simulations show an improvement of admitted calls, reduced data packet end-to-end delay and increased bandwidth utilization.     

A channel reuse strategy with adaptive channel allocation for all-optical WDM networks

The fundamental problems of WDM networks are: (1) high rate of control packet loss and (2) high propagation delay for each (re)transmission. In this paper, we minimize the station randomness to access the control architecture introducing a collisions-free access scheme. We propose a synchronous protocol according which at the end of the propagation delay each station applies a distributed algorithm for packet transmission following the data channel collisions and the receiver collisions avoidance algorithms. We introduce two data transmission stages. The time difference between them is one packet transmission time. At the end of the first stage all data channels are free and can be reused by the remaining data packets during the second stage. The proposed protocol ensures a totally collisions-free performance. The main advantage is that the data channels reuse strategy applied during the second stage provides enhanced transmission probability to the rejected packets during the first stage. This allows the data packets to try retransmission in the same cycle without requiring control packets re-coordination that increases propagation delay. Thus, we achieve large number of data packets transmission, even more than the data channels number, providing throughput improvement and delay reduction, comparing with other studies.     

一种环境感知的无线Mesh网络自适应QoS路径选择算法

本文针对如何改善无线多跳Mesh网络的服务质量,满足无线多媒体业务对数据传输的带宽、时延、抖动的要求等问题,研究了一种基于无线信道状态和链路质量统计的MAC层最大重传次数的自适应调整算法。该算法通过对无线Mesh网络的无线信道环境的动态感知,利用分层判断法区分无线分组丢失的主要原因是无线差错还是网络拥塞导致,实时调整MAC层的最佳重传次数,降低无线网络中的分组冲突概率。基于链路状态信息的统计和最大重传策略,提出了一种启发式的基于环境感知的QoS路由优化机制HEAOR。该算法通过动态感知底层链路状态信息,利用灰色关联分析法自适应选择最优路径,在不增加系统复杂度的基础上,减少链路误判概率,提高传输效率。NS2仿真结果表明,HEAOR算法能有效减少重路由次数,降低链路失效概率,提高网络的平均吞吐率。本文提出的方法不仅能够优化MAC层的重传,而且通过发现跨层设计的优化参数实现对路径的优化选择。      

TCP/IP performance with random loss and bidirectional congestion

With the growth in Internet access services over networks with asymmetric links such as asymmetric digital subscriber line (ADSL) and cable-based access networks, it becomes crucial to evaluate the performance of TCP/IP over systems in which the bottleneck link speed on the reverse path is considerably slower than that on the forward path. In this paper, we provide guidelines for designing network control mechanisms for supporting TCP/IP. We determine the throughput as a function of buffering, round-trip times, and normalized asymmetry (defined as the ratio of the transmission time of acknowledgment (ACK) in the reverse path to that of data packets in the forward path). We identify three modes of operation which are dependent on the forward buffer size and the normalized asymmetry, and determine the conditions under which the forward link is fully utilized. We also show that drop-from-front discarding of ACKs on the reverse link provides performance advantages over other drop mechanisms in use. Asymmetry increases the TCP already high sensitivity to random packet losses that occur on a time scale faster than the connection round-trip time. We generalize the by-now well-known relation relating the square root of the random loss probability to obtained TCP throughput, originally derived considering only data path congestion. Specifically, random loss leads to significant throughput deterioration when the product of the loss probability, the normalized asymmetry and the square of the bandwidth delay product is large. Congestion in the reverse path adds considerably to TCP unfairness when multiple connections share the reverse bottleneck link. We show how such problems can be alleviated by per-connection buffer and bandwidth allocation on the reverse path     

End-to-End Adaptive QoS Provisioning over GPRS Wireless Mobile Network

The General Packet Radio Service (GPRS) offers performance guaranteed packet data services to mobile users over wireless frequency-division duplex links with time division multiple access, and core packet data networks. This paper presents a dynamic adaptive guaranteed Quality-of-Service (QoS) provisioning scheme over GPRS wireless mobile links by proposing a guaranteed QoS media access control (GQ-MAC) protocol and an accompanying adaptive prioritized-handoff call admission control (AP-CAC) protocol to maintain GPRS QoS guarantees under the effect of mobile handoffs. The GQ-MAC protocol supports bounded channel access delay for delay-sensitive traffic, bounded packet loss probability for loss-sensitive traffic, and dynamic adaptive resource allocation for bursty traffic with peak bandwidth allocation adapted to the current queue length. The AP-CAC protocol provides dynamic adaptive prioritized admission by differentiating handoff requests with higher admission priorities over new calls via a dynamic multiple guard channels scheme, which dynamically adapts the capacity reserved for dealing with handoff requests based on the current traffic conditions in the neighboring radio cells. Integrated services (IntServ) QoS provisioning over the IP/ATM-based GPRS core network is realized over a multi-protocol label switching (MPLS) architecture, and mobility is supported over the core network via a novel mobile label-switching tree (MLST) architecture. End-to-end QoS provisioning over the GPRS wireless mobile network is realized by mapping between the IntServ and GPRS QoS requirements, and by extending the AP-CAC protocol from the wireless medium to the core network to provide a unified end-to-end admission control with dynamic adaptive admission priorities.     

Burst synchronization of slotted random access with preamble power ramping in the reverse link of CDMA systems

Efficient random access is one of the key designs in code-division multiple-access (CDMA) cellular systems. Random access is used by user equipment for initial access, requesting dedicated channels and transmitting short packet data to a base station. In random access, a preamble part is usually devised for fast and reliable burst synchronization, which is essential in order to avoid excessive access delay and/or repeated transmissions that may reduce the overall system capacity. This paper investigates the issue of burst synchronization for the slotted random access with preamble power ramping in the reverse link of CDMA systems. A flexible burst synchronizer based on a parallel-serial code-phase detector is proposed, which can be easily configured to achieve different complexity/performance tradeoffs. A general analysis is also presented with important design parameters being taken into account, including the number of correlators, power control error, power ramping step, diversity order, frequency offset, multipath combining, and others. The analysis is verified by computer simulations.     

Dynamic Code Assignment Medium Access (DCAMA) Protocol for Wireless Integrated Services Networks

A medium access control (MAC) protocol for wireless mobile networks that supports integrated services and provides quality of service (QoS) support is presented and evaluated via simulation. A controlled random access protocol which allows all terminals to dynamically share a group of spread spectrum spreading codes is used. The protocol provides mobile terminals the access control required for efficient transfer of integrated traffic with QoS guarantees. Two service classes are provided; "best-effort" service, with priority queueing, and reserved bandwidth circuit service. The performance of the protocol is evaluated via simulation for traffic consisting of integrated voice, data and compressed video. The performance assessment measure is packet delay.     

Adaptive Packetization for Conversational Video Service over IEEE 802.11 WLANs with Hidden Terminals

For IEEE 802.11-based wireless local area networks (WLANs), due to inherent random access mechanisms, it is very challenging to provision video services, which are subject to very stringent quality-of-service (QoS) constraints. Collision and fading are two main sources of packet loss in WLANs and as such, both are affected by the packetization at the medium access control (MAC) layer. While a larger packet is preferred to balance protocol header overhead, a shorter packet is less vulnerable to packet loss due to channel fading errors or staggered collisions in the presence of hidden terminals. In this paper, we exploit estimate of collision probabilities to adapt packetization for video frames. We first show analytically that the effective throughput is a unimodal function of packet size when considering both channel fading and staggered collisions. We then design an additive increase and multiplicative decrease (AIMD) packetization strategy which adjusts the MAC-layer packet size based on local estimate of staggered collision probability. It is demonstrated that the proposed approach can greatly improve the effective throughput of WLAN and reduce video frame transfer delay.     

Multipath interconnection: a technique for reducing congestionwithin fast packet switching fabrics

The banyan interconnection is prone to internal link congestion, resulting in a blocking switch architecture. Several solutions that have been implemented to reduce the severity of link congestion offer packets a multiplicity of paths, which tend to increase packet delay variability and allow delivery of out-of-sequence packets. This, in turn, can lead to an increase in end-to-end protocol complexity, particularly in the case of real-time services. A solution called multipath interconnection is proposed to overcome this difficulty. Multiple (i.e., alternate) paths are provided and one is selected at call-setup time. Subsequent packets belonging to the call are constrained to follow the selected path. A number of path selection strategies are presented     

Ordered Packet Length Based Groupwise Transmission Scheme for Rate Scheduling in Burst Switching DS/CDMA System

This paper proposes a new packet rate scheduling scheme for a non-real time data services over the uplink of a burst switching based direct sequence code division multiple access (DS/CDMA) system to support integrated voice/data services. We consider the most general form of optimization problem formulation to determine the optimal number of transmission time groups along with their data rates, which minimizes the average packet transmission delay. An ordered packet length based groupwise transmission (OLGT) scheme is proposed as a simple heuristic solution to this problem, and we present some analytical results for performance comparison with other possible schemes.     

Packet CDMA versus dynamic TDMA for multiple access in anintegrated voice/data PCN

A comparative evaluation of dynamic time-division multiple access (TDMA) and spread-spectrum packet code-division multiple access (CDMA) approaches to multiple access in an integrated voice/data personal communications network (PCN) environment are presented. After briefly outlining a cellular packet-switching architecture for voice/data PCN systems, dynamic TDMA and packet CDMA protocols appropriate for such traffic scenarios are described. Simulation-based network models which have been developed for performance evaluation of these competing access techniques are then outlined. These models are exercised with example integrated voice/data traffic models to obtain comparative system performance measures such as channel utilization, voice blocking probability, and data delay. Operating points based on typical performance constraints such as voice blocking probability 0.01 (for TDMA), voice packet loss rate 10^-3 (for CDMA), and data delay 250 ms are obtained, and results are presented     

A novel delay-aware routing algorithm (DARA) for a hybrid wireless-optical broadband access network (WOBAN)

A hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future access networks. Recently, the WOBAN has been gaining increasing attention, and early versions are being deployed as municipal access solutions. This architecture saves on network deployment cost because fiber need not penetrate to each end user. However, a major research opportunity exists in developing an efficient routing algorithm for the wireless front-end of the WOBAN. We propose and investigate the characteristics of the delay-aware routing algorithm (DARA) that minimizes the average packet delay in the wireless front-end of a WOBAN. In DARA we model wireless routers as queues and predict wireless link states periodically. Our performance studies show that DARA achieves less delay and congestion, and improved load balancing compared to traditional approaches such as the minimum-hop routing algorithm, shortest-path routing algorithm, and predictive throughput routing algorithm.     

统计优先级多址接入协议的改进与仿真

统计优先级的多址接入（Statistical Priority-based Multiple Access,SPMA）协议的优良性能符合未来数据链的发展趋势。经典的SPMA协议中存在固定门限设置导致的吞吐量下降、退避时间设置过于简单和低优先级分组“饥饿”等三个问题。针对这些问题,提出了统计差值退避算法和虚拟时间戳排队算法。统计差值退避算法使用负载统计量和优先级门限的差值,计算出合理的分组退避时间。虚拟时间戳排队算法根据接入带宽的最低要求,按照虚拟完成时间大小进行分组接入。结合这两个算法,设计了基于SPMA的介质访问控制层改进协议,并使用OPNET软件对改进协议进行了仿真。仿真结果表明,相比于SPMA协议的传统算法,改进协议的系统吞吐量更大且更稳定,优先级平均时延更低,同时保证了低优先级业务的最小带宽接入需求。     

Packet access mechanisms for cellular radio

The paper reviews the findings of work completed in RACE Mobile Telecommunications Project 1043 on the suitability of packet access mechanisms for mixed services in the Universal Mobile Telecommunication System. A first order comparison of random and scheduled access is provided and conditions under which these mechanisms provide an attractive alternative to channel allocation for call duration are specified. It is concluded that packet reservation multiple access (PRMA) is an attractive candidate for mixed services over a range of cell sizes as it can accommodate fixed channel access, reserved channel access and random channel access     

A Medium Access Control Protocol for Real Time Video over High Latency Satellite Channels

We report the results of extensive simulation work on a new satellite medium access control (MAC) protocol for medium quality interactive video. This MAC protocol uses combined random access/demand assigned multiple access (RA/DAMA). The underlying multiple access physical layer is time division multiple access (TDMA). The RA/DAMA MAC seeks to adaptively minimize the delay of each network layer (nl) packet that arrives to the output queue by transmitting packets on either a collision free demand assigned channel or on a collision possible random access channel. Combined with this dual channel transmission method is a new technique for acquiring demand assigned bandwidth, called a packet flow rate metric (PFRM). This metric seeks to track the slow time behavior of video traffic, leading to a significant reduction in the amount of DAMA signaling. All simulations were conducted using SMACS, the Satellite Medium Access Control Simulator [4], a simulation tool built into ns-2.0 (network simulator version 2) [10]. This simulation tool allowed us to evaluate our MAC protocol using an actual 2 hour long video trace rather than a parametric video traffic generator. Our results show that if light packet loss is tolerable (less than 3%), then significantly lower delays and higher link utilization can be achieved.     

Terminal‐Assisted Hybrid MAC Protocol for Differentiated QoS Guarantee in TDMA‐Based Broadband Access Networks

This paper presents a terminal‐assisted frame‐based packet reservation multiple access (TAF‐PRMA) protocol, which optimizes random access control between heterogeneous traffic aiming at more efficient voice/data integrated services in dynamic reservation TDMA‐based broadband access networks. In order to achieve a differentiated quality‐of‐service (QoS) guarantee for individual service plus maximal system resource utilization, TAF‐PRMA independently controls the random access parameters such as the lengths of the access regions dedicated to respective service traffic and the corresponding permission probabilities, on a frame‐by‐frame basis. In addition, we have adopted a terminal‐assisted random access mechanism where the voice terminal readjusts a global permission probability from the central controller in order to handle the ‘fair access’ issue resulting from distributed queuing problems inherent in the access network. Our extensive simulation results indicate that TAF‐PRMA achieves significant improvements in terms of voice capacity, delay, and fairness over most of the existing medium access control (MAC) schemes for integrated services.     

TETRA分组数据业务随机接入延迟计算

数字集群系统的参数设计和网络负荷对分组数据业务的延迟具有很大的影响。首先详细分析了陆地集群无线通信(TETRA)分组数据业务在空中接口的发送过程,然后分析了TETRA协议的随机接入算法,最后对分组数据采用离散接入帧进行随机接入的延迟进行了推导,得到了随机接入延迟与相关参数的关系表达式,并对接入延迟与参数的关系进行了分析,对TETRA集群系统的设计具有指导意义。     

Dynamic cache allocation routing strategy of Internet of things satellite node based on traffic prediction

Aiming at the routing problem of low earth orbit (LEO) Internet of things (IoT) satellite systems,a dynamic cache allocation routing strategy based on traffic prediction for IoT satellite nodes was proposed.Firstly,the space-time characteristics of traffic distribution in the LEO coverage area were analyzed,and an end-to-end traffic prediction model was proposed.Then,according to the traffic prediction result,a dynamic cache allocation routing strategy was proposed.The satellite node periodically monitored the traffic load of the inter-satellite link,dynamically allocated the cache resources of each inter-satellite link between the neighboring nodes.The cache allocation process was divided into two phases,initialization and system operation.At the same time,the traffic offload and packet forwarding strategy when the node was congested was proposed.By comparing the queuing delay and the forwarding delay,it was determined whether the data packet needs to be rerouted.The simulation results show that the proposed routing strategy effectively reduces the packet loss rate and average end-to-end delay,and improves the traffic distribution in the whole network.