检索结果-内蒙古大学图书馆

作者： Bagaa, Miloud Taleb, Tarik Laghrissi, Abdelquoddouss Ksentini, Adlen Flinck, Hannu Department of Communications and Networking School of Electrical Engineering Aalto University Finland Department of Computer and Information Security Sejong University Seoul Korea Republic of Communication systems EURECOM Sophia-Antipolis France Nokia Bell Labs. Finland

Many ongoing research activities relevant to 5G mobile systems concern the virtualization of the mobile core network, including the Evolved Packet Core (EPC) elements, aiming for system scalability, elasticity, flexibility, and cost-efficiency. Virtual EPC (vEPC)/5G Core will principally rely on some key technologies such as Network Function Virtualization (NFV), Software Defined networking (SDN) and Cloud Computing;enabling the concept of Mobile Carrier Cloud. The key idea beneath this concept, known also as Core Network as a Service (CNaaS), consists in deploying virtual instances (i.e., Virtual Machines or containers) of key core network functions (i.e., Virtual Network Functions - VNF of 4G or 5G) such as the Mobility Management Entity (MME), Serving GateWay (SGW), Packet Data network gateWay (PGW), Access and Mobility Management Function (AMF), Session Management Function (SMF), Authentication Server Function (AUSF), and User Plane Functions (UPF) over a federated cloud. In this vein, an efficient VNF placement algorithm is highly needed to sustain Quality of Service (QoS) while reducing the deployment cost. Our contribution in this paper is two fold. First, we devise an algorithm that derives the optimal number of virtual instances of 4G (MME, SGW, PGW) or 5G (AMF, SMF and AUSF) core network elements to meet the requirements of a specific mobile traffic. Second, we propose an algorithm for the placement of these virtual instances over a federated cloud. While the first algorithm is based on Mixed Integer Linear Programming (MILP), the second is based on Coalition formation game, wherein the aim is to build coalitions of Cloud Networks (CNs) to host the virtual instances of the vEPC/5G Core elements. The obtained results clearly indicate the advantages of the proposed algorithms in ensuring QoS given a fixed cost for vEPC/5G Core deployment, while maximizing the profits of cloud operators. © 2018 IEEE.

关键词： Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Schemes of data visualization for ground vibration prediction induced by trains 47

Schemes of data visualization for ground vibration predictio...

引用

47th International Congress and Exposition on Noise Control engineering: Impact of Noise Control engineering, INTER-NOISE 2018

作者： Chen, Yit-Jin Chen, Chi-Jane Chen, Chi-Jim Department of Civil Engineering Chung Yuan Christian University Taoyuan City32023 Taiwan Department of Computer Science and Engineering National Taiwan Ocean University Keelung City20224 Taiwan Information Networking Institute Carnegie-Mellon University PittsburghPA15213 United States

Rail transport has many advantages, such as good energy efficiency and air quality, compared with other transportation systems. However, ground vibration induced by trains can reach levels that can distract humans and interrupt sensitive instrumentation. Among the influencing factors, rail system, train speed, transmitting distance, structure type, and geological condition are the most important influencing factors. A series of measurements was performed to assess the influence of vibration and distance on high-speed rail and mass rapid transit in Taiwan. Based on the measurement results, artificial neural network (ANN), random forest model (RFM), and support vector machine (SVM) are applied to predict the vibration induced by trains. This machine learning model also applies a voting-based ensemble learning algorithm to improve the prediction result. The prediction model has been evaluated by performing the 10-fold cross-validation. Generally, the machine learning model can reasonably predict the ground vibration level in various frequency ranges. Finally, an automatic prediction system with the schemes of data visualization for ground vibration induced by trains is proposed in this study. The proposed system can help engineers determine whether vibration-sensitive land uses are close enough to the proposed train system and analyze the effect of ground-borne vibration. © INTER-NOISE 2018 - 47th International Congress and Exposition on Noise Control engineering: Impact of Noise Control engineering. All rights reserved.

关键词： Data visualization

来源：评论

学校读者我要写书评

暂无评论

NOMA aided NarrowBand IoT for machine type communications with user clustering

arXiv

引用

arXiv 2018年

作者： Shahini, Ali Ansari, Nirwan ADVANCED NETWORKING LABORATORY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING NEW JERSEY INSTITUTE OF TECHNOLOGY

