477 research outputs found

    Contributions to Wireless multi-hop networks : Quality of Services and Security concerns

    Get PDF
    Ce document résume mes travaux de recherche conduits au cours de ces 6 dernières années. Le principal sujet de recherche de mes contributions est la conception et l’évaluation des solutions pour les réseaux sans fil multi-sauts en particulier les réseaux mobiles adhoc (MANETs), les réseaux véhiculaires ad hoc (VANETs), et les réseaux de capteurs sans fil (WSNs). La question clé de mes travaux de recherche est la suivante : « comment assurer un transport des données e cace en termes de qualité de services (QoS), de ressources énergétiques, et de sécurité dans les réseaux sans fil multi-sauts? » Pour répondre à cette question, j’ai travaillé en particulier sur les couches MAC et réseau et utilisé une approche inter-couches.Les réseaux sans fil multi-sauts présentent plusieurs problèmes liés à la gestion des ressources et au transport des données capable de supporter un grand nombre de nœuds, et d’assurer un haut niveau de qualité de service et de sécurité.Dans les réseaux MANETs, l’absence d’infrastructure ne permet pas d’utiliser l’approche centralisée pour gérer le partage des ressources, comme l’accès au canal.Contrairement au WLAN (réseau sans fil avec infrastructure), dans les réseaux Ad hoc les nœuds voisins deviennent concurrents et il est di cile d’assurer l’équité et l’optimisation du débit. La norme IEEE802.11 ne prend pas en compte l’équité entre les nœuds dans le contexte des MANETs. Bien que cette norme propose di érents niveaux de transmission, elle ne précise pas comment allouer ces débits de manière e cace. En outre, les MANETs sont basés sur le concept de la coopération entre les nœuds pour former et gérer un réseau. Le manque de coopération entre les nœuds signifie l’absence de tout le réseau. C’est pourquoi, il est primordial de trouver des solutions pour les nœuds non-coopératifs ou égoïstes. Enfin, la communication sans fil multi-sauts peut participer à l’augmentation de la couverture radio. Les nœuds de bordure doivent coopérer pour transmettre les paquets des nœuds voisins qui se trouvent en dehors de la zone de couverture de la station de base.Dans les réseaux VANETs, la dissémination des données pour les applications de sureté est un vrai défi. Pour assurer une distribution rapide et globale des informations, la méthode de transmission utilisée est la di usion. Cette méthode présente plusieurs inconvénients : perte massive des données due aux collisions, absence de confirmation de réception des paquets, non maîtrise du délai de transmission, et redondance de l’information. De plus, les applications de sureté transmettent des informations critiques, dont la fiabilité et l’authenticité doivent être assurées.Dans les réseaux WSNs, la limitation des ressources (bande passante, mémoire, énergie, et capacité de calcul), ainsi que le lien sans fil et la mobilité rendent la conception d’un protocole de communication e cace di cile. Certaines applications nécessitent un taux important de ressources (débit, énergie, etc) ainsi que des services de sécurité, comme la confidentialité et l’intégrité des données et l’authentification mutuelle. Ces paramètres sont opposés et leur conciliation est un véritable défi. De plus, pour transmettre de l’information, certaines applications ont besoin de connaître la position des nœuds dans le réseau. Les techniques de localisation sou rent d’un manque de précision en particulier dans un environnement fermé (indoor), et ne permettent pas de localiser les nœuds dans un intervalle de temps limité. Enfin, la localisation des nœuds est nécessaire pour assurer le suivi d’objet communicant ou non. Le suivi d’objet est un processus gourmand en énergie, et requiert de la précision.Pour répondre à ces défis, nous avons proposé et évalué des solutions, présentées de la manière suivante : l’ensemble des contributions dédiées aux réseaux MANETs est présenté dans le deuxième chapitre. Le troisième chapitre décrit les solutions apportées dans le cadre des réseaux VANETs. Enfin, les contributions liées aux réseaux WSNs sont présentées dans le quatrième chapitre

    Teoria de jogos para utilização efetiva dos recursos em aplicações para 5G

    Get PDF
    Doutoramento em Engenharia Eletrotécnica - TelecomunicaçõesEsta tese tem como objetivo fornecer afirmações conclusivas em relação a utilização eficiente de recursos para redes e aplicações de 5G (5a geração) com recurso a teoria dos jogos. Neste contexto, investigamos dois cenários principais, um relativo a comunicações móveis e um outro relativo a redes inteligentes. Uma métrica importante para o desenho das redes móveis emergentes é a eficiência energética, com particular ênfase no lado do dispositivo móvel, onde as tecnologias das baterias são ainda limitadas. Alguns trabalhos de investigação relacionados têm demonstrado que a cooperação pode ser um paradigma útil no sentido de resolver o problema do défice energético. Contudo, pretendemos ir mais além, ao definir a cooperação e os utilizadores móveis como um grupo de jogadores racionais, que podem atuar sobre estratégias e utilidades, por forma a escolher a retransmissão mais apropriada para poupança de energia. Esta interpretação presta-se à aplicação da teoria dos jogos, e recorremos assim aos jogos coalicionais para solucionar conflitos de interesse entre dispositivos cooperantes, empregando Programação Linear (LP) para resolver o problema da selecção da retransmissão e derivar a principal solução do jogo. Os resultados mostram que a escolha do jogo de retransmissão coalicional proposto pode potencialmente duplicar a duração da bateria, numa era em que a próxima geração de dispositivos móveis necessitará de cada vez mais energia para suportar serviços e aplicações cada vez mais sofisticados. O segundo cenário investiga a resposta da procura em aplicações smart grid, que está a ganhar interesse sob a égide do 5G e que é considerada uma abordagem promissora, incentivando os utilizadores a consumir electricidade de forma mais uniforme em horas de vazio. Recorremos novamente à teoria dos jogos, imaginando as interacções estratégicas entre a empresa fornecedora de energia eléctrica e os potenciais utilizadores finais como um jogo de forma extensiva. São abordados dois programas em tempo real de resposta à procura: Day-Ahead Pricing (DAP) e Convex Pricing Tariffs. A resposta dos consumidores residenciais conscientes dos preços destas tarifas, é formulada como um problema de Mixed Integer Linear Programming (MILP) ou Quadratic Programming (QP), nos quais as soluções potenciais são o agendamento dos seus electrodomésticos inteligentes de modo a minimizar os seus gastos diários de electricidade, satisfazendo as suas necessidades diárias de energia e níveis de conforto. Os resultados demonstram que implementar o programa DAP pode reduzir a razão Peak-to-Average (PAR) at e 71% e as faturas de consumo das casas inteligentes at e 32%. Para além disso, a aplicação de tarifas convexas em tempo real pode melhorar ainda mais estas métricas de desempenho, alcançando uma redução de 80% do PAR e uma economia de mais de 50% na faturação da energia residencial.This research thesis aims to provide conclusive statements towards effective resource utilization for 5G (5th Generation) mobile networks and applications using game theory. In this context, we investigate two key scenarios pertaining to mobile communications and smart grids. A pivotal design driver for the upcoming era of mobile communications is energy efficiency, with particular emphasis on the mobile side where battery technology is still limited. Related works have shown that cooperation can be a useful engineering paradigm to take a step towards solving the energy deficit. However, we go beyond by envisaging cooperation and mobile users as a game of rational players, that can act on strategies and utilities in order to choose the most appropriate relay for energy saving. This interpretation lends itself to the application of game theory, and we look at coalitional games to settle conflicts of interest among cooperating user equipments, and employ Linear Programming (LP) to solve the relay selection problem and to derive the core solution of the game. The results reveal that adopting the proposed coalitional relaying game can potentially double battery lifetime, in an era where the next wave of next generation handsets will be more energy demanding supporting sophisticated services and applications. The second scenario investigates demand response in smart grid applications, which is also gaining momentum under the umbrella of 5G, which is a promising approach urging end-users to consume electricity more evenly during nonpeak hours of the day. Again, we resort to game theory and picture the strategic interactions between the electric utility company and the potential end-users as an extensive form game. Two real-time demand response programmes are addressed, namely Day-Ahead Pricing (DAP) and convex pricing tariffs. The response of price-aware residential consumers to these programmes is formulated as Mixed Integer Linear Programming (MILP) or Quadratic Programming (QP) problem, which optimally schedule their smart home appliances so as to minimise their daily electricity expenses while satisfying their daily energy needs and comfort levels. The results demonstrate that implementing the DAP programme can reduce the Peakto- Average Ratio (PAR) of demand by up to 71% and cut smart households bill by 32%. Moreover, applying real-time convex pricing tariffs can push these performance metrics even further, achieving 80% PAR reduction and more than 50% saving on the household electricity bill

    Spectral Efficient and Energy Aware Clustering in Cellular Networks

    Full text link
    The current and envisaged increase of cellular traffic poses new challenges to Mobile Network Operators (MNO), who must densify their Radio Access Networks (RAN) while maintaining low Capital Expenditure and Operational Expenditure to ensure long-term sustainability. In this context, this paper analyses optimal clustering solutions based on Device-to-Device (D2D) communications to mitigate partially or completely the need for MNOs to carry out extremely dense RAN deployments. Specifically, a low complexity algorithm that enables the creation of spectral efficient clusters among users from different cells, denoted as enhanced Clustering Optimization for Resources' Efficiency (eCORE) is presented. Due to the imbalance between uplink and downlink traffic, a complementary algorithm, known as Clustering algorithm for Load Balancing (CaLB), is also proposed to create non-spectral efficient clusters when they result in a capacity increase. Finally, in order to alleviate the energy overconsumption suffered by cluster heads, the Clustering Energy Efficient algorithm (CEEa) is also designed to manage the trade-off between the capacity enhancement and the early battery drain of some users. Results show that the proposed algorithms increase the network capacity and outperform existing solutions, while, at the same time, CEEa is able to handle the cluster heads energy overconsumption

    Towards 5G Cellular: Understanding 3D In-Building Single Band and Multi-band Small Cells with Control/User-plane Coupled and Separation Architectures with a Novel Resource Reuse Approach

    Get PDF
    In this paper, we present numerous small cell base station, i.e. femtocell base station (FCBS), with control-/user-plane coupled and separation architectures based on the number of transceivers and operating frequency bands to serve control-/user-plane traffic. A single transceiver enabled FCBS can operate at either a co-channel microwave of the overlaid macrocell or a millimeter wave band. For multiple transceivers, dual transceivers are considered operating at both bands. FCBSs are deployed in a number of buildings with each floor modeled as 5Ă—5 square-grid apartments. The co-channel interference with FCBSs is avoided using enhanced intercell interference coordination techniques. We propose a static frequency reuse approach and develop an algorithm by avoiding adjacent channel interferences from reusing frequencies in FCBSs. We also develop a resource scheduling algorithm for FCBSs with CUCA and CUSA to evaluate system level performances with a multi-tier network. It is found that a single transceiver co-channel microwave enabled FCBS with CUCA provides the worse, whereas a single or dual transceivers millimeter wave enabled FCBS with CUSA provides the best overall system capacity and FCBSs’ energy efficiency performances. Besides, we show the outperformances of the proposed resource reuse approach over an existing approach in literature in terms of system capacity and fairness among FCBSs with CUCA. Finally, we point out the applicability of a multi-band enabled FCBS and several features and issues of FCBSs with CUCA and CUSA.In this paper, we present numerous small cell base station, i.e. femtocell base station (FCBS), with control-/user-plane coupled and separation architectures based on the number of transceivers and operating frequency bands to serve control-/user-plane traffic. A single transceiver enabled FCBS can operate at either a co-channel microwave of the overlaid macrocell or a millimeter wave band. For multiple transceivers, dual transceivers are considered operating at both bands. FCBSs are deployed in a number of buildings with each floor modeled as 5 by 5 square-grid apartments. The co-channel interference with FCBSs is avoided using enhanced intercell interference coordination techniques. We propose a static frequency reuse approach and develop an algorithm by avoiding adjacent channel interferences from reusing frequencies in FCBSs. We also develop a resource scheduling algorithm for FCBSs with CUCA and CUSA to evaluate system level performances with a multi-tier network. It is found that a single transceiver co-channel microwave enabled FCBS with CUCA provides the worse, whereas a single or dual transceivers millimeter wave enabled FCBS with CUSA provides the best overall system capacity and FCBSs' energy efficiency performances. Besides, we show the outperformances of the proposed resource reuse approach over an existing approach in literature in terms of system capacity and fairness among FCBSs with CUCA. Finally, we point out the applicability of a multi-band enabled FCBS and several features and issues of FCBSs with CUCA and CUSA

    Radio Resource Sharing for MTC in LTE-A: An Interference-Aware Bipartite Graph Approach

    Get PDF
    International audienceTraditional cellular networks have been considered the most promising candidates to support machine to machine (M2M) communication mainly due to their ubiquitous coverage. Optimally designed to support human to human (H2H) communication, an innovative access to radio resources is required to accommodate M2M unique features such as the massive number of machine type devices (MTDs) as well as the limited data transmission session. In this paper, we consider a simultaneous access to the spectrum in an M2M/H2H coexistence scenario. Taking the advantage of the new device to device (D2D) communication paradigm enabled in long term evolution-advanced (LTE-A), we propose to combine M2M and D2D owing to the MTD low transmit power and thus enabling efficiently the resource sharing. First, we formulate the resource sharing problem as a maximization of the sum-rate, problem for which the optimal solution has been proved to be non deterministic polynomial time hard (NP-Hard). We next model the problem as a novel interference-aware bipartite graph to overcome the computational complexity of the optimal solution. To solve this problem, we consider here a two-phase resource allocation approach. In the first phase, H2H users resource assignment is performed in a conventional way. In the second phase, we introduce two alternative algorithms, one centralized and one semi-distributed to perform M2M resource allocation. The computational complexity of both introduced algorithms whose aim is to solve the M2M resource allocation, is of polynomial complexity. Simulation results show that the semi-distributed M2M resource allocation algorithm achieves quite good performance in terms of network aggregate sum-rate with markedly lower communication overhead compared to the centralized one

    Cooperation Strategies for Enhanced Connectivity at Home

    Get PDF
    WHILE AT HOME , USERS MAY EXPERIENCE A POOR I NTERNET SERVICE while being connected to their 802.11 Access Points (APs). The AP is just one component of the Internet Gateway (GW) that generally includes a backhaul connection (ADSL, fiber,etc..) and a router providing a LAN. The root cause of performance degradation may be poor/congested wireless channel between the user and the GW or congested/bandwidth limited backhaul connection. The latter is a serious issue for DSL users that are located far from the central office because the greater the distance the lesser the achievable physical datarate. Furthermore, the GW is one of the few devices in the home that is left always on, resulting in energy waste and electromagnetic pollution increase. This thesis proposes two strategies to enhance Internet connectivity at home by (i) creating a wireless resource sharing scheme through the federation and the coordination of neighboring GWs in order to achieve energy efficiency while avoiding congestion, (ii) exploiting different king of connectivities, i.e., the wired plus the cellular (3G/4G) connections, through the aggregation of the available bandwidth across multiple access technologies. In order to achieve the aforementioned strategies we study and develop: • A viable interference estimation technique for 802.11 BSSes that can be implemented on commodity hardware at the MAC layer, without requiring active measurements, changes in the 802.11 standard, cooperation from the wireless stations (WSs). We extend previous theoretical results on the saturation throughput in order to quantify the impact in term of throughput loss of any kind of interferer. We im- plement and extensively evaluate our estimation technique with a real testbed and with different kind of interferer, achieving always good accuracy. • Two available bandwidth estimation algorithms for 802.11 BSSes that rely only on passive measurements and that account for different kind of interferers on the ISM band. This algorithms can be implemented on commodity hardware, as they require only software modifications. The first algorithm applies to intra-GW while the second one applies to inter-GW available bandwidth estimation. Indeed, we use the first algorithm to compute the metric for assessing the Wi-Fi load of a GW and the second one to compute the metric to decide whether accept incoming WSs from neighboring GWs or not. Note that in the latter case it is assumed that one or more WSs with known traffic profile are requested to relocate from one GW to another one. We evaluate both algorithms with simulation as well as with a real test-bed for different traffic patterns, achieving high precision. • A fully distributed and decentralized inter-access point protocol for federated GWs that allows to dynamically manage the associations of the wireless stations (WSs) in the federated network in order to achieve energy efficiency and offloading con- gested GWs, i.e, we keep a minimum number of GWs ON while avoiding to create congestion and real-time throughput loss. We evaluate this protocol in a federated scenario, using both simulation and a real test-bed, achieving up to 65% of energy saving in the simulated setting. We compare the energy saving achieved by our protocol against a centralized optimal scheme, obtaining close to optimal results. • An application level solution that accelerates slow ADSL connections with the parallel use of cellular (3G/4G) connections. We study the feasibility and the potential performance of this scheme at scale using both extensive throughput measurement of the cellular network and trace driven analysis. We validate our solution by implementing a real test bed and evaluating it “in the wild, at several residential locations of a major European city. We test two applications: Video-on-Demand (VoD) and picture upload, obtaining remarkable throughput increase for both applications at all locations. Our implementation features a multipath scheduler which we compare to other scheduling policies as well as to transport level solution like MTCP, obtaining always better results

    A Study of Mobility Support in Wearable Health Monitoring Systems: Design Framework

    Get PDF
    International audienceThe aim of this work is to investigate main techniques and technologies enabling user's mobility in wearable health monitoring systems. For this, design requirements for key enabling mechanisms are pointed out, and a number of conceptual and technological recommendations are presented. The whole is schematized and presented into the form of a design framework covering design layers and taking in consideration patient context constraints. This work aspires to bring a further contribution for the conception and possibly the evaluation of health monitoring systems with full support of mobility offering freedom to users while enhancing their life qualit

    Secure Incentives to Cooperate for Wireless Networks

    Get PDF
    The operating principle of certain wireless networks makes essential the cooperation between the mobile nodes. However, if each node is an autonomous selfish entity, cooperation is not guaranteed and therefore we need to use incentive techniques. In this thesis, we study cooperation in three different types of networks: WiFi networks, Wireless Mesh Networks (WMNs), and Hybrid Ad-hoc networks. Cooperation has a different goal for each of these networks, we thus propose incentive mechanisms adapted to each case. In the first chapter of this thesis, we consider WiFi networks whose wide-scale adoption is impeded by two major hurdles: the lack of a seamless roaming scheme and the variable QoS experienced by the users. We devise a reputation-based solution that (i) allows a mobile node to connect to a foreign Wireless ISP in a secure way while preserving his anonymity and (ii) encourages the WISPs to cooperate, i.e., to provide the mobile clients with a good QoS. Cooperation appears here twofold: First, the mobile clients have to collaborate in order to build and maintain the reputation system and second, the use of this reputation system encourages the WISPs to cooperate. We show, by means of simulations, that our reputation model indeed encourages the WISPs to behave correctly and we analyze the robustness of our solution against various attacks. In the second chapter of the thesis, we consider Wireless Mesh Networks (WMNs), a new and promising paradigm that uses multi-hop communications to extend WiFi networks. Indeed, by connecting only one hot spot to the Internet and by deploying several Transit Access Points (TAPs), a WISP can extend its coverage and serve a large number of clients at a very low cost. We analyze the characteristics of WMNs and deduce three fundamental network operations that need to be secured: (i) the routing protocol, (ii) the detection of corrupt TAPs and (iii) the enforcement of a proper fairness metric in WMNs. We focus on the fairness problem and propose FAME, an adaptive max-min fair resource allocation mechanism for WMNs. FAME provides a fair, collision-free capacity use of the WMN and automatically adjusts to the traffic demand fluctuations of the mobile clients. We develop the foundations of the mechanism and demonstrate its efficiency by means of simulations. We also experimentally assess the utility of our solution when TAPs are equipped with directional antennas and distinct sending and receiving interfaces in the Magnets testbed deployed in Berlin. In the third and last chapter of this thesis, we consider Hybrid Ad-hoc networks, i.e., infrastructured networks that are extended using multi-hop communications. We propose a secure set of protocols to encourage the most fundamental operation in these networks, namely packet forwarding. This solution is based on a charging and rewarding system. We use "MAC layering" to reduce the space overhead in the packets and a stream cipher encryption mechanism to provide "implicit authentication" of the nodes involved in the communication. We analyze the robustness of our protocols against rational and malicious attacks. We show that the use of our solution makes cooperation rational for selfish nodes. We also show that our protocols thwart rational attacks and detect malicious attacks

    From Packet to Power Switching: Digital Direct Load Scheduling

    Full text link
    At present, the power grid has tight control over its dispatchable generation capacity but a very coarse control on the demand. Energy consumers are shielded from making price-aware decisions, which degrades the efficiency of the market. This state of affairs tends to favor fossil fuel generation over renewable sources. Because of the technological difficulties of storing electric energy, the quest for mechanisms that would make the demand for electricity controllable on a day-to-day basis is gaining prominence. The goal of this paper is to provide one such mechanisms, which we call Digital Direct Load Scheduling (DDLS). DDLS is a direct load control mechanism in which we unbundle individual requests for energy and digitize them so that they can be automatically scheduled in a cellular architecture. Specifically, rather than storing energy or interrupting the job of appliances, we choose to hold requests for energy in queues and optimize the service time of individual appliances belonging to a broad class which we refer to as "deferrable loads". The function of each neighborhood scheduler is to optimize the time at which these appliances start to function. This process is intended to shape the aggregate load profile of the neighborhood so as to optimize an objective function which incorporates the spot price of energy, and also allows distributed energy resources to supply part of the generation dynamically.Comment: Accepted by the IEEE journal of Selected Areas in Communications (JSAC): Smart Grid Communications series, to appea
    • …
    corecore