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

Low-Complexity Energy-Efficient Power Allocation With buffer constraint in HSR Communications

IEEE ACCESS 2019年 7卷 113867-113879页

作者： Wang, Xiaoming Yu, Mi Hu, Jinling Xu, Youyun Nanjing Univ Posts & Telecommun Coll Telecommun & Informat Engn Nanjing 210003 Jiangsu Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China

In this paper, we investigate the energy-efficient power allocation for downlink distributed antenna system (DAS) with buffer size constraint in high-speed railway (HSR) scenarios. We design the power allocation at different times for HSR communications, utilizing the characteristics of fixed moving path of trains. A key issue we discuss is the matching problem between the data arrival process and instantaneous wireless transmission process under the buffer size constraint. We formulate the energy-efficient power allocation problem with the requirement of buffer size as a non-convex optimization problem. By a parameterized transformation and an iterative algorithm, we derive the optimal solution at different time phases. Then, to reduce complexity of the multiple iterations, we present a low-complexity algorithm by analyzing the feasible region of the optimal solution. Simulation results demonstrate that the proposed power allocation schemes can achieve the optimal energy efficiency (EE) and avoid data overflow. Moreover, with a smaller number of iterations, the low-complexity algorithm can achieve the same EE performance as the optimal algorithm based on the bisection method.

关键词： Power allocation buffer constraint low-complexity high-speed railway energy efficiency

来源：评论

学校读者我要写书评

暂无评论

On throughput capacity of large-scale ad hoc networks with realistic buffer constraint

引用

WIRELESS NETWORKS 2017年第1期23卷 193-204页

作者： Xu, Yang Liu, Jia Shen, Yulong Li, Xiangning Jiang, Xiaohong Xidian Univ Sch Econ & Management Xian 710071 Shaanxi Peoples R China Future Univ Hakodate Sch Syst Informat Sci Hakodate Hokkaido 0418655 Japan Xidian Univ Sch Comp Sci & Technol Xian 710071 Shaanxi Peoples R China Xidian Univ Sch Mech Engn Xian 710071 Shaanxi Peoples R China

The problem of determining the throughput capacity of an ad hoc network is addressed. Previous studies mainly focused on the infinite buffer scenario, however, in this paper we consider a large-scale ad hoc network with a scalable traffic model, where each node has a buffer of size B packets, and explore its corresponding per node throughput performance. We first model each node as a G/G/1/B queuing system which incorporates the important wireless interference and medium access contention. With the help of this queuing model, we then explore the properties of the throughput upper bound for all scheduling schemes. Based on these properties, we further develop an analytical approach to derive the expressions of per node throughput capacity for the concerned buffer-limited ad hoc network. The results show that the cumulative effect of packet loss due to the per hop buffer overflowing will degrade the throughput performance, and the degradation is inversely proportional to the buffer size. Finally, we provide the specific scheduling schemes which enable the per node throughput to approach its upper bound, under both symmetrical and unsymmetrical network topologies.

关键词： Capacity Ad hoc networks buffer constraint Queuing analysis Network scheduling

来源：评论

学校读者我要写书评

暂无评论

Stability of Networked Control Systems With Polytopic Uncertainty and buffer constraint

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2010年第5期55卷 1202-1208页

作者： Wu, Dongxiao Wu, Jun Chen, Sheng Chu, Jian Zhejiang Univ Inst Cyber Syst & Control State Key Lab Ind Control Technol Hangzhou 310027 Peoples R China Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

We consider the stability of the discrete-time networked control systems (NCSs) with polytopic uncertainty, where a smart controller is updated with the buffered sensor information at stochastic intervals and the amount of the buffered data received by the controller under the buffer capacity constraint is also random. We establish sufficient conditions for guaranteeing the exponential stability of generic switched NCSs and the exponential mean square stability of Markov-chain driven NCSs, respectively. An illustrative example is given to demonstrate the effectiveness of our results.

关键词： buffer constraint networked control systems (NCSs) polytopic uncertainty stochastic systems

来源：评论

学校读者我要写书评

暂无评论

On Performance Modeling for MANETs Under General Limited buffer constraint

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2017年第10期66卷 9483-9497页

作者： Liu, Jia Xu, Yang Shen, Yulong Jiang, Xiaohong Taleb, Tarik Xidian Univ State Key Lab Integrated Serv Network Xian 710071 Peoples R China Natl Inst Informat Ctr Cybersecur Res & Dev Tokyo 1018430 Japan Xidian Univ Sch Econ & Management Xian 710071 Peoples R China Future Univ Hakodate Sch Syst Informat Sci Hakodate Hokkaido 0418655 Japan Sejong Univ Seoul South Korea Aalto Univ Espoo 02150 Finland

