Proposal of Asynchronous Time Division Multiple Access Radio Highway Using Chirp Multiplexing Transform

Asynchronous TDMA bus-link systems using chirp multiplexing transform(CMT) are proposed for radio highway networks to provide the flexibleconstruction of fiber-optic radio access networks and thepossibility of the universal use of these networks among future diverseradio services. The CMT equipped at the radio base station performs twofunctions. One is the conversion of FDM multiple radio services intosignals with a TDMA format and the other is the time compression ofthe generated signal in order to allow asynchronous access. As aresult, the proposed systems can realize the unified transmission ofmultiple radio services and the switching of them in the optical stage(photonic routing) in the networks according to the type of radioservice. The realization of such photonic routing of the radio servicewould greatly benefit the goal of a seamless and universalnetwork available to different types of radio service. Therelationship between the pulse-loss probability performance and thecall-blocking probability performance is theoretically analyzed. Theeffect on the performance of traffic partiality in the coveredarea and the way the performance can be improved are theoreticallyinvestigated. Finally, one of the ways to determine the network sizecovered by a bus link and the number of connected radio base stationsis introduced.     

Efficient bandwidth allocation and call admission control for VBR service using UPC parameters

Provision of Quality‐of‐Service (QoS) guarantees is an important and challenging issue in the design of Asynchronous Transfer Mode (ATM) networks. Call Admission Control (CAC) is an integral part of the challenge and is closely related to other aspects of network designs such as traffic characterization and QoS specification. Since the Usage Parameter Control (UPC) parameters are the only standardized traffic characterizations, developing efficient CAC schemes based on UPC parameters is significant for the implementation of CAC on ATM switches. In this paper, we develop a CAC algorithm called TAP (derived from TAgged Probability) as well as two other CAC algorithms using the UPC parameters. These CAC algorithms are based on our observation that the loss‐probability‐to‐overflow‐probability ratio tends to decrease as the number of sources increases. By introducing the loss‐probability‐to‐overflow‐probability ratio K, we find that this ratio sheds light on increasing resource utilization while still guaranteeing QoS. Analysis, simulation, and numerical results have shown that the proposed TAP algorithm is simple and efficient. Copyright © 2000 John Wiley & Sons, Ltd.     

自相似业务下共享通道保护WDM网络性能分析

该文利用随机中点置换-分形高斯噪声(RMD-FGN)方法生成自相似业务,并且利用分层图方法来记录WDM网络状态,提出了一种链路状态描述模型。对自相似业务下55 Mesh_Torus共享通道保护WDM网络性能进行了仿真。结果表明:当业务的自相似系数或方差变大时,也就是说业务的突发程度变大时,阻塞率变大,网络的性能下降。增加单纤波长数,可以降低阻塞率,提高网络性能。     

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     

Network dimensioning at the call level for the always‐on network

It is becoming common for the network to provide always‐on access services, where subscribers are guaranteed that their call requests will never be blocked. This paper studies the call‐level link dimensioning for the always‐on network with single‐class traffic. The call‐level QoS requirement is expressed in terms of the probability of a poor‐quality call, which is the probability that a call experiences packet‐level QoS violation at any time during its duration, as opposed to the probability of blocking in the network with call admission control (CAC). The system is modelled as the M/M/infinite system with finite population and an analytic expression for the probability of a poor‐quality call is derived based on performability analysis. The effects of the call‐level traffic characteristics on the required link resources are studied. It is also shown that the call‐level link dimensioning for the always‐on network needs more link resources than the network with CAC, and the call‐level link dimensioning based on the analytic expression can be used to conservatively dimension the always‐on network with arbitrarily distributed call holding time and inter‐call time. The paper also studies the problem of estimating the call‐level traffic characteristics when the knowledge of call boundaries is not available. Copyright © 2004 John Wiley & Sons, Ltd.     

Outage Analysis of OFDM‐Based Cognitive AF Relay Network in the Presence of Narrowband Interference

Orthogonal frequency‐division multiplexing (OFDM) is one of the most widely used technologies in current wireless communication systems and standards. Cognitive radio (CR) provides a robust solution to the problem of spectrum congestion as it offers opportunistic usage of frequency bands that are not occupied by primary users. Due to the underlying sensing, spectrum shaping, scaling, and interoperable capabilities of OFDM, it has been adapted as a best transmission technology for CR wireless systems. However, the performance of an OFDM‐based CR wireless system is affected by the existence of narrowband interference (NBI) from other users. Further, due to carrier frequency offset in NBI sources, NBI energy may spread over all subcarriers of an OFDM signal. In this paper, a fixed Amplify‐and‐Forward (AF) relay that operates at a frequency band that is different from that of direct mode is introduced to suppress the effect of NBI. Analytical expressions are derived for outage probability in direct, AF‐relay, and incremental relaying modes. The outage performance of the proposed AF relay–based CR network is proven to be better than that of direct mode.     

