容量受限网络选择中的时延影响分析

文中在用户容量受限的异构无线网络环境下,基于进化博弈理论研究了时延对用户网络选择行为的影响。设计了一种收益函数,以可用带宽和网络负载表征网络性能,并在收益函数中加入了惩罚项,使得理性用户不会去选择不可行的策略;提出了一种集中式的带时延的进化博弈实现算法,分析了迭代步长的选取。数值与仿真结果表明,网络存在时延的条件下,设计的收益函数和算法仍能保证种群演进到均衡状态。     

Multimedia Service Discrimination Based on Fair Resource Allocation Using Bargaining Solutions

We deal with a resource allocation problem for multimedia service discrimination in wireless networks. We assume that a service provider allocates network resources to users who can choose and access one of the discriminated services. To express the rational service selection of users, the utility function of users is devised to reflect both service quality and cost. Regarding the utility function of a service provider, total profit and efficiency of resource usage have been considered. The proposed service discrimination framework is composed of two game models. An outer model is a repeated Stackelberg game between a service provider and a user group, while an inner model is a service selection game among users, which is solved by adopting the Kalai‐Smorodinsky bargaining solution. Through simulation experiments, we compare the proposed framework with existing resource allocation methods according to user cost sensitivity. The proposed framework performed better than existing frameworks in terms of total profit and fairness.     

A Noncooperative Game-Theoretic Framework for Radio Resource Management in 4G Heterogeneous Wireless Access Networks

Fourth generation (4G) wireless networks will provide high-bandwidth connectivity with quality-of-service (QoS) support to mobile users in a seamless manner. In such a scenario, a mobile user will be able to connect to different wireless access networks such as a wireless metropolitan area network (WMAN), a cellular network, and a wireless local area network (WLAN) simultaneously. We present a game-theoretic framework for radio resource management (that is, bandwidth allocation and admission control) in such a heterogeneous wireless access environment. First, a noncooperative game is used to obtain the bandwidth allocations to a service area from the different access networks available in that service area (on a long-term basis). The Nash equilibrium for this game gives the optimal allocation which maximizes the utilities of all the connections in the network (that is, in all of the service areas). Second, based on the obtained bandwidth allocation, to prioritize vertical and horizontal handoff connections over new connections, a bargaining game is formulated to obtain the capacity reservation thresholds so that the connection-level QoS requirements can be satisfied for the different types of connections (on a long-term basis). Third, we formulate a noncooperative game to obtain the amount of bandwidth allocated to an arriving connection (in a service area) by the different access networks (on a short-term basis). Based on the allocated bandwidth and the capacity reservation thresholds, an admission control is used to limit the number of ongoing connections so that the QoS performances are maintained at the target level for the different types of connections.     

基于5G无人机通信的多智能体异构网络选择方法

摘 要：5G无人机通信网络和各种不同无线接入技术的结合使无线异构网络呈现多样化的发展趋势。然而，用户繁多且不同的业务请求对网络要求也不同，造成网络接入选择问题。提出了一种基于5G无人机通信的多智能体异构网络选择方法，将用户分为多个智能体，从用户端和网络端两个方面出发，将用户侧的时延和传输速率需求与网络侧的负载均衡需求综合考虑作为即时回报的相关参数，通过基于Nash Q-Learning的算法进行学习，得到异构网络环境下的网络选择决策模型。仿真结果表明，所提异构网络选择方法针对不同业务类型用户的需求均能选择合适的网络，同时均衡网络的负载，充分利用异构无线网络的资源。     

基于网络选择的视频通信带宽博弈算法

针对异构无线网络的视频通信提出一种基于网络选择的带宽博弈算法(BAG-NS)。该算法首先根据不同用户视频特性及当前网络状况,采用层次分析法和熵值法确定网络评价参数的权重,选择最佳网络;其次构建了基于收益和代价的用户效用函数,通过分布式迭代算法得到其纳什均衡解,并证明了纳什均衡的存在性和唯一性。仿真结果表明,该算法使不同特性的视频用户合理地分布在不同网络,能兼顾用户公平性和网络拥塞控制,增加网络资源利用率,减小用户视频失真,提高用户视频质量。     