Understanding the real achievable performance of mobile ad hoc networks (MANETs) under practical network constraints is of great importance for their applications in future highly heterogeneous wireless network environments. This paper explores, for the first time, the performancemodeling for MANETs under a general limited buffer constraint, where each network node maintains a limited source buffer of size B-s to store its locally generated packets and also a limited shared relay buffer of size B-r to store relay packets for other nodes. Based on the Queuing theory and birth-death chain theory, we first develop a general theoretical framework to fully depict the source/relay buffer occupancy process in such a MANET, which applies to any distributed MAC protocol and any mobility model that leads to the uniform distribution of nodes' locations in steady state. With the help of this framework, we then derive the exact expressions of several key network performance metrics, including achievable throughput, throughput capacity, and expected end-to-end delay. We further conduct case studies under two network scenarios and provide the corresponding theoretical/simulation results to demonstrate the application as well as the efficiency of our theoretical framework. Finally, we present extensive numerical results to illustrate the impacts of buffer constraint on the performance of a buffer-limited MANET.

关键词： buffer constraint delay mobile ad hoc networks performance modeling throughput

来源：评论

学校读者我要写书评

暂无评论

State Estimation for Networked Systems With Markov Driven Transmission and buffer constraint

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第12期51卷 7727-7734页

作者： Xu, Yong Yang, Lixin Wang, Zhuo Rao, Hongxia Lu, Renquan Guangdong Univ Technol Guangdong Prov Key Lab Intelligent Decis & Cooper Guangzhou 510006 Peoples R China Guangdong Univ Technol Sch Automat Guangzhou 510006 Peoples R China Beihang Univ Res Inst Frontier Sci Beijing 100191 Peoples R China Beihang Univ Key Lab Minist Ind & Informat Technol Quantum Sen Beijing 100191 Peoples R China Beihang Univ Beijing Adv Innovat Ctr Big Data Based Precis Med Beijing 100191 Peoples R China Beijing Acad Quantum Informat Sci Beijing 100193 Peoples R China

This article investigates the problem of state estimation for discrete-time systems with a Markov driven transmission strategy. A buffer with limited capacity is used to store the latest measurements, and they are transmitted simultaneously once the system accesses to the shared channel. A buffer-dependent smart estimator is then proposed to process the received measurements. A convex sufficient condition concerning the exponential meansquare stability and the l(2) - l(infinity) performance is established for the estimation error system to design the estimator gains. Finally, two examples are presented to illustrate the effectiveness of the derived result under different conditions.

关键词： buffer constraint Markov driven transmission networked systems state estimation

来源：评论

学校读者我要写书评

暂无评论

Emergency Data Gathering with buffer constraint in Actuator-based Wireless Sensor Networks 10

Emergency Data Gathering with Buffer Constraint in Actuator-...

引用

10th IEEE Conference on Industrial Electronics and Applications

作者： Guo, Ying Hu, Jiankun Cent S Univ Informat Sci & Engn Changsha 410083 Hunan Peoples R China Univ New S Wales Sch Engn & Informat Technol Australian Def Force Acad Canberra ACT 2600 Australia

ISBN: (纸本)9781479983896

Employing the mobility of actuators to achieve data collection is a challenging problem in the actuator-based wireless sensor networks (AWSNs). The related actuator is usually required to collect the whole information within time delays. However, in practice not all the information need to be collected immediately except the emergencies. In this paper, a mobile emergency data gathering algorithm is proposed on a basis of an improved dynamic shortest path tree. In this algorithm, the dynamic shortest tree is constructed firstly. Subsequently, polling points are chosen to gather data acquired by the sensor network nodes in related sub-regions when considering the transmission hops. Finally, the buffer constraints and emergencies are both taken as key parameters to select a subset of polling points as anchor points for the actuator. The optimal path for the actuator is achieved to minimize energy consumption considering the communication radius. Simulation results demonstrate that this algorithm can promptly response to emergent events and reduce the packet loss with the extended lifetime of network.

关键词： Wireless sensor and actuator networks buffer constraint mobile data gathering emergencies

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity Energy Efficient Power Allocation with buffer constraint for Downlink DAS in HSR Scenarios

Low-Complexity Energy Efficient Power Allocation with Buffer...

引用

IEEE International Conference on Computer and Communications

作者： Mi Yu Xiaoming Wang Jinling Hu Youyun Xu Nion Engineering Reserch Cener of Counicions Neworking Nnjing Universiy of Poss nd TeecounicionsNion Engineering Reserch Cener of Counicions Neworking Nnjing Universiy of Poss nd Teecounicions Nion Mobie Counicions Reserch Lborory Souhes UniversiyNion Engineering Reserch Cener of Counicions Neworking Nnjing Universiy of Poss nd TeecounicionsNion Engineering Reserch Cener of Counicions Neworking Nnjing Universiy of Poss nd Teecounicions

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

