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

44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Vu, Quang-Doanh Tran, Le-Nam Juntti, Markku Univ Oulu Ctr Wireless Commun Oulu 90014 Finland Univ Coll Dublin Sch Elect & Elect Engn Dublin 4 Ireland

We investigate the coordinated multi-point noncoherent joint transmission (JT) in dense small cell networks. The goal is to design beamforming vectors for macro cell and small cell base stations (BSs) such that the weighted sum rate of the system is maximized, subject to a total transmit power at individual BSs. The optimization problem is inherently nonconvex and intractable, making it difficult to explore the full potential performance of the scheme. To this end, we first propose an algorithm to find a globally optimal solution based on the generic monotonic branch reduce and bound optimization framework. Then, for a more computationally efficient method, we adopt the inner approximation (InAp) technique to efficiently derive a locally optimal solution, which is numerically shown to achieve near-optimal performance. In addition, for decentralized networks such as those comprising of multi-access edge computing servers, we develop an algorithm based on the alternating direction method of multipliers, which distributively implements the InAp-based solution. Our main conclusion is that the noncoherent JT is a promising transmission scheme for dense small cell networks, since it can exploit the densitification gain, outperforms the coordinated beamforming, and is amenable to distributed implementation.

关键词： Computer architecture Array signal processing Microcell networks Wireless communication Servers Microprocessors Synchronization Dense small cell networks noncoherent joint transmission weighted sum rate multi-access edge computing distributed implementation branch reduce and bound inner approximation alternating direction method of multipliers

来源：评论

学校读者我要写书评

暂无评论

Statistical inference and distributed implementation for linear multicategory SVM

引用

STAT 2023年第1期12卷

作者： Sun, Gaoming Wang, Xiaozhou Yan, Yibo Zhang, Riquan East China Normal Univ Sch Stat Shanghai Peoples R China East China Normal Univ Key Lab Adv Theory & Applicat Stat & Data Sci MOE Shanghai Peoples R China Shanghai Univ Int Business & Econ Sch Stat & Informat Shanghai Peoples R China

Support vector machine (SVM) is one of the most prevalent classification techniques due to its excellent performance. The standard binary SVM has been well-studied. However, a large number of multicategory classification problems in the real world are equally worth attention. In this paper, focusing on the computationally efficient multicategory angle-based SVM model, we first study the statistical properties of model coefficient estimation. Notice that the new challenges posed by the widespread presence of distributed data, this paper further develops a distributed smoothed estimation for the multicategory SVM and establishes its theoretical guarantees. Through the derived asymptotic properties, it can be seen that our distributed smoothed estimation can achieve the same statistical efficiency as the global estimation. Numerical studies are performed to demonstrate the highly competitive performance of our proposed distributed smoothed method.

关键词： asymptotic properties Bahadur representation distributed implementation kernel smoothing linear multicategory SVM

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of an individual-based predator–prey model for a distributed computing environment 1

引用

Simulation Practice and Theory 1999年第1期7卷 47-70页

作者： Linda E. Mellott Michael W. Berry E.J. Comiskey Louis J. Gross Department of Computer Science University of Tennessee 107 Ayres Hall Knoxville TN 37996-1301 USA The Institute for Environmental Modeling and Department of Ecology and Evolutionary Biology University of Tennessee Knoxville TN 37996-1610 USA

A distributed implementation of the Spatially-Explicit Individual-Based Simulation Model of Florida Panther and White-Tailed Deer in the Everglades and Big Cypress Landscapes (SIMPDEL) model is presented. SIMPDEL models the impact of different water management strategies in the South Florida region on the white-tailed deer and the Florida panther populations. SIMPDEL models the interaction of the four interrelated components – vegetation, hydrology, white-tailed deer and Florida panther, over a time span up to several decades. Very similar outputs of bioenergetic and survival statistics were obtained from the serial and distributed models. A performance evaluation of the two models revealed moderate speed improvements for the distributed model (referred to as DSIMPDEL). The 4-processor configuration attained a speed improvement of 3.83 with small deer populations on an ATM-based network of SUN Ultra 2 workstations over the serial model executing on a single SUN Ultra 2 workstation.