An Efficient Adaptive Channel Estimation Algorithm for MIMO OFDM Systems—Study of Doppler Spread Tolerance

In this paper we develop an adaptive MIMO channel estimation algorithm for space–time block coded OFDM systems. The presented algorithm is based on Expectation Maximization (EM) technique by decomposing the superimposed received signals into their signal components, and estimating the channel parameters of each signal component separately. We also study and compare our proposed EM-based algorithm with a previously introduced recursive-least-squares based algorithm for MIMO OFDM systems. At each iteration the EM algorithm decomposes the problem of multi-channel estimation into channel estimation for each transmit–receive link. In this paper we also study the Doppler spread tolerance of our proposed algorithm in a fast fading environment, and investigate how it affects the system BER performance.     

Computer-aided planning of SS/TDMA network operation

A computer-aided approach to the planning of SS/TDMA network operation is proposed. SS/TDMA is a sophisticated satellite communication network based on an onboard switch matrix, whose operation planning is formulated as a large-scale scheduling problem. An overall planning and scheduling model is presented to deal with practical SS/TDMA systems, such as a two-frequency channel network and nondisjoint beam coverage. For systematic planning suitable for a computer-aided approach, the entire scheduling process is divided into several steps, for each of which an efficient mathematical model is proposed. A linear programming model is used for distribution of traffic on a beam-to-beam basis and the generated switching sequence is further refined by a model using the traveling salesman problem. Burst scheduling is carried out by the Bin packing algorithm and scheduling models for practical networks allowing transponder hopping and multidestination bursts. An algorithm called enhanced rescheduling is presented to further improve the scheduling capability of the existing methods. The performance of the proposed methods is demonstrated by simulation results     

Approximation of loss calculation for hierarchical networks with multiservice overflows

This paper studies loss calculation in hierarchical networks with multiservice overflows which have different call arrival rates, mean holding times, bandwidth requirements and share a common link. The loss calculation involves two challenging problems: 1) the computation of the two moment characterizations of multiservice overflow traffic over the shared link, 2) the calculation of the loss probabilities for multiservice non-Poisson overflow traffic in hierarchical systems. An efficient approximation method, known as multiservice overflow approximation (MOA), is proposed to enable multiservice networks designs with hierarchical architecture. Two contributions are included in the MOA method. First, an approximation based on blocking probabilities matching is proposed to compute the variances of multiservice overflows over the shared link. Second, a modified Fredericks & Hayward's approximation is used to calculate the loss probabilities of multiservice non-Poisson over flow traffic. The performance of the MOA method is evaluated in a two-tier hierarchical cellular network and compared with an existing approximation method based on multi-dimensional Markov-modulated Poisson process (MMPP). Verified by simulations, the MOA method achieves better accuracy in the general heterogeneous cases at lower computational cost than the MMPP method.     

PAPR reduction for OFDM‐based visible light communication systems using proposed hybrid technique

Orthogonal Frequency Division Multiplexing (OFDM) is utilized with visible light communication (VLC) systems to decrease the impacts of inter‐symbol interference and to achieve communication with high speed of data transmission and huge bandwidth. In any case, the main problem in OFDM‐based VLC systems is high peak‐to‐average power ratios (PAPRs). This paper proposes a hybrid PAPR reduction technique based on signal transformation combined with clipping. The Hadamard transform is used in the proposed technique to reduce the PAPR without affecting the bit error rate (BER) of the VLC systems. The optimum clipping threshold at which the PAPR is reduced simultaneously with the improvement the BER of the VLC systems is also determined. The performance of the proposed system is assessed in terms of complementary cumulative distribution function and the BER. The obtained results demonstrate that the proposed procedure can simultaneously decrease the PAPR and achieve good BER performance compared to the OFDM‐based VLC system.     

On providing blocking probability and throughput guarantees in a multi‐service environment

