Capture probability in a mobile packet radio system

The probability of q_i of successful packet reception when i users transmit simultaneously in a mobile packet radio system is shown to decrease monotonically with i for a number of commonly used capture and spatial distribution models, with no fading. Examples of both noiseless and noisy systems in which q_i is not monotonically decreasing with i are also given     

Channel allocation mechanisms for improving QoS in packet mobile radio networks

New quality-based channel allocation mechanisms are evaluated. The mechanisms assign incoming calls the available channel that previously experienced the best link quality. For that purpose, three metrics have been considered: BER, BLER and CIR. The proposed techniques improve the QoS compared to the traditional random allocation mechanism while also offering its benefits in terms of uniform long-term channel use.     

Cross-layer radio resource allocation in packet CDMA wireless mobile networks

An efficient radio resource allocation scheme is crucial for guaranteeing the quality of service (QoS) requirements and fully utilizing the scarce radio resources in wireless mobile networks. Most of previous studies of radio resource allocation in traditional wireless networks concentrates on network layer connection blocking probability QoS. In this paper, we show that physical layer techniques and QoS have significant impacts on network layer QoS. We use a concept of cross-layer effective bandwidth to measure the unified radio resource usage taking into account both physical layer linear minimum-mean square error (LMMSE) receivers and varying statistical characteristics of the packet traffic in code devision multiple access (CDMA) networks. We demonstrate the similarity between traditional circuit-switched networks and packet CDMA networks, which enables rich theories developed in traditional wireless mobile networks to be used in packet CDMA networks. Moreover, since both physical layer signal-to-interference ratio (SIR) QoS and network layer connection blocking probability QoS are considered simultaneously, we can explore the tradeoff between physical layer QoS and network layer QoS in packet CDMA networks. This work is supported by Natural Science and Engineering Research Council of Canada. Please address all correspondence to Professor Vikram Krishnamurthy at the above address. Fei Yu received the Ph.D. degree in electrical engineering from the University of British Columbia in 2003. From 2002 to 2004, he was with Ericsson (in Lund, Sweden), where he worked on the research and development of dual mode UMTS/GPRS handsets. From 2005, he has been working in Silicon Valley at a start-up, where he conducts research and development in the areas of advanced wireless communication technologies and new standards. After completing the PhD, he has been a research associate in the Department of Electrical and Computer Engineering at the University of British Columbia. His research interests include cross-layer optimization, QoS provisioning and security in wireless networks. Vikram Krishnamurthy (S’90-M’91-SM’99-F’05) was born in 1966. He received his bachelor’s degree from the University of Auckland, New Zealand in 1988, and Ph.D. from the Australian National University, Canberra, in 1992. Since 2002, he has been a professor and Canada Research Chair at the Department of Electrical Engineering, University of British Columbia, Vancouver, Canada. Prior to this he was a chaired professor at the Department of Electrical and Electronic Engineering, University of Melbourne, Australia. His research interests span several areas including ion channels and nanobiology, stochastic scheduling and control, statistical signal processing and wireless telecommunications. Dr. Krishnamurthy has served as associate editor for IEEE Transactions on Signal Processing, IEEE Transactions Aerospace and Electronic Systems, IEEE Transactions Nanobioscience, IEEE Transactions Circuits and Systems II, Systems and Control Letters and European Journal of Applied Signal Processing. He was guest editor of a special issue of IEEE Transactions on NanoBioScience, March 2005 on bio-nanotubes.     

Improved ICMA/CD protocol in packet mobile radio networks

An improved idle-signal casting protocol that exploits a collision reduction scheme and a concept of the virtual time protocol simultaneously is proposed and its performance is analysed. Compared to the existing nonpersistent, 1-persistent and virtual time schemes, the proposed protocol exhibits higher throughput and lower packet failure probability.<>     

Effect of bit-to-bit dependence on packet error rate using asynchronous DS-CDMA for mobile packet radio networks

The probability of packet success for asynchronous direct sequence code division multiple access (DS-CDMA) over the multipath fading channel is investigated under different fading conditions and for different cases. We studied the bit-to-bit dependence caused by the multipath fading and by the multiple access interference (MAI) originating from the chip and phase offsets between the desired and interfering signals. We investigated the effect of using the Gaussian versus the improved Gaussian process on the computation of probability of packet success as well as the effect of the bit-to-bit dependence within a packet. The improved Gaussian approximation provides more accurate values for the probability of bit error for any number of simultaneous users, while it also allows us to incorporate the effects of bit-to-bit dependence into the calculations of the probability of packet success.This paper was presented in part at the 17th Biennial Symposium on Communiations, Kingston, June 1994. This work was supported by a strategic grant (STR-0100720) from the Natural Sciences and Engineering Research Council (NSERC) of Canada.     