关键词： Computational ecology distributed implementation Individual-based simulation Network of workstations Predator–prey model

来源：评论

学校读者我要写书评

暂无评论

distributed utility-based real-time power flow optimization in ICT-enabled low voltage distribution grids

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2023年第13期17卷 2900-2925页

作者： Ipach, Hanko Fisser, Leonard Becker, Christian Timm-Giel, Andreas Hamburg Univ Technol Inst Elect Powet & Energy Technol Ieet D-21079 Hamburg Germany Hamburg Univ Technol Inst Commun Networks ComNets Hamburg Germany

Low-Voltage (LV) distribution grids are facing a rapid increase of connected Photovoltaic (PV) power plants as well as flexible consumers like Battery-Electric Vehicle (BEV) chargers and Heat Pumps (HPs). The coordinated operation of these generation, storage and consumption units, referred to as distributed Energy Resources (DERs), is regarded as a key requirement to maximize the benefits of renewable generation without violating, for example, voltage limits. Therefore, an operation management scheme was proposed in previous work that optimizes the power flows in LV grids in real-time, where optimality is expressed as a maximization of the utility that DER owners experience from power consumption or injection, respectively. In this contribution, this method is extended by: (1) detailing a time-varying utility-model to express customer needs, (2) introducing a distributed implementation enhancing the robustness to failures, (3) developing a testbed using a real-time digital power grid simulator and a communication network emulator, and (4) integrating a real-time information flooding protocol. The performance is evaluated in different simulation scenarios, showing that the proposed method is able to cooperatively utilize the flexible units in order to fulfil the DER owners' needs even in the event of controller failures and constrained communication.

关键词： Distribution networks Optimisation techniques consumption units Power system management, operation and economics Reliability Solar power stations and photovoltaic power systems LV grids constrained communication DER owners coordinated operation renewable generation real-time digital power grid simulator flexible units power consumption distributed utility-based real-time power flow optimization distributed energy resources low-voltage distribution grids flexible consumers real-time information flooding protocol heat pumps distributed power generation operation management scheme power system simulation power distribution reliability voltage limits distributed implementation BEV chargers power grids load flow time-varying utility-model connected photovoltaic power plants Power engineering computing photovoltaic power systems ICT-enabled low voltage distribution grids battery-electric vehicle chargers optimisation distributed power generation

来源：评论

学校读者我要写书评

暂无评论

An Agile and distributed Mechanism for Inter-Domain Network Slicing in Next Generation Mobile Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2022年第10期21卷 3486-3501页

作者： Khamse-Ashari, Jalal Senarath, Gamini Bor-Yaliniz, Irem Yanikomeroglu, Halim Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada Huawei Canada Res Ctr Ottawa ON K2K 3J1 Canada

