7,736 research outputs found
A Non-Cooperative Game Theoretical Approach For Power Control In Virtual MIMO Wireless Sensor Network
Power management is one of the vital issue in wireless sensor networks, where
the lifetime of the network relies on battery powered nodes. Transmitting at
high power reduces the lifetime of both the nodes and the network. One
efficient way of power management is to control the power at which the nodes
transmit. In this paper, a virtual multiple input multiple output wireless
sensor network (VMIMO-WSN)communication architecture is considered and the
power control of sensor nodes based on the approach of game theory is
formulated. The use of game theory has proliferated, with a broad range of
applications in wireless sensor networking. Approaches from game theory can be
used to optimize node level as well as network wide performance. The game here
is categorized as an incomplete information game, in which the nodes do not
have complete information about the strategies taken by other nodes. For
virtual multiple input multiple output wireless sensor network architecture
considered, the Nash equilibrium is used to decide the optimal power level at
which a node needs to transmit, to maximize its utility. Outcome shows that the
game theoretic approach considered for VMIMO-WSN architecture achieves the best
utility, by consuming less power.Comment: 12 pages, 8 figure
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
Energy-Efficient Resource Allocation in Wireless Networks: An Overview of Game-Theoretic Approaches
An overview of game-theoretic approaches to energy-efficient resource
allocation in wireless networks is presented. Focusing on multiple-access
networks, it is demonstrated that game theory can be used as an effective tool
to study resource allocation in wireless networks with quality-of-service (QoS)
constraints. A family of non-cooperative (distributed) games is presented in
which each user seeks to choose a strategy that maximizes its own utility while
satisfying its QoS requirements. The utility function considered here measures
the number of reliable bits that are transmitted per joule of energy consumed
and, hence, is particulary suitable for energy-constrained networks. The
actions available to each user in trying to maximize its own utility are at
least the choice of the transmit power and, depending on the situation, the
user may also be able to choose its transmission rate, modulation, packet size,
multiuser receiver, multi-antenna processing algorithm, or carrier allocation
strategy. The best-response strategy and Nash equilibrium for each game is
presented. Using this game-theoretic framework, the effects of power control,
rate control, modulation, temporal and spatial signal processing, carrier
allocation strategy and delay QoS constraints on energy efficiency and network
capacity are quantified.Comment: To appear in the IEEE Signal Processing Magazine: Special Issue on
Resource-Constrained Signal Processing, Communications and Networking, May
200
Local Approximation Schemes for Ad Hoc and Sensor Networks
We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1+ε)-approximation to the problems at hand for any given ε > 0. The time complexity of both algorithms is O(TMIS + log*! n/εO(1)), where TMIS is the time required to compute a maximal independent set in the graph, and n denotes the number of nodes. We then extend these results to a more general class of graphs in which the maximum number of pair-wise independent nodes in every r-neighborhood is at most polynomial in r. Such graphs of polynomially bounded growth are introduced as a more realistic model for wireless networks and they generalize existing models, such as unit disk graphs or coverage area graphs
A survey on pseudonym changing strategies for Vehicular Ad-Hoc Networks
The initial phase of the deployment of Vehicular Ad-Hoc Networks (VANETs) has
begun and many research challenges still need to be addressed. Location privacy
continues to be in the top of these challenges. Indeed, both of academia and
industry agreed to apply the pseudonym changing approach as a solution to
protect the location privacy of VANETs'users. However, due to the pseudonyms
linking attack, a simple changing of pseudonym shown to be inefficient to
provide the required protection. For this reason, many pseudonym changing
strategies have been suggested to provide an effective pseudonym changing.
Unfortunately, the development of an effective pseudonym changing strategy for
VANETs is still an open issue. In this paper, we present a comprehensive survey
and classification of pseudonym changing strategies. We then discuss and
compare them with respect to some relevant criteria. Finally, we highlight some
current researches, and open issues and give some future directions
- …