蜂窝网络中用户流量的地域分布预测分析与研究

Early detection and rapid resolution network congestion can considerably improve network capacity. Consequently, much research has been carried out on predicting traff ic patterns in 3G networks. This paper introduces an access point centric approach that is implemented by two prediction models, the traffic abstraction model and the order-k Markov model. Traffi c predictions are carried out to support the congestion control in the semi-smart antenna systems. The simulation result shows that the cumulative error rate is below 25% even carrying out multi-step-ahead predictions.     

On Bandwidth Allocation for Data Dissemination in Cellular Mobile Networks

Wireless bandwidth is a scarce resource in a cellular mobile network. As such, it is important to effectively allocate bandwidth to each cell such that the overall system performance is optimized. Channel allocation strategies have been extensively studied for voice communications in cellular networks. However, for data dissemination applications, studies on bandwidth allocation have thus far been limited to a single-cell environment. This paper investigates the problem of bandwidth allocation for data dissemination in a multi-cell environment, which, to the best of our knowledge, has not been investigated before. The performance objective is to minimize the overall expected access latency given the workload for each cell in a data dissemination system. Two heuristic techniques, called compact allocation and cluster-step allocation, are proposed to effectively allocate bandwidth for a cellular network. Simulation experiments are conducted to evaluate the performance of the proposed bandwidth allocation schemes. Experimental results show that the proposed schemes substantially outperform the uniform allocation and proportional allocation schemes.     

Healthcare Data Encryption Technique Using Hybrid Cellular Automata in IoT Networks

Wireless Personal Communications - In this article, we secure the healthcare data using low complexity hybrid cellular automata (CA) algorithm while enabling remote monitoring of patients using IoT...     

Distributed Uplink Power Control for Optimal SIR Assignment in Cellular Data Networks

This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini–Miljanic distributed power control can attain a given fixed and feasible SIR target. In data networks, however, SIR needs to be jointly optimized with transmit powers in wireless data networks. In the vast research literature since the mid-1990s, solutions to this joint optimization problem are either distributed but suboptimal, or optimal but centralized. For convex formulations of this problem, we report a distributed and optimal algorithm.      

Improving Voice and Data Services in Cellular/WLAN Integrated Networks by Admission Control

In this paper, we study voice and data service provisioning in an integrated system of cellular and wireless local area networks (WLANs). With the ubiquitous coverage of the cellular network and the disjoint deployment of WLANs in hot-spot areas, the integrated system has a two-tier overlaying structure. As an essential resource allocation aspect, admission control can be used to properly admit voice and data calls to the overlaying cells and WLANs. A simple admission scheme is proposed in this study to analyze the dependence of resource utilization and the impact of user mobility and traffic characteristics on admission parameters. Both admission control and rate control are considered to limit the input traffic to the WLAN, so that the WLAN operates in its most efficient states and effectively complements the cellular network. The call blocking/dropping probabilities and data call throughput are evaluated for effective and accurate derivation of the admission parameters. It is observed that the utilization varies with the configuration of admission parameters, which properly distributes the voice and data traffic load to the cells and WLANs. Mobility and traffic variability have a significant impact on the selection of the admission parameters.     

Interference Evaluation in Cellular Networks

Interference in cellular networks is one of the most common problems in the radio access network. In fact, it is the major issue in cellular networks that affects performances and quality of service. Indeed, interference can be caused by a call on the same frequency from neighboring cell, or a call on an adjacent channel in the same or in neighboring cell. So, we can classify interference on intra-cell interference and inter-cell interference. In 4G, thanks to the use of orthogonal frequency division multiple access and single carrier frequency division multiple access as access techniques in downlink and uplink respectively, intra-cell interference is reduced compared to the inter cell one which caused by the frequency reuse one mechanism and the femto cells deployment. In this work, we will evaluate the interference in different cellular network standards from 2G to 4G.     

Interference Coordination in Cellular OFDMA Networks

Orthogonal frequency division multiple access is the basis for several emerging mobile communication systems. Prominent examples are the 3GPP Long Term Evolution as the successor of UMTS high-speed packet access and the IEEE 802.16 system, advanced by the WiMAX forum. On a system level, OFDMA is basically a combination of time and frequency division multiple access. In cellular TDM/FDM systems, inter-cell interference is a major issue that traditionally has been solved by avoiding the use of the same frequency bands in adjacent cells. However, this solution incurs a waste of precious frequency resources. An attractive alternative is the use of beamforming antennas in combination with interference coordination mechanisms, where the transmission of adjacent base stations is coordinated to minimize inter-cell interference. Interference coordination is an important aspect of the system level, which influences many other issues, such as network planning or scheduling mechanisms. In this article, we give an overview of interference coordination as it would apply, for example, to IEEE 802.16e and review the relevant literature. We also discuss and compare interference coordination algorithms, which can be based either on global system knowledge or purely on local system knowledge.     

