Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAge of Information in Multi-hop Networks with Priorities
217
0
0.0
(
0
)
Added by
Olga Vikhrova
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Age of Information is a new metric used in real-time status update tracking applications. It measures at the destination the time elapsed since the generation of the last received packet. In this paper, we consider the co-existence of critical and noncritical status updates in a two-hop system, for which the network assigns different scheduling priorities. Specifically, the high priority is reserved to the packets that traverse the two nodes, as they experience worse latency performance. We obtain the distribution of the age and its natural upper bound termed peak age. We provide tight upper and lower bounds for priority updates and the exact expressions for the non-critical flow of packets with a general service distribution. The results give fundamental insights for the design of age-sensitive multi-hop systems.
rate research
Read More
We consider unmanned aerial vehicle (UAV)-assisted wireless communication employing UAVs as relay nodes to increase the throughput between a pair of transmitter and receiver. We focus on developing effective methods to position the UAV(s) in the sky in the presence of interference in the environment, the existence of which makes the problem non-trivial and our methodology different from the current art. We study the optimal position planning, which aims to maximize the (average) signal-to-interference-ratio (SIR) of the system, in the presence of: i) one major source of interference, ii) stochastic interference. For each scenario, we first consider utilizing a single UAV in the dual-hop relay mode and determine its optimal position. Afterward, multiple UAVs in the multi-hop relay mode are considered, for which we investigate two novel problems concerned with determining the optimal number of required UAVs and developing an optimal fully distributed position alignment method. Subsequently, we propose a cost-effective method that simultaneously minimizes the number of UAVs and determines their optimal positions to guarantee a certain (average) SIR of the system. Alternatively, for a given number of UAVs, we develop a fully distributed placement algorithm along with its performance guarantee. Numerical simulations are provided to evaluate the performance of our proposed methods.
We consider the scenario where a sender periodically sends a batch of data to a receiver over a multi-hop network, possibly using multiple paths. Our objective is to minimize peak/average Age-of-Information (AoI) subject to throughput requirements. The consideration of batch generation and multi-path communication differentiates our AoI study from existing ones. We first show that our AoI minimization problems are NP-hard, but only in the weak sense, as we develop an optimal algorithm with a pseudo-polynomial time complexity. We then prove that minimizing AoI and minimizing maximum delay are roughly equivalent, in the sense that any optimal solution of the latter is an approximate solution of the former with bounded optimality loss. We leverage this understanding to design a general approximation framework for our problems. It can build upon any $alpha$-approximation algorithm of the maximum delay minimization problem, to construct an $(alpha+c)$-approximate solution for minimizing AoI. Here $c$ is a constant depending on the throughput requirements. Simulations over various network topologies validate the effectiveness of our approach.
In this paper, we propose a new Quality Link Metric (QLM), ``Inverse Expected Transmission Count (InvETX) in Optimized Link State Routing (OLSR) protocol. Then we compare performance of three existing QLMs which are based on loss probability measurements; Expected Transmission Count (ETX), Minimum Delay (MD), Minimum Loss (ML) in Static Wireless Multi-hop Networks (SWMhNs). A novel contribution of this paper is enhancement in conventional OLSR to achieve high efficiency in terms of optimized routing load and routing latency. For this purpose, first we present a mathematical framework, and then to validate this frame work, we select three performance parameters to simulate default and enhanc
Recent advances in antenna technology have made the design of multi-beam antennas (MBA) feasible. Compared to an omni-directional or a single beam directional antenna, an MBA equipped node can achieve a throughput of up to m times, by simultaneously communicating on its m non-interfering beams. As a result, a few multi-beam directional medium access control (MAC) schemes have been proposed in the literature recently, which are implemented mostly on the in-house simulation setups in Matlab or C/C++. These implementations make many assumptions to simplify their design, without a thorough implementation of other network layers. However, the implementation of a multi-beam MAC scheme on the well-known discrete event network simulator platforms (such as the Riverbed Modeler, NS3, QualNet) is challenging as it requires extensive changes and additions to various source code modules. In fact, the network protocols in these simulator packages have been mainly designed for omni-directional communication, and very few implementations of directional MAC and other network protocols exist in the literature. This paper presents a framework to implement a multi-beam directional MAC scheme in multi-hop wireless networks, by using the Wireless Suite of Riverbed Modeler. The detailed implementation procedures are described for multi-beam antenna module, multi-beam node model, concurrent packet transmission and reception, scheduling, collision avoidance, retransmission, and local node synchronization. These MAC modules and methodology can be very helpful to the researchers and developers for implementing the single-beam as well as multi-beam directional MAC and routing protocols in Riverbed Modeler.
In wireless industrial networks, the information of time-sensitive control systems needs to be transmitted in an ultra-reliable and low-latency manner. This letter studies the resource allocation problem in finite blocklength transmission, in which the information freshness is measured as the age of information (AoI) whose maximal AoI is characterized using extreme value theory (EVT). The considered system design is to minimize the sensors transmit power and transmission blocklength subject to constraints on the maximal AoIs tail behavior. The studied problem is solved using Lyapunov stochastic optimization, and a dynamic reliability and age-aware policy for resource allocation and status updates is proposed. Simulation results validate the effectiveness of using EVT to characterize the maximal AoI. It is shown that sensors need to send larger-size data with longer transmission blocklength at lower transmit power. Moreover, the maximal AoIs tail decays faster at the expense of higher average information age.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
