Game Theoretic subcarrier and power allocation for wireless OFDMA networks

This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s payoff as a function of the achieved data-rate.The fairness resource allocation problem can then be modeled as a cooperative bargaining game.The objective of the game is to maximize the aggregate payoffs for the users.To search for the Nash bargaining solution(NBS) of the game,a suboptimal subcarrier allocation is performed by assuming an equal power allocation.Thereafter,an optimal power allocation is performed to maximize the sum payoff for the users.By comparing with the max-rate and the max-min algorithms,simulation results show that the proposed game could achieve a good tradeoff between the user fairness and the overall system performance.     

Deliverability analysis of greedy routing in the spherical cap 3D sensor networks

For 3D sensor networks to monitor the ocean, forest and aerosphere, etc., sensors can forward their data to the base station by greedy routing. It is critical to quantitatively greedy routing’s deliverability for evaluating network’s functionality and performance. The probability that all sensors can successfully send their data to the base station by greedy routing is usually modeled as the probability of guaranteed delivery. For a typical spherical cap 3D sensor network deployment scenario where nodes follow a homogeneous Poisson point process, the relationship between the sensor transmission radius and the probability of guaranteed delivery is studied, and a tight analytical upper bound on the sensor transmission radius to ensure the designed deliverability probability is derived in this paper. The correctness and tightness of the derived upper bound are verified by extensive simulations.     

Dynamically reconfigurable radio-over-fiber network with medium access control protocol to provide network access to train passengers

An innovative dynamically reconfgurable radio-over-fber(RoF)network equipped with an intelligent medium access control(MAC)protocol is proposed to provide broadband access to train passengers in railway high-speed mobile applications.The proposed RoF network architecture is based on a reconfgurable control station and remote access unit(RAU)that is equipped with a fxed flter and tunable flter.The proposed hybrid frequency-division multiplexing/time division multiple access(FDM/TDMA)based MAC protocol realizes failure detection/recovery and dynamic wavelength allocation to remote access units.Simulation result shows that with the proposed MAC protocol,the control station can detect failures and recover and dynamic wavelength allocation can increase the wavelength resource utilization to maintain network performance.     

Load diversity based optimal processing resource allocation for super base stations in centralized radio access networks

To reduce construction cost and energy consumption of cellular networks, the centralized radio access cellular network infrastructure with a Super BS （CSBS） architecture has been proposed. The CSBS architecture has the advantage that the centralized processing resource can be flexibly organized. However, the problem of low processing resource efficiency caused by load discrepancy of base stations still exists and the processing resource allocation methods for physical layer processing are not suitable for protocol processing. In this article, a framework for protocol processing resource management is designed and a load diversity based processing resource allocation （LDA） algorithm is proposed, which employs dynamic programming with the consideration of load discrepancy. Also, to support large mumber of BSs, a suboptimal algorithm hybrid load diversity＂ based processing resource allocation （H-LDA） is also proposed. Sinmlation results show that LDA and H-LDA algorithm significantly outperforms the conventional methods, respectively, by more than 60% and 55% in the processing resource efficiency and the performance gap grows with the increasing BS number.     

Fairness-based joint call admission control for heterogeneous wireless networks: an SMDP approach

In heterogeneous wireless networks, both terminal heterogeneity and network heterogeneity give rise to the fairness problem of resource allocation. Due to the capability of exploiting the resources of multiple networks, the behavior of multi-mode terminals will have a great effect on single-mode terminals, and this influence becomes more severe when considering the different demands of different traffic. In this article, we propose a novel joint call admission control （JCAC） scheme to address this problem. The JCAC problem is modeled as a semi-Markov decision process （SMDP） with the aim of maximizing the average network revenue under tile constraints of the fairness among different terminals and traffic classes. Based on the SMDP, we design an algorithm to achieve a good tradeoff between revenue and fairness by dynamically adjusting the threshold of fairness constraints imposed on heterogeneous terminals. Simulation results show that the proposed scheme can significantly improve the fairness among heterogeneous terminals and guarantee the priority and fairness among different traffic classes with little loss of network revenue compared with other schemes.     

