Game theory for dynamic spectrum sharing cognitive radio

This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel University on 21 June 2010.‘Game Theory’ is the formal study of conflict and cooperation. The theory is based on a set of tools that have been developed in order to assist with the modelling and analysis of individual, independent decision makers. These actions potentially affect any decisions, which are made by other competitors. Therefore, it is well suited and capable of addressing the various issues linked to wireless communications. This work presents a Green Game-Based Hybrid Vertical Handover Model. The model is used for heterogeneous wireless networks, which combines both dynamic (Received Signal Strength and Node Mobility) and static (Cost, Power Consumption and Bandwidth) factors. These factors control the handover decision process; whereby the mechanism successfully eliminates any unnecessary handovers, reduces delay and overall number of handovers to 50% less and 70% less dropped packets and saves 50% more energy in comparison to other mechanisms. A novel Game-Based Multi-Interface Fast-Handover MIPv6 protocol is introduced in this thesis as an extension to the Multi-Interface Fast-handover MIPv6 protocol. The protocol works when the mobile node has more than one wireless interface. The protocol controls the handover decision process by deciding whether a handover is necessary and helps the node to choose the right access point at the right time. In addition, the protocol switches the mobile nodes interfaces ‘ON’ and ‘OFF’ when needed to control the mobile node’s energy consumption and eliminate power lost of adding another interface. The protocol successfully reduces the number of handovers to 70%, 90% less dropped packets, 40% more received packets and acknowledgments and 85% less end-to-end delay in comparison to other Protocols. Furthermore, the thesis adapts a novel combination of both game and auction theory in dynamic resource allocation and price-power-based routing in wireless Ad-Hoc networks. Under auction schemes, destinations nodes bid the information data to access to the data stored in the server node. The server will allocate the data to the winner who values it most. Once the data has been allocated to the winner, another mechanism for dynamic routing is adopted. The routing mechanism is based on the source-destination cooperation, power consumption and source-compensation to the intermediate nodes. The mechanism dramatically increases the seller’s revenue to 50% more when compared to random allocation scheme and briefly evaluates the reliability of predefined route with respect to data prices, source and destination cooperation for different network settings. Last but not least, this thesis adjusts an adaptive competitive second-price pay-to-bid sealed auction game and a reputation-based game. This solves the fairness problems associated with spectrum sharing amongst one primary user and a large number of secondary users in a cognitive radio environment. The proposed games create a competition between the bidders and offers better revenue to the players in terms of fairness to more than 60% in certain scenarios. The proposed game could reach the maximum total profit for both primary and secondary users with better fairness; this is illustrated through numerical results

Basics of coalitional games with applications to communications and networking

Game theory is the study of decision making in an interactive environment. Coalitional games fulfill the promise of group efficient solutions to problems involving strategic actions. Formulation of optimal player behavior is a fundamental element in this theory. This paper comprises a self-instructive didactic means to study basics of coalitional games indicating how coalitional game theory tools can provide a framework to tackle different problems in communications and networking. We show that coalitional game approaches achieve an improved performance compare to non-cooperative game theoretical solutions

Cognitive radio systems in LTE networks

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London.The most important fact in the mobile industry at the moment is that demand for wireless services will continue to expand in the coming years. Therefore, it is vital to find more spectrums through cognitive radios for the growing numbers of services and users. However, the spectrum reallocations, enhanced receivers, shared use, or secondary markets-will not likely, by themselves or in combination, meet the real exponential increases in demand for wireless resources. Network operators will also need to re-examine network architecture, and consider integrating the fibre and wireless networks to address this issue. This thesis involves driving fibre deeper into cognitive networks, deploying microcells connected through fibre infrastructure to the backbone LTE networks, and developing the algorithms for diverting calls between the wireless and fibre systems, introducing new coexistence models, and mobility management. This research addresses the network deployment scenarios to a microcell-aided cognitive network, specifically slicing the spectrum spatially and providing reliable coverage at either tier. The goal of this research is to propose new method of decentralized-to-distributed management techniques that overcomes the spectrum unavailability barrier overhead in ongoing and future deployments of multi-tiered cognitive network architectures. Such adjustments will propose new opportunities in cognitive radio-to-fibre systematic investment strategies. Specific contributions include: 1) Identifying the radio access technologies and radio over fibre solution for cognitive network infrastructure to increase the uplink capacity analysis in two-tier networks. 2) Coexistence of macro and microcells are studied to propose a roadmap for optimising the deployment of cognitive microcells inside LTE macrocells in the case of considering radio over fibre access systems. 3) New method for roaming mobiles moving between microcells and macrocell coverage areas is proposed for managing spectrum handover, operator database, authentication and accounting by introducing the channel assigning agent entity. The ultimate goal is to reduce unnecessary channel adaptation