To support Machine Type Communications (MTC) in next generation mobile networks, NarrowBand-IoT (NB-IoT) has been released by the Third Generation Partnership Project (3GPP) as a promising solution to provide extended coverage and low energy consumption for low cost MTC devices. However, the existing Orthogonal Multiple Access (OMA) scheme in NB-IoT cannot provide connectivity for a massive number of MTC devices. In parallel with the development of NB-IoT, Non-Orthogonal Multiple Access (NOMA), introduced for the fifth generation wireless networks, is deemed to significantly improve the network capacity by providing massive connectivity through sharing the same spectral resources. To leverage NOMA in the context of NB-IoT, we propose a power domain NOMA scheme with user clustering for an NB-IoT system. In particular, the MTC devices are assigned to different ranks within the NOMA clusters where they transmit over the same frequency resources. Then, we formulate an optimization problem to maximize the total throughput of the network by optimizing the resource allocation of MTC devices and NOMA clustering while satisfying the transmission power and quality of service requirements. We prove the NP-hardness of the proposed optimization problem. We further design an efficient heuristic algorithm to solve the proposed optimization problem by jointly optimizing NOMA clustering and resource allocation of MTC devices. Furthermore, we prove that the reduced optimization problem of power control is a convex optimization task. Simulation results are presented to demonstrate the efficiency of the proposed scheme. Copyright © 2018, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Hierarchical capacity provisioning for fog computing

arXiv

引用

arXiv 2018年

作者： Kiani, Abbas Ansari, Nirwan Khreishah, Abdallah ADVANCED NETWORKING LABORATORY DEPARTMENT of ELECTRICAL and COMPUTER ENGINEERING NEW JERSY INSTITUTE of TECHNOLOGY

The concept of fog computing is centered around providing computation resources at the edge of network, thereby reducing the latency and improving the quality of service. However, it is still desirable to investigate how and where at the edge of the network the computation capacity should be provisioned. To this end, we propose a hierarchical capacity provisioning scheme. In particular, we consider a two-tier network architecture consisting of shallow and deep cloudlets and explore the benefits of hierarchical capacity based on queueing analysis. Moreover, we explore two different network scenarios in which the network delay between the two tiers is negligible as well as the case that the deep cloudlet is located somewhere deeper in the network and thus the delay is significant. More importantly, we model the first network delay scenario with bufferless shallow cloudlets as well as the second scenario with finite-size buffer shallow cloudlets, and formulate an optimization problem for each model. We also use stochastic ordering to solve the optimization problem formulated for the first model and an upper bound based technique is proposed for the second model. The performance of the proposed scheme is evaluated via simulations in which we show the accuracy of the proposed upper bound technique as well as the queue length estimation approach for both randomly generated input and real trace data. Copyright © 2018, The Authors. All rights reserved.

关键词： Fog computing

来源：评论

学校读者我要写书评

暂无评论

Green Communication and Computation Offloading in Ultra-dense Networks

Green Communication and Computation Offloading in Ultra-dens...

引用

IEEE Global Communications Conference

作者： Feixiang Li Haipeng Yao Jun Du Chunxiao Jiang F. Richard Yu Beijing Advanced Innovation Center for Future Internet Technology Beijing University of Technology Beijing China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Electronic Engineering Tsinghua University Beijing China Department of Systems and Computer Engineering Carleton University Ottawa Canada

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

In ultra-dense networks, the increasing demand for wireless services has led to severe energy consumption problem. In this paper, we mainly focus on green communication and computation offloading in ultra-dense networks, constituted of different macro base stations and small-cell base stations. This paper jointly considers edge energy consumption and delay under the limited network resource for multiple users. To address this issue, we propose an efficient computation offloading scheme in multi-user multi-task scenario, and a cuckoo search algorithm is invoked for solving the computation offloading problem. To be specific, the global convergence analysis presents the validity of this computation offloading scheme. Finally, experimental results validate that our proposed scheme is conducive to improving the efficiency of entire system in ultra-dense networks.

关键词： Task analysis Manganese Delays Computational modeling Energy consumption Wireless communication

来源：评论

学校读者我要写书评

暂无评论

SDN-based architecture for providing reliable Internet of Things connectivity in 5G systems 17

