21,019 research outputs found
Dynamic Time-domain Duplexing for Self-backhauled Millimeter Wave Cellular Networks
Millimeter wave (mmW) bands between 30 and 300 GHz have attracted
considerable attention for next-generation cellular networks due to vast
quantities of available spectrum and the possibility of very high-dimensional
antenna ar-rays. However, a key issue in these systems is range: mmW signals
are extremely vulnerable to shadowing and poor high-frequency propagation.
Multi-hop relaying is therefore a natural technology for such systems to
improve cell range and cell edge rates without the addition of wired access
points. This paper studies the problem of scheduling for a simple
infrastructure cellular relay system where communication between wired base
stations and User Equipment follow a hierarchical tree structure through fixed
relay nodes. Such a systems builds naturally on existing cellular mmW backhaul
by adding mmW in the access links. A key feature of the proposed system is that
TDD duplexing selections can be made on a link-by-link basis due to directional
isolation from other links. We devise an efficient, greedy algorithm for
centralized scheduling that maximizes network utility by jointly optimizing the
duplexing schedule and resources allocation for dense, relay-enhanced OFDMA/TDD
mmW networks. The proposed algorithm can dynamically adapt to loading, channel
conditions and traffic demands. Significant throughput gains and improved
resource utilization offered by our algorithm over the static,
globally-synchronized TDD patterns are demonstrated through simulations based
on empirically-derived channel models at 28 GHz.Comment: IEEE Workshop on Next Generation Backhaul/Fronthaul Networks -
BackNets 201
SDDV: scalable data dissemination in vehicular ad hoc networks
An important challenge in the domain of vehicular ad hoc networks (VANET) is the scalability of data dissemination. Under dense traffic conditions, the large number of communicating vehicles can easily result in a congested wireless channel. In that situation, delays and packet losses increase to a level where the VANET cannot be applied for road safety applications anymore. This paper introduces scalable data dissemination in vehicular ad hoc networks (SDDV), a holistic solution to this problem. It is composed of several techniques spread across the different layers of the protocol stack. Simulation results are presented that illustrate the severity of the scalability problem when applying common state-of-the-art techniques and parameters. Starting from such a baseline solution, optimization techniques are gradually added to SDDV until the scalability problem is entirely solved. Besides the performance evaluation based on simulations, the paper ends with an evaluation of the final SDDV configuration on real hardware. Experiments including 110 nodes are performed on the iMinds w-iLab.t wireless lab. The results of these experiments confirm the results obtained in the corresponding simulations
A survey of self organisation in future cellular networks
This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks
Recommended from our members
Cooperative smartphone relay selection based on fair power utilization for network coverage extension
This paper presents a relay selection algorithm based on fair battery power utilization for extending mobile network coverage and capacity by using a cooperative communication strategy where mobile devices can be utilized as relays. Cooperation improves the network performance for mobile terminals, either by providing access to out-of-range devices or by facilitating multi-path network access to connected devices. In this work, we assume that all mobile devices can benefit from using other mobile devices as relays and investigate the fairness of relay selection algorithms. We point out that signal strength based relay selection inevitably leads to unfair relay selection and devise a new algorithm that is based on fair utilization of power resources on mobile devices. We call this algorithm Credit based Fair Relay Selection (CF-RS) and in this paper show through simulation that the algorithm results in fair battery power utilization, while providing similar data rates compared with traditional approaches. We then extend the solution to demonstrate that adding incentives for relay operation adds clear value for mobile devices in the case they require relay service. Typically, mobile devices represent self-interested users who are reluctant to cooperate with other network users, mainly due to the cost in terms of power and network capacity. In this paper, we present an incentive based solution which provides clear mutual benefit for mobile devices and demonstrate this benefit in the simulation of symmetric and asymmetric network topologies. The CF-RS algorithm achieves the same performance in terms of achievable data rate, Jain's fairness index and utility of end devices in both symmetric and asymmetric network configurations
Ultra Reliable UAV Communication Using Altitude and Cooperation Diversity
The use of unmanned aerial vehicles (UAVs) that serve as aerial base stations
is expected to become predominant in the next decade. However, in order for
this technology to unfold its full potential it is necessary to develop a
fundamental understanding of the distinctive features of air-to-ground (A2G)
links. As a contribution in this direction, this paper proposes a generic
framework for the analysis and optimization of the A2G systems. In contrast to
the existing literature, this framework incorporates both height-dependent path
loss exponent and small-scale fading, and unifies a widely used
ground-to-ground channel model with that of A2G for analysis of large-scale
wireless networks. We derive analytical expressions for the optimal UAV height
that minimizes the outage probability of a given A2G link. Moreover, our
framework allows us to derive a height-dependent closed-form expression and a
tight lower bound for the outage probability of an \textit{A2G cooperative
communication} network. Our results suggest that the optimal location of the
UAVs with respect to the ground nodes does not change by the inclusion of
ground relays. This enables interesting insights in the deployment of future
A2G networks, as the system reliability could be adjusted dynamically by adding
relaying nodes without requiring changes in the position of the corresponding
UAVs
Wireless Information and Energy Transfer for Two-Hop Non-Regenerative MIMO-OFDM Relay Networks
This paper investigates the simultaneous wireless information and energy
transfer for the non-regenerative multipleinput multiple-output orthogonal
frequency-division multiplexing (MIMO-OFDM) relaying system. By considering two
practical receiver architectures, we present two protocols, time switchingbased
relaying (TSR) and power splitting-based relaying (PSR). To explore the system
performance limit, we formulate two optimization problems to maximize the
end-to-end achievable information rate with the full channel state information
(CSI) assumption. Since both problems are non-convex and have no known solution
method, we firstly derive some explicit results by theoretical analysis and
then design effective algorithms for them. Numerical results show that the
performances of both protocols are greatly affected by the relay position.
Specifically, PSR and TSR show very different behaviors to the variation of
relay position. The achievable information rate of PSR monotonically decreases
when the relay moves from the source towards the destination, but for TSR, the
performance is relatively worse when the relay is placed in the middle of the
source and the destination. This is the first time to observe such a
phenomenon. In addition, it is also shown that PSR always outperforms TSR in
such a MIMO-OFDM relaying system. Moreover, the effect of the number of
antennas and the number of subcarriers are also discussed.Comment: 16 pages, 12 figures, to appear in IEEE Selected Areas in
Communication
Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network
An interrelation between a topological design of network and efficient
algorithm on it is important for its applications to communication or
transportation systems. In this paper, we propose a design principle for a
reliable routing in a store-carry-forward manner based on autonomously moving
message-ferries on a special structure of fractal-like network, which consists
of a self-similar tiling of equilateral triangles. As a collective adaptive
mechanism, the routing is realized by a relay of cyclic message-ferries
corresponded to a concatenation of the triangle cycles and using some good
properties of the network structure. It is recoverable for local accidents in
the hierarchical network structure. Moreover, the design principle is
theoretically supported with a calculation method for the optimal service rates
of message-ferries derived from a tandem queue model for stochastic processes
on a chain of edges in the network. These results obtained from a combination
of complex network science and computer science will be useful for developing a
resilient network system.Comment: 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of
Collective Adaptive Systems) at The 9th IEEE International Conference on
SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 201
MIMO-OFDM Based Energy Harvesting Cooperative Communications Using Coalitional Game Algorithm
This document is the Accepted Manuscript version. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, we consider the problem of cooperative communication between relays and base station in an advanced MIMO-OFDM framework, under the assumption that the relays are supplied by electric power drawn from energy harvesting (EH) sources. In particular, we focus on the relay selection, with the goal to guarantee the required performance in terms of capacity. In order to maximize the data throughput under the EH constraint, we model the transmission scheme as a non-transferable coalition formation game, with characteristic function based on an approximated capacity expression. Then, we introduce a powerful mathematical tool inherent to coalitional game theory, namely: the Shapley value (Sv) to provide a reliable solution concept to the game. The selected relays will form a virtual dynamically-configuredMIMO network that is able to transmit data to destination using efficient space-time coding techniques. Numerical results, obtained by simulating the EH-powered cooperativeMIMO-OFDMtransmission with Algebraic Space-Time Coding (ASTC), prove that the proposed coalitional game-based relay selection allows to achieve performance very close to that obtained by the same system operated by guaranteed power supply. The proposed methodology is finally compared with some recent related state-of-the-art techniques showing clear advantages in terms of link performance and goodput.Peer reviewe
- …