Network slicing is emerging as a promising method to provide sought after versatility and flexibility to cope with ever-increasing demands. To realize such potential advantages and to meet the challenging requirements of various network slices in an on-demand fashion, we need to develop an agile and distributed mechanism for resource provisioning to different network slices in a heterogeneous multi-resource multi-domain mobile network environment. We formulate inter-domain resource provisioning to network slices in such an environment as an optimization problem which maximizes social welfare among network slice tenants (so that maximizing tenants' satisfaction), while minimizing operational expenditures for infrastructure service providers at the same time. To solve the envisioned problem, we implement an iterative auction game among network slice tenants, on one hand, and a plurality of price-taking subnet service providers, on the other hand. We show that the proposed solution method results in a distributed privacy-saving mechanism which converges to the optimal solution of the described optimization problem. In addition to providing analytical results to characterize the performance of the proposed mechanism, we also employ numerical evaluations to validate the results, demonstrate convergence of the presented algorithm, and show the enhanced performance of the proposed approach (in terms of resource utilization, fairness and operational costs) against the existing solutions.

关键词： Network slicing Resource management Quality of service Optimization Next generation networking Hardware Cloud computing Inter-domain network slicing virtualization end-to-end service provisioning distributed implementation multi-resource allocation

来源：评论

学校读者我要写书评

暂无评论

Decentralized SINR Balancing in Cognitive Radio Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2017年第4期66卷 3491-3496页

作者： Dhifallah, Oussama Dahrouj, Hayssam Al-Naffouri, Tareq Y. Alouini, Mohamed-Slim King Abdullah Univ Sci & Technol Div Comp Elect & Math Sci & Engn Thuwal 23955 Saudi Arabia Effat Univ Dept Elect & Comp Engn Jeddah 22332 Saudi Arabia King Abdullah Univ Sci & Technol Thuwal 23955 Saudi Arabia King Fahd Univ Petr & Minerals Dhahran 31261 Saudi Arabia

This paper considers the downlink of a cognitive radio (CR) network formed by multiple primary and secondary transmitters, where each multiantenna transmitter serves a preknown set of single-antenna users. This paper assumes that the secondary and primary transmitters can simultaneously transmit their data over the same frequency bands to achieve high system spectrum efficiency. This paper considers the downlink balancing problem of maximizing the minimum signal-to-interference-plus-noise ratio (SINR) of the secondary transmitters subject to both the total power constraint of the secondary transmitters and the maximum interference constraint at each primary user due to secondary transmissions. This paper proposes solving the problem using the alternating direction method of multipliers, which leads to a distributed implementation through limited information exchange across the coupled secondary transmitters. This paper additionally proposes a solution that guarantees feasibility at each iteration. Simulation results demonstrate that the proposed solution converges to the centralized solution in a reasonable number of iterations.

关键词： Alternating direction method of multipliers cognitive radio (CR) network distributed implementation limited information exchange maximizing the minimum signal-to-interference-plus-noise ratio (SINR)

来源：评论

学校读者我要写书评

暂无评论

Mobile Edge Computing Meets mmWave Communications: Joint Beamforming and Resource Allocation for System Delay Minimization

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2020年第4期19卷 2382-2396页

作者： Zhao, Cunzhuo Cai, Yunlong Liu, An Zhao, Minjian Hanzo, Lajos Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou 310027 Peoples R China Univ Southampton Dept Elect & Comp Sci Southampton SO17 1BJ Hants England

Mobile edge computing (MEC) has been identified as a key technique of next-generation wireless networks, which supports cloud computing along with other compelling service capabilities at the network & x2019;s edge with the objective of reducing the system delay. As one of the prospective candidates for new spectrum in next-generation networks, millimeter wave (mmWave) communications has been gaining significant attention as a benefit of its high rate. Hence we conceive a joint hybrid beamforming and resource allocation algorithm for mmWave MEC. Explicitly, we jointly optimize the analog beamforming vectors at the users, the analog and digital beamforming matrices at the base station (BS), the computation task offloading ratios and resource allocation at the MEC server for minimizing the maximum system delay subject to the affordable communication and computing budget. We conceive a powerful algorithm for solving this challenging nonconvex optimization problem with coupled constraints based on the penalty dual decomposition (PDD) technique. The proposed algorithm can be implemented in a parallel and distributed fashion. Our numerical results demonstrate the superiority of the proposed algorithm by quantifying the benefits of intrinsically amalgamating MEC with mmWave communications.

关键词： Millimeter wave hybrid beamforming mobile edge computing resource allocation distributed implementation

来源：评论

学校读者我要写书评

暂无评论

Parallel TDMA Scheduling for Multiple-Destination Wireless Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2011年第11期10卷 3843-3851页

作者： Nguyen, Gam D. Kompella, Sastry Wieselthier, Jeffrey E. Ephremides, Anthony USN Div Informat Technol Res Lab Washington DC 20375 USA Wieselthier Res Silver Spring MD 20901 USA Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA

We study transmission strategies in a multiple-source, multiple-destination wireless network. Each source transmits packets that are intended for a particular destination. However, a transmitted packet can cause interference at other destinations. Our primary performance measure is throughput, which we define to be the average number of packets that are successfully received per intended destination per time slot. The sources are first divided into groups, based on the intended destination of their packets. In our parallel method, each group operates according to its own local protocol (e. g., TDMA), concurrently with and independently of the other groups. Our results show the impact of transmission schedules, channel fading, receiver noise, and other-user interference on network performance. We then show that, for given channel statistics and topology configurations, the network performance can be significantly improved when the groups in the network coordinate their transmissions according to an optimal schedule. Further, in many cases, even the use of randomly generated parallel schedules can provide considerably higher performance than traditional TDMA.

关键词： Parallel TDMA sequential TDMA transmission scheduling random schedules distributed implementation interference

来源：评论

学校读者我要写书评

暂无评论

A Reassessment on Applying Protocol Interference Model Under Rayleigh Fading: From Perspective of Link Scheduling

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2024年第1期32卷 238-252页

作者： Yu, Kan Yu, Jiguo Feng, Zhiyong Chen, Honglong Beijing Univ Posts & Telecommun Coll Comp Sci & Engn Sch Informat & Commun Engn Beijing 100088 Shandong Peoples R China China Univ Petr Coll Comp Sci & Technol Qingdao 266555 Peoples R China Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing 100088 Peoples R China China Univ Petr Coll Control Sci & Engn Qingdao 266555 Peoples R China

Link scheduling plays a pivotal role in accommodating stringent reliability and latency requirements. In this paper, we focus on the availability and effectiveness of applying protocol interference model (PIM) under Rayleigh fading model to solve the problem. The motivation is that PIM caters to distributed link scheduling algorithm design, but usually lead to irrationality due to its localization behavior. While Rayleigh fading model can accurately describe the inherent characteristic of wireless signal propagation, but the features of global interference and channel fading make algorithm design more challenging. To be specific, we first remove the effect of channel fading on algorithmic design by establishing the relationship between Rayleigh fading model and non-fading model. We then propose a centralized once link elimination (OLE) algorithm by utilizing local nature of PIM, and achieve its distributed implementation based on the message delivery with time complexity of O(?(max) ln ?(max)), where ?(max) is the maximum number of nodes around a given node inside some range. Furthermore, based on random contention resolution, we design another distributed algorithm to schedule all the links within O(?(3)(max) ln ?(max)) rounds. Simulations show that the PIM is of great confidence as same as Rayleigh fading model, and the proposed algorithms outperform three popular link scheduling algorithms.

关键词： Link scheduling PIM and IBM Rayleigh fading distributed implementation time complexity

来源：评论

学校读者我要写书评

暂无评论

distributed Resource Management in Downlink Cache-Enabled Multi-Cloud Radio Access Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2022年第12期71卷 13120-13136页

作者： Reifert, Robert-Jeron Ahmad, Alaa Alameer Dahrouj, Hayssam Chaaban, Anas Sezgin, Aydin Al-Naffouri, Tareq Y. Alouini, Mohamed-Slim Ruhr Univ Bochum Digital Commun Syst D-44801 Bochum Germany Volkswa Gen Infotainment GmbH D-44799 Bochum Germany King Abdullah Univ Sci & Technol Thuwal 23955 Saudi Arabia Univ British Columbia Sch Engn Kelowna BC V1V 1V7 Canada

A compound of several clouds, jointly managing large-scale inter-cloud and intra-cloud interference, promises to be a practical solution to account for the ambitious premises of beyond fifth generation networks. This paper considers a multi-cloud radio access network (MC-RAN), where each cloud is connected to a distinct set of cache-enabled base stations (BSs) via limited capacity fronthaul links. The BSs are equipped with local cache storage and baseband processing capabilities, as a means to alleviate the fronthaul congestion problem. The paper then investigates the problem of jointly assigning users to clouds and determining their beamforming vectors so as to maximize the network-wide energy efficiency subject to fronthaul capacity and transmit power constraints. This paper solves such a mixed discrete-continuous, non-convex optimization problem using fractional programming and successive inner-convex approximation techniques to deal with the non-convexity of the continuous part of the problem, and $l_{0}$-norm approximation to account for the binary association part. A highlight of the proposed algorithm is its capability of being implemented in a distributed fashion across the multiple clouds through a reasonable amount of information exchange. The numerical simulations illustrate the pronounced role the proposed algorithm plays in improving the energy efficiency of large-scale cache-enabled MC-RANs, especially at the high interference regime.

关键词： Dinkelbach algorithm distributed implementation energy efficiency fractional programming multi-cloud radio access network successive inner convex approximation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：