As the Internet evolves from a packet network supporting a single best effort service class towards an integrated infrastructure supporting several service classes—some with QoS guarantees—there is a growing interest in the introduction of admission control and in devising bandwidth sharing strategies, which meet the diverse needs of QoS‐assured and elastic services. In this paper we show that the extension of the classical multi‐rate loss model is possible in a way that makes it useful in the performance analysis of a future admission control based Internet that supports traffic with peak rate guarantee as well as elastic traffic. After introducing the model, it is applied for the analysis of a single link, where it sheds light on the trade‐off between blocking probability and throughput. For the investigation of this trade‐off, we introduce the throughput‐threshold constraint, which bounds the probability that the throughput of a traffic flow drops below a predefined threshold. Finally, we use the model to determine the optimal parameter set of the popular partial overlap link allocation policy: we propose a computationally efficient algorithm that provides blocking probability‐ and throughput guarantees. We conclude that the model and the numerical results provide important insights in traffic engineering in the Internet. Copyright © 2002 John Wiley & Sons, Ltd.     

一种利用信道侦听的动态TDMA协议

针对TDMA网络节点间业务量不均匀时,会造成信道资源严重浪费的情况,提出了一种利用信道侦听的CS-TDMA协议。该协议在TDMA协议的基础上,节点通过接收到各节点的数据包数量估算相应节点的业务量大小。当某节点时隙剩余时,向其统计中业务量最大的一个节点发送ATS信息,通知该节点占用剩余时隙发送数据,直至时隙结束。仿真结果表明,CS-TDMA协议较TDMA协议在传输时延、吞吐量、数据接收率上均有所提高,尤其在节点间业务量大小不均匀时,时延性能提升更加明显。     

Distributed protocols for ad hoc wireless LANs: a learning-automata-based approach

An ad hoc learning-automata-based protocol for wireless LANs, capable of operating efficiently under bursty traffic conditions, is introduced. According to the proposed protocol, the mobile station that is granted permission to transmit is selected by means of learning automata. At each station, the learning automaton takes into account the network feedback information in order to update the choice probability of each mobile station. The proposed protocol is compared via simulation to TDMA and IEEE 802.11 under bursty traffic conditions. Ad hoc learning-automata-based protocol (AHLAP) is shown to exhibit superior performance compared to TDMA in all cases. Compared to IEEE 802.11, the burstier the network traffic, the larger the performance increase of AHLAP. Furthermore, the implementation of AHLAP is more easier than that of IEEE 802.11.     

Performance analysis of handover delay and buffer capacity in mobile OpenFlow‐based networks

Software‐defined networking (SDN) is a network concept that brings significant benefits for the mobile cellular operators. In an SDN‐based core network, the average service time of an OpenFlow switch is highly influenced by the total capacity and type of the output buffer, which is used for temporary storage of the incoming packets. In this work, the main goal is to model the handover delay due to the exchange of OpenFlow‐related messages in mobile SDN networks. The handover delay is defined as the overall delay experienced by the mobile node within the handover procedure, when reestablishing an ongoing session from the switch in the source eNodeB to the switch in the destination eNodeB. We propose a new analytical model, and we compare two systems with different SDN switch designs that model a continuous time Markov process by using quasi‐birth–death processes: (1) single shared buffer without priority (model SFB), used for all output ports for both control and user traffic, and (2) two isolated buffers with priority (model priority finite buffering [PFB]), one for control and the other for user plane traffic, where the control traffic is always prioritized. The two proposed systems are compared in terms of total handover delay and minimal buffer capacity needed to satisfy a certain packet error ratio imposed by the link. The mathematical modeling is verified via extensive simulations. In terms of handover delay, the results show that the model PFB outperforms the model SFB, especially for networks with high number of users and high probability of packet‐in messages. As for the buffer dimensioning analysis, for lower arrival rates, low number of users, and low probability of packet‐in messages, the model SFB has the advantage of requiring a smaller buffer size.     

Slot allocation strategies for delay sensitive traffic support in asynchronous ad hoc wireless networks

Supporting real‐time traffic in ad hoc wireless networks is considered as a challenging problem. Existing bandwidth reservation mechanisms assume a TDMA environment where achieving time synchronisation is expensive in terms of resources. Heuristics that exist for slot allocation schemes assume a CDMA over TDMA model in order to alleviate the presence of hidden terminals. Slot allocation strategies in the presence of hidden terminals assume significance in a single channel system for supporting delay sensitive traffic. In this paper, we propose three heuristics for the slot allocation process in asynchronou single channel multihop wireless networks in the presence of hidden terminals. The heuristics we propose are the early fit reservation (EFR), minimum bandwidth‐based reservation (MBR) and position‐based hybrid reservation (PHR). The EFR heuristic assigns bandwidth link‐by‐link in the forward path. The MBR heuristic allocates bandwidth to the links in the increasing order of free conn‐slots. The PHR heuristic assigns bandwidth for every link proportional to its position in the path. Simulation studies show that EFR performs better in terms of delay characteristics. MBR provides better call blocking performance at the cost of high end‐to‐end delay. PHR provides a better delay performance compared to MBR and better call blocking performance comparedto EFR. Copyright © 2004 John Wiley & Sons, Ltd.     