Multi-channel power allocation based on market competitive equilibrium in cognitive radio networks

Cognitive radios such as intelligent phones and Bluetooth devices have been considered essential goods in next-generation communication systems.Such devices will have to share the same frequency band owing to the limited bandwidth resource.To improve spectrum efciency,we formulate multi-channel power allocation as a market competitive equilibrium(CE)problem,and prove that its solution exists and is unique under the condition of weak interference.We then propose two distributed power allocation algorithms achieving CE,namely the fast convergent power allocation algorithm(FCPAA)and the social-fairness-aware FCPAA(SFAF).Theoretical analysis and simulation results demonstrate that the proposed algorithms lead to better system performance in terms of the guaranteed interference temperature constraint using the price mechanism instead of a strategy based on the Nash equilibrium.Moreover,it is shown that the FCPAA maximizes total utility,and converges more quickly than the method addressed in prior research with the help of improved round-robin rules.However,the FCPAA cannot ensure the same social fairness among secondary users as the SFAF scheme in both the non-fading channel and Rayleigh fading channel;the SFAF balances the individual utility by adjusting each user’s budget at the expense of a small quantity of system total throughput.     

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.     

Resource allocation algorithm with limited feedback for multicast single frequency networks

The single frequency network (SFN) can provide a multimedia broadcast multicast service over a large coverage area. However, the application of SFN is still restricted by a large amount of feedback. Therefore, we propose a multicast resource allocation scheme based on limited feedback to maximize the total rate while guaranteeing the quality of service (QoS) requirement of real-time services. In this scheme, we design a user feedback control algorithm to effectively reduce feedback load. The algorithm determines to which base stations the users should report channel state information. We then formulate a joint subcarrier and power allocation issue and find that it has high complexity. Hence, we first distribute subcarriers under the assumption of equal power and develop a proportional allocation strategy to achieve a tradeoff between fairness and QoS. Next, an iterative water-filling power allocation is proposed to fully utilize the limited power. To further decrease complexity, a power iterative scheme is introduced. Simulation results show that the proposed scheme significantly improves system performance while reducing 68% of the feedback overhead. In addition, the power iterative strategy is suitable in practice due to low complexity.     

New Hybrid Access Method for Femtocell through Adjusting QoS

The increasing number of mobile users raises issues about coverage extension in some areas such as rural zones, indoor or underground locations： one of suggestion solution to accommodate this growing of mobile user is femtocell. Femtocell have been attracting considerable attention in mobile communications, it is a small base station that install to improve the indoor coverage of a given cellular and to enhance user＇s capacity. Call admission control and resource allocation infemtocell＇s hybrid mode are an essential performance promotion issue. Developing methods for femtocell utilization is very comparative nowadays. The two major limitations of wireless communication are capacity and range. The main contribution of our paper is developing resource allocation scheme that can manage the femocell resources between subscriber （femtocell user） and non-subscriber （macrocell user in order to maximizing the system utilizations, we provide a mechanism that leads to serve more users by admitting more subscribers basing on adjusting QoS of the connected users.     

Secure Application-Aware Service Differentiation in Public Area Wireless Networks

We are witnessing the increasing demand for pervasive Internet access from public area wireless networks (PAWNs). As their popularity grows, the inherent untrusted nature of public places and the diverse service requirements of end users are two key issues that need to be addressed. We have proposed two approaches to address these issues. First, the Home-based Authentication Protocol (HAP) that provides a framework by which to establish trust between a nomadic client and a service provider using a trusted third party (home). Second, we argue that the best-effort-based service model provided by many access points is not enough to satisfy the end user fairness and to maximize the wireless link utilization for a diverse user population. We have proposed an application-aware service differentiation (AASD) mechanism that takes both application semantics and user requirements into consideration. Our analysis of this framework shows several fruitful results. The total authentication latency increases with the number of clients but at a rate that is much less than linear increasing latency. Also, in comparison with two other bandwidth allocation approaches, the best effort and static access control, our proposed application-aware service differentiation method, outperforms them in terms of the client fairness and wireless bandwidth utilization.