In this paper, we investigate the low-complexity energy efficient (EE) power allocation with buffer constraint for downlink distributed antenna system (DAS) in high speed railway (HSR) communication. Then, we formulate the EE optimization power allocation problem with the requirement of buffer size. Because the traditional method is used to solve this optimization problem, multi-layer iteration is needed, which leads to the low efficiency of the solving process. Therefore, to deal with multiple iterations, we present a low-complexity algorithm by analyzing the feasible region of the optimal solution. Simulation results demonstrate that the low-complexity algorithm can achieve the same EE performance as the optimal algorithm based on the bisection method and reduce the number of iterations.

关键词： Energy-efficientt Low-complexity buffer constraint Distributed antenna system High-speed railway

来源：评论

学校读者我要写书评

暂无评论

Partial-Nodes-Based State Estimation for Complex Networks with buffer constraints 2

Partial-Nodes-Based State Estimation for Complex Networks wi...

引用

2nd Conference on Fully Actuated System Theory and Applications (CFASTA)

作者： Zhang, Lintao Xian Jiaotong Livepool Univ Sch Adv Technol Suzhou 215123 Peoples R China

ISBN: (纸本)9798350332162

This article focuses on the ultimate boundedness estimation problem for a class of partial-node-based (PNB) complex networks (CNs) with buffer constraint. The aim of the addressed estimation problem is designing an estimator for the PNB complex network so that the estimation error system is ultimately bounded. Sufficient conditions are obtained to ensure the ultimate boundedness of the dynamics of the estimation error system. Furthermore, the ideal estimator gain is derived through solving a convex optimization problem. Finally, an illustrative example is provided to illustrate the correctness and effectiveness of the proposed estimator designing approach.

关键词： Partial-Nodes-Based (PNB)State Estimation Complex Networks(CNs) buffer constraint Ultimate Boundedness Estimation

来源：评论

学校读者我要写书评

暂无评论

Throughput Maximization of Mixed FSO/RF UAV-Aided Mobile Relaying With a buffer

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2021年第1期20卷 683-694页

作者： Lee, Ju-Hyung Park, Ki-Hong Ko, Young-Chai Alouini, Mohamed-Slim Korea Univ Sch Elect & Comp Engn Seoul 02841 South Korea King Abdullah Univ Sci & Technol KAUST Elect Engn Program Comp Elect Math Sci & Engn Div Thuwal 23955 Saudi Arabia

In this paper, we investigate a mobile relaying system assisted by an unmanned aerial vehicle (UAV) with a finite size of the buffer. Under the buffer size limit and delay constraints at the UAV relay, we consider a dual-hop mixed free-space optical/radio frequency (FSO/RF) relaying system (i.e., the source-to-relay and relay-to-destination links employ FSO and RF links, respectively). Taking an imbalance in the transmission rate between RF and FSO links into consideration, we address the trajectory design of the UAV relay node to obtain the maximum data throughput at the ground user terminal. Specifically, we classify two relaying transmission schemes according to the delay requirements, i.e., i) delay-limited transmission and ii) delay-tolerant transmission. Accordingly, we propose an iterative algorithm to effectively obtain the locally optimal solution to our throughput optimization problems and further present the complexity analysis of this algorithm. Through this algorithm, we present the resulting trajectories over the atmospheric condition, the buffer size, and the delay requirement. In addition, we show the optimum buffer size and the throughput-delay tradeoff for a given system. The numerical results validate that the proposed buffer-aided and delay-considered mobile relaying scheme obtains 223.33% throughput gain compared to the conventional static relaying scheme.

关键词： Mixed FSO/RF communication UAV-aided mobile relaying throughput maximization buffer constraint delay-considered design

来源：评论

学校读者我要写书评

暂无评论

A new fuzzy based scheme to optimize buffer constrained throughput of a wireless link using adaptive modulation, coding and transmit power

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2017年第3期32卷 2499-2507页

作者： Taki, Mehrdad Univ Qom Qom Iran

This paper presented a new fuzzy based optimization framework for wireless link adaptation which maximizes throughput subject to buffer length, Bit Error Rate (BER) and average power constraints. buffer constrained throughput of a link is called effective capacity. At first, we present two schemes to optimize the effective capacity of a wireless link, in an analytical approach, with constant or adaptive power transmission. As shown, the scheme with constant power transmission works without any need to probability density function (PDF) of channel's SNR. However, a considerable performance improvement is seen by using adaptive power transmission at the cost of more complicated design. In analytical approach, provisioning average power constraint requires knowledge on PDF of the link's SNR which may not be available in practical systems especially mobile networks. We design a new fuzzy based scheme for adaptive power transmission without any need to PDF which provide instantaneous BER, buffer and average power constraints. Our numerical evaluations for adaptive LDPC or convolutional coded, QAM modulated transmission, show that after a reasonable period of time the throughput of our proposed scheme converges to its optimum value by analytical approach.

关键词： Link adaptation adaptive modulation and coding buffer constraint cross layer design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：