Application of game theory in ad- hoc opportunistic radios

P r a m o d K u m a r S a g a r & D r. A n u C h a u d h a r y Abstract:-During recent years, demand of communication is growing rapidly. Duet to this increment in the demand of communication there are various challenges are faced during communication such as throughput, delay etc. In this field of communication, mobile Ad-Hoc networks (MANET) have been proved a promising technique to achieve better communication quality but due to dynamic nature of mobile nodes in MANET, there is a requirement of new approach to improve the performance of network even if node are dynamic. In this paper, we use game theoretic approach to support QoS in MANET. According to the proposed model, initially a problem is formulated which generates a non-convex problem for MANET. In order to solve this we use game theory approach. For further improvement in the network, we use cooperative approach of game theory. Simulation study is carried out using MATLAB tool. Experimental study shows the improved performance when compared to other protocols.

Ad Hoc Networks, 2011

We consider a distributed joint random access and power control scheme for interference management in wireless ad hoc networks. To derive decentralized solutions that do not require any cooperation among the users, we formulate this problem as noncooperative joint random access and power control game, in which each user minimizes its average transmission cost with a given rate constraint. Using

Game theory is a set of tools developed to model interactions between agents with conflicting interests . It is a field of applied mathematics that defines and evaluates interactive decision situations. It provides analytical tools to predict the outcome of complicated interactions between rational entities, where rationality demands strict adherence to a strategy based on observed or measured results . Originally developed to model problems in the field of economics, game theory has recently been applied to network problems, in most cases to solve the resource allocation problems in a competitive environment. The reason that game theory is an adapted choice for studying cooperative communications is various. Nodes in the network are independent agents, making decisions only for their own interests. Game theory provides us sufficient theoretical tools to analyze the network users' behaviors and actions. Game theory, also primarily deals with distributed optimization, which often requires local information only. Thus it enables us to design distributed algorithms. . This article surveys the literature on game theory as they apply to wireless networks. First, a brief overview of classifications of games, important definitions used in games (Nash Equilibrium, Pareto efficiency, Pure, Mixed and Fully mixed strategies) and game models are presented. Then, we identified five areas of application of game theory in wireless networks; therefore, we discuss related work to game theory in communication networks, cognitive radio networks, wireless sensor networks, resource allocation and power control. Finally, we discuss the limitations of the application of game theory in wireless networks.

Wireless Networks and Mobile Communications, 2011

Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks, 2013

In this paper, we revisit the power control problem in wireless networks by introducing a signaling game approach. This game is known in the literature as "Cheap Talk". Under the considered scenario, we consider two players named player I and player II. We assume that player I only knows his channel state without any information about the channel state of player II and vice-versa. Player I moves first and sends a signal to player II which can be accurate or distorted. Player II picks up his power control strategy based on this information and his belief about the nature of the informed player's information. In order to analyze such a model, the proposed scheme game is transformed into 4 × 4 matrix game. We establish the existence of Nash equilibria and show by numerical results the equilibria and the performance of the proposed signaling game.

2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, 2008

In this paper, a distributed power-aware Medium Access Control (MAC) algorithm for ad hoc wireless networks is presented. The algorithm is developed based on proposing a power-aware MAC game which is analyzed in the game theory framework. The aim is to adjust each active link persistence probability and power by maximizing a defined local link payoff function. The payoff function is such that its selfish maximization at the links leads to an efficient use of medium resources and has two terms. The first term is the link utility while the second one reflects the cost of using the medium resources. The existence and uniqueness of the game Nash equilibrium are investigated analytically. Also, it is shown that this equilibrium is Pareto optimal indicating its efficiency. Simulation results are provided to evaluate the algorithm and are compared to a scenario in which only powers are tuned. This results emphasize that the link persistence and power should be adjusted simultaneously according to the link location in ad hoc networks.

Computer Networks, 2010

While the Quality of Service (QoS) offered to users may be enhanced through innovative protocols and new technologies, future trends should take into account the efficiency of resource allocation and network/terminal cooperation as well. Game theory techniques have widely been applied to various engineering design problems in which the action of one component has impact on (and perhaps conflicts with) that of any other component. Therefore, game formulations are used, and a stable solution for the players is obtained through the concept of equilibrium. This survey collects applications of game theory in wireless networking and presents them in a layered perspective, emphasizing on which fields game theory could be effectively applied. To this end, several games are modeled and their key features are exposed.

John Wiley & Sons, Inc. eBooks, 2015