Topology control for multihop packet radio networks

A distributed topology-control algorithm has been developed for each node in a packet radio network (PRN) to control its transmitting power and logical neighbors for a reliable high-throughput topology. The algorithm first constructs a planar triangulation from locations of all nodes as a starting topology. Then, the minimum angles of all triangles in the planar triangulation are maximized by means of edge switching to improve connectivity and throughput. The resulting triangulation at this stage, the Delaunay triangulation, can be determined locally at each node. The topology is modified by negotiating among neighbors to satisfy a design requirement on the nodal degree parameter. Simulations show that the final topology is degree-bounded, has a rather regular and uniform structure, and has throughput and reliability that are greater than that of a number of alternative topologies     

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.     

Frequency-hop transmission for satellite packet switching and terrestrial packet radio networks

The performance of frequency-hop transmission in a packet communication network is analyzed. Satellite multiple-access broadcast channels for packet switching and terrestrial packet radio networks are the primary examples of the type of network considered. An analysis of the effects of multiple-access interference in frequency-hop radio networks is presented. New measures of "local" performance are defined and evaluated for networks of this type, and new concepts that are important in the design of these networks are introduced. In particular, error probabilities and local throughput are evaluated for a frequency-hop radio network which incorporates the standard slotted and unslotted ALOHA channel-access protocols, asynchronous frequency hopping, and Reed-Solomon error-control coding. The performance of frequency-hop multiple access with error-control coding is compared with the performance of conventional ALOHA random access using narrow-band radios.     

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.     

A new model for scheduling packet radio networks

Packet radio networks are modeled as arbitrary graphs by most researchers. In this paper we show that an arbitrary graph is an inaccurate model of the radio networks. This is true because there exists a large class of graphs which will not model the radio networks. Radio networks can be modeled accurately by a restricted class of graphs called the planar point graphs. Since the radio networks can accurately be modeled only by a restricted class of graphs, the NP-completeness results for scheduling using an arbitrary graph as the model, do not correctly reflect the complexity of the problem. In this paper we study the broadcast scheduling problem using the restricted class as the model. We show that the problem remains NP-complete even in this restricted domain. We give an O(n log n) algorithm when all the transceivers are located on a line. This revised version was published online in July 2006 with corrections to the Cover Date.     

Hermitian codes for frequency-hop spread-spectrum packet radio networks

Hermitian codes are an attractive alternative to Reed-Solomon codes for use in frequency-hop spread-spectrum packet radio networks. For a given alphabet size, a Hermitian code has a much longer block length than a Reed-Solomon code. This and other considerations suggest that Hermitian codes may be superior for certain applications. Analytical results are developed for the evaluation of the packet error probability for frequency-hop transmissions using Hermitian coding. We find there are several situations for which Hermitian codes provide much lower packet error probabilities than can be obtained with Reed-Solomon codes. In general, as the code rate decreases or the symbol alphabet size increases, the relative performance of Hermitian codes improves with respect to Reed-Solomon codes. Performance evaluations are presented for an additive white Gaussian noise channel and for certain partial-band interference channels, and the packet error probability is evaluated for both errors-only and errors-and-erasures decoding.     

Distributed code assignments for CDMA packet radio networks

Code-division multi-access (CDMA) techniques allow many users to transmit simultaneously in the same band without substantial interference by using approximately orthogonal (low cross-correlation) spread-spectrum waveforms. Two-phase algorithms have been devised to assign and reassign spread-spectrum codes to transmitters, to receivers and to pairs of stations in a large dynamic packet radio network in polynomial times. The purpose of the code assignments is to spatially reuse spreading codes to reduce the possibility of packet collisions and to react dynamically to topological changes. These two-phase algorithms minimize the time complexity in the first phase and minimize the number of control packets needed to be exchanged in the second phase. Therefore, they can start the network operation in a short time, then switch to the second phase with the goal of adapting to topological changes. A pairwise code-assignment scheme is proposed to assign codes to edges. Simulations based on well-controlled topologies (sparse topologies) show that the scheme requires much fewer codes than transmitter-based code assignment, while maintaining similar throughput performance     

