Institution
Beijing University of Posts and Telecommunications
Education•Beijing, Beijing, China•
About: Beijing University of Posts and Telecommunications is a education organization based out in Beijing, Beijing, China. It is known for research contribution in the topics: MIMO & Quality of service. The organization has 39576 authors who have published 41525 publications receiving 403759 citations. The organization is also known as: BUPT.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this article, a large class of generalized variable-coefficient Korteweg-de Vries (KdV) models with external-force and perturbed/dissipative terms is studied.
164 citations
••
TL;DR: Simulation results show how QUVoD is a highly efficient user-centric mobile VoD solution in urban vehicular networks in comparison with existing state-of-the-art solutions.
Abstract: Recently, many cities around the world have witnessed large-scale deployment of terrestrial broadcasting mobile television (TV) to vehicles. This service is similar to the cable or satellite TV already in the home, and user-centric interactive mobile Video-on-Demand (VoD) over urban vehicular networks is in fact expected. However, providing this new service with focus on user Quality of Experience (QoE) constitutes a significant challenge. This paper introduces a QoE-driven User-centric solution for VoD services in urban vehicular network environments (QUVoD). QUVoD relies on a multihomed hierarchical peer-to-peer (P2P) and vehicular ad-hoc network (VANET) architecture. Vehicles construct a low-layer VANET via Wireless Access in the Vehicular Environment interfaces; they also form an upper layer P2P Chord overlay on top of a cellular network via Fourth-Generation (4G) interfaces. A novel grouping-based storage strategy that uniformly distributes the video segments along the Chord overlay is proposed, reducing segment seeking traffic while also enabling load balancing. A novel segment seeking and multipath delivery scheme that achieves high lookup success rate and very good video data delivery efficiency is also introduced, which achieves high lookup success rate and very good video data delivery efficiency. Furthermore, a new speculation-based prefetching strategy is proposed, which analyses users' interactive viewing behavior and, by estimating video segment playback order, employs prefetching of the expected segments, smoothening the video playback. Simulation results show how QUVoD is a highly efficient user-centric mobile VoD solution in urban vehicular networks in comparison with existing state-of-the-art solutions.
164 citations
••
01 Feb 2012TL;DR: It is demonstrated that a combination of two negatively correlated objectives under the multi-objective framework usually leads to remarkably better performance compared with either of the orignal single objectives, including even many popular algorithms.
Abstract: Community detection in social network analysis is usually considered as a single objective optimization problem, in which different heuristics or approximate algorithms are employed to optimize a objective function that capture the notion of community. Due to the inadequacy of those single-objective solutions, this paper first formulates a multi-objective framework for community detection and proposes a multi-objective evolutionary algorithm for finding efficient solutions under the framework. After analyzing and comparing a variety of objective functions that have been used or can potentially be used for community detection, this paper exploits the concept of correlation between objective which charcterizes the relationship between any two objective functions. Through extensive experiments on both artifical and real networks, this paper demonstrates that a combination of two negatively correlated objectives under the multi-objective framework usually leads to remarkably better performance compared with either of the orignal single objectives, including even many popular algorithms..
164 citations
••
08 Dec 2008
TL;DR: A Spectrum-Tree base On-Demand routing protocol (STOD-RP) is proposed where a spectrum-tree is built in each spectrum band to address the cooperation between spectrum decision and route selection in an efficient way.
Abstract: A unique challenge for routing in cognitive radio networks is the collaboration between the route selection and spectrum decision. To solve this problem, in this paper a Spectrum-Tree base On-Demand routing protocol (STOD-RP) is proposed where a spectrum-tree is built in each spectrum band. The formation of the spectrum-tree addresses the cooperation between spectrum decision and route selection in an efficient way. In addition, a new route metric is proposed as well as a fast and efficient spectrum-adaptive route recovery method. Simulation results show that our proposed STOD-RP reduces the control overhead and shortens the average end-to-end delay significantly.
164 citations
••
16 May 2011TL;DR: This paper survey's recent Mobile Cloud Computing architecture, application partition & offloading, and context-aware service, and a concept model has been proposed to analyze related research work.
Abstract: The rapid development of mobile computing and cloud computing trigger novel computing paradigm-----Mobile Cloud Computing. This paper review current research effort towards Mobile Computing. First, we present several challenges for the design of Mobile Cloud Computing service. Second, a concept model has been proposed to analyze related research work. Third, we survey recent Mobile Cloud Computing architecture, application partition & offloading, and context-aware service.
164 citations
Authors
Showing all 39925 results
Name | H-index | Papers | Citations |
---|---|---|---|
Jie Zhang | 178 | 4857 | 221720 |
Jian Li | 133 | 2863 | 87131 |
Ming Li | 103 | 1669 | 62672 |
Kang G. Shin | 98 | 885 | 38572 |
Lei Liu | 98 | 2041 | 51163 |
Muhammad Shoaib | 97 | 1333 | 47617 |
Stan Z. Li | 97 | 532 | 41793 |
Qi Tian | 96 | 1030 | 41010 |
Xiaodong Xu | 94 | 1122 | 50817 |
Qi-Kun Xue | 84 | 589 | 30908 |
Long Wang | 84 | 835 | 30926 |
Jing Zhou | 84 | 533 | 37101 |
Hao Yu | 81 | 981 | 27765 |
Mohsen Guizani | 79 | 1110 | 31282 |
Muhammad Iqbal | 77 | 961 | 23821 |