Game theory for dynamic spectrum sharing cognitive radio

‘Game Theory’ is the formal study of conflict and cooperation. The theory is based on a set of tools that have been developed in order to assist with the modelling and analysis of individual, independent decision makers. These actions potentially affect any decisions, which are made by other competitors. Therefore, it is well suited and capable of addressing the various issues linked to wireless communications. This work presents a Green Game-Based Hybrid Vertical Handover Model. The model is used for heterogeneous wireless networks, which combines both dynamic (Received Signal Strength and Node Mobility) and static (Cost, Power Consumption and Bandwidth) factors. These factors control the handover decision process; whereby the mechanism successfully eliminates any unnecessary handovers, reduces delay and overall number of handovers to 50% less and 70% less dropped packets and saves 50% more energy in comparison to other mechanisms. A novel Game-Based Multi-Interface Fast-Handover MIPv6 protocol is introduced in this thesis as an extension to the Multi-Interface Fast-handover MIPv6 protocol. The protocol works when the mobile node has more than one wireless interface. The protocol controls the handover decision process by deciding whether a handover is necessary and helps the node to choose the right access point at the right time. In addition, the protocol switches the mobile nodes interfaces ‘ON’ and ‘OFF’ when needed to control the mobile node’s energy consumption and eliminate power lost of adding another interface. The protocol successfully reduces the number of handovers to 70%, 90% less dropped packets, 40% more received packets and acknowledgments and 85% less end-to-end delay in comparison to other Protocols. Furthermore, the thesis adapts a novel combination of both game and auction theory in dynamic resource allocation and price-power-based routing in wireless Ad-Hoc networks. Under auction schemes, destinations nodes bid the information data to access to the data stored in the server node. The server will allocate the data to the winner who values it most. Once the data has been allocated to the winner, another mechanism for dynamic routing is adopted. The routing mechanism is based on the source-destination cooperation, power consumption and source-compensation to the intermediate nodes. The mechanism dramatically increases the seller’s revenue to 50% more when compared to random allocation scheme and briefly evaluates the reliability of predefined route with respect to data prices, source and destination cooperation for different network settings. Last but not least, this thesis adjusts an adaptive competitive second-price pay-to-bid sealed auction game and a reputation-based game. This solves the fairness problems associated with spectrum sharing amongst one primary user and a large number of secondary users in a cognitive radio environment. The proposed games create a competition between the bidders and offers better revenue to the players in terms of fairness to more than 60% in certain scenarios. The proposed game could reach the maximum total profit for both primary and secondary users with better fairness; this is illustrated through numerical results.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

State-Of-The-Art and Prospects for Peer-To-Peer Transaction-Based Energy System

Transaction-based energy (TE) management and control has become an increasingly relevant topic, attracting considerable attention from industry and the research community alike. As a result, new techniques are emerging for its development and actualization. This paper presents a comprehensive review of TE involving peer-to-peer (P2P) energy trading and also covering the concept, enabling technologies, frameworks, active research efforts and the prospects of TE. The formulation of a common approach for TE management modelling is challenging given the diversity of circumstances of prosumers in terms of capacity, profiles and objectives. This has resulted in divergent opinions in the literature. The idea of this paper is therefore to explore these viewpoints and provide some perspectives on this burgeoning topic on P2P TE systems. This study identified that most of the techniques in the literature exclusively formulate energy trade problems as a game, an optimization problem or a variational inequality problem. It was also observed that none of the existing works has considered a unified messaging framework. This is a potential area for further investigation

