Deterministic access protocols for packet radio networks

In this paper, multiple-phase deterministic protocols for packet radio networks are introduced and analysed. Two modes of information transfer are considered, namely (a) broadcasting and (b) point-to-point transmission. We explore systematic ways of designing multiple-phase protocols and apply them on Manhattan networks. The proposed protocols are studied primarily from the point of view of throughput efficiency. Delay analysis is also presented.     

Multiple-packet forwarding protocols for frequency-hop packet radio networks

Reliable data distribution within multiple-hop spread-spectrum packet radio networks requires high performance from the network protocols. The high variability in quality among the links and the unique characteristics of frequency-hop spread-spectrum signaling impose special requirements for network protocols that are to be employed in frequency-hop packet radio networks. These features can be exploited in the forwarding protocols by allowing multiple packets to be included in each forwarding attempt. The use of multiple-packet transmissions exploits the capture property of frequency-hop signaling, and it reduces the overhead required for acknowledgments. A potential trade-off arises because the use of multiple-packet transmissions increases the throughput, but in some situations it can also increase the delay. Two new transmission protocols that employ multiple-packet transmissions are described, and their performance is evaluated.     

无线移动信道中Rake接收机的多径分辨系数

本文研究了码分多址移动通信系统中RAKE接收机的特性在无线移动信道中一种新的衡量方式。目前已有的无线移动信道的衡量方式，只侧重于对无线电波传播过程的研究。如大尺寸环境路径损失，小尺寸环境多径衰落等；已有的RAKE接收机特性的衡量方式。即分辨多径个数和，只强调RAKE接收机能处理的多径对其性能的影响。这两种衡量方式已不能很好地衡量信道的特性对目前新型RAKE接收机的影响。本文提出了一种新的联合衡量无线信道及RAKE接收机特性的方式－多径分辨系数，它能很好地衡量无线移动信道对新型RAKE接收机的影响以及新型RAKE接收机算法的先进性。     

A distributed link scheduling algorithm for CDMA packet radio networks

A distributed algorithm for the conflict-free channel allocation in CDMA (code division multiple access) networks is presented. Dynamic adjustment to topological changes is also considered. Though the schedules produced by our algorithm are not optimal with respect to link schedule length, the algorithm is simple and practical. The link schedule length minimization problem is NP-complete. Here the length of a link schedule is the number of time slots it uses. The algorithm guarantees a bound 2 — 1 time slots on the TDMA cycle length, where is the maximum degree of a station (i.e., maximum number of stations that a station can reach by radio links) in the network. The message complexity of a station isO().     

A general approach to the evaluation and characterization of packet radio networks performance

In this work a general exact methodology for capture effect and performance evaluation of packet radio networks is presented. Both narrow-band and spread-spectrum systems are investigated and compared. Several network performance quality indexes are considered: throughput, outage probability, packet error probability, average delay time. Two particular capture effect models are investigated. It can be seen that one of the two models can be considered as a good approximation of the other if a appropriate parameter definition is made. By using this methodology various operating conditions given by fading (Rice, Rayleigh, Nakagami), shadowing, different traffic models, different modulation, and coding schemes are investigated. Comparison is performed by means of spectral efficiency parity.     

Reactive routing for mobile cognitive radio ad hoc networks

Although more than a decade has passed from the proposal of the Cognitive Radio paradigm, in these years the research has mainly focused on physical and medium access issues, and few recent works focused on the problem of routing in cognitive networks. This paper addresses such a problem by evaluating the feasibility of reactive routing for mobile cognitive radio ad hoc networks. More specifically, we design a reactive routing protocol for the considered scenario able to achieve three goals: (i) to avoid interferences to primary users during both route formation and data forwarding; (ii) to perform a joint path and channel selection at each forwarder; (iii) to take advantage of the availability of multiple channels to improve the overall performance. Two different versions of the same protocol, referred to as Cognitive Ad-hoc On-demand Distance Vector (CAODV), are presented. The first version exploits inter-route spectrum diversity, while the second one exploits intra-route spectrum diversity. An exhaustive performance analysis of both the versions of the proposed protocol in different environments and network conditions has been carried out via numerical simulations. The results state the suitability of the proposed protocol for small mobile cognitive radio ad hoc networks.     

