On the performance of packet-switched cellular networks for wireless data communications

Cellular frequency reuse is known to be an efficient method to allow many wireless telephone subscribers to share the same frequency band. However, for wireless data and multi-media communications optimum cell layouts differ essentially from typical solutions for telephone systems. We argue that wireless radio systems for bursty message traffic preferably use the entire bandwidth in each cell. Packet queuing delays are derived for a network with multipath fading channels, shadowing, path loss and discontinuously transmitting base stations. Interference between cells can be reduced by appropriately scheduling transmissions or by spatial collision resolution.Portions of this paper have been presented at the IEEE International Conferences on Personal Indoor Mobile Radio Communications (PIMRC) of 1993 in Yokohama and 1994 in The Hague.     

Estimation of performance measures for product form cellular mobile communications networks

Telecommunication Systems - This paper investigates cellular mobile communications networks. The purpose of the paper is twofold. First, it is shown that the restrictive assumption of reversible...     

Design and performance analysis of the algorithms for channelallocation in cellular networks

The authors consider the problem of dynamic channel allocation in cellular networks. Each cell can use any channel, subject to the interference constraints. Channel allocation algorithms are executed by the network switch in a centralized way. The authors show how to design and use objective functions aimed at proper channel allocation and improvement of network performance. As a figure of merit of network performance, they consider the blocking probability in the network as a whole, and the maximum blocking probability in any particular cell of the network (“hot-spot” in the network). They designed three specific channel allocation policies, based on three different objective functions. Compared with two other benchmark policies, the approach shows significant improvement. Performance analysis of various channel allocation policies is virtually impossible without simulations, which are prohibitively time-consuming in the case of small blocking probabilities. The authors propose an original approximate method based on a short simulation and an analytic approximation. The method exhibits good accuracy and significant improvement in efficiency     

Downlink adaptive array algorithms for cellular mobile communications

The capacity of wireless downlink communication to mobile receivers in a dense urban environment is limited primarily by co-channel interference. Downlink adaptive arrays can be used to mitigate this limitation by maximizing the power transmitted to desired in-cell mobiles in the reference cell while minimizing power to co-channel mobiles in neighboring cells. This is accomplished by using uplink measurements to estimate downlink covariance matrices and then solving a generalized eigenvalue problem. Several algorithms are proposed to adaptively estimate the optimal solution and are evaluated using a simplified signal model that allows efficient deterministic performance calculations.     

Soft handoff algorithms for CDMA cellular networks

This paper discusses the design of soft handoff algorithms for cellular communication systems. The handoff process is modeled as a hybrid system and handoff design is cast as an optimization problem based on such a model. Performance is evaluated in terms of call quality, average number of active base stations, average number of active set updates, and average amount of interference. A soft handoff algorithm, which achieves a tradeoff between these performance criteria, is obtained using principles of dynamic programming. One key feature of the algorithm is that it incorporates the effects of mobility and shadow fading in the handoff decision. Different diversity combining schemes are considered including selective combining, equal gain combining (EGC), and various optimized combining (OC) methods in the soft handoff mode. For EGC and OC, Wilkinson's and Schwartz and Yeh's methods are used to compute the statistics for the power sum of the signals. Simulation results indicate that the performance of the handoff algorithm is a function of the different combining schemes and of the different methods used to compute the statistics of the power sum. Moreover, it is observed that interference cancellation is important in order for the algorithm to be viable for cellular systems which experience interference due to using nonorthogonal multiple access.     

Social-aware device-to-device communications underlaying cellular networks

This article put forward a resource allocation scheme aimming at maximizing system throughput for devide-to-device(D2D) communications underlying cellular network. Firstly, user closeness is defined and calculated through social information including friendship, interest similarity and communication strength to represent the willingness of user to share the spectrum resource with others. Then a social-aware resource allocation problem is formulated to maximize the system throughput while guaranteeing the quality of service(QoS) requirements of both the admissible D2D pairs and then the power of both CUs and D2D pairs is efficiently allocated. Finally CUs and D2D pairs are matched to reuse the spectrum resource in consideration of both user closeness and physical conditions. Simulation results certify the effectiveness of the proposed scheme which significantly enhances the system throughput compared with the existing algorithms.     