Combining Bandwidth Borrowing and Reservation in Cellular Networks

In the third generation cellular networks and beyond, a wide variety of different services are/will be provided by the operators. Out of QoS reasons, it is preferable to assign higher priority to certain connection types. These include calls carrying delay-sensitive services and already ongoing calls. In this paper, a prioritization method combining bandwidth borrowing and reservation, called BBR, will be presented. BBR monitors the rate-adaptiveness of the ongoing calls in a cell. Simultaneously, advanced movement predictions are applied to estimate the arrival rate to each cell. If it is determined that the use of bandwidth borrowing (temporarily reducing the data rate of other connections in the same cell) is not sufficient to support the high priority calls that are expected to arrive, a portion of the assigned bandwidth to the cell is exclusively reserved for these calls to prevent call dropping. The scheme enables the operator to increase the average user satisfaction in the network. This is achieved by defining appropriate penalty functions for the events of blocking, dropping and bandwidth reduction of a call.     

基于点对点WiFi通信实现移动数据流量卸载的架构：预定-发送

Currently cellular networks do not have sufficient capacity to accommodate the exp-onential growth of mobile data requirements. Data can be delivered between mobile terminals through peer-to-peer WiFi com-munications (e.g. WiFi direct), but contacts between mobile terminals are frequently disrupted because of the user mobility. In this paper, we propose a Subscribe-and-Send architecture and an opportunistic forwarding protocol for it called HPRO. Under Sub-scribe-and-Send, a user subscribes contents on the Content Service Provider (CSP) but does not download the subscribed contents. Some users who have these contents deliver them to the subscribers through WiFi opportunistic peer-to-peer communications. Numerical simulations provide a robust evaluation of the forwarding performance and the traffic of-floading performance of Subscribe-and-Send and HPRO.     

应用于第三代移动通信系统中的中继技术

分析了一种可应用于TD-SCDMA蜂窝移动通信系统的中继技术.该技术将Ad hoc和蜂窝系统相结合.在蜂窝移动通信系统中,移动台和基站之间的信号可以通过其他移动台转发.这种中继技术可以减少小区内移动台的发射功率,从而增加系统容量.作者在通用仿真平台OPNET上建立时分双工CDMA系统物理信道模型,并在系统中应用中继技术,通过仿真分析比较了系统的性能.     

Robust Packet Scheduling in Wireless Cellular Networks

This paper addresses the following robust scheduling problem: Given that only coarse-grained channel state information (i.e., bounds on channel errors, but not the fine-grained error pattern) is available, how to design a robust scheduler that ensures worst-case optimal performance? To solve this problem, we consider two coarse-grained channel error models and take a zero-sum game theoretic approach, in which the scheduler and the channel error act as non-cooperative adversaries in the scheduling process. Our results show that in the heavy channel error case, the optimal scheduler adopts a threshold form. It does not schedule a flow if the price (the flow is willing to pay) is too small, in order to maximize the system revenue. Among the scheduled flows, the scheduler schedules a flow with a probability inversely proportional to the flow price such that the risk of being caught by the channel error adversary is minimized. We also show that in the mild channel error model, the robust scheduling policy exhibits a balanced trade-off between a greedy decision and a conservative policy. The scheduler is likely to take a greedy decision if it evaluates the risk of encountering the channel error adversary now to be small. Therefore, robust scheduling does not always imply conservative decision. The scheduler is willing to take “risks” to expect higher gain in some scenarios. Our solution also shows that probabilistic scheduling may lead to higher worst-case performance compared to traditional deterministic policies. Finally, the current efforts show the feasibility to explore a probabilistic approach to cope with dynamic channel error conditions.     

Efficient Location Prediction in Mobile Cellular Networks

Mobile context-aware applications are capable of predicting the context of the user in order to operate pro-actively and provide advanced services. We propose an efficient spatial context classifier and a short-term predictor for the future location of a mobile user in cellular networks. We introduce different variants of the considered location predictor dealing with location (cell) identifiers and directions. Symbolic location classification is treated as a supervised learning problem. We evaluate the prediction efficiency and accuracy of the proposed predictors through synthetic and real-world traces and compare our solution with existing algorithms for location prediction. Our findings are very promising for the location prediction problem and the adoption of proactive context-aware applications and services.     