Wide-Area Time-Synchronized Closed-Loop Control of Power Systems And Decentralized Active Distribution Networks

The rapidly expanding power system grid infrastructure and the need to reduce the occurrence of major blackouts and prevention or hardening of systems against cyber-attacks, have led to increased interest in the improved resilience of the electrical grid. Distributed and decentralized control have been widely applied to computer science research. However, for power system applications, the real-time application of decentralized and distributed control algorithms introduce several challenges. In this dissertation, new algorithms and methods for decentralized control, protection and energy management of Wide Area Monitoring, Protection and Control (WAMPAC) and the Active Distribution Network (ADN) are developed to improve the resiliency of the power system. To evaluate the findings of this dissertation, a laboratory-scale integrated Wide WAMPAC and ADN control platform was designed and implemented. The developed platform consists of phasor measurement units (PMU), intelligent electronic devices (IED) and programmable logic controllers (PLC). On top of the designed hardware control platform, a multi-agent cyber-physical interoperability viii framework was developed for real-time verification of the developed decentralized and distributed algorithms using local wireless and Internet-based cloud communication. A novel real-time multiagent system interoperability testbed was developed to enable utility independent private microgrids standardized interoperability framework and define behavioral models for expandability and plug-and-play operation. The state-of-theart power system multiagent framework is improved by providing specific attributes and a deliberative behavior modeling capability. The proposed multi-agent framework is validated in a laboratory based testbed involving developed intelligent electronic device prototypes and actual microgrid setups. Experimental results are demonstrated for both decentralized and distributed control approaches. A new adaptive real-time protection and remedial action scheme (RAS) method using agent-based distributed communication was developed for autonomous hybrid AC/DC microgrids to increase resiliency and continuous operability after fault conditions. Unlike the conventional consecutive time delay-based overcurrent protection schemes, the developed technique defines a selectivity mechanism considering the RAS of the microgrid after fault instant based on feeder characteristics and the location of the IEDs. The experimental results showed a significant improvement in terms of resiliency of microgrids through protection using agent-based distributed communication

Reinforcement Learning in Self Organizing Cellular Networks

Self-organization is a key feature as cellular networks densify and become more heterogeneous, through the additional small cells such as pico and femtocells. Self- organizing networks (SONs) can perform self-configuration, self-optimization, and self-healing. These operations can cover basic tasks such as the configuration of a newly installed base station, resource management, and fault management in the network. In other words, SONs attempt to minimize human intervention where they use measurements from the network to minimize the cost of installation, configuration, and maintenance of the network. In fact, SONs aim to bring two main factors in play: intelligence and autonomous adaptability. One of the main requirements for achieving such goals is to learn from sensory data and signal measurements in networks. Therefore, machine learning techniques can play a major role in processing underutilized sensory data to enhance the performance of SONs. In the first part of this dissertation, we focus on reinforcement learning as a viable approach for learning from signal measurements. We develop a general framework in heterogeneous cellular networks agnostic to the learning approach. We design multiple reward functions and study different effects of the reward function, Markov state model, learning rate, and cooperation methods on the performance of reinforcement learning in cellular networks. Further, we look into the optimality of reinforcement learning solutions and provide insights into how to achieve optimal solutions. In the second part of the dissertation, we propose a novel architecture based on spatial indexing for system-evaluation of heterogeneous 5G cellular networks. We develop an open-source platform based on the proposed architecture that can be used to study large scale directional cellular networks. The proposed platform is used for generating training data sets of accurate signal-to-interference-plus-noise-ratio (SINR) values in millimeter-wave communications for machine learning purposes. Then, with taking advantage of the developed platform, we look into dense millimeter-wave networks as one of the key technologies in 5G cellular networks. We focus on topology management of millimeter-wave backhaul networks and study and provide multiple insights on the evaluation and selection of proper performance metrics in dense millimeter-wave networks. Finally, we finish this part by proposing a self-organizing solution to achieve k-connectivity via reinforcement learning in the topology management of wireless networks

