Sorry, you need to enable JavaScript to visit this website.

This paper studies a multi-source “age of information”
problem in multi-hop wireless networks with packetized
status updates and explicit channel contention. Specifically, the
scenario considered in this paper assumes that each node in the
network is a both a source and a monitor of information. Nodes
take turns broadcasting their information to other nodes in the
network while also maintaining tables of status updates for the
information received from all other nodes in the network. Lower

Categories:
78 Views

Age of Information (AoI), measures the time elapsed since the last received information packet was generated at the source. We consider the problem of AoI minimization for single-hop flows in a wireless network, under pairwise interference constraints and time varying channel. We consider simple, yet broad, class of distributed scheduling policies, in which a transmission is attempted over each link with a certain attempt probability. We obtain an interesting relation between the optimal attempt probability and the optimal AoI of the link, and its neighboring links.

Categories:
12 Views

Public Safety Networks (PSN) are expected to provide resilient communication paradigms under disaster recovery scenarios. Towards providing an energy efficient solution an UAV-supported multi-level architecture is employed where user equipments (UEs) are grouped together in clusters.

Categories:
9 Views

Wireless-controlled robots, cars and other critical applications are in need of technologies that offer high reliability and low latency. Massive MIMO, Multiple-Input Multiple-Output, is a key technology for the upcoming 5G systems and is one part of the solution to increase the reliability of wireless systems. More specifically, when increasing the number of base station antennas in a massive MIMO systems the channel variations decrease and the so-called channel hardening effect appears. This means that the variations of the channel gain in

Categories:
4 Views

We study a co-design problem of control, scheduling, and routing over a multi-hop sensor and actuator network (WSANs) subject to energy-saving consideration. We formulate an optimization problem, minimizing a linear combination of the averaged linear quadratic Gaussian (LQG) control performance and the averaged transmission energy consumption. Optimal solutions are derived and their performance is illustrated in a numerical example.

Categories:
9 Views

When a base station (BS) sees desired and interfering
users at different angles, it results in non-overlapping angleof-
arrival (AoA) regions for those users. This is important for
reducing pilot contamination (PC) of massive MIMO systems.
Most state of the art studies utilize a simple non-line-of-sight
(NLoS) one-ring model which assumes sparse support and can
reasonably schedule users with different AoA to minimize PC.
However, it is not confirmed with measurements that the one-ring

Categories:
19 Views

Traditional random access schemes are designed based on the aggregate process of user activation, which is created on the basis of independent activations of the users. However, in Machine-Type Communications (MTC), some users are likely to exhibit a high degree of correlation, e.g. because they observe the same physical phenomenon. This paves the way to devise access schemes that combine scheduling and random access, which is the topic of this work. The underlying idea is to schedule highly correlated users in such a way that their transmissions are less likely to result in a collision.

Categories:
3 Views

In this paper, we investigate the resource allocation design for multicarrier (MC) systems employing a solar powered unmanned aerial vehicle (UAV) for providing communication services to multiple downlink users. We study the joint design of the three-dimensional positioning of the UAV and the power and subcarrier allocation for maximization of the system sum throughput. The algorithm design is formulated as a mixed-integer non-convex optimization problem, which requires a prohibitive computational complexity for obtaining the globally optimal solution.

Categories:
3 Views

Pages