Optimal Sequential Paging in Cellular Wireless Networks

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense of greater delay in locating the users. We present a polynomial time algorithm for minimizing paging cost under the average delay constraint, a problem that has previously been considered intractable. We show the conditions under which cluster paging, a simple heuristic technique proposed for use with dynamic location update schemes, is optimal. We also present analytical results on the average delay and paging cost obtained with sequential paging, including tight bounds.     

蜂窝移动通信系统核心网络的演进与全IP核心网络

分析了现有移动通信网络存在的问题，阐述了第2代移动通信核心网向第3代移动通信核心网演进的必然性：讨论了第2代移动通信核心网向第3代移动通信核心网演进所采用的演进策略，介绍了两种可供选择的全IP核心网络的参考结构。     

Bounds and Performance Networks of Reuse Partitioning in Cellular

In this paper we study a scheme that allows asmooth increase of the capacity of a cellular system forcircuit switching by applying cell partitioning andusing dynamic channel allocation techniques. A bound is computed for this reuse partitioningscheme that gives the maximum theoretical gainaccomplished in the system bandwidth. The performance ofthe proposed scheme in terms of blocking probability is evaluated both when the position of themobiles remains unchanged and when mobility is takeninto account. The numerical results show that thecapacity of the proposed scheme is sensibly higher than that of a fixed allocation scheme.     

Optimal and Approximate Mobility-Assisted Opportunistic Scheduling in Cellular Networks

This paper considers the problem of scheduling multiple users in the downlink of a time-slotted cellular data network. For such a network, opportunistic scheduling algorithms improve system performance by exploiting time variations of the radio channel. We present novel optimal and approximate opportunistic scheduling algorithms that combine channel fluctuation and user mobility information in their decision rules. The algorithms modify the opportunistic scheduling framework of Liu et al., (1993) with dynamic constraints for fairness. These fairness constraints adapt according to the user mobility. The adaptation of constraints in the proposed algorithms implicitly results in giving priority to the users that are in the most favorable locations. The optimal algorithm is an offline algorithm that precomputes constraint values according to a known mobility model. The approximate algorithm is an online algorithm that relies on the future prediction of the user mobility locations in time. We show that the use of mobility information in opportunistic scheduling increases channel capacity. We also provide analytical bounds on the performance of the approximate algorithm using the fundamental inequality of Dyer et al., (1986) for linear programs. Simulation results on high data rate (HDR) illustrate the usefulness of the proposed schemes for elastic traffic and macrocell structures     

中继蜂窝网络中小区间和小区内的资源分割

文章提出了一种应用于固定中继蜂窝网络中基于复用分割的小区间频谱分配框架,通过引入有效复用因子这一指标来优化小区内基站和中继之间的资源分割,并比较了不同的链路带宽分配方案对系统性能的影响。理论分析和仿真结果显示,该方案可以在保证小区边缘用户的吞吐量的同时提高小区容量。     

Slot-Splitting TDD-CDMA for Cellular Wireless Networks

This paper proposes an improved version of time-division duplex (TDD) mode called slot-splitting TDD (SS-TDD), which increases the average achievable capacity of a TDD cellular network by splitting a slot. The improvement results from partial relaxation of the restriction in the former versions of TDD, which requires an integer number of downlink slots. The proposed method can be implemented with no significant increase in computational complexity. In addition, with a few minor modifications, the proposed SS-TDD can be applied to two out of three burst types in UTRA TDD with a single-switching-point configuration. In a multi-cell environment with mixed traffic, our analysis shows that the proposed SS-TDD increases the average cell capacity (in Mbps) by up to 18.5-10.0%, and the Erlang capacity by up to 20.5-44.3%, for targeted SIRs in the range of 5-7dB.     

Cellular Neural Networks With Transient Chaos

A new model of cellular neural networks (CNNs) with transient chaos is proposed by adding negative self-feedbacks into CNNs after transforming the dynamic equation to discrete time via Euler's method. The simulation on the single neuron model shows stable fix points, bifurcation and chaos. Hence, this new CNN model has richer and more flexible dynamics, and therefore may possess better capabilities of solving various problems, compared to the conventional CNN with only stable dynamics