563 research outputs found
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
Joint Head Selection and Airtime Allocation for Data Dissemination in Mobile Social Networks
Mobile social networks (MSNs) enable people with similar interests to
interact without Internet access. By forming a temporary group, users can
disseminate their data to other interested users in proximity with short-range
communication technologies. However, due to user mobility, airtime available
for users in the same group to disseminate data is limited. In addition, for
practical consideration, a star network topology among users in the group is
expected. For the former, unfair airtime allocation among the users will
undermine their willingness to participate in MSNs. For the latter, a group
head is required to connect other users. These two problems have to be properly
addressed to enable real implementation and adoption of MSNs. To this aim, we
propose a Nash bargaining-based joint head selection and airtime allocation
scheme for data dissemination within the group. Specifically, the bargaining
game of joint head selection and airtime allocation is first formulated. Then,
Nash bargaining solution (NBS) based optimization problems are proposed for a
homogeneous case and a more general heterogeneous case. For both cases, the
existence of solution to the optimization problem is proved, which guarantees
Pareto optimality and proportional fairness. Next, an algorithm, allowing
distributed implementation, for join head selection and airtime allocation is
introduced. Finally, numerical results are presented to evaluate the
performance, validate intuitions and derive insights of the proposed scheme
Review on Radio Resource Allocation Optimization in LTE/LTE-Advanced using Game Theory
Recently, there has been a growing trend toward ap-plying game theory (GT) to various engineering fields in order to solve optimization problems with different competing entities/con-tributors/players. Researches in the fourth generation (4G) wireless network field also exploited this advanced theory to overcome long term evolution (LTE) challenges such as resource allocation, which is one of the most important research topics. In fact, an efficient de-sign of resource allocation schemes is the key to higher performance. However, the standard does not specify the optimization approach to execute the radio resource management and therefore it was left open for studies. This paper presents a survey of the existing game theory based solution for 4G-LTE radio resource allocation problem and its optimization
An Enhanced Dynamic Spectrum Allocation Method on Throughput Maximization in Urban 5G FBMC Heterogeneous Network
Reports have shown that the demand for data managed by wireless systems is expected to grow by more than 500 exabytes by 2025 and beyond. 5G networks are predicted to meet these demands, provided that the spectrum resources are well managed. In this paper, an enhanced dynamic spectrum allocation (E-DSA) method is proposed, which incorporates a cooperative type of game theory called the Nash bargaining solution (NBS). It was assumed that there is one primary user (PU) and two secondary users (SU) in the network and their spectrum allocation was analyzed by testing the validity of the algorithm itself by using price weight factors to control the costs of the spectrum sharing. The solution was established by combining a proposed multiplexing method called the Filter Bank Multicarrier (FBMC) for 5G configuration, with the E-DSA algorithm to maximize the throughput of a heterogeneous 5G network. It was shown that the throughputs for 5G with E-DSA implementation were always higher than those of the ones without E-DSA. The simulation was done using the LabVIEW communication software and was analyzed based on a 5G urban macro and micro network configuration to validate the heterogeneity of the network
Interference-aware energy efficiency maximization in 5G ultra-dense networks
Ultra-dense networks can further improve the spectrum efficiency (SE) and the energy efficiency (EE). However, the interference avoidance and the green design are becoming more complex due to the intrinsic densification and scalability. It is known that the much denser small cells are deployed, the more cooperation opportunities exist among them. In this work, we characterize the cooperative behaviors in the Nash bargaining cooperative game-theoretic framework, where we maximize the EE performance with a certain sacrifice of SE performance. We first analyze the relationship between the EE and the SE, based on which we formulate the Nash-product EE maximization problem.We achieve the closed-form sub-optimal SE equilibria to maximize the EE performance with and without the minimum SE constraints. We finally propose a CE2MG algorithm, and numerical results verify the improved EE and fairness of the presented CE2MG algorithm compared with the non-cooperative scheme
An Efficient Requirement-Aware Attachment Policy for Future Millimeter Wave Vehicular Networks
The automotive industry is rapidly evolving towards connected and autonomous
vehicles, whose ever more stringent data traffic requirements might exceed the
capacity of traditional technologies for vehicular networks. In this scenario,
densely deploying millimeter wave (mmWave) base stations is a promising
approach to provide very high transmission speeds to the vehicles. However,
mmWave signals suffer from high path and penetration losses which might render
the communication unreliable and discontinuous. Coexistence between mmWave and
Long Term Evolution (LTE) communication systems has therefore been considered
to guarantee increased capacity and robustness through heterogeneous
networking. Following this rationale, we face the challenge of designing fair
and efficient attachment policies in heterogeneous vehicular networks.
Traditional methods based on received signal quality criteria lack
consideration of the vehicle's individual requirements and traffic demands, and
lead to suboptimal resource allocation across the network. In this paper we
propose a Quality-of-Service (QoS) aware attachment scheme which biases the
cell selection as a function of the vehicular service requirements, preventing
the overload of transmission links. Our simulations demonstrate that the
proposed strategy significantly improves the percentage of vehicles satisfying
application requirements and delivers efficient and fair association compared
to state-of-the-art schemes.Comment: 8 pages, 8 figures, 2 tables, accepted to the 30th IEEE Intelligent
Vehicles Symposiu
- …