357 research outputs found
Adaptive resource allocation for cognitive wireless ad hoc networks
Widespread use of resource constrained wireless ad hoc networks requires careful management of the network resources in order to maximize the utilization. In cognitive wireless networks, resources such as spectrum, energy, communication links/paths, time, space, modulation scheme, have to be managed to maintain quality of service (QoS). Therefore in the first paper, a distributed dynamic channel allocation scheme is proposed for multi-channel wireless ad hoc networks with single-radio nodes. The proposed learning scheme adapts the probabilities of selecting each channel as a function of the error in the performance index at each step.
Due to frequent changes in topology and flow traffic over time, wireless ad hoc networks require a dynamic routing protocol that adapts to the changes of the network while allocating network resources. In the second paper, approximate dynamic programming (ADP) techniques are utilized to find dynamic routes, while solving discrete-time Hamilton-Jacobi-Bellman (HJB) equation forward-in-time for route cost. The third paper extends the dynamic routing to multi-channel multi-interface networks which are affected by channel uncertainties and fading channels. By the addition of optimization techniques through load balancing over multiple paths and multiple wireless channels, utilization of wireless channels throughout the network is enhanced.
Next in the fourth paper, a decentralized game theoretic approach for resource allocation of the primary and secondary users in a cognitive radio networks is proposed. The priorities of the networks are incorporated in the utility and potential functions which are in turn used for resource allocation. The proposed game can be extended to a game among multiple co-existing networks, each with different priority levels --Abstract, page iv
Game theory for collaboration in future networks
Cooperative strategies have the great potential of improving network performance and spectrum utilization in future networking environments. This new paradigm in terms of network management, however, requires a novel design and analysis framework targeting a highly flexible networking solution with a distributed architecture. Game Theory is very suitable for this task, since it is a comprehensive mathematical tool for modeling the highly complex interactions among distributed and intelligent decision makers. In this way, the more convenient management policies for the diverse players (e.g. content providers, cloud providers, home providers, brokers, network providers or users) should be found to optimize the performance of the overall network infrastructure. The authors discuss in this chapter several Game Theory models/concepts that are highly relevant for enabling collaboration among the diverse players, using different ways to incentivize it, namely through pricing or reputation. In addition, the authors highlight several related open problems, such as the lack of proper models for dynamic and incomplete information games in this area.info:eu-repo/semantics/acceptedVersio
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
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Competition in Wireless Systems via Bayesian Interference Games
We study competition between wireless devices with incomplete information
about their opponents. We model such interactions as Bayesian interference
games. Each wireless device selects a power profile over the entire available
bandwidth to maximize its data rate. Such competitive models represent
situations in which several wireless devices share spectrum without any central
authority or coordinated protocol.
In contrast to games where devices have complete information about their
opponents, we consider scenarios where the devices are unaware of the
interference they cause to other devices. Such games, which are modeled as
Bayesian games, can exhibit significantly different equilibria. We first
consider a simple scenario of simultaneous move games, where we show that the
unique Bayes-Nash equilibrium is where both devices spread their power equally
across the entire bandwidth. We then extend this model to a two-tiered spectrum
sharing case where users act sequentially. Here one of the devices, called the
primary user, is the owner of the spectrum and it selects its power profile
first. The second device (called the secondary user) then responds by choosing
a power profile to maximize its Shannon capacity. In such sequential move
games, we show that there exist equilibria in which the primary user obtains a
higher data rate by using only a part of the bandwidth.
In a repeated Bayesian interference game, we show the existence of reputation
effects: an informed primary user can bluff to prevent spectrum usage by a
secondary user who suffers from lack of information about the channel gains.
The resulting equilibrium can be highly inefficient, suggesting that
competitive spectrum sharing is highly suboptimal.Comment: 30 pages, 3 figure
- …