2,231 research outputs found
Decentralized Dynamic Hop Selection and Power Control in Cognitive Multi-hop Relay Systems
In this paper, we consider a cognitive multi-hop relay secondary user (SU)
system sharing the spectrum with some primary users (PU). The transmit power as
well as the hop selection of the cognitive relays can be dynamically adapted
according to the local (and causal) knowledge of the instantaneous channel
state information (CSI) in the multi-hop SU system. We shall determine a low
complexity, decentralized algorithm to maximize the average end-to-end
throughput of the SU system with dynamic spatial reuse. The problem is
challenging due to the decentralized requirement as well as the causality
constraint on the knowledge of CSI. Furthermore, the problem belongs to the
class of stochastic Network Utility Maximization (NUM) problems which is quite
challenging. We exploit the time-scale difference between the PU activity and
the CSI fluctuations and decompose the problem into a master problem and
subproblems. We derive an asymptotically optimal low complexity solution using
divide-and-conquer and illustrate that significant performance gain can be
obtained through dynamic hop selection and power control. The worst case
complexity and memory requirement of the proposed algorithm is O(M^2) and
O(M^3) respectively, where is the number of SUs
Hierarchical Cooperation for Operator-Controlled Device-to-Device Communications: A Layered Coalitional Game Approach
Device-to-Device (D2D) communications, which allow direct communication among
mobile devices, have been proposed as an enabler of local services in 3GPP
LTE-Advanced (LTE-A) cellular networks. This work investigates a hierarchical
LTE-A network framework consisting of multiple D2D operators at the upper layer
and a group of devices at the lower layer. We propose a cooperative model that
allows the operators to improve their utility in terms of revenue by sharing
their devices, and the devices to improve their payoff in terms of end-to-end
throughput by collaboratively performing multi-path routing. To help
understanding the interaction among operators and devices, we present a
game-theoretic framework to model the cooperation behavior, and further, we
propose a layered coalitional game (LCG) to address the decision making
problems among them. Specifically, the cooperation of operators is modeled as
an overlapping coalition formation game (CFG) in a partition form, in which
operators should form a stable coalitional structure. Moreover, the cooperation
of devices is modeled as a coalitional graphical game (CGG), in which devices
establish links among each other to form a stable network structure for
multi-path routing.We adopt the extended recursive core, and Nash network, as
the stability concept for the proposed CFG and CGG, respectively. Numerical
results demonstrate that the proposed LCG yields notable gains compared to both
the non-cooperative case and a LCG variant and achieves good convergence speed.Comment: IEEE Wireless Communications and Networking Conference 201
A Hybrid Model to Extend Vehicular Intercommunication V2V through D2D Architecture
In the recent years, many solutions for Vehicle to Vehicle (V2V)
communication were proposed to overcome failure problems (also known as dead
ends). This paper proposes a novel framework for V2V failure recovery using
Device-to-Device (D2D) communications. Based on the unified Intelligent
Transportation Systems (ITS) architecture, LTE-based D2D mechanisms can improve
V2V dead ends failure recovery delays. This new paradigm of hybrid V2V-D2D
communications overcomes the limitations of traditional V2V routing techniques.
According to NS2 simulation results, the proposed hybrid model decreases the
end to end delay (E2E) of messages delivery. A complete comparison of different
D2D use cases (best & worst scenarios) is presented to show the enhancements
brought by our solution compared to traditional V2V techniques.Comment: 6 page
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
Spatial-temporal reasoning applications of computational intelligence in the game of Go and computer networks
Spatial-temporal reasoning is the ability to reason with spatial images or information about space over time. In this dissertation, computational intelligence techniques are applied to computer Go and computer network applications. Among four experiments, the first three are related to the game of Go, and the last one concerns the routing problem in computer networks.
The first experiment represents the first training of a modified cellular simultaneous recurrent network (CSRN) trained with cellular particle swarm optimization (PSO). Another contribution is the development of a comprehensive theoretical study of a 2x2 Go research platform with a certified 5 dan Go expert. The proposed architecture successfully trains a 2x2 game tree. The contribution of the second experiment is the development of a computational intelligence algorithm calledcollective cooperative learning (CCL). CCL learns the group size of Go stones on a Go board with zero knowledge by communicating only with the immediate neighbors. An analysis determines the lower bound of a design parameter that guarantees a solution. The contribution of the third experiment is the proposal of a unified system architecture for a Go robot. A prototype Go robot is implemented for the first time in the literature. The last experiment tackles a disruption-tolerant routing problem for a network suffering from link disruption. This experiment represents the first time that the disruption-tolerant routing problem has been formulated with a Markov Decision Process. In addition, the packet delivery rate has been improved under a range of link disruption levels via a reinforcement learning approach --Abstract, page iv
Distributed Estimation and Control of Algebraic Connectivity over Random Graphs
In this paper we propose a distributed algorithm for the estimation and
control of the connectivity of ad-hoc networks in the presence of a random
topology. First, given a generic random graph, we introduce a novel stochastic
power iteration method that allows each node to estimate and track the
algebraic connectivity of the underlying expected graph. Using results from
stochastic approximation theory, we prove that the proposed method converges
almost surely (a.s.) to the desired value of connectivity even in the presence
of imperfect communication scenarios. The estimation strategy is then used as a
basic tool to adapt the power transmitted by each node of a wireless network,
in order to maximize the network connectivity in the presence of realistic
Medium Access Control (MAC) protocols or simply to drive the connectivity
toward a desired target value. Numerical results corroborate our theoretical
findings, thus illustrating the main features of the algorithm and its
robustness to fluctuations of the network graph due to the presence of random
link failures.Comment: To appear in IEEE Transactions on Signal Processin
- …