分层异构网络中基于斯坦克尔伯格博弈的资源分配算法

分层异构网络中家庭基站与宏基站之间往往存在干扰,如何分配资源以获得高谱率和高容量、保证用户性能一直是研究的重点。为了解决这个问题,本文提出了一种异构蜂窝网络中基于斯坦克尔伯格博弈的家庭基站与宏基站联合资源分配算法,算法首先基于图论的分簇算法对家庭基站和宏用户进行分簇和信道分配,以减少家庭基站之间的同层干扰和家庭基站层与宏蜂窝网络的跨层干扰;然后建立了联合家庭基站发射功率以及宏用户接入选择的斯坦克尔伯格博弈,推导出达到纳什均衡时的家庭基站发射功率的表达式,并据此为宏用户选择合适的接入策略。仿真结果表明,该算法能够有效地提高宏用户的信干噪比（SINR）,家庭用户的性能也得到改善。      

异构网络选择的一种新博弈模型

目前对于异构网络选择问题的研究大多没有充分考虑用户和网络的相互选择,为此提出一种新的异构网络选择博弈模型,通过用户与网络相互选择得到该博弈的稳定匹配.算法性能分析与仿真验证表明,该模型相对于用户决策模型提高了网络满意度,相对于网络决策模型提高了用户满意度,即最终用户与网络得到了双赢.     

多业务无线网络中基于最佳等信干比的功率控制

功率控制技术是无线网络的关键技术之一。为改进多业务无线网络中基于非合作博弈的功率控制算法中纳什均衡的帕累托有效性,引入数据终端的最佳等信干比概念,使得系统中所有数据终端都工作在最佳的等信干比下,语音终端工作在语音通信服务质量门限的目标信干比门限之下。推导出一个新的分布式基于最佳等信干比的功率控制算法。仿真表明,该算法明显提高了系统的服务质量,系统中终端均具有相对较高的效用和较低的发射功率,还使得无线网络资源的使用更加合理和公平。     

GRA Based Network Selection in Heterogeneous Wireless Networks

4G wireless networks will integrate heterogeneous technologies such as Wireless LAN and third generation (3G) cellular networks and have the capability to offer various services at any time as per user requirements, anywhere with seamless interoperability at affordable cost. One important challenge in such a heterogeneous wireless environment is to enable network selection mechanisms in order to keep the mobile users always best connected anywhere and at any time. In this paper, a multi-criteria access network selection algorithm is proposed in Worldwide Interoperability for Microwave Access–Wireless Fidelity environment, in order to facilitate the provision of high quality services and at the same time to satisfy different types of user service level agreements. Analytical hierarchy process (AHP) and grey relational analysis (GRA) methods are applying for optimal access network selection. The proposed methodology combines the AHP to decide the relative weights of criteria set according to network’s performance, as well as the GRA to rank the network alternatives. The advantages of the GRA method are that the results are based on the original data, the calculations are simple and straightforward, and finally it is one of the best methods to make decision under heterogeneous wireless network environment.     

Utility-Aware Cognitive Network Selections in Wireless Infrastructures

Operators of wireless infrastructures should maintain their users “always-best-connected”. This concept means that applications should be offered to users at the best possible Quality of Service (QoS) level, taking into account profile, context and policy information. The profiles provide the user requirements and preferences, the terminal capabilities, and the application requirements. The policies provide the objectives, constraints imposed by various stakeholders, for instance the network operator (NO). The context of operation designates relevant applications, available networks and their QoS capabilities. The “always-best-connectivity” concept can be achieved by directing user terminals to the most appropriate networks of the heterogeneous infrastructure of the NO. In this respect, advanced terminal management functionality is required. This paper presents management mechanisms for utility-based cognitive network selections. The utility is used for expressing the user desire for a QoS level. Cognition mechanisms are applied for learning the QoS capabilities of candidate networks, and therefore increasing the reliability and seamlessness of the network selections. Extensive results are provided, which show the behaviour of the scheme in terms of network selections made, and computational effort required for the acquisition of the knowledge.     