A call admission control scheme for packet data in CDMA cellular communications

In wireless cellular communication systems, call admission control (CAC) is to ensure satisfactory services for mobile users and maximize the utilization of the limited radio spectrum. In this paper, we propose a new CAC scheme for a code division multiple access (CDMA) wireless cellular network supporting heterogeneous self-similar data traffic. In addition to ensuring transmission accuracy at the bit level, the CAC scheme guarantees service requirements at both the call level and the packet level. The grade of service (GoS) at the call level and the quality of service (QoS) at the packet level are evaluated using the handoff call dropping probability and the packet transmission delay, respectively. The effective bandwidth approach for data traffic is applied to guarantee QoS requirements. Handoff probability and cell overload probability are derived via the traffic aggregation method. The two probabilities are used to determine the handoff call dropping probability, and the GoS requirement can be guaranteed on a per call basis. Numerical analysis and computer simulation results demonstrate that the proposed CAC scheme can meet both QoS and GoS requirements and achieve efficient resource utilization.     

High performance receivers for optical communications

The principles underlying optical detection are reviewed and the practical realisation of devices and receivers for digital optical communications is discussed. Some emphasis is placed on the advanced receiver signal processing techniques-both electronic and optoelectronic-that are now coming forward to provide a performance approaching the fundamental limits imposed by quantum mechanical considerations     

TOA-based robust location algorithms for wireless cellular networks

Caused by Non-Line-Of-Sight (NLOS) propagation effect, the non-symmetric contamination of measured Time Of Arrival (TOA) data leads to high inaccuracies of the conventional TOA based mobile location techniques. Robust position estimation method based on bootstrapping M-estimation and Huber estimator are proposed to mitigate the effects of NLOS propagation on the location error. Simulation results show the improvement over traditional Least-Square (LS) algorithm on location accuracy under different channel environments.     

Design algorithms for multihop packet radio networks with multipledirectional antennas stations

A protocol called the simple tone sense (STS) protocol is designed for multihop packet radio networks (PRNs) with multiple directional antennas stations. The protocol can minimize transmission interference by using a group of tones to identify the active neighbors. A variation of the STS protocol called the variable power tone sense (VPTS) protocol is also designed to further reduce interference. Algorithms for assigning tones and for determining the orientation and broadcasting angles of the directional antennas are designed. Design examples are given. Simulation result shows that the STS protocol gives better throughput-delay performance than the busy-tone multiple access protocol, especially when the traffic is heavy. The VPTS protocol gives still better throughput-delay performance than the STS protocol     

Multiple-access protocols for satellite packet communication networks: A performance comparison

This paper considers satellite packet communication networks with a large population of bursty users and presents an analytic comparison of the throughput versus average message delay trade-off characteristics of multiple-access protocols. The following six multiple-access protocols are examined: 1) slotted ALOHA, 2) reservation-ALOHA, 3) a reservation protocol with a slotted ALOHA reservation channel, 4) a reservation protocol with a TDMA reservation channel, 5) SRUC (Split Reservation Upon Collision), and 6) fixed assigned TDMA. All the protocols are required to ensure that all packets of a message are correctly received in the proper order at the destination. Then, a unified presentation of the delay-throughput performance of the protocols is given by means of an analytical technique called equilibrium point analysis. The throughput versus average message delay tradeoff characteristics are compared taking into account the system stability.     

Two hybrid ARQ algorithms for reliable multicast communications in UMTS networks

Multicast communications in wireless networks have attracted the interest of the scientific community, since many issues remain open. In this framework, our letter proposes two novel hybrid automatic repeat request (HARQ) algorithms for multicast communications in the UMTS radio link control (RLC) layer. The proposed algorithms exploit the channel autocorrelation in order to dynamically estimate the multicast users' channel conditions and thus reduce the mean service data unit (SDU) delay and increase the SDU throughput.     

Photonic packet WDM ring networks architecture and performance

