Congestion probabilities in CDMA-based networks supporting batched Poisson traffic

We propose a new multirate teletraffic loss model for the calculation of time and call congestion probabilities in CDMA-based networks that accommodate calls of different serviceclasses whose arrival follows a batched Poisson process. The latter is more "peaked" and "bursty" than the ordinary Poisson process. The acceptance of calls in the system is based on the partial batch blocking discipline. This policy accepts a part of the batch (one or more calls) and discards the rest if the available resources are not enough to accept the whole batch. The proposed model takes into account the multiple access interference, the notion of local (soft) blocking, user’s activity and the interference cancellation. Although the analysis of the model does not lead to a product form solution of the steady state probabilities, we show that the calculation of the call-level performance metrics, time and call congestion probabilities, can be based on approximate but recursive formulas. The accuracy of the proposed formulas are verified through simulation and found to be quite satisfactory

On the variable capacity property of CC/DS-CDMA systems

A complete complementary code based direct sequence code division multiple access (CC/DS-CDMA) system has been proposed recently as a potential candidate for beyond third generation (B3G) wireless communications. This paper addresses the issues that design of efficient code assignment schemes should be based on a flexible physical layer support, which is extremely important for emerging cross-layer designs in future wireless applications. The study in this paper considers a CC/DS-CDMA system with multiple time slots, three traffic classes and two dynamic code-flock assignment schemes, namely random assignment (RA) and compact assignment (CA). Simulation results show that the CC/DS-CDMA system has variable capacity property (VCP), which is sensitively affected by different code-flock assignment schemes. In general, CA can offer lower blocking probability, whereas RA can offer a larger mean system capacity and higher throughput when offered traffic is heavy

QoS constrained cellular ad hoc augmented networks

In this dissertation, based on different design criteria, three novel quality of service (QoS) constrained cellular ad hoc augmented network (CAHAN) architectures are proposed for next generation wireless networks. The CAHAN architectures have a hybrid architecture, in which each MT of CDMA cellular networks has ad hoc communication capability. The CAHAN architectures are an evolutionary approach to conventional cellular networks. The proposed architectures have good system scalability and high system reliability. The first proposed architecture is the QoS constrained minimum-power cellular ad hoc augmented network architecture (QCMP CAHAN). The QCMP CAHAN can find the optimal minimum-power routes under the QoS constraints (bandwidth, packet-delay, or packet-error-rate constraint). The total energy consumed by the MTs is lower in the case of QCMP CAHAN than in the case of pure cellular networks. As the ad hoc communication range of each MT increases, the total transmitted power in QCMP CAHAN decreases. However, due to the increased number of hops involved in information delivery between the source and the destination, the end-to-end delay increases. The maximum end-to-end delay will be limited to a specified tolerable value for different services. An MT in QCMP CAHAN will not relay any messages when its ad hoc communication range is zero, and if this is the case for all MTs, then QCMP CAHAN reduces to the traditional cellular network. A QoS constrained network lifetime extension cellular ad hoc augmented network architecture (QCLE CAHAN) is proposed to achieve the maximum network lifetime under the QoS constraints. The network lifetime is higher in the case of QCLE CAHAN than in the case of pure cellular networks or QCMP CAHAN. In QCLE CAHAN, a novel QoS-constrained network lifetime extension routing algorithm will dynamically select suitable ad-hoc-switch-to-cellular points (ASCPs) according to the MT remaining battery energy such that the selection will balance all the MT battery energy and maximizes the network lifetime. As the number of ASCPs in an ad hoc subnet decreases, the network lifetime will be extended. Maximum network lifetime can be increased until the end-to-end QoS in QCLE CAHAN reaches its maximum tolerable value. Geocasting is the mechanism to multicast messages to the MTs whose locations lie within a given geographic area (target area). Geolocation-aware CAHAN (GA CAHAN) architecture is proposed to improve total transmitted power expended for geocast services in cellular networks. By using GA CAHAN for geocasting, saving in total transmitted energy can be achieved as compared to the case of pure cellular networks. When the size of geocast target area is large, GA CAHAN can save larger transmitted energy