Multi‐carrier platform for wireless communications. Part 2: OFDM and MC‐CDMA systems with high‐performance,high‐throughput via innovations in spreading

Multi‐carrier technologies in general, and OFDM and MC‐CDMA in particular, are an integral part of the wireless landscape. In this second part of a two‐part survey, the authors present an innovative set of spreading codes known as CI codes, and demonstrate how these significantly increase performance and capacity in OFDM and MC‐CDMA systems, all the while eliminating PAPR concerns. Regarding OFDM: the spreading of each symbol over all N carriers using CI spreading codes (replacing the current one symbol per carrier strategy) are presented. CI codes are ideally suited for spreading OFDM since, when compared to traditional OFDM, CI‐based OFDM systems achieve the performance of coded OFDM (COFDM) while maintaining the throughput of uncoded OFDM, and, at the same time, eliminate PAPR concerns. When applied to MC‐CDMA, CI codes provide a simple means of supporting 2N users on N carriers while maintaining the performance of an N‐user Hadamard Walsh code MC‐CDMA system, i.e., CI codes double MC‐CDMA network capacity without loss in performance. The CI codes used in OFDM and MC‐CDMA systems are directly related to the CI pulse (chip) shapes used to enhance TDMA and DS‐CDMA (see part 1): hence, the CI approach provides a common hardware platform for today's multi‐carrier/multiple‐access technologies, enabling software radio applications. Copyright © 2002 John Wiley & Sons, Ltd.     

Multi‐carrier platform for wireless communications. Part 1: High‐performance,high‐throughput TDMA and DS‐CDMA via multi‐carrier implementations

Multi‐carrier technologies in general, and OFDM and MC‐CDMA in particular, are quickly becoming an integral part of the wireless landscape. In this first of a two‐part survey, the authors present the innovative transmit/receive multi‐carrier implementation of TDMA and DS‐CDMA systems. Specifically, at the transmit side, the pulse shape (in TDMA) and the chip shape (in DS‐CDMA) corresponds to a linear combining of in‐phase harmonics (called a CI signal). At the receiver side, traditional time‐domain processing (equalization in TDMA and RAKE reception in DS‐CDMA) is replaced by innovative frequency based processing. Here, receivers decompose pulse (or chip) shapes into carrier subcomponents and recombine these in a manner achieving both high frequency diversity gain and low MAI. The resulting system outperforms traditional TDMA and DS‐CDMA systems by 10–14 dB at typical BERs, and, by application of pseudo‐orthogonal pulse shapes (chip shapes), is able to double system throughput while maintaining performance gains of up to 8 dB. Copyright © 2002 John Wiley & Sons, Ltd.     

Performance analysis of microcell/macrocell with reuse partitioning in TDMA‐based cellular systems

System capacity and grade of service (GoS) are both important for the rapid growth of cellular communication services. In this paper, we propose a two‐tier TDMA‐based cellular system with macrocell overlaid on microcell clusters by implementing fixed channel assignment (FCA) scheme and fixed reuse partitioning (FRP) scheme in microcell layer and macrocell layer, respectively, named FCA–FRP overlay scheme. Improvement can be achieved in both system capacity and GoS. Theoretical analysis based on the overlay scheme without overflow and with overflow is first presented. It shows that the simulation results are agreed with the analytical results. Then, simulation results, obtained from the overlay scheme with and without overflow, show that the performance in terms of the call blocking probability, the call dropping probability and system capacity of such a system can be greatly improved compared with a conventional one‐tier cellular system deployed with FCA or FRP scheme. Copyright © 2008 John Wiley & Sons, Ltd.     

Cooperative Coding for OFDM Systems

In this paper, we study Orthogonal Frequency Division Multiplexing (OFDM) systems with cooperative coding over frequency selective Rayleigh fading channels. We derive the pairwise error probability (PEP) for the block-fading OFDM channel model. We use the derived PEP to get an upper bound on the frame error probability for the coded cooperative OFDM system. This bound is then utilized in the study of the diversity and coding gains achievable through cooperative coding in OFDM systems for various inter-user channel qualities. We consider the design of cooperative convolutional codes based on the principle of overlays and provide simulation results for different cooperation scenarios. We observe significant gains over conventional non-cooperative OFDM systems. Finally, based on some simple approximations, we provide guidelines for the choice of partners in coded cooperative OFDM systems.