Journal of China Universities of Posts and Telecommunications最新文献

Abstract

As different requirements on mobility support will be introduced by diversified communication scenarios in the fifth generation (5G), on demand mobility management is put forward to simplify signaling process, reduce terminal power consumption, improve network efficiency and so on. In order to enable on demand mobility management in 5G networks, a mobility driven network slicing (MDNS) was proposed, which takes individual mobility support requirements into account while customizing networks for different mobile services. Within the MDNS framework, the actual levels of required mobility support are determined by a mobility description system, and network slice templates with the corresponding mobility management schemes are defined by a network slice description function. By instantiating the network slices, each mobile terminal could be directed to the network slice with the most appropriate mobility management scheme. Based on this, a prototype was implemented to validate the feasibility of MDNS framework, i.e. creating multiple network slices with different mobility management schemes. In addition, the performance evaluation on average cost of processing a mobility event is conducted for the proposed MDNS framework and the long term evolution (LTE) system, and operating benefits are analyzed including efficiency and scalability.

Abstract

With the boom of wireless devices, the number of wireless users under wireless local area networks (WLANs) has increased dramatically. However, the standard backoff mechanism in IEEE 802.11 adopts fixed initial contention window (CW) size without considering changes of network load, which leads to a high collision probability and low channel utilization in bursty arrivals. In this paper, a novel CW dynamic adjustment scheme is proposed to achieve high throughput performance in dense user environment. In the proposed scheme, the initial CW size is dynamically adjusted to optimum according to the measured packet collision probability. Simulation results show that the proposed scheme can significantly improve the throughput performance.

Abstract

Along with the increasing number of vehicles, parking space becomes narrow gradually, safety parking puts forward higher requirements on the driver's driving technology. How to safely, quickly and accurately park the vehiclo to parking space right? This paper presents an automatic parking scheme based on trajectory planning, which analyzing the mechanical model of the vehicle, establishing vehicle steering model and parking model, coming to the conclusion that it is the turning radius is independent of the vehicle speed at low speed. The Matlab simulation environment verifies the correctness and effectiveness of the proposed algorithm for parking. A class of the automatic parking problem of intelligent vehicles is solved.

Abstract

Color image enhancement is an active research field in image processing. Currently, many image enhancement methods are capable of enhancing the details of the color image. However, these methods only process the red, green and blue (RGB) color channels separately, which leads to color distortion easily. In order to overcome this problem, the paper presents an approach to integrate the quaternion theory into the traditional guided filter to obtain a quaternion guided filter (QGF). This method makes full use of the color information of an image to realize the holistic processing of RGB color channels. So as to preserve color information while enhancing details, this paper proposes a color image detail enhancement algorithm based on the QGF. Experimental results show that the proposed algorithm is effective in the applications of the color image detail enhancement, and enables image's edges to be more prominent and texture clearer while avoiding color distortion. Compared with the existing image enhancement methods, the proposed method achieves better enhancement performance in terms of the visual quality and the objective evaluating indicators.

Abstract

Information fusion is a key step in multimodal biometric systems. The feature-level fusion is more effective than the score-level and decision-level method owing to the fact that the original feature set contains richer information about the biometric data. In this paper, we present a multiset generalized canonical discriminant projection (MGCDP) method for feature-level multimodal biometric information fusion, which maximizes the correlation of the intra-class features while minimizes the correlation of the between-class. In addition, the serial MGCDP (S-MGCDP) and parallel MGCDP (P-MGCDP) strategy were also proposed, which can fuse more than two kinds of biometric information, so as to achieve better identification effect. Experiments performed on various biometric databases shows that MGCDP method outperforms other state-of-the-art feature-level information fusion approaches.

Abstract

