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

Fairness aware multiple drone base station deployment

IET COMMUNICATIONS 2018年第4期12卷 425-431页

作者： Akarsu, Alper Girici, Tolga TOBB Univ Econ & Technol Elect & Elect Engn Ankara Turkey HAVELSAN Command Control & Combat Syst Ankara Turkey

The recent advances in drone technology significantly improved the effectiveness of applications such as border surveillance, disaster management, seismic surveying, and precision agriculture. The use of drones as base stations to improve communication in the next generation wireless networks is another attractive application. However, the deployment of drone base stations (DBSs) is not an easy task and requires a carefully designed strategy. Fairness is one of the most important metrics of tactical communications or a disaster-affected network and must be considered for the efficient deployment of DBSs. In this study, a fairness-aware multiple DBS deployment algorithm is proposed. As the proposed algorithm uses particle swarm optimisation (PSO) that requires significant processing power, simpler algorithms with faster execution times are also proposed and the results are compared. The simulations are performed to evaluate the performance of the algorithms in two different network scenarios. The simulation results show that the proposed PSO-based method finds the three-dimensional locations of DBSs, achieving the best fairness performance with a minimum number of DBSs for deployment. However, it is shown that the proposed suboptimal algorithm performs very close to the PSO-based solution and requires significantly less processing time.

关键词： remotely operated vehicles aircraft communication particle swarm optimisation next generation networks radio networks fairness aware multiple drone base station deployment next generation wireless networks tactical communications disaster-affected network fairness-aware multiple DBS deployment algorithm particle swarm optimisation PSO three-dimensional locations suboptimal algorithm

来源：评论

学校读者我要写书评

暂无评论

A penalty search algorithm for the obstacle neutralization problem

引用

COMPUTERS & OPERATIONS RESEARCH 2015年 53卷 165-175页

作者： Alkaya, Ali Fuat Aksakalli, Vural Priebe, Carey E. Marmara Univ Dept Comp Engn TR-34722 Istanbul Turkey Istanbul Sehir Univ Dept Ind Engn TR-34662 Istanbul Turkey Johns Hopkins Univ Dept Appl Math & Stat Baltimore MD 21218 USA

We consider a path planning problem wherein an agent needs to swiftly navigate from a source to a destination through an arrangement of obstacles in the plane. We suppose the agent has a limited neutralization capability in the sense that it can safely pass through an obstacle upon neutralization at a cost added to the traversal length. The agent's goal is to find the sequence of obstacles to be neutralized en route that minimizes the overall traversal length subject to the neutralization limit. We call this problem the obstacle neutralization problem (ONP), which is essentially a variant of the intractable weight-constrained shortest path problem in the literature. In this study, we propose a simple, yet efficient and effective suboptimal algorithm for ONP based on the idea of penalty search and we present special cases where our algorithm is provably optimal. Computational experiments involving both real and synthetic naval minefield data are also presented. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Combinatorial optimization Path planning Weight-constrained shortest path suboptimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Secure resource allocation for green two-way relay networks with mutually untrusted relay and mobile users

引用

IET NETWORKS 2020年第1期9卷 1-6页

作者： Wang, Fei Qin, Changchun Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuit & Intelligent Chongqing 400715 Peoples R China Chongqing Coll Elect Engn Dept Artificial Intelligence & Big Data Chongqing 401331 Peoples R China

The authors investigate secure resource allocation for an orthogonal frequency division multiple access two-way relay network, which has several pairs of mobile users (MUs) and one energy harvesting (EH) relay. In this network, the relay is untrusted and each MU pair may also overhear the other MU pairs' confidential information. In particular, to forward information for each MU, the relay adopts power splitting technique to harvest energy from radio frequency signals emitted by each MU. For this scenario, which has hardly been considered, the joint problem of subcarrier allocation, power control, and power splitting ratio selection is formulated, with the aim to maximise the total secrecy rate of all MUs. A suboptimal algorithm with low complexity and satisfactory performance is proposed to solve the formulated non-convex problem.

关键词： concave programming power control resource allocation relay networks (telecommunication) OFDM modulation energy harvesting telecommunication security frequency division multiple access telecommunication control telecommunication power management secure resource allocation mutually untrusted relay mobile users energy harvesting relay power splitting technique radio frequency signals subcarrier allocation power splitting ratio selection green two-way relay networks orthogonal frequency division multiple access two-way relay network MU pair confidential information power control suboptimal algorithm nonconvex problem

来源：评论

学校读者我要写书评

暂无评论

CURVE FITTING BY A PIECEWISE CUBIC POLYNOMIAL

引用

COMPUTING 1976年第4期16卷 329-338页

作者： ICHIDA, K YOSHIMOTO, F KIYONO, T KYOTO UNIV DEPT INFORMATION SCIKYOTOJAPAN AKASHI TECH COLL AKASHIJAPAN

This paper deals with curve fitting by a piecewise cubic polynomial which is continuous with its first derivative. A knot is inserted successively until a certain criterion is satisfied. Then a suboptimal algorithm is... 详细信息

关键词： Computational Mathematic suboptimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Joint Subcarrier Pairing and Power Allocation for DF-Relayed OFDM Cognitive Systems

Joint Subcarrier Pairing and Power Allocation for DF-Relayed...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Shaat, Musbah Bader, Faouzi Ctr Tecnol Telecomunicac CTTC Barcelona Spain

ISBN: (纸本)9781424492688