认知型飞蜂窝网络中的子信道分配与功率控制

为了解决宏蜂窝与飞蜂窝构成的两层异构网络上行干扰与资源分配问题,提出了一种在认知型飞蜂窝的双层异构网中结合子信道分配和功率控制进行资源分配的框架。通过对异构网中跨层干扰问题进行分析与建模,将求解最优子信道分配矩阵和用户发射功率矩阵作为干扰管理问题的解决方法。模型中认知型飞蜂窝网络子信道和飞蜂窝网络用户构成非合作博弈,双方利用效用函数最优值进行匹配,构成初始信道分配矩阵;再由接入控制器根据接入条件从初始信道分配矩阵中筛选用户,并优化接入用户的发射功率矩阵,得到最优子信道分配矩阵和功率矩阵。仿真结果表明,优化框架提高了双层异构网络中飞蜂窝网络用户的吞吐量和接入率,降低了异构网中跨层干扰。     

Fast-Handover Mechanism between 802.11 WLAN and 802.16 WiMax with MIH in PMIPv6

As the wireless Internet services become widely available, users become able to use various Internet services without restriction in location. In particular, the demands on wireless Internet services are becoming greater, because mobile devices that support high mobility are getting smarter. However, if a user uses various wireless networks, much limitation occurs in network setting when they move a network different each other. This is because there are few appropriate handover mechanisms to support a heterogeneous network. We propose a fast-handover for heterogeneous networks that utilizes MIH in PMIPv6 to support heterogeneous networks and to reduce the handover latency time. And the performance evaluation for the proposed method was done separately for low speed and high speed mobility. The result presented shows that the suggested method has reduced latency time by 26 % and packet losses by 90 % (Avg.).     

Max-utility wireless resource management for best-effort traffic

Due to the characteristics of wireless channels, utility-based resource management in wireless networks requires a set of mechanisms that are different from those for wireline networks. This paper explores in detail why and how the requirements are different. In particular, we analyze the wireless network performance to find out the scheduling algorithm that maximizes total utility of the system. Unlike previous studies, this paper focuses on scenarios in which wireless networks are not fully loaded and all of the users are best-effort data users, i.e., there is no streaming user. Our first key conclusion is that Kleinrock's Conservation Law provides a valuable means to accurately capture the perceived rates of best-effort users in such systems. The queueing analysis further indicates that, within periods during which channel conditions are stable for each user, albeit differ from user to user, the max-utility scheduling algorithm can be derived using queueing theorem and can be readily implemented in actual systems for utility functions that are of exponential or log format. When further taking into account the time-variant nature of wireless channel conditions, our simulation results demonstrate that dynamic weighted fair queueing, with weights adjusted according to the channel conditions, can achieve highly desirable performance with great flexibility.     

Multiplicative multi-attribute auction based optimal network selection for heterogeneous wireless networks

One of the remarkable features of the next generation network is the integration of heterogeneous wireless networks,which enables mobile users with multi-mode terminals access to the best available network seamlessly.However,most of previous work only takes account of either maximizing single user’s utility or the whole network’s payoff,rarely considers the negotiation between them.In this paper,we propose a novel network selection approach using improved multiplicative multi-attribute auction(MMA).At first,an improved MMA method is put forward to define the user’s utility.Additionally,user cost is defined by considering allocated bandwidth,network load intensity and cost factor parameter.And last the best suitable network is selected according to the user’s performance-cost-ration.Simulation results confirm that the proposed scheme outperforms the existing scheme in terms of network selection’s fairness,user’s performance-cost-ration,load balancing and the number of accommodated users.     

An access cell selection algorithm for next generation mobile environments