SDN-based architecture for providing reliable Internet of Th...

引用

17th Annual Mediterranean Ad Hoc networking Workshop, Med-Hoc-Net 2018

作者： Tello-Oquendo, Luis Akyildiz, Ian F. Lin, Shih-Chun Pla, Vicent Broadband Wireless Networking Laboratory School of Electrical and Computer Engineering Georgia Institute of Technology AtlantaGA30332 United States Instituto ITACA Universitat Politecnica de Valencia Valencia46022 Spain Department of Electrical and Computer Engineering North Carolina State University Raleigh NC27606 United States

ISBN: (纸本)9783903176058

Sheer number of devices in Internet of Things (IoTs) fundamentally challenge the ubiquitous information transmissions through the backbone networks, such as cellular systems. The heterogeneity of IoT devices and the hardware-based, inflexi-ble cellular architectures impose even greater challenges to enable efficient communication. To address these challenges, this paper introduces the so-called SoftAir architecture on wireless software-defined networking and proposes software-defined gateways (SD-GWs) that jointly optimize cross-layer communication functionalities between heterogeneous IoT devices and cellular systems. First, the SoftAir architecture is proposed to support a unified software-defined platform for quality-of-service aware IoT systems and software-defined radio access networks (SD-RANs) with millimeter-wave transmissions. Next, the SD-GWs are designed in SoftAir to explore the interactions between two-types of networks (i.e., IoTs and SD-RANs) and enable cross-layer solutions that simultaneously achieve optimal energy savings and throughput gain in IoTs and maximum sum-rates in SD-RANs. Simulation results validate that our SoftAir solutions surpass classical IoT schemes by jointly optimizing communication functionalities for both IoTs and SD-RANs and bring significant system synergies for reliable 5G IoT communication. © 2018 IFIP.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Density of spherically embedded stiefel and grassmann codes

Density of spherically embedded stiefel and grassmann codes

引用

作者： Pitaval, Renaud-Alexandre Wei, Lu Tirkkonen, Olav Hollanti, Camilla Department of Communications and Networking Aalto University AaltoFI-00076 Finland Huawei Technologies Sweden AB KistaSE-164 94 Sweden Department of Electrical and Computer Engineering University of Michigan-Dearborn DearbornMI48128 United States

The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. A high density indicates that a code performs well when used as a uniform point-wise discretization of an ambient space. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal distance arising from an Euclidean embedding, including the unitary group as a special case. The choice of distance enables the treatment of the manifolds as subspaces of Euclidean hyperspheres. In this geometry, the densest packings are not necessarily equivalent to maximum-minimum-distance codes. Computing a code's density follows from computing: 1) the normalized volume of a metric ball and 2) the kissing radius, the radius of the largest balls one can pack around the codewords without overlapping. First, the normalized volume of a metric ball is evaluated by asymptotic approximations. The volume of a small ball can be well-approximated by the volume of a locally equivalent tangential ball. In order to properly normalize this approximation, the precise volumes of the manifolds induced by their spherical embedding are computed. For larger balls, a hyperspherical cap approximation is used, which is justified by a volume comparison theorem showing that the normalized volume of a ball in the Stiefel or Grassmann manifold is asymptotically equal to the normalized volume of a ball in its embedding sphere as the dimension grows to infinity. Then, bounds on the kissing radius are derived alongside corresponding bounds on the density. Unlike spherical codes or codes in flat spaces, the kissing radius of Grassmann or Stiefel codes cannot be exactly determined from its minimum distance. It is nonetheless possible to derive bounds on density as functions of the minimum distance. Stiefel and Grassmann codes have larger density than their image spherical codes when dimensions tend to infinity. Finally, the bounds on density lead t

关键词： Spheres

来源：评论

学校读者我要写书评

暂无评论

Stochastic Optimization for Pricing-Aware Multimedia Services in 5G Vehicular Networks

Stochastic Optimization for Pricing-Aware Multimedia Service...

引用

2019 IEEE Global Communications Conference (GLOBECOM)

作者： Tengfei Cao Changqiao Xu Zhongbai Jiang Han Xiao Lujie Zhong Luigi Alfredo Grieco State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Computer Technology and Applications Qinghai University Qinghai China Information Engineering College Capital Normal University Beijing China School of Electronic Engineering Politecnico di Bari Bari Italy

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