In this paper, the problem of resource allocation in OFDM based decode-and-forward (DF) cognitive radio (CR) system is considered. The objective is to maximize the CR system throughput by optimizing the subcarrier pairs and powers. The interference introduced to the primary system should not exceed the prescribed interference temperature limit. The resources are optimized jointly by applying the dual decomposition technique to get asymptotically optimal solution. In addition, a suboptimal algorithm that performs the resources allocation in two phases is proposed. By the suboptimal algorithm, the subcarrier pairing is first performed considering the channels quality as well as the interference introduced to the primary system. Afterwards, the powers are allocated in the second phase by applying a waterfilling-like algorithm. The suboptimal algorithm reduces significantly the computational complexity with small performance degradation. The simulation results confirm the efficiency of the proposed algorithm.

关键词： CR system DF-relayed OFDM cognitive system Interference constraints OFDM OFDM based decode-and-forward cognitive radio system OFDM modulation Optimization Relays Resource management Strontium asymptotically optimal solution channel quality cognitive radio communication complexity computational complexity decode and forward communication dual decomposition technique interference temperature limit joint subcarrier pairing power allocation radiofrequency interference resource allocation subcarrier multiplexing subcarrier pair optimization subcarrier pairing suboptimal algorithm waterfilling-like algorithm wireless channels

来源：评论

学校读者我要写书评

暂无评论

User Grouping algorithm for Power Minimization in STBC MC-CDMA systems

User Grouping Algorithm for Power Minimization in STBC MC-CD...

引用

21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Phasouliotis, Antonis So, Daniel K. C. Univ Manchester Sch Elect & Elect Engn Manchester Lancs England

ISBN: (纸本)9781424480166

In this paper, we propose user grouping algorithms to provide power minimization in grouped STBC MC-CDMA systems. Depending on the channel fading conditions, power control is utilized to minimize the total transmitted power under a BER constraint. When the allocation is performed without a fair data rate requirement, we provide the optimal solution to the minimization problem. However when some fairness is considered, the optimal solution requires high computational complexity. We solve this problem by proposing two suboptimal algorithms. Simulation results illustrate a significantly reduced power consumption in comparison with other techniques.

关键词： BER STBC MC-CDMA system channel fading condition code division multiple access computational complexity data rate requirement error statistics fading channels high computational complexity optimal solution power consumption power control power control power minimization problem power transmission space-time block codes suboptimal algorithm user grouping algorithm

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT MATRIX EMBEDDING TECHNIQUE BY USING SUBMATRIX TRANSFORM FOR GRAYSCALE IMAGES

引用

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL 2019年第4期15卷 1565-1580页

作者： Chang, Hsi-Yuan Wang, Jyun-Jie Lin, Chi-Yuan Chen, Chin-Hsing Natl Cheng Kung Univ Inst Comp & Commun Engn 1 Univ Rd Tainan 70101 Taiwan Natl Cheng Kung Univ Dept Elect Engn 1 Univ Rd Tainan 70101 Taiwan Natl Chin Yi Univ Technol Dept Comp Sci & Informat Engn 57 Zhongshan Rd Taichung 41170 Taiwan

Matrix embedding (ME) is a high performance technique for steganography. Unlike optimal matrix embedding algorithms, which require maximum likelihood (ML) decoding to determine the minimum modified changes, this study proposes an adaptive suboptimal algorithm, called the submatrix transformation matrix embedding (STME) algorithm. The STME algorithm combines the original ME technique with adaptive techniques to improve embedding efficiency and complexity. Several concerns are related to cover location selection, such as the modification of less significant covers, changeable parts of the cover, and forced modification of the cover when embedding a secret message into the cover. The STME algorithm can embed q-ary message vectors at arbitrary specified cover locations. Consequently, the embedded message can be recovered at the receiver, without any damage to the associated cover locations. The simulation results indicate that the STME algorithm offers a trade-off between computational time complexity and embedding efficiency. Moreover, the experimental results show that the STME algorithm has the advantage of adaptive embedding, unlike conventional ME algorithms. The results also show efficiency difference between the optimal ME algorithm and the STME algorithm.

关键词： Matrix embedding Steganography Maximum likelihood (ML) decoding suboptimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Transmit Beamforming and Admission Control for Multicast with Uncertain User Partition

Transmit Beamforming and Admission Control for Multicast wit...

引用

IEEE/CIC International Conference on Communications in China

作者： Bin Hu Cunqing Hua Cailian Chen Xinping Guan Dept. of Autom. Shanghai Jiao Tong Univ. Shanghai China

In this paper, we consider the multicast beamforming problem in a downlink wireless system. Then, an optimization problem is formulated to find the optimal user-group assignment scheme and beamforming weight vectors, such that the number of admitted users is maximized with the minimum transmit power under the quality of service (QoS) requirement constraints of each individual user. Unfortunately, the constraints are nonlinear since they consist of the products of binary variables and continuous variables. As a solution, the big-M approach is adopted to transform the problem to a mixed integer quadratically constrained quadratic programming (MIQCQP) problem. Then, an optimal and a suboptimal algorithm are proposed based on the branch and bound (BnB) method. In addition, a heuristic algorithm is designed in order to trade off the performance between computational complexity and accuracy. Simulation results are provided to demonstrate the performance of the proposed algorithms in terms of the number of admitted users and energy consumption.

关键词： array signal processing computational complexity integer programming multicast communication quadratic programming quality of service radiocommunication telecommunication congestion control tree searching MI-QCQP problem QoS admission control branch and bound method downlink wireless system energy consumption heuristic algorithm minimum transmit power mixed integer quadratically constrained quadratic programming multicast beamforming transmission optimal user-group assignment scheme optimization problem suboptimal algorithm uncertain user partition Array signal processing Complexity theory Downlink Heuristic algorithms Interference Optimization Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：