Improving 3G network throughput by new service and joint design.

Li Ning.Thesis (M.Phil.)--Chinese University of Hong Kong, 2004.Includes bibliographical references (leaves 52-55).Abstracts in English and Chinese.Acknowledgments --- p.iiAbstract --- p.iii哲學碩士論文摘要 --- p.ivChapter Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Research Background --- p.2Chapter 1.2 --- Contributions of the Thesis --- p.5Chapter 1.3 --- Organization of the Thesis --- p.6Chapter Chapter 2 --- Properties of OVSF Codes --- p.7Chapter 2.1 --- Tree-Structured Generation of OVSF Codes --- p.7Chapter 2.2 --- OVSF Codes Assignment --- p.10Chapter Chapter 3 --- Support Delayable Traffic in Wireless Networks --- p.14Chapter 3.1 --- System Model --- p.15Chapter 3.2 --- Scheduling Algorithm with Burst Adaptation --- p.17Chapter 3.3 --- Performance Analysis --- p.22Chapter 3.4 --- Simulation Results --- p.24Chapter Chapter 4 --- Allocate OVSF Codes with Joint Design --- p.30Chapter 4.1 --- Combine Number of Active Users and Error-Control Coding Scheme --- p.31Chapter 4.1.1 --- System Model --- p.31Chapter 4.1.2 --- Scheduling Algorithm Description --- p.33Chapter 4.1.3 --- Simulation Results --- p.35Chapter 4.2 --- Combine Power Adaptation and Error-Control Coding Scheme --- p.39Chapter 4.2.1 --- System Model --- p.39Chapter 4.2.2 --- Scheduling Algorithm Description --- p.41Chapter 4.2.3 --- Simulation Results --- p.44Chapter Chapter 5 --- Conclusion --- p.50Bibliography --- p.5

Destination directed packet switch architecture for a 30/20 GHz FDMA/TDM geostationary communication satellite network

Emphasis is on a destination directed packet switching architecture for a 30/20 GHz frequency division multiplex access/time division multiplex (FDMA/TDM) geostationary satellite communication network. Critical subsystems and problem areas are identified and addressed. Efforts have concentrated heavily on the space segment; however, the ground segment was considered concurrently to ensure cost efficiency and realistic operational constraints

Performance analysis of CDMA-based networks with interference cancellation, for batched poisson traffic under the Bandwidth Reservation policy

CDMA-based technologies deserve assiduous analysis and evaluation. We study the performance, at call-level, of a CDMA cell with interference cancellation capabilities, while assuming that the cell accommodates different service-classes of batched Poisson arriving calls. The partial batch blocking discipline is applied for Call Admission Control (CAC). To guarantee certain Quality of Service (QoS) for each service-class, the Bandwidth Reservation (BR) policy is incorporated in the CAC; i.e., a fraction of system resources is reserved for high-speed service-classes. We propose a new multirate loss model for the calculation of time and call congestion probabilities. The notion of local (soft) and hard blocking, users activity, interference cancellation, as well as the BR policy, are incorporated in the model. Although the steady state probabilities of the system do not have a product form solution, time and call congestion probabilities can be efficiently determined via approximate but recursive formulas. Simulation verified the high accuracy of the new formulas. We also show the consistency of the proposed model in respect of its parameters, while comparison of the proposed model with that of Poisson input shows its necessity

Near-Instantaneously Adaptive HSDPA-Style OFDM Versus MC-CDMA Transceivers for WIFI, WIMAX, and Next-Generation Cellular Systems