The many fold capacity magnification promised by 5G vehicular networks will likely provide massive multimedia services, including infotainment, augmented reality, location services, etc. However, the large-scale and stochastic characteristic of these burgeoning multimedia applications will lead to an exponential increase of traffic in vehicular networks. Meanwhile, the diversified requirements introduced by the coexistence with traditional services will also bring new challenges to the efficient usage of resources. To cope with the above challenges, we propose a novel Stochastic Optimization framework for Pricing-aware Multimedia Services (SOPMS) in this paper, which targets the maximization of utility with the constraints of system stability and traffic pricing policy. Specifically, we leverage the Lyapunov function to address this optimization objective, which is decomposed into three tractable subproblems. For each problem, a distinct algorithm is conceived, i.e. Quality of Experience (QoE) based utility maximization, cooperative resource allocation and pricing-based transmission control. Finally, validated by the simulations, our proposed SOPMS preserves the optimality and significantly improves the queue stability and service utility, in comparison with other state-of-the-art solutions.

关键词： Optimization Quality of experience 5G mobile communication Stability analysis Stochastic processes Resource management Pricing

来源：评论

学校读者我要写书评

暂无评论

ENHANCING APPLE MATURATION RECOGNITION PERFORMANCE BASED ON FIELD PROGRAMMABLE GATE ARRAY IMPLEMENTATION

引用

Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University 2019年第6期54卷

作者： Awad, Fouad H. Fadhel, Mohammed A. Ali Alheeti, Khattab M. Al-Shamma, Omran Alzubaidi, Laith Computer Networking Systems Department College of Computer Sciences and Information Technology University of Anbar P.O. Box: 55431 55 Anbar Ramadi Iraq University of Information Technology and Communications Al-Nidhal St. Baghdad Iraq College of Computer Science and Information Technology University of Sumer Dhi Qar Rifai Iraq Faculty of Science & Engineering Queensland University of Technology 2 George St. Brisbane Australia

Recently, several techniques have been developed for vegetable and fruit maturing recognition. Adding hardware designs will enhance the recognition performance. Especially, parallel processing designs efficiently speed up the process functions. This paper utilizes a hardware parallel processing design called field programmable gate array for that purpose. In addition, two different methods;namely K-means clustering and color thresholding are used for recognizing the apple maturation. This study aims to design and implement a mature apple recognition system based on field programmable gate array. The results demonstrate that the color thresholding technique is faster, more reliable and more effective than the K-means clustering technique. © 2019 Science Press. All rights reserved.

关键词： Fruits

来源：评论

学校读者我要写书评

暂无评论

Feedback Design for Multi-Antenna K-Tier Heterogeneous Downlink Cellular Networks

Feedback Design for Multi-Antenna K-Tier Heterogeneous Downl...

引用

作者： Park, Jeonghun Lee, Namyoon Heath, Robert W. Qualcomm Wireless Research and Development San DiegoCA92121 United States Department of Electrical Engineering Pohang University of Science and Technology Pohang37673 Korea Republic of Wireless Networking and Communication Group Department of Electrical and Computer Engineering University of Texas at Austin AustinTX78701 United States

We characterize the ergodic spectral efficiency of a non-cooperative and a cooperative type of K-tier heterogeneous network with limited feedback. In the non-cooperative case, a multi-antenna base station (BS) serves a single-antenna user using maximum-ratio transmission based on limited feedback. In the cooperative case, a BS coordination set is formed by using dynamic clustering across the tiers, wherein the intra-cluster interference is mitigated by using multi cell zero-forcing also based on limited feedback. Modeling the network based on stochastic geometry, we derive analytical expressions for the ergodic spectral efficiency as a function of the system parameters. Leveraging the obtained expressions, we formulate feedback partition problems and obtain solutions to improve the ergodic spectral efficiency. Simulations show the spectral efficiency improvement by using the obtained feedback partitions. Our major findings are as follows: 1) in the non-cooperative case, the feedback is only useful in a particular tier if the mean interference is small enough;2) in the cooperative case, allocating more feedback to stronger intra-cluster BSS is efficient;and 3) in both cases, the obtained solutions do not change depending on the instantaneous signal-to-interference ratio. © 2002-2012 IEEE.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：