Performance Evaluation of Packet Mobile Communications through Level Crossing Analysis

In this paper the performance of a packet mobile radio network is studied inthe presence of shadow fading outage intervals.Under quite general assumptions for the medium access protocol,the probability mass function of the sequence of packets that may be lostdue to an outage interval is derived. It is seen that long sequences of lostpackets are likely to occur for typical values of the mobile speed andshadowing correlation parameters.For delay constrained sources, e.g., voice, the analysis is mainly focused atderiving the probability function of the sequence of dropped packetsand the probability of dropping. For data sources, the delay statistic isalso derived. In the latter case, the effect of finite buffer length isaddressed. Simulation is used to verify the accuracy of approximations introduced in the analysis.     

无冲突话音/数据综合业务分组预约多址(CF-IPRMA)协议及其性能

本文提出了无冲突话音／数据综合业务的ＰＲＭＡ协议：ＣＦ－ＩＰＲＭＡ协议,并利用马尔可夫链模型法,对ＣＦ－ＩＰＲＭＡ协议中的数据通信性能进行了分析;分析结果表明,该协议在保证话音通信质量的前提下,具有较高的数据业务通过率。     

Analytical evaluation of average bit error rate for the land mobile satellite channel

An analytical solution is presented showing the average bit error probability for the land mobile satellite channel. The channel is modelled as Rice and Rayleigh—lognormal fading. Modulation schemes under consideration include differentially detected PSK and non-coherently detected FSK. Results indicate that the receiver performance is highly dominated by the time share of shadowing. The ratio of the BERs in shadowed and unshadowed areas of typical measured channels and an operating point assumed to be at E_s/N_o = 10 dB is of the order of 10^?2.     

Parallel interference cancellation employing RAKE receiver with selection diversity for multiuser asynchronous DS/CDMA detectors in multipath Rayleigh fading channels

In this paper, we propose and analyse parallel CCI multistage cancellation by combining RAKE and selection diversity. In order to account for channel variations, adaptive implementation of decision thresholds at the RAKE output is suggested. It is shown to provide significant improvement over either hard or soft decision techniques especially in the near‐far situation. Investigation of the system robustness to imperfect channel parameter estimation is also presented. The communication channel is modelled as slowly varying Rayleigh fading discrete multipath channel. Copyright © 2002 John Wiley & Sons, Ltd.     

Slotted ALOHA multiple access and error control coding for land mobile satellite networks

This paper considers a satellite network with data messages being transmitted by land mobile users according to slotted Aloha multiple access. The mobile communication links suffering from multipath fading and signal shadowing are modelled as Gilbert-Elliott channels. FEC block coding is used to correct transmission errors. The maximum achievable information throughput and the mean packet delay are derived from a combined analysis of the multiple access and FEC/ARQ protocol. The results show that the additional overhead necessary for FEC is outweighed by the benefit in throughput and delay. Finally, the capture effect and its consequences are discussed.     

A bandwidth reservation protocol for speech/data integration in TDMA-based advanced mobile systems

The traffic performance of third-generation mobile systems is greatly influenced by the multiple access protocols used in the radio access subsystem. The paper introduces an access protocol, SIR (Service Integration Radio Access), which has the potential for accommodating the requirements of speech and bursty data traffic in an efficient way. SIR is evolved from a protocol (PRMA ++) studied in the framework of a TDMA-based version of the European Universal Mobile Telecommunication System (UMTS) and uses dedicated mechanisms for data bandwidth request collection and servicing.     

认知网络中基于最大和速率的协同通信方案

为了提高认知无线网络主用户通信与次用户通信的和速率,提出了一种新的协同通信方案.该方案中主用户通过机会选择次用户是否协同自身数据传输、允许通信的次用户通过匹配最佳可用信道来最大化认知无线网络的和速率.通过建模将该和速率最大化问题表示为一个组合优化问题,进一步将问题转化为了一个等价的标准指派问题,从而提出了基于匈牙利算法的协同通信方案.仿真结果表明,所提方案显著提高了主次用户的和速率.     