Mobile packet radio networks: State-of-the-art

MUCH WORK HAS been done in the areas of packet switching, packet radio, and random communication channels. However, efforts combining these areas are not as plentiful. There are several reasons for this. One reason is, the packet communications area is relatively young. Much of the research into packet communications has been accomplished by computer scientists rather then communications engineers, with a resulting emphasis on architecture, protocols, software, and so on. Even the development of packet radio has not fostered extensive examination of link effects on system performances. The UHF line-of-sight links and SHF satellite links have been assumed to be perfect with packet collisions as the dominant error source, which is a good assumption under normal circumstances. However, abnormal circumstances including ionospheric scintillations and multipath fading are another source of error on degraded packet radio links, which characterize Mobile Packet Radio Networks (MPRNET). In this paper we define and discuss Mobile Packet Radio Networks and presend their channel characteristics. The performance avaluation of some channel access protocols for a Mobile Packet Radio Network link, which is a typical example of a degraded packet radio channel, is descirbed.     

Reduced-rate retransmissions for spread-spectrum packet radio multimedia networks

A reduced-rate retransmission (RRR) scheme is proposed for improving the throughput performance of spread-spectrum packet radio networks. The scheme takes advantages of the available multi-rate scalable source coding techniques. It assumes that several versions of a data packet with different sizes (number of information bits) are available. The transmission of a packet starts from its full-size version. If the full-size version is not correctly received, its half-size version is used in the retransmission. If further retransmissions are needed, the quarter-size version and so on are used. The shrunk packets are transmitted either in a minislot if the processing gain is kept the same, or occupying a slot duration by increasing the processing gain proportionally. In both cases, the effective signal to interference ratio for a packet is increased. As a result, the system throughput is improved. Theoretical and numerical results are provided in this paper which illustrate the throughput improvement. Another advantage of the proposed RRR scheme is that the packet-size reduction provides finer granules for link adaptation. Therefore, it is especially suitable for multimedia applications for which codes of variable rate for the source data are available and which can tolerate gracefully degraded quality of service. The performance of the proposed scheme in fading channels is also addressed.     

Capture and retransmission control in mobile radio

We consider the slotted ALOHA protocol with capture, in a mobile communication environment, in the presence of Rayleigh fading and log-normal shadowing. The capture probabilities and their asymptotic value, as the number of colliding packets tends to infinity, are computed. A sufficient condition, under which this limit is positive, is identified and expressed in terms of the spatial distribution of the users. Also, various models for this latter distribution are discussed. These results help identify the region in which the system may achieve a positive stable throughput. Finally, a retransmission control scheme, that enhances the throughput, is considered, and the stability of the system is rigorously proven. We also show that the use of retransmission control is unavoidable if the network performance predicted in some recent literature is to be achieved     

Computer simulation of a mobile packet radio system

A software simulator for a mobile packet radio system is described. Bitwise coherent addition of interfering DPSK-packets can be expected, resulting in a smaller throughput than achieved with incoherent addition, but higher than in a nonfading channel     

On improving throughput in packet mobile radio network

A novel random multiaccess protocol is proposed for a packet mobile-radio network employing an idle-signal casting multiple-access (ICMA) with/without collision detection scheme. The protocol takes advantage of the channel control scheme to reduce collisions. The authors show significant improvements in terms of maximum achievable throughput.<>     

Spatial reuse in multihop packet radio networks

Multihop packet radio networks present many challenging problems to the network analyst and designer. The communication channel, which must be shared by all of the network users, is the critical system resource. In order to make efficient use of this shared resource, a variety of channel access protocols to promote organized sharing have been investigated. Sharing can occur in three domains: frequency, time, and space. This paper is mostly concerned with sharing and channel reuse in the spatial domain. A survey of results on approaches to topological design and associated channel access protocols that attempt to optimize system performance by spatial reuse of the communication channel is presented.     

TDM policies in multistation packet radio networks

A multistation packet radio network with m stations and a finite number of nodes n that uses a conflict-free protocol to access the backbone network of stations through a shared channel is discussed. The goal is to derive an allocation of the channel time slots (time-division multiplexing cycle), so that all transmissions will be conflict-free and some measure of performance (e.g., the expected total weighted throughput, the expected weighted holding cost) will be optimized. The methodology that is used is to bound the performance and to allocate the slots according to the golden ratio policy