Institution
Xidian University
Education•Xi'an, China•
About: Xidian University is a education organization based out in Xi'an, China. It is known for research contribution in the topics: Antenna (radio) & Computer science. The organization has 32099 authors who have published 38961 publications receiving 431820 citations. The organization is also known as: University of Electronic Science and Technology at Xi'an & Xīān Diànzǐ Kējì Dàxué.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, a reflective metasurface is designed, fabricated, and experimentally demonstrated to generate an orbital angular angular momentum (OAM) vortexwave in radio frequency domain.
Abstract: In this paper, a reflective metasurface is designed, fabricated, and experimentally demonstrated to generate an orbital angular momentum (OAM) vortexwave in radio frequency domain. Theoretical formula of phase-shift distribution is deduced and used to design the metasurface producing vortexradio waves. The prototype of a practical configuration is designed, fabricated, and measured to validate the theoretical analysis at 5.8 GHz. The simulated and experimental results verify that the vortexwaves with different OAM mode numbers can be flexibly generated by using sub-wavelength reflective metasurfaces. The proposed method and metasurface pave a way to generate the OAM vortexwaves for radio and microwave wireless communication applications.
261 citations
••
TL;DR: A smart, Deep Reinforcement Learning based Resource Allocation (DRLRA) scheme, which can allocate computing and network resources adaptively, reduce the average service time and balance the use of resources under varying MEC environment is proposed.
Abstract: The development of mobile devices with improving communication and perceptual capabilities has brought about a proliferation of numerous complex and computation-intensive mobile applications. Mobile devices with limited resources face more severe capacity constraints than ever before. As a new concept of network architecture and an extension of cloud computing, Mobile Edge Computing (MEC) seems to be a promising solution to meet this emerging challenge. However, MEC also has some limitations, such as the high cost of infrastructure deployment and maintenance, as well as the severe pressure that the complex and mutative edge computing environment brings to MEC servers. At this point, how to allocate computing resources and network resources rationally to satisfy the requirements of mobile devices under the changeable MEC conditions has become a great aporia. To combat this issue, we propose a smart, Deep Reinforcement Learning based Resource Allocation (DRLRA) scheme, which can allocate computing and network resources adaptively, reduce the average service time and balance the use of resources under varying MEC environment. Experimental results show that the proposed DRLRA performs better than the traditional OSPF algorithm in the mutative MEC conditions.
261 citations
••
06 Nov 2011TL;DR: A novel sparse representation model called centralized sparse representation (CSR) is proposed, which achieves convincing improvement over previous state-of-the-art methods on image restoration tasks by exploiting the nonlocal image statistics.
Abstract: This paper proposes a novel sparse representation model called centralized sparse representation (CSR) for image restoration tasks. In order for faithful image reconstruction, it is expected that the sparse coding coefficients of the degraded image should be as close as possible to those of the unknown original image with the given dictionary. However, since the available data are the degraded (noisy, blurred and/or down-sampled) versions of the original image, the sparse coding coefficients are often not accurate enough if only the local sparsity of the image is considered, as in many existing sparse representation models. To make the sparse coding more accurate, a centralized sparsity constraint is introduced by exploiting the nonlocal image statistics. The local sparsity and the nonlocal sparsity constraints are unified into a variational framework for optimization. Extensive experiments on image restoration validated that our CSR model achieves convincing improvement over previous state-of-the-art methods.
260 citations
••
TL;DR: This work presents a lightweight and secure user authentication protocol based on the Rabin cryptosystem, which has the characteristic of computational asymmetry and presents a comprehensive heuristic security analysis to show that the protocol is secure against all the possible attacks and provides the desired security features.
Abstract: Wireless sensor networks (WSNs) will be integrated into the future Internet as one of the components of the Internet of Things, and will become globally addressable by any entity connected to the Internet. Despite the great potential of this integration, it also brings new threats, such as the exposure of sensor nodes to attacks originating from the Internet. In this context, lightweight authentication and key agreement protocols must be in place to enable end-to-end secure communication. Recently, Amin et al. proposed a three-factor mutual authentication protocol for WSNs. However, we identified several flaws in their protocol. We found that their protocol suffers from smart card loss attack where the user identity and password can be guessed using offline brute force techniques. Moreover, the protocol suffers from known session-specific temporary information attack, which leads to the disclosure of session keys in other sessions. Furthermore, the protocol is vulnerable to tracking attack and fails to fulfill user untraceability. To address these deficiencies, we present a lightweight and secure user authentication protocol based on the Rabin cryptosystem, which has the characteristic of computational asymmetry. We conduct a formal verification of our proposed protocol using ProVerif in order to demonstrate that our scheme fulfills the required security properties. We also present a comprehensive heuristic security analysis to show that our protocol is secure against all the possible attacks and provides the desired security features. The results we obtained show that our new protocol is a secure and lightweight solution for authentication and key agreement for Internet-integrated WSNs.
259 citations
••
TL;DR: This paper provides this paper to study the MECO problem in ultradense IoT networks, and proposes a two-tier game-theoretic greedy offloading scheme as the solution.
Abstract: The emergence of massive Internet of Things (IoT) mobile devices (MDs) and the deployment of ultradense 5G cells have promoted the evolution of IoT toward ultradense IoT networks. In order to meet the diverse quality-of-service and quality of experience demands from the ever-increasing IoT applications, the ultradense IoT networks face unprecedented challenges. Among them, a fundamental one is how to address the conflict between the resource-hungry IoT mobile applications and the resource-constrained IoT MDs. By offloading the IoT MDs’ computation tasks to the edge servers deployed at the radio access infrastructures, including macro base station (MBS) and small cells, mobile-edge computation offloading (MECO) provides us a promising solution. However, note that available MECO research mostly focused on single-tier base station scenario and computation offloading between the MDs and the edge server connected to the MBS. Little works can be found on performing MECO in ultradense IoT networks, i.e., a multiuser ultradense edge server scenario. Toward this end, we provide this paper to study the MECO problem in ultradense IoT networks, and propose a two-tier game-theoretic greedy offloading scheme as our solution. Extensive numerical results corroborate the superior performance of conducting computation offloading among multiple edge servers in ultradense IoT networks.
259 citations
Authors
Showing all 32362 results
Name | H-index | Papers | Citations |
---|---|---|---|
Zhong Lin Wang | 245 | 2529 | 259003 |
Jie Zhang | 178 | 4857 | 221720 |
Bin Wang | 126 | 2226 | 74364 |
Huijun Gao | 121 | 685 | 44399 |
Hong Wang | 110 | 1633 | 51811 |
Jian Zhang | 107 | 3064 | 69715 |
Guozhong Cao | 104 | 694 | 41625 |
Lajos Hanzo | 101 | 2040 | 54380 |
Witold Pedrycz | 101 | 1766 | 58203 |
Lei Liu | 98 | 2041 | 51163 |
Qi Tian | 96 | 1030 | 41010 |
Wei Liu | 96 | 1538 | 42459 |
MengChu Zhou | 96 | 1124 | 36969 |
Chunying Chen | 94 | 508 | 30110 |
Daniel W. C. Ho | 85 | 360 | 21429 |