Graph-based criteria for spectrum-aware clustering in cognitive radio networks

Cognitive radios (CRs) can exploit vacancies in licensed frequency bands to self-organize in opportunistic spectrum networks. Such networks, henceforth referred to as cognitive radio networks (CRNs), operate over a dynamic bandwidth in both time and space. This inherently leads to the partition of the network into clusters depending on the spatial variation of the primary radio network (PRN) activity. In this article, we analytically evaluate the performance of a new class of clustering criteria designed for CRNs, which explicitly take into account the spatial variations of spectrum opportunities. We jointly represent the network topology and spectrum availability using bipartite graphs. This representation reduces the problem of spectrum-aware cluster formation to a biclique construction problem. We investigate several criteria for constructing clusters for the CRN environment, and characterize their performance under different spectrum sensing and PR activity models. In particular, we evaluate the expected cluster size and number of common idle channels within each cluster, as a function of the spectrum and topology variability. We verify our analytical results via extensive simulations.     

Performance of packet reservation multiple access for digital mobile radio using variable rate speech coder

The advantages of using adaptive bit rate voice coders to improve the performance of PRMA for digital cellular radio are considered. It is shown that such a technique forces a fairer distribution of packet loss between mobiles and is able to accommodate fluctuations in traffic levels within a cell.<>     

Multilevel trellis-coded modulations for mobile multimedia satellite systems using synchronous CDMA

In this paper the performance of multilevel trellis-coded modulations (MTCMs) for satellite mobile multimedia systems using synchronous CDMA is investigated. A model for the multiple-access interference arising from the non-orthogonality of the spreading waveforms is developed for different modulation and spreading schemes and transmission over the mobile satellite channel. Using this model, the performance of MTCMs for synchronous CDMA is analysed and compared with the Ungerboeck and Schegel–Costello trellis-coded modulation (TCM) designs. The impact on the transmission of synchronization errors between the different users is presented and the power control requirements are derived. © 1998 John Wiley & Sons, Ltd.     

A flexible MAC protocol for the integration of high- and low-quality video streams, voice and data traffic over high-speed packet switched wireless networks

In this work, we propose and evaluate mechanisms for the multiplexing and the integrated delivery of various traffic types such as video, data and voice, over a wireless cellular high-speed packet switched network. Two different scenarios are examined where the video traffic results from videoconference sessions and high-quality media playback, respectively. In both cases we focus on the uplink channel and we thoroughly investigate, by using actual MPEG-4 video streams, the system's performance under a variety of possible loads. Our goal is to achieve high-aggregate channel throughput while preserving the quality of service requirements of each traffic type.     

A distributed media access protocol for packet radio networks and performance analysis. Part 2: Network set-up time and data rate

In this, the second part of a two-part paper, the required time for establishing a mobile packet radio network using the virtual circuit and time division multiple access protocol developed in Part 1 is analysed. Tools are developed to determine the virtual circuit and network set-up times in terms of the channel bandwidth allocated to establish and maintain the network. The tools are then extended to include the effects of user mobility. Then these results are combined with the network capacity results of Part 1 to analyse the trade-off between the data rate and set-up time of the network. Next a hierarchical architecture is proposed and the network data rate versus set-up time trade-off of this architecture is analysed using these tools. This architecture is shown to both provide a higher data rate and establish faster than flat networks of the same number of nodes.     

Analysis of a contention resolution multiple-access algorithm for handling mixed traffic on wireless networks

Existing wireless standards, like DECT and GSM, are based on TDMA. Packet multiple-access algorithms perform statistical multiplexing, leading to greater efficiency than basic TDMA which assigns a fixed amount of channel resources to each user. Moreover, these methods permit one to handle in a more flexible way different kinds of information. Most of the proposed packet access methods, applied to radio networks, are based on slotted ALOHA algorithms. We propose a methodology for applying packet contention resolution multiple-access techniques to wireless networks. The proposed techniques are able to handle the access of mixed traffic types. We define and analyze a multiple-access algorithm for handling the access of a mixed set of users, including a group of speech users and a population of users that generate a random traffic approximated by a stream of Poisson.