Search

In this paper, a novel scheme is proposed to optimize the effectiveness of the device-to-device (D2D) enabled vehicular communications (D2D-V), which are underlaid in cellular networks, where the uplink channel allocated to one cellular user (CU) is reused by the multiple D2D-V links. To develop a well-functioning D2D-V system, the sum rate of all D2D-V links is necessary to be maximized, and also the reliability of the co-channel CU to infrastructure has to be guaranteed with the CU interference constraint. Unlike the traditional statical D2D systems, the D2D-V system suffers with high mobility and channel uncertainty. Therefore, the CU interference constraint is formulated as a probabilistic function by the Bernstein approximation, the constraint attempts to address the mobile channel fluctuations. Besides, the tractable approximate constraint is reformulated as two separable structure, this reformulated constraint attempts to determine the near-optimal solutions more efficiently. Since the objective function with a logarithmic form is nonconvex, successive convex approximation is applied to transform the nonconvex problem into the convex problem. The dual decomposition is used to determine the near-optimal solutions. After the problem is reformulated, a distributed robust power control algorithm is proposed to perform the chance-constrained optimization. Numerical simulations are used to evaluate the performance of the proposed scheme. The simulation results show the impacts of system performance when applying the proposed scheme in vehicular environments with high mobility. The proposed optimization schemes are further verified by comparing with the existing methods. [ABSTRACT FROM AUTHOR]

This paper considers the problem of network-based mobile-phone positioning when multiple providers are available. This paper proposes two cross-provider localization algorithms via a cooperative approach, which are called linear regression (LR) and locally cooperative embedding (LCE), to efficiently exploit the complementary information from each network provider. The former chooses the provider weights that minimize the mean-square positioning errors. The latter dynamically embeds the cooperation and iteratively refines the positioning process according to each provider's local accuracy surrounding the user. This paper applies the proposed cross-provider positioning algorithms to actual Global System for Mobile Communications (GSM) networks, using a dual-subscriber-identity-module (SIM) mobile phone connecting to multiple providers simultaneously. On-site experiments clearly demonstrated that the proposed cross-provider approaches provide better positioning accuracy than any individual provider, where LCE achieves the best performance. [ABSTRACT FROM PUBLISHER]

This paper investigates the features of a cellular geometry in code-division multiple-access (CDMA) systems with soft handoff and distinguishes controlling area of a cell from coverage area of a cell. Some important characteristics of the cellular configuration in soft handoff systems are used to propose a new design of efficient call admission control (CAC) in CDMA systems. Then, the paper constructs a continuous-time Markov chain (CTMC) model for CAC in CDMA with a soft handoff queue, obtains closed-form solutions, and thus develops loss formulas as performance indices such as the new blocking probability and the handoff dropping probability. In order to determine handoff traffic arrival rate, a fixed-point strategy is developed. Algorithms are also provided to stably compute loss probabilities and to determine the optimal number of guard channels. A new soft handoff scheme—eliminating pseudo handoff calls (EPHC)—is proposed to improve channel utilization efficiency based on mobility information. As an application of the loss formulas, the proposed modeling techniques are used to evaluate and compare the performance of conventional and proposed EPHC soft handoff schemes. Numerical results show the effectiveness of the proposed Markov chain models and the benefits of the new soft handoff scheme. [ABSTRACT FROM AUTHOR]

The introduction of fourth-generation wireless technologies has fueled the rapid development of cellular networks, significantly increasing the energy consumption and the expenditures of mobile network operators (MNOs). In addition, network underutilization during low-traffic periods (e.g., night zone) has motivated a new business model, namely, infrastructure sharing, which allows the MNOs to have their traffic served by other MNOs in the same geographic area, thus enabling them to switch off part of their network. In this paper, we propose a novel infrastructure-sharing algorithm for multioperator environments, which enables the deactivation of underutilized base stations during low-traffic periods. Motivated by the conflicting interests of the MNOs and the necessity for effective solutions, we introduce a game-theoretic framework that enables the MNOs to individually estimate the switching-off probabilities that reduce their expected financial cost. Our approach reaches dominant strategy equilibrium, which is the strategy that minimizes the cost of each player. Finally, we provide extensive analytical and experimental results to estimate the potential energy and cost savings that can be achieved in multioperator environments, incentivizing the MNOs to apply the proposed scheme. [ABSTRACT FROM AUTHOR]

