92 research outputs found
Design and optimisation of a low cost Cognitive Mesh Network
Wireless Mesh Networks (WMNs) have been touted as the most promising wireless technology in providing high-bandwidth Internet access to rural, remote and under-served areas, with relatively lower investment cost as compared to traditional access networks. WMNs structurally comprise of mesh routers and mesh clients. Furthermore, WMNs have an envisaged ability to provide a heterogeneous network system that integrates wireless technologies such as IEEE 802.22 WRAN, IEEE 802.16 WiMAX, IEEE 802.11 Wi-Fi, Blue-tooth etc. The recent proliferation of new devices on the market such as smart phones and, tablets, and the growing number of resource hungry applications has placed a serious strain on spectrum availability which gives rise to the spectrum scarcity problem. The spectrum scarcity problem essentially results in increased spectrum prices that hamper the growth and efficient performance of WMNs as well as subsequent transformation of WMN into the envisaged next generation networks. Recent developments in TV white space communications technology and the emergence of Cognitive radio devices that facilitate Dynamic Spectrum Access (DSA) have provided an opportunity to mitigate the spectrum scarcity problem. To solve the scarcity problem, this thesis reconsiders the classical Network Engineering (NE) and Traffic Engineering (TE) problems to objectively design a low cost Cognitive Mesh network that promotes efficient resources utilization and thereby achieve better Quality of Service (QoS) levels
Resource allocation for dataflow applications in FANETs using anypath routing
Management of network resources in advanced IoT applications is a challenging topic due to their distributed nature from the Edge to the Cloud, and the heavy demand of real-time data from many sources to take action in the deployment. FANETs (Flying Ad-hoc Networks) are a clear example of heterogeneous multi-modal use cases, which require strict quality in the network communications, as well as the coordination of the computing capabilities, in order to operate correctly the final service. In this paper, we present a Virtual Network Embedding (VNE) framework designed for the allocation of dataflow applications, composed of nano-services that produce or consume data, in a wireless infrastructure, such as an airborne network. To address the problem, an anypath-based heuristic algorithm that considers the quality demand of the communication between nano-services is proposed, coined as Quality-Revenue Paired Anypath Dataflow VNE (QRPAD-VNE). We also provide a simulation environment for the evaluation of its performance according to the virtual network (VN) request load in the system. Finally, we show the suitability of a multi-parameter framework in conjunction with anypath routing in order to have better performance results that guarantee minimum quality in the wireless communications.Xunta de Galicia | Ref. ED431C 2022/04 T254Ministerio de Universidades | Ref. FPU19/01284Agencia Estatal de Investigación | Ref. PCI2020-112174Agencia Estatal de Investigación | Ref. PID2020-113795RB-C33Agencia Estatal de Investigación | Ref. PID2020-116329GB-C21Universidade de Vigo/CISU
Game Theory for Multi-Access Edge Computing:Survey, Use Cases, and Future Trends
Game theory (GT) has been used with significant success to formulate, and either design or optimize, the operation of many representative communications and networking scenarios. The games in these scenarios involve, as usual, diverse players with conflicting goals. This paper primarily surveys the literature that has applied theoretical games to wireless networks, emphasizing use cases of upcoming multiaccess edge computing (MEC). MEC is relatively new and offers cloud services at the network periphery, aiming to reduce service latency backhaul load, and enhance relevant operational aspects such as quality of experience or security. Our presentation of GT is focused on the major challenges imposed by MEC services over the wireless resources. The survey is divided into classical and evolutionary games. Then, our discussion proceeds to more specific aspects which have a considerable impact on the game's usefulness, namely, rational versus evolving strategies, cooperation among players, available game information, the way the game is played (single turn, repeated), the game's model evaluation, and how the model results can be applied for both optimizing resource-constrained resources and balancing diverse tradeoffs in real edge networking scenarios. Finally, we reflect on lessons learned, highlighting future trends and research directions for applying theoretical model games in upcoming MEC services, considering both network design issues and usage scenarios
Game theory for cooperation in multi-access edge computing
Cooperative strategies amongst network players can improve network performance and spectrum utilization in future networking environments. Game Theory is very suitable for these emerging scenarios, since it models high-complex interactions among distributed decision makers. It also finds the more convenient management policies for the diverse players (e.g., content providers, cloud providers, edge providers, brokers, network providers, or users). These management policies optimize the performance of the overall network infrastructure with a fair utilization of their resources. This chapter discusses relevant theoretical models that enable cooperation amongst the players in distinct ways through, namely, pricing or reputation. In addition, the authors highlight open problems, such as the lack of proper models for dynamic and incomplete information scenarios. These upcoming scenarios are associated to computing and storage at the network edge, as well as, the deployment of large-scale IoT systems. The chapter finalizes by discussing a business model for future networks.info:eu-repo/semantics/acceptedVersio
Recommended from our members
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
Trust-based mechanisms for secure communication in cognitive radio networks
Cognitive radio (CR) technology was introduced to solve the problem of spectrum scarcity to support the growth of wireless communication. However, the inherent properties of CR technology make such networks more vulnerable to attacks. This thesis is an effort to develop a trust-based framework to ensure secure communication in CRN by authenticating trustworthy nodes to share spectrum securely and increasing system's availability and reliability by selecting the trustworthy key nodes in CRNs
White Space Network Management: Spectrum Quanti cation, Spectrum Allocation and Network Design
Philosophiae Doctor - PhD (Computer Science)The unused spectrum in the television broadcasting frequency bands (so-called TV
white spaces) can alleviate the spectrum crunch, and have potential to provide
broadband connection to rural areas of countries in the developing world. Current
research on TV white spaces focuses on how to detect them accurately, and how they
can be shared or allocated to secondary devices. Therefore, the focus of this research is
three-fold: to investigate a novel distributed framework, which does not use
propagation models in detecting TV white spaces, and suitable for use in countries of
the developing world; to investigate a suitable spectrum sharing mechanism for
short-time leasing of the TV white spaces to secondary devices; and extend the
research to investigate the design of a TV white space-ware network in TV white space
frequencies
Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks
This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field
- …