|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Utility-based bandwidth allocation algorithm for heterogeneous wireless networks显示文摘In next generation wireless network (NGWN), mobile users are capable of connecting to the core network through various heterogeneous wireless access networks, such as cellular network, wireless metropolitan area network (WMAN), wireless local area network (WLAN), and ad hoc network. NGWN is expected to provide high-bandwidth connectivity with guaranteed quality-of-service to mobile users in a seamless manner; however, this desired function demands seamless coordination of the heterogeneous radio access network (RAN) technologies. In recent years, some researches have been conducted to design radio resource management (RRM) architectures and algorithms for NGWN; however, few studies stress the problem of joint network performance optimization, which is an essential goal for a cooperative service providing scenario. Furthermore, while some authors consider the competition among the service providers, the QoS requirements of users and the resource competition within access networks are not fully considered. In this paper, we present an interworking integrated network architecture, which is responsible for monitoring the status information of different radio access technologies (RATs) and executing the resource allocation algorithm. Within this architecture, the problem of joint bandwidth allocation for heterogeneous integrated networks is formulated based on utility function theory and bankruptcy game theory. The proposed bandwidth allocation scheme comprises two successive stages, i.e., service bandwidth allocation and user bandwidth allocation. At the service bandwidth allocation stage, the optimal amount of bandwidth for different types of services in each network is allocated based on the criterion of joint utility maximization. At the user bandwidth allocation stage, the service bandwidth in each network is optimally allocated among users in the network according to bankruptcy game theory. Numerical results demonstrate the efficiency of the proposed algorithm. | CHAI Rong WANG XiuJuan CHEN QianBin SVENSSON Tommy | 2013 | Science China(Information Sciences)2013，56，2： | 4 |
| 2 | Modelling and simulation of Rayleigh fading,path loss,and shadowing fading for wireless mobile networks显示文摘 | Zhi Ren Guangyu Wang Qianbin Chen | 2011 | Simulation Modelling Practice and Theory2011，，19： | 1 |
| 3 | Modelling and simulation of Rayleigh fading, path loss, and shadowing fading for wireless mobile networks显示文摘 | Ren Zhi Wang Guangyu Chen Qianbin | 2011 | Simulation Modelling Practice and Theory2011，19，2： | 1 |
| 4 | Chinese brushes: From controllable liquid manipulation to template-free printing microlines显示文摘作为为书法和画的一台传统的作品仪器,中国刷子由于它 controllably 处理液体墨水的能力在最后 5,000 年享受了高名声,并且广泛地被用来作为文化通讯的一个工具扔墨水进某些人物或图。在这微型评论,我们首先显示出在一把中国刷子的可控制的液体转移的关键怎么躺在刚突现的头发的各向异性的多尺度的结构的特征。然后,绘画从这的灵感,在抽的可控制的液体的应用,高度有效的液体转移和没有模板的打印 microlines 被探讨。我们想象在液体操作的中国刷子和他们的应用的基础在这评论提及,这可以也被扩大到另外的液体阶段功能的材料系统。 | Qianbin wang Qingan Meng Huan Liu Lei Jiang | 2015 | Nano Research2015，8，1： | 1 |
| 5 | Energy Efficient Constrained Shortest Path First-Based Joint Resource Allocation and Route Selection for Multi-Hop CRNs显示文摘Cognitive radio networks(CRNs) are expected to improve spectrum utilization efficiently by allowing secondary users(SUs) to opportunistically access the licensed spectrum of primary users(PUs).In CRNs,source and destination SUs may achieve information interaction in an ad hoc manner.In the case that no direct transmission link between the SU transmission pairs is available,multi-hop relay SUs can be applied to forward information for the source and destination SUs,resulting in multi-hop CRNs.In this paper,we consider a multi-hop CRN consisting of multiple PUs,SU transmission pairs and relay SUs.Stressing the importance of transmission hops and the tradeoff between data rate and power consumption,we propose an energy efficient constrained shortest path first(CSPF)-based joint resource allocation and route selection algorithm,which consists of two sub-algorithms,i.e.,CSPF-based route selection sub-algorithm and energy efficient resource allocation sub-algorithm.More specifically,we first apply CSPF-based route selection sub-algorithm to obtain the shortest candidate routes(SCRs) between the SU pair under the transmission constraints.Then,an energy efficient resource allocation problem of the SCRs is formulated and solved by applying iterative algorithm and Lagrange dual method.Simu-lation results demonstrate the effectiveness of the proposed algorithm. | Qianbin Chen Ling Wang Yuanpeng Gao Rong Chai Xiaoge Huang | 2017 | China Communications2017，14，12： | 1 |
| 6 | Joint Optimization of Energy Consumption and Network Latency in Blockchain-Enabled Fog Computing Networks显示文摘Fog computing is considered as a solution to accommodate the emergence of booming requirements from a large variety of resource-limited Internet of Things(IoT)devices.To ensure the security of private data,in this paper,we introduce a blockchain-enabled three-layer device-fog-cloud heterogeneous network.A reputation model is proposed to update the credibility of the fog nodes(FN),which is used to select blockchain nodes(BN)from FNs to participate in the consensus process.According to the Rivest-Shamir-Adleman(RSA)encryption algorithm applied to the blockchain system,FNs could verify the identity of the node through its public key to avoid malicious attacks.Additionally,to reduce the computation complexity of the consensus algorithms and the network overhead,we propose a dynamic offloading and resource allocation(DORA)algorithm and a reputation-based democratic byzantine fault tolerant(R-DBFT)algorithm to optimize the offloading decisions and decrease the number of BNs in the consensus algorithm while ensuring the network security.Simulation results demonstrate that the proposed algorithm could efficiently reduce the network overhead,and obtain a considerable performance improvement compared to the related algorithms in the previous literature. | Huang Xiaoge Yin Hongbo Cao Bin Wang Yongsheng Chen Qianbin Zhang Jie | 2024 | China Communications2024，21，4： | 0 |
| 7 | Actor-Critic-Based UAV-Assisted Data Collection in the Wireless Sensor Network显示文摘Wireless Sensor Network(WSN)is widely utilized in large-scale distributed unmanned detection scenarios due to its low cost and flexible installation.However,WSN data collection encounters challenges in scenarios lacking communication infrastructure.Unmanned aerial vehicle(UAV)offers a novel solution for WSN data collection,leveraging their high mobility.In this paper,we present an efficient UAV-assisted data collection algorithm aimed at minimizing the overall power consumption of the WSN.Firstly,a two-layer UAV-assisted data collection model is introduced,including the ground and aerial layers.The ground layer senses the environmental data by the cluster members(CMs),and the CMs transmit the data to the cluster heads(CHs),which forward the collected data to the UAVs.The aerial network layer consists of multiple UAVs that collect,store,and forward data from the CHs to the data center for analysis.Secondly,an improved clustering algorithm based on K-Means++is proposed to optimize the number and locations of CHs.Moreover,an Actor-Critic based algorithm is introduced to optimize the UAV deployment and the association with CHs.Finally,simulation results verify the effectiveness of the proposed algorithms. | Huang Xiaoge Wang Lingzhi He Yong Chen Qianbin | 2024 | China Communications2024，21，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员