Abstract-This paper proposes a dynamic resource-allocation (DRA) algorithm for packet data services in wireless communication systems based on Hopfield neural networks (HNNs). The resource-allocation algorithm assumes a delay-centric approach in that it maximizes resource utilization of the overall system while minimizing the packet delay. The real-time (RT) working capability of HNN hardware implementation means that a very powerful scheduling DRA algorithm can be obtained. A generic formulation of the algorithm is presented to establish the optimal bit rate allocation. In addition, some illustrative examples of this formulation are given, considering specific wireless communication systems, such as General Packet Radio Service (GPRS) or Universal Mobile Telecommunications System (UMTS). lo be more precise, the performance of the proposed DRA algorithm is evaluated in a realistic UMTS scenario, considering both RT and nonreal-time (NRT) services. To obtain the best resource distribution and fulfill the different quality-of-service (QoS) levels required by RT and NRT services, the new HNN-based delay-centric DRA algorithm is performed twice. Initially, only the RT services are considered, and following this, all the NRT services are taken into account. The results reveal that the proposed DRA algorithm outperforms other reference algorithms in terms of not only average packet delay but the allocated total bit rate as well. [ABSTRACT FROM AUTHOR]

This paper presents efficient dynamic resource allocation schemes with interference mitigation techniques for multimedia services in downlink orthogonal frequency-division multiplexing mobile cellular systems. Performance of the proposed algorithms is evaluated in terms of user quality-of-service and system spectral efficiency. It is shown that the best subcarrier allocation scheme with interference mitigation and macrodiversity techniques gives significant performance gains in terms of system spectral efficiency. Furthermore, sharing the system bandwidth among real-time stream-type voice and bursty data services can support much larger system loads than having a hard division. [ABSTRACT FROM AUTHOR]

This paper investigates the effect of two control parameters of the Universal Mobile Telecommunications System (UMTS) handoff algorithm on the total peak base station (BS) transmit power required per mobile station (MS) to satisfy a prescribed outage probability. Denoting the set of BSs supporting an MS in soft handoff (SH) as the active group, the first parameter n is the maximum allowed size of the active group. The second, denoted r, is the upper limit on the difference between the path loss of the dominant BS and that of any other member of the active group, where the term "dominant" refers to the BS with the lowest path loss to the MS. It was assumed that the MS is equipped with a Rake receiver capable of performing "maximal ratio combining" of the signals it receives from the transmitting BSs. General analytical derivations along with results derived for specific situations through numerical integration are presented. [ABSTRACT FROM AUTHOR]

In power control, the convergence rate is one of the most important criteria that can determine the practical applicability of a given algorithm. The Convergence rate of power control is especially important when propagation and traffic conditions are changing rapidly. To track these changes, the power control algorithm must converge quickly. The purpose of this paper is to generalize the existing power control framework such that we can utilize partially known link gain information in improving the convergence speed. For the purpose, block power control (BPC) is suggested with its convergence properties. BPC is centralized within each block in the sense that it exchanges link gain information within the same block. However, it is distributed in a block-wise manner, and no information is exchanged between different blocks. Depending on availability of link gain information, a block can be any set of users, and can even consist of a single user. Computational experiments are carried out on a direct-sequence code-division multiple-access system, illustrating how BPC utilizes available link gain information in increasing the convergence speed of the power control. [ABSTRACT FROM AUTHOR]

Call admission control (CAC) strongly influences the performance of 3G/4G spread spectrum systems because it determines the number of active users that are admitted to the network, i.e., influences spectral efficiency. A novel air interface CAC algorithm is introduced in this paper. It optimizes the utilization of radio resources and provides real-time adaptation to the radio channel with generalized multiplicative fading. Users are handled as memory-less traffic sources. The suggested CAC method was evaluated for lognormal fading and ON/OFF traffic. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach for designing a call-admission control (CAC) algorithm for code-division multiple-access CDMA) networks with arbitrary call-arrival rates. The. design of the CAC algorithm uses global information; it incorporates e call-arrival rates and the user mobilities across the network and guarantees the users' quality of service (QoS) as well as prespecific blocking probabilities. On the other hand, its implementation in each cell uses local information; it only requires the number f calls currently active in that cell. We present several cases for a nontrivial network topology where our CAC algorithm guarantees QoS and blocking probabilities while achieving significantly higher throughput than that achieved by traditional techniques. We so calculate the network capacity, i.e., the maximum throughput f r the entire network, for prespecified blocking probabilities and QoS requirements. [ABSTRACT FROM AUTHOR]

Presents a study which introduced an algorithm for estimating mobile speed for handoff in hierarchical cellular systems. Use of hierarchical cellular systems to mobile and personal communications; Results; Conclusion and discussions.

Presents a study concerned with partial compensation sign-level-based power control algorithms and their impact on battery duration of mobile terminals. Use of power control to cellular networks; Results; Conclusion.

Presents a frequency offset estimation algorithm that uses an indicator of the channel status called the uncertainty factor in mobile radio. Description on the system and channel used; Analysis on the computer simulation and its results; Conclusions.