Ad hoc networks are wireless networks that form spontaneously and organize themselves automatically without requiring a pre-existing infrastructure. An ad hoc network is a collection of hosts (nodes) equipped with antennas that can communicate with one another without administrative centralization based on the topology of wireless communication. Unlike wired networks in which only a few nodes called routers are responsible for delivering data, in an ad hoc network, each node acts as a terminal mode, and possibly as a link to relay messages when recipients are not within radio range of the transmitters. In an ad hoc network, a node can communicate directly with another node in point-to-point mode when the two nodes are located in the same transmission zone, while communication with a node in another zone is carried out via several intermediary nodes in multi-hop mode. Initially of military origin [JUB 87], due to several of the benefits they offer, ad hoc networks are of confirmed interest for circumstances characterized by a total lack of pre-existing infrastructures. From an applicative point of view, ad hoc wireless networks are useful in situations that require the deployment of a rapid local network or one lacking infrastructure, such as reaction to a crisis, conferences, military applications and possibly household and office

International Journal of Students’ Research in Technology & Management, 2017

Cognitive Radio (CR) technology is imagined to solve the problems in Wireless Ad-hoc NETworks (WANET) resulting from the limited available spectrum and the inefficiency in the spectrum usage by exploiting the existing wireless spectrum opportunistically. Game theory is a process to analyze multi-person decision making situation, where each decision maker tries to maximize his own utility. In this paper, we illustrates how various interactions in Cognitive Radio Ad Hoc Network (CRAHN) can be modeled as a game. It also illustrates a problem with solution approach that uses intelligent game theory technique in CRAHN.

IEEE Systems Journal, 2017

This paper employs game theory to optimize the performance of multiple secondary users (SUs) in a cognitive radio ad hoc network where the primary and SUs have quality of service (QoS) constraints. The proposed algorithm utilizes a distributed noncooperative game theory mechanism among SUs that compete to maximize their individual capacities. We propose two utility functions, UcLog and UcLin, with logarithmic and linear cost functions of the perceived interference in the primary receiver, respectively. The value of the utility function varies according to the transmit power and the relay selection strategy. Simulation results show that both utility functions obtain similar results in most scenarios. However, UcLin causes less interference to the primary receiver and has better convergence than UcLog. The two consecutive games mechanism used in the proposed algorithm allows us to achieve rates above 95% in all simulated scenarios without QoS constraints in secondary links. Index Terms-Cognitive radio (CR), game theory, power control (PC), relay selection (RS). Onel L. A. López, photograph and biography not available at the time of publication. Samuel Montejo Sánchez, photograph and biography not available at the time of publication. Samuel B. Mafra (GS'12), photograph and biography not available at the time of publication. Evelio M. G. Fernandez (M'13), photograph and biography not available at the time of publication. Glauber Brante (S'10-GS'10-M'14), photograph and biography not available at the time of publication.

2011

With increasing demand for data transfer requirements on wireless networks, spectrum became a scarce resource due to inefficient allocation and management. Recent research efforts diverted the problem towards dynamic spectrum access models for effective utilization of the unused or idled spectrum. The models include overlay/underlay techniques by designing the framework to improve the spectrum efficiently by using business and game theory models. Surveying of these models concludes that the key component for efficient utilization of the unused spectrum is the detection of the unused spectrum at any given time. Further, we found that by allocating the unused spectrum using appropriate techniques (business, game, and hybrid models) will produce better results. Among these models, the game models were identified as one of the powerful mathematical tools to detect and allocate the unused spectrum. In this paper, we first discussed the role of game models in wireless communications, player"s strategy selection for better utility, and then proposed a correlated equilibrium algorithm for efficient allocation of spectrum. The simulations conclude that the mixed strategies are better than the pure strategies in resource allocation.

IEEE Journal on Selected Areas in Communications, 2000

2004

I would like to thank my advisor, Professor Chaouki Abdallah, for his support, continuous guidance and inspiration and for introducing me to the field of this in-teresting research. I would also like to thank the dissertation committee: Professor Majid Hayat, Professor Christos ...

Proceedings of the 38th Annual Hawaii International Conference on System Sciences, 2005

This paper focuses on the competitively optimal power-control and signal-shaping for "ad-hoc" networks composed by Multiple-Antenna noncooperative transmit/receive terminals affected by spatially colored Multiple-Access Interference (MAI). For this purpose, the MAI-impaired network is modeled as a noncooperative strategic game, and sufficient conditions for the existence and uniqueness of the Nash Equilibrium are provided. Specifically, the following main results are achieved. First, we develop an iterative, fully decentralized, asynchronous and scalable power-control and signal-shaping algorithm that is competitively optimal and maximizes the information throughput sustained by links active over the network. Second, we test that the proposed decentralized access algorithm outperforms the (conventional) centralized orthogonal ones (as TDMA) in terms of aggregate network throughput. Third, we show that, when the throughput requested by the users are no sustainable by the network, the proposed algorithm converges to the allowable operating point at the minimum Euclidean distance from the requested one. Finally, we propose two fully decentralized Connection Admission Procedures (CAPs) that rely on the proposed decentralized access algorithm and optimize the tradeoff between aggregated networking throughput and users QoS requirements.