Burts-by-burst (BbB) adaptive high-speed downlink packet access (HSDPA) style multicarrier systems are reviewed, identifying their most critical design aspects. These systems exhibit numerous attractive features, rendering them eminently eligible for employment in next-generation wireless systems. It is argued that BbB-adaptive or symbol-by-symbol adaptive orthogonal frequency division multiplex (OFDM) modems counteract the near instantaneous channel quality variations and hence attain an increased throughput or robustness in comparison to their fixed-mode counterparts. Although they act quite differently, various diversity techniques, such as Rake receivers and space-time block coding (STBC) are also capable of mitigating the channel quality variations in their effort to reduce the bit error ratio (BER), provided that the individual antenna elements experience independent fading. By contrast, in the presence of correlated fading imposed by shadowing or time-variant multiuser interference, the benefits of space-time coding erode and it is unrealistic to expect that a fixed-mode space-time coded system remains capable of maintaining a near-constant BER

Soft handover issues in radio resource management for 3G WCDMA networks

PhDMobile terminals allow users to access services while on the move. This unique feature has driven the rapid growth in the mobile network industry, changing it from a new technology into a massive industry within less than two decades. Handover is the essential functionality for dealing with the mobility of the mobile users. Compared with the conventional hard handover employed in the GSM mobile networks, the soft handover used in IS-95 and being proposed for 3G has better performance on both link and system level. Previous work on soft handover has led to several algorithms being proposed and extensive research has been conducted on the performance analysis and parameters optimisation of these algorithms. Most of the previous analysis focused on the uplink direction. However, in future mobile networks, the downlink is more likely to be the bottleneck of the system capacity because of the asymmetric nature of new services, such as Internet traffic. In this thesis, an in-depth study of the soft handover effects on the downlink direction of WCDMA networks is carried out, leading to a new method of optimising soft handover for maximising the downlink capacity and a new power control approach

Design and performance of CDMA codes for multiuser communications

Walsh and Gold sequences are fixed power codes and are widely used in multiuser CDMA communications. Their popularity is due to the ease of implementation. Availability of these code sets is limited because of their generating kernels. Emerging radio applications like sensor networks or multiple service types in mobile and peer-to-peer communications networks might benefit from flexibilities in code lengths and possible allocation methodologies provided by large set of code libraries. Walsh codes are linear phase and zero mean with unique number of zero crossings for each sequence within the set. DC sequence is part of the Walsh code set. Although these features are quite beneficial for source coding applications, they are not essential for spread spectrum communications. By relaxing these unnecessary constraints, new sets of orthogonal binary user codes (Walsh-like) for different lengths are obtained with comparable BER performance to standard code sets in all channel conditions. Although fixed power codes are easier to implement, mathematically speaking, varying power codes offer lower inter- and intra-code correlations. With recent advances in RF power amplifier design, it might be possible to implement multiple level orthogonal spread spectrum codes for an efficient direct sequence CDMA system. A number of multiple level integer codes have been generated by brute force search method for different lengths to highlight possible BER performance improvement over binary codes. An analytical design method has been developed for multiple level (variable power) spread spectrum codes using Karhunen-Loeve Transform (KLT) technique. Eigen decomposition technique is used to generate spread spectrum basis functions that are jointly spread in time and frequency domains for a given covariance matrix or power spectral density function. Since this is a closed form solution for orthogonal code set design, many options are possible for different code lengths. Design examples and performance simulations showed that spread spectrum KLT codes outperform or closely match with the standard codes employed in present CDMA systems. Hybrid (Kronecker) codes are generated by taking Kronecker product of two spreading code families in a two-stage orthogonal transmultiplexer structure and are judiciously allocated to users such that their inter-code correlations are minimized. It is shown that, BER performance of hybrid codes with a code selection and allocation algorithm is better than the performance of standard Walsh or Gold code sets for asynchronous CDMA communications. A redundant spreading code technique is proposed utilizing multiple stage orthogonal transmultiplexer structure where each user has its own pre-multiplexer. Each data bit is redundantly spread in the pre-multiplexer stage of a user with odd number of redundancy, and at the receiver, majority logic decision is employed on the detected redundant bits to obtain overall performance improvement. Simulation results showed that redundant spreading method improves BER performance significantly at low SNR channel conditions