A Vision and Framework for the High Altitude Platform Station (HAPS) Networks of the Future

A High Altitude Platform Station (HAPS) is a network node that operates in the stratosphere at an of altitude around 20 km and is instrumental for providing communication services. Precipitated by technological innovations in the areas of autonomous avionics, array antennas, solar panel efficiency levels, and battery energy densities, and fueled by flourishing industry ecosystems, the HAPS has emerged as an indispensable component of next-generations of wireless networks. In this article, we provide a vision and framework for the HAPS networks of the future supported by a comprehensive and state-of-the-art literature review. We highlight the unrealized potential of HAPS systems and elaborate on their unique ability to serve metropolitan areas. The latest advancements and promising technologies in the HAPS energy and payload systems are discussed. The integration of the emerging Reconfigurable Smart Surface (RSS) technology in the communications payload of HAPS systems for providing a cost-effective deployment is proposed. A detailed overview of the radio resource management in HAPS systems is presented along with synergistic physical layer techniques, including Faster-Than-Nyquist (FTN) signaling. Numerous aspects of handoff management in HAPS systems are described. The notable contributions of Artificial Intelligence (AI) in HAPS, including machine learning in the design, topology management, handoff, and resource allocation aspects are emphasized. The extensive overview of the literature we provide is crucial for substantiating our vision that depicts the expected deployment opportunities and challenges in the next 10 years (next-generation networks), as well as in the subsequent 10 years (next-next-generation networks).Comment: To appear in IEEE Communications Surveys & Tutorial

Prise de décision de handover vertical pour la gestion de mobilité dans les réseaux hétérogènes sans fil