Next generation of mobile communications will be based on a heterogeneous infrastructure comprising different wireless access systems in a complementary manner. This paper proposes a network selection algorithm based on user activity, user preferences, service requirements, and networks conditions which provides users a prospect of being always best connected within an environment of heterogeneous mobile networks. This is achieved by a learning process which allows user to select an access network based in previous connections and a cost function that helps the user to select the best network that adapts to the needs.     

Competitive Resource Sharing Based on Game Theory in Cooperative Relay Networks

This letter considers the problem of resource sharing among a relay and multiple user nodes in cooperative transmission networks. We formulate this problem as a sellers’ market competition and use a noncooperative game to jointly consider the benefits of the relay and the users. We also develop a distributed algorithm to search the Nash equilibrium, the solution of the game. The convergence of the proposed algorithm is analyzed. Simulation results demonstrate that the proposed game can stimulate cooperative diversity among the selfish user nodes and coordinate resource allocation among the user nodes effectively.     

异构融合网络中基于博弈论的网络选择方案研究

近年来,移动通信技术蓬勃发展,多种网络并存,异构融合网络中的网络选择策略成为当前热点,本文引入了一种基于博弈论的网络选择方案,通过多级判决实现最佳接入.为了降低接入网络的多个用户间的干扰,本文在用户的发射端引入了基于SLNR的预编码,提高异构融合网络的整体性能.     

Novel distributed algorithm for coalition formation in cognitive radio networks for throughput enhancement using matching theory

In this paper, a novel algorithm is proposed for increasing the throughput in cognitive radio networks by forming coalitions among cognitive radio users in AWGN and fading channel environment. Although there have been numerous studies exploring the benefits of coalition formation in cognitive radio networks from the game theory perspective, there are several limitations in their application. To overcome the limitations of game theory, concepts from matching theory are used. Specifically, the stable marriage problem is used to formulate the interactions among the cognitive radio users as a matching game for collaborative distributed spectrum sensing under target detection probability constraint. The utility function is defined as the average probability of false alarm per cognitive radio user. The advantage of stable marriage is that it always converges to a stable matching and is Pareto optimal when the preferences of cognitive radios are strict. In the proposed model, the stable matching problem is extended to propose a novel algorithm to form coalitions of varying sizes for improving the utility of CR (false alarm and throughput). The coalitions formed using the algorithm are stable and do not deviate from the final matching. Using simulations and mathematical analysis, it is shown that the proposed algorithm leads to stable coalitions and returns significant improvement in terms of reduced probability of false alarm and improved throughput per cognitive radio user as compared to the noncooperative scenario.     

MIMO-CDMA系统中一种基于博弈方式的分布式功率控制

针对MIMO-CDMA系统中的无线数据业务,本文研究了分布式非合作功率控制博弈。对MIMO-CDMA系统中的无线数据业务建立了收益函数,该收益函数对功率效率和频谱效率都进行了考虑,并能够反映系统中无线数据用户对服务质量(QoS)的满意程度。以收益函数为基础,建立了两种非合作功率控制博弈模型,并对模型纳什均衡的存在性和唯一性进行了推导。另外,还研究了两种代价函数机制。最后,给出了一种获得纳什均衡的算法,数值仿真结果表明该算法具有良好的性能,有效地控制了各用户的发射功率。     

Joint random access and power control game in ad hoc networks with noncooperative users

We consider a distributed joint random access and power control scheme for interference management in wireless ad hoc networks. To derive decentralized solutions that do not require any cooperation among the users, we formulate this problem as noncooperative joint random access and power control game, in which each user minimizes its average transmission cost with a given rate constraint. Using supermodular game theory, the existence and uniqueness of Nash equilibrium are established. Furthermore, we present an asynchronous distributed algorithm to compute the solution of the game based on myopic best response updates, which converges to Nash equilibrium globally. Finally, a link admission algorithm is carried out to guarantee the reliability of the active users. Performance evaluations via simulations show that the game-theoretical based cross-layer design achieves high performance in terms of energy consumption and network stability.