This article reviews various WDM ring architectures and pays special attention to their implementation in the metropolitan environment. A number of possible network architectures as well as protocols are reviewed. The article also proposes and analyses a WDM slotted-ring network architecture with nodes that use one fixed transmitter and fixed receivers. Used as a metropolitan access network, it is shown through simulation how a simple slotted MAC protocol can be implemented in this network to achieve efficient bandwidth utilization. Throughput, delay and packet dropping probability results are presented under Poisson and self-similar traffic.     

A call admission control strategy for multiservice wireless cellular packet networks

A simple connection control system for multiservice cellular wireless networks is presented. Mobile stations are classified depending on the traffic they generate (e.g., voice, data). Within each class, two subclasses are also identified: stations which have originated inside the cell and stations which come from adjacent cells. The connection control mechanism is carried out by considering a number of priorities among the various classes and their subclasses. It works on two levels: static and dynamic. The static level looks at packet-level quality of service (QoS), such as cell loss and delay, while the dynamic level takes care of connection dynamics and allows the load of the system to be driven with respect to the various subclasses. Results that illustrate the performance of this control mechanism are presented.     

Novel MAC protocol for terahertz ultra-high data-rate wireless networks

Due to having a large bandwidth to support Gbps-level data rate, terahertz communication attracts more and more attention in recent years. However, there are few medium access control （MAC） protocols for terahertz ultra-high data-rate wireless networks, which affects the research and application of terahertz communications. To address this problem and to achieve ultra-high data-rate wireless access with terahertz communication, a novel MAC protocol, called medium access control for terahertz communication （MAC-TC）, is proposed. Through designing a new channel access scheme, a new superframe structure, and related key parameters, MAC-TC can support a maximum data rate up to 10 Gbit/s even higher. Theoretical analysis and simulation results show that our proposed MAC protocol realizes the function of medium access control and attains a maximum data rate of 18.3 Gbit/s, which is 2 times higher than 5.78 Gbit/s, the theoretical maximum data rate of IEEE 802.15.3c standard.     

Efficient multi-hop scheduling algorithms for packet transmissions in WDM optical star networks

This paper proposes multi-hop scheduling algorithms for the All-to-All Broadcast (AAB) problem in Wavelength Division Multiplexed (WDM) optical star networks. The multi-hop AAB problem can be split into two subproblems: Logical Topologies Construction (LTC) problem, and Transmission Scheduling (TS) problem. For improving the efficiency of multi-hop scheduling, we focus on a new multi-hop transmission model and transfer the LTC problem to a special case of the Round Robin Tournament (RRT) problem. In the proposed logical topologies, our multi-hop scheduling algorithms can easily overlap the tuning latency and reduce the number of tuning operations on each node. We compare our results with previous research in terms of schedule length. Overall results indicate that our multi-hop scheduling algorithms have better performance than previous algorithms.     

Modelling and performance of packet synchronization in A data communications system

This paper deals with some problems of packet synchronization in a slotted packet-radio communications system. The problems considered are bit-synchronization and unique word detection for bursty systems. The necessary overhead for synchronization purposes is dimensioned for applications in land-mobile satellite communication systems. The performance of synchronization is evaluated using hardware measurement equipment, including a commercial bit-synchronizer. Using these results, the performance loss of communication systems due to packet synchronization effects can be estimated. This is done for the additive white Gaussian noise channel and the class of land-mobile satellite channels.     

Optimum packet size for data communications

If packets of data carry D message bits and H header bits and reliable estimates of message length are not available, then D should be chosen to be about eight times greater than H in order to obtain maximum throughput for a given transmission rate.     

Architectures and performance of optical packet switching nodes for IP networks

As new bandwidth-hungry Internet protocol (IP) services are demanding more and more capacity, transport networks are evolving to provide a reconfigurable optical layer in order to allow fast dynamic allocation of wavelength-division-multiplexing (WDM) channels. To achieve this goal, optical packet-switched systems seem to be strong candidates as they allow a high degree of statistical resource sharing, which leads to an efficient bandwidth utilization. In this paper, we propose an architecture for optical packet-switched transport networks, together with an innovative switching node structure based on the concept of per-packet wavelength routing. The traffic performance of such node when loaded by a typical IP traffic is evaluated through computer simulation; packet loss probability and average delay performance are shown for various load conditions.