L évolution des technologies réseaux sans fil, des terminaux mobiles ainsi que des contenus et des services créent des environnements hétérogènes de plus en plus complexes. Dans ce contexte, un compromis entre la mobilité, la transparence et la performance apparaît. Des utilisateurs mobiles, ayant différents profils et préférences, voudraient être toujours connectés au meilleur réseau à tout moment, sans avoir à se soucier des différentes transitions entre réseaux hétérogènes. Face à cette complexité, il parait nécessaire de proposer de nouvelles approches afin de rendre ces systèmes plus autonomes et de rendre les décisions de handover vertical plus efficaces. Cette thèse se concentre sur la gestion de mobilité verticale, plus précisément sur la prise de décision de handover vertical dans un environnement de réseaux hétérogènes sans fil. Après l identification des différents paramètres de prise de décision et l analyse de l état de l art relié à la gestion de la mobilité verticale, nous avons proposé un système de réputation qui permet de réduire les délais de prise de décision. La réputation d un réseau est introduite comme une nouvelle métrique de prise de décision qui peut être recueillie à partir des expériences précédentes des utilisateurs sur ce réseau. Nous montrons que la réputation est une métrique efficace qui permet l anticipation du handover et accélère la prise de décision. Bien que l objectif principal soit de garantir la meilleure qualité de service et l utilisation optimale des ressources radios, les aspects économiques doivent également être considérés, y compris la minimisation des coûts pour les utilisateurs et la maximisation des revenus pour les fournisseurs de services ou les opérateurs. Nous proposons alors, dans la deuxième partie de la thèse, un mécanisme de prise de décision basé sur la théorie des jeux. Ce dernier permet la maximisation des utilités des réseaux et des utilisateurs. Dans cette solution, chaque réseau disponible joue un jeu de Stackelberg avec un ensemble d utilisateurs, tandis que les utilisateurs jouent un jeu de Nash entre eux pour partager les ressources radios limitées. Un point d équilibre de Nash, qui maximise l utilité de l utilisateur et les revenus des fournisseurs de services, est trouvé et utilisé pour le contrôle d admission et la prise de décision de handover vertical. Dans la troisième partie de cette thèse, nous proposons et discutons deux différentes solutions architecturales sur lesquelles nos mécanismes de prise de décision proposés peuvent être intégrés. La première architecture proposée est basée sur la norme IEEE 802.21 à laquelle nous proposons certaines extensions. La seconde architecture proposée est basée sur un niveau de contrôle composé de deux couches de virtualisation. La virtualisation est assurée via des agents capables de faire un raisonnement et de prendre des décisions pour le compte d entités physiques qu ils représentent au sein du système. Cette architecture permet une plus grande flexibilitéMobility management over heterogeneous wireless networks is becoming a major interest area as new technologies and services continue to proliferate within the wireless networking market. In this context, seamless mobility is considered to be crucial for ubiquitous computing. Service providers aim to increase the revenue and to improve users satisfaction. However there are still many technical and architectural challenges to overcome before achieving the required interoperability and coexistence of heterogeneous wireless access networks. Indeed, the context of wireless networks is offering multiple and heterogeneous technologies (e.g. 2G to 4G, WiFi, Wimax, TETRA,...). On the one hand, this rich environment allows users to take profit from different capacities and coverage characteristics. Indeed, this diversity can provide users with high flexibility and allow them to seamlessly connect at any time and any where to the access technology that best fits their requirements. Additionally, cooperation between these different technologies can provide higher efficiency in the usage of the scarce wireless resources offering more economic systems for network providers. On the other hand, the heterogeneity of technologies and architectures and the multiplication of networks and service providers creates a complex environment where cooperation becomes challenging at different levels including and not limited to mobility management, radio resource provisioning, Quality of Service and security guarantees. This thesis is focusing on mobility management and mainly on decision making for Vertical handover within heterogeneous wireless network environments. After the analysis of the related state of the art, we first propose a reputation based approach that allows fast vertical handover decision making. A decision making scheme is then built on that approach. Network s reputation, is a new metric that can be gathered from previous users experiences in the networks. We show that it is an efficient construct to speed up the vertical handover decision making thanks to anticipation functionalities. While the main objective remains guaranteeing the best Quality of Service and optimal radio resource utilization, economical aspects have also to be considered including cost minimization for users and revenue maximization for network providers. For this aim, we propose, in the second part of the thesis, a game theoretic based scheme that allows maximizing benefits for both networks and users. In this solution, each available network plays a Stackelberg game with a finite set of users, while users are playing a Nash game among themselves to share the limited radio resources. A Nash equilibrium point, that maximizes the user s utility and the service provider revenue, is found and used for admission control and vertical handover decision making. The analyses of the optimal bandwidth/prices and the revenue at the equilibrium point show that there are some possible policies to use according to user s requirements in terms of QoS and to network capacities. For instance, we pointed out that networks having same capacities and different reputation values should charge users with different prices which makes reputation management very important to attract users and maximize networks revenue. In the third part of this thesis, we provide and discuss two different architectural and implementation solutions on which our proposed vertical handover decision mechanisms can be integrated. The first proposed architecture is a centralized one. It is based on the IEEE 802.21 standard to which some extensions are proposed. The second proposed architecture is distributed. It is based on an overlay control level composed of two virtualization layers able to make reasoning on behalf of physical entities within the system. This architecture allows higher flexibility especially for loosely coupled interconnected networksEVRY-INT (912282302) / SudocSudocFranceF

Estimation and Allocation of Cost Savings from Collaborations

