132 research outputs found

    Game theory for dynamic spectrum sharing cognitive radio

    Get PDF
    ‘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

    Cooperative resource pooling in multihomed mobile networks

    Get PDF
    The ubiquity of multihoming amongst mobile devices presents a unique opportunity for users to co-operate, sharing their available Internet connectivity, forming multihomed mobile networks on demand. This model provides users with vast potential to increase the quality of service they receive. Despite this, such mobile networks are typically underutilized and overly restrictive, as additional Internet connectivity options are predominantly ignored and selected gateways are both immutable and incapable of meeting the demand of the mobile network. This presents a number of research challenges, as users look to maximize their quality of experience, while balancing both the financial cost and power consumption associated with utilizing a diverse set of heterogeneous Internet connectivity options. In this thesis we present a novel architecture for mobile networks, the contribution of which is threefold. Firstly, we ensure the available Internet connectivity is appropriately advertised, building a routing overlay which allows mobile devices to access any available network resource. Secondly, we leverage the benefits of multipath communications, providing the mobile device with increased throughput, additional resilience and seamless mobility. Finally, we provide a multihomed framework, enabling policy driven network resource management and path selection on a per application basis. Policy driven resource management provides a rich and descriptive approach, allowing the context of the network and the device to be taken into account when making routing decisions at the edge of the Internet. The aim of this framework, is to provide an efficient and flexible approach to the allocation of applications to the optimal network resource, no matter where it resides in a mobile network. Furthermore, we investigate the benefits of path selection, facilitating the policy framework to choose the optimal network resource for specific applications. Through our evaluation, we prove that our approach to advertising Internet connectivity in a mobile network is both efficient and capable of increasing the utilization of the available network capacity. We then demonstrate that our policy driven approach to resource management and path selection can further improve the user’s quality of experience, by tailoring network resource usage to meet their specific needs

    MP-CFM: MPTCP-Based communication functional module for next generation ERTMS

    Get PDF
    184 p. El contenido de los capĂ­tulos 4,5,6,7,8 y 9 estĂĄ sujeto a confidencialidadEl Sistema Europeo de GestiĂłn del TrĂĄfico Ferroviario (ERTMS, por sus siglasen inglĂ©s), fue originalmente diseñado para los ferrocarriles europeos. Sinembargo, a lo largo de las dos Ășltimas dĂ©cadas, este sistema se ha convertidoen el estĂĄndar de-facto para los servicios de Alta Velocidad en la mayorĂ­a depaĂ­ses desarrollados.El sistema ERTMS se compone de tres subsistemas principales: 1) el Sistemade Control Ferroviario Europeo (ETCS, por sus siglas en inglĂ©s), que actĂșacomo aplicaciĂłn de señalizaciĂłn; 2) el sistema Euroradio, que a su vez estĂĄdividido en dos subsistemas, el MĂłdulo de Seguridad Funcional (SFM, porsus siglas en inglĂ©s), y el MĂłdulo de ComunicaciĂłn Funcional (CFM, porsus siglas en inglĂ©s); y 3) el sistema de comunicaciones subyacente, GSM-R,que transporta la informaciĂłn intercambiada entre el sistema embarcado enel tren (OBU, por sus siglas en inglĂ©s) y el Centro de Bloqueo por Radio(RBC, por sus siglas en inglĂ©s). El sistema de señalizaciĂłn ETCS soporta tresniveles dependiendo del nivel de prestaciones soportadas. En el nivel 3 seintroduce la posibilidad de trabajar con bloques mĂłviles en lugar de bloquesfijos definidos en la vĂ­a. Esto implica que la distancia de avance entre dos trenesconsecutivos puede ser reducida a una distancia mĂ­nima en la que se garanticela seguridad del servicio, aumentando por tanto la capacidad del corredorferroviario. Esta distancia de seguridad viene determinada por la combinaciĂłnde la distancia de frenado del tren y el retraso de las comunicaciones deseñalizaciĂłn. Por lo tanto, se puede afirmar que existe una relaciĂłn directaentre los retrasos y la confiabilidad de las transmisiones de las aplicaciones deseñalizaciĂłn y la capacidad operacional de un corredor ferroviario. AsĂ­ pues,el estudio y mejora de los sistemas de comunicaciones utilizados en ERTMSjuegan un papel clave en la evoluciĂłn del sistema ERTMS. Asimismo, unaoperatividad segura en ERTMS, desde el punto de vista de las comunicacionesimplicadas en la misma, viene determinada por la confiabilidad de lascomunicaciones, la disponibilidad de sus canales de comunicaciĂłn, el retrasode las comunicaciones y la seguridad de sus mensajes.Unido este hecho, la industria ferroviaria ha venido trabajando en ladigitalizaciĂłn y la transiciĂłn al protocolo IP de la mayor parte de los sistemasde señalizaciĂłn. Alineado con esta tendencia, el consorcio industrial UNISIGha publicado recientemente un nuevo modelo de comunicaciones para ERTMSque incluye la posibilidad, no solo de operar con el sistema tradicional,basado en tecnologĂ­a de conmutaciĂłn de circuitos, sino tambiĂ©n con un nuevosistema basado en IP. Esta tesis estĂĄ alineada con el contexto de migraciĂłnactual y pretende contribuir a mejorar la disponibilidad, confiabilidad yseguridad de las comunicaciones, tomando como eje fundamental los tiemposde transmisiĂłn de los mensajes, con el horizonte puesto en la definiciĂłn deuna prĂłxima generaciĂłn de ERTMS, definida en esta tesis como NGERTMS.En este contexto, se han detectado tres retos principales para reforzar laresiliencia de la arquitectura de comunicaciones del NGERTMS: 1) mejorarla supervivencia de las comunicaciones ante disrupciones; 2) superar laslimitaciones actuales de ERTMS para enviar mensajes de alta prioridad sobretecnologĂ­a de conmutaciĂłn de paquetes, dotando a estos mensajes de un mayorgrado de resiliencia y menor latencia respecto a los mensajes ordinarios; y3) el aumento de la seguridad de las comunicaciones y el incremento de ladisponibilidad sin que esto conlleve un incremento en la latencia.Considerando los desafĂ­os previamente descritos, en esta tesis se proponeuna arquitectura de comunicaciones basada en el protocolo MPTCP, llamadaMP-CFM, que permite superar dichos desafĂ­os, a la par que mantener laretrocompatibilidad con el sistema de comunicaciones basado en conmutaciĂłnde paquetes recientemente propuesto por UNISIG. Hasta el momento, esta esla primera vez que se propone una arquitectura de comunicaciones completacapaz de abordar los desafĂ­os mencionados anteriormente. Esta arquitecturaimplementa cuatro tipos de clase de servicio, los cuales son utilizados porlos paquetes ordinarios y de alta prioridad para dos escenarios distintos; unescenario en el que ambos extremos, el sistema embarcado o OBU y el RBC,disponen de mĂșltiples interfaces de red; y otro escenario transicional en el cualel RBC sĂ­ tiene mĂșltiples interfaces de red pero el OBU solo dispone de unaĂșnica interfaz. La arquitectura de comunicaciones propuesta para el entornoferroviario ha sido validada mediante un entorno de simulaciĂłn desarrolladopara tal efecto. Es mĂĄs, dichas simulaciones demuestran que la arquitecturapropuesta, ante disrupciones de canal, supera con creces en tĂ©rminos derobustez el sistema diseñado por UNISIG. Como conclusiĂłn, se puede afirmarque en esta tesis se demuestra que una arquitectura de comunicaciones basadade MPTCP cumple con los exigentes requisitos establecidos para el NGERTMSy por tanto dicha propuesta supone un avance en la evoluciĂłn del sistema deseñalizaciĂłn ferroviario europeo

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

    Get PDF
    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
    • 

    corecore