In modern data centers, power consumed by network is an observable portion of the total energy budget and thus improving the energy efficiency of data center networks (DCNs) truly matters. One effective way for this energy efficiency is to make the size of DCNs elastic along with traffic demands by flow consolidation and bandwidth scheduling, i.e., turning off unnecessary network components to reduce the power consumption. Meanwhile, having the instinct support for data center management, software defined networking (SDN) provides a paradigm to elastically control the resources of DCNs. To achieve such power savings, most of the prior efforts just adopt simple greedy heuristic to reduce computational complexity. However, due to the inherent problem of greedy algorithm, a good-enough optimization cannot be always guaranteed. To address this problem, a modified hybrid genetic algorithm (MHGA) is employed to improve the solution's accuracy, and the fine-grained routing function of SDN is fully leveraged. The simulation results show that more efficient power management can be achieved than the previous studies, by increasing about 5% of network energy savings.

Abstract

Area-efficient design methodology is proposed for the analog decoding implementations of the rate-½ accumulate repeat-4 jagged-accumulate (AR4JA) low density parity check (LDPC) code. The proposed approach is designed using optimized decoding architecture and regularized routing network, in such a way that the overall wiring overhead is minimized and the silicon area utilization is significantly improved. The prototyping chip used to verify the approach is fully integrated in a four-metal double-poly 0.35 μm complementary metal oxide semiconductor (CMOS) technology, and includes an input-output interface that maximizes the decoder throughput. The decoding core area is 2.02 mm² with a post-layout area utilization of 80%. The decoder was successfully tested at the maximum data rate of 10 Mbit/s, with a core power consumption of 6.78 mW at 3.3 V, which corresponds to an energy per decoded bit of 0.677 nJ. The proposed analog LDPC decoder with low processing power and high-reliability is suitable for space- and power-constrained spacecraft system.

Abstract

To extract and express the knowledge hidden in information systems, discernibility matrix and its extensions were introduced and applied successfully in many real life applications. Binary discernibility matrix, as a representative approach, has many interesting superior properties and has been rapidly developed to find intuitive and easy to understand knowledge. However, at present, the binary discernibility matrix is mainly adopted in the complete information system. It is a challenging topic how to achieve the attribute reduction by using binary discernibility matrix in incomplete information system. A form of generalized binary discernibility matrix is further developed for a number of representative extended rough set models that deal with incomplete information systems. Some useful properties and criteria are introduced for judging the attribute core and attribute relative reduction. Thereafter, a new algorithm is formulated which supports attribute core and attribute relative reduction based on the generalized binary discernibility matrix. This algorithm is not only suitable for consistent information systems but also inconsistent information systems. The feasibility of the proposed methods was demonstrated by worked examples and experimental analysis.

Given the large volume of video content and the diversity of user attention, it is of great importance to understand the characteristics of online video popularity for technological, economic and social reasons. In this paper, based on the data collected from a leading online video service provider in China, namely Youku, the dynamics of online video popularity are analyzed in-depth from four key aspects: overall popularity distribution, individual popularity distribution, popularity evolution pattern and early-future popularity relationship. How the popularity of a set of newly upload videos distributes throughout the observation period is first studied. Then the notion of active days is proposed, and the per-day and per-hour popularity distributions of individual videos are carefully studied. Next, how the popularity of an individual video evolves over time is investigated. The evolution patterns are further defined according to the number and temporal locations of popularity bursts, in order to describe the popularity growth trend. At last, the linear relationship between early video popularity and future video popularity are examined on a log-log scale. The relationship is found to be largely impacted by the popularity evolution patterns. Therefore, the specialized models are proposed to describe the correlation according to the popularity evolution patterns. Experiment results show that specialized models can better fit the correlation than a general model. Above all, the analysis results in our work can provide direct help in practical for the interested parties of online video service such as service providers, online advisers, and network operators.

As the telecommunication market in China becomes increasingly mature, operators have begun to focus their primary effort on user management; within this focus, determining the proper tariff package for users and offering them relevant recommendations are key issues to resolve. This paper introduces a matching model that links tariff packages and users' usage behavior (e.g., the total minutes used, data usage, etc.) based on the market segmenting theory. Microsoft Visual Fox Pro 9.0 is selected as the development tool to implement the matching model, while the tariff packages and user behavior data for a city branch of China Mobile are used to validate the model.