학위논문(석사) -- 서울대학교대학원 : 공과대학 산업공학과, 2021.8. 문일경.The physical internet (PI) is a state-of-the-art open global supply chain network that is gaining attention from both participants and researchers of supply chains. The PI uses standardized containers to dispatch shipments through an interconnected network within a supply chain, where information, storage facilities, and transportation methods are shared participants of the physical internet. The network aims to save costs, handle volatile demand and information, and be socially and environmentally responsible. Up until now, however, almost all studies concerning the PI have focused primarily on its conceptual development and the advantages of putting it into practical, widespread use. Studies that consider realistic constraints of its use, such as empty runs of transportation, limited capacity of resources, or an equitable allocation of the cost savings obtained from its implementation are limited. While in general the PI can offer greater efficiency and sustainability compared to the traditional supply chain network, in certain situations some users of it experience loss through its use because of the inherent setup it presents of sharing capacitated resources. Therefore, compensating companies that experience loss when joining a PI is essential in building a solid network. In this thesis, in order to address the minimization of a total cost problem in the production-inventory-distribution decision of a PI, we first propose a mixed-integer linear programming (MILP) model formulation that takes into account capacitated factory and warehouse capacity, the penalty sustained by empty runs of transportation, and the maximum delivery distance of freight runs. Next, we use the model to compare the costs incurred by individual players when they do not participate in the PI and the costs of collaboration in the PI in which players do participate. After comparing the costs saved by participating in the PI, we then allocated the cost savings among independent supply chains, allotting them through three different allocation methods, including the Shapley value method, which is a cooperative game theory solution method.피지컬 인터넷은 최첨단의 공유 글로벌 공급망 네트워크로 다양한 학자 및 실무자들의 관심을 끌고 있습니다. 피지컬 인터넷은 표준화된 컨테이너를 이용하여 상호 연결된 네트워크를 통해 제품 및 재화를 발송합니다. 이 때, 정보, 보관 시설 및 운송 수단은 참여자들 간에 공유됩니다. 이 네트워크는 비용을 절감하고 변동성이 큰 수요와 정보를 처리하고 사회적, 환경적으로 지속가능성을 유지하는 것을 목표로 합니다. 지금까지 피지컬 인터넷에 대한 연구는 주로 그 개념과 프레임워크의 개발, 그리고 사회에 도입하였을 때의 장점을 주로 다루었습니다. 피지컬 인터넷 속에서 운송 수단의 공차 운행, 자원의 한계 용량, 절감한 비용의 배분 등과 같은 현실적인 요소들에 대한 고려를 한 연구들은 아직 제한적입니다. 피지컬 인터넷은 전체적으로 보았을 때 기존의 공급망에 비해 더 큰 효율성과 지속 가능성을 얻을 수 있지만 특정한 상황에서는 일부 참가자는 현실적인 제약 상황으로 인해 오히려 손해를 보는 경우가 존재할 수 있습니다. 따라서 더 큰 효율성과 지속 가능성을 얻을 수 있는 피지컬 인터넷에 기업들을 참여시키기 위해선 그들이 참여함으로써 손해를 보는 상황을 만들지 않는 것이 필수적인 조건입니다. 본 논문에서는 먼저 운송 수단의 공차 운행 페널티 비용, 최대 운송 가능 거리, 창고의 폐쇄를 고려한 통합 생산-재고-물류 최소 비용 혼합 정수 선형 계획법 모형을 제안하였습니다. 그 후, 개별적인 공급망의 비용과 피지컬 인터넷 하에서 협업한 통합 공급망의 비용을 비교하여 비용 절감 효과를 계산한 후 협력 게임의 일종인 섀플리 값을 포함한 세 가지 배분 방법을 통해 비용 절감 효과 배분을 살펴보았습니다.Chapter 1 Introduction 1 Chapter 2 Literature Review 5 2.1 The Physical Internet 5 2.2 Cost Savings Allocation Problem 8 Chapter 3 Model Formulation 10 3.1 Problem Definition 10 3.2 Assumptions 15 3.3 Notaions and Formulations 17 Chapter 4 Numerical Analysis of the MILP model 22 4.1 Experimental Design 22 4.2 Results Analysis 26 4.3 Cost Parameter Sensitivity Analysis 29 Chapter 5 Cost Savings Allocation Problem 31 5.1 No Pre-set Rules 31 5.2 Proportional to Customer Demand 33 5.3 The Shapley Value 35 Chapter 6 Conclusions 37 Bibliography 39 국문초록 42석