Multi-hop Communication Network Research Articles

DRAMS: Double-RIS assisted multihop routing scheme for device-to-device communication

Reconfigurable intelligent surfaces (RISs) is a promising solution for enhancing the performance of multihop wireless communication networks. In this paper, we propose a double-RIS assisted multihop routing scheme for a device-to-device (D2D) communication network. Specifically, the scheme is dependent on the already deployed RISs and users in the surroundings. Besides the RISs, the emphasis of this work is to make more use of the existing intermediate users (IUs), which can act as relays. Hence, the density of RIS deployment in the surroundings can be reduced, which leads to the avoidance of resource wastage. However, we cannot solely depend on the IUs because this implies complete dependence on their availability for relaying and as a result, the aspect of reliability in terms of delay-constrained information transfer cannot be guaranteed. Moreover, the IUs are considered capable of energy harvesting and as a result, they do not waste their own energy in the process of volunteering to act as a relay for other users. Numerical results demonstrate the advantage of the proposed scheme over some existing approaches and lastly, useful insights related to the scheme design are also drawn, where we characterize the maximum acceptable delay at each hop under different set-ups.

Novel compressed linear network coding vectors for multihop communication networks

Novel compressed linear network coding vectors for multihop communication networks

Bidirectional quantum teleportation in multi-hop communication network

Bidirectional quantum teleportation in multi-hop communication network

One-Hop Listening Based ARQs for Low-Latency Communication in Multihop Networks

Inspired by emerging applications in vehicular networks, we address the problem of achieving high-reliability and low-latency communication in multi-hop wireless networks. We propose a new family of Automatic-Repeat-Requests (ARQs) based cooperative strategies wherein high end-to-end reliability is obtained using packet re-transmissions at each hop while the low-latency constraint is met by imposing an upper bound on the total number of packet retransmissions across the network. A hallmark of our strategies is the one-hop listening capability wherein nodes utilize the unused ARQs of their preceding node just by counting the number of failed attempts due to decoding errors. We further extend the idea of one-hop listening to multi-hop listening, wherein a set of consecutive nodes form clusters to utilize the unused ARQs of the preceding nodes, beyond its nearest neighbour, to further improve reliability. Thus, our strategies provide the high-reliability feature with no compromise in the original latency-constraint. For the proposed strategies, we solve non-linear optimization problems on distributing the ARQs across the nodes so as to minimize packet drop probability (PDP) subject to a total number of ARQs in the network. Through extensive theoretical results on PDP and delay profiles, we show that the proposed strategies outperform the best-known strategies in this space.

Short-Packet Communications in Multihop Networks With WET: Performance Analysis and Deep Learning-Aided Optimization

In this paper, we study short-packet communications in multi-hop networks with wireless energy transfer, where relay nodes harvest energy from power beacons to transmit short packets to multiple destinations. It is proposed a novel cooperative beamforming relay selection (CRS) scheme which incorporates partial relay selection and distributed multiuser beamforming to achieve a high-reliable transmission in two consecutive hops. A closed-form expression for the average block error rate (BLER) of the CRS scheme is derived, based on which an asymptotic analysis is also carried out. To achieve optimal channel uses allocation, we formulate a fairness end-to-end throughput maximization problem which is generally NP-hard due to the non-concavity of the objective function and mixed-integer constraints. To solve this challenging problem efficiently, we first relax channel uses to be continuous and transform the relaxed problem into an equivalent non-convex one, but with a more tractable form. We then develop a low-complexity iterative algorithm relying on inner approximation framework to convexify non-convex parts that converges to at least a locally optimal solution. Towards real-time settings, we design an efficient deep convolutional neural network (CNN) with multiscale-accumulation connections to achieve the sub-optimal solution of the relaxed problem via real-time inference processes. Numerical results are presented to verify the analytical derivations and to demonstrate performance improvements of the CRS scheme over the benchmark ones in terms of BLER, reliability, latency, and throughput in various settings. Moreover, the designed CNN provides the lowest root-mean-square error compared to the state-of-the-art deep learning approaches while the CNN-aided optimization framework estimates accurately the optimal channel uses allocation with low execution time.

An Improved Routing Approach for Enhancing QoS Performance for D2D Communication in B5G Networks

Device-to-device (D2D) communication is one of the eminent promising technologies in Beyond Fifth Generation (B5G) wireless networks. It promises high data rates and ubiquitous coverage with low latency, energy, and spectral efficiency among peer-to-peer users. These advantages enable D2D communication to be fully realized in a multi-hop communication scenario. However, to ideally implement multi-hop D2D communication networks, the routing aspect should be thoroughly addressed since a multi-hop network can perform worse than a conventional mobile system if wrong routing decisions are made without proper mechanisms. Thus, routing in multi-hop networks needs to consider device mobility, battery, link quality, and fairness, which issues do not exist in orthodox cellular networking. Therefore, this paper proposed a mobility, battery, link quality, and contention window size-aware routing (MBLCR) approach to boost the overall network performance. In addition, a multicriteria decision-making (MCDM) method is applied to the relay devices for optimal path establishment, which provides weights according to the evaluated values of the devices. Extensive simulation results under various device speed scenarios show the advantages of the MBLCR compared to conventional algorithms in terms of throughput, packet delivery ratio, latency, and energy efficiency.

Denial-of-Service Attack Mitigation in Multi-hop 5G D2D Wireless Communication Networks Employing Double Auction Game

Denial-of-Service Attack Mitigation in Multi-hop 5G D2D Wireless Communication Networks Employing Double Auction Game

Multi-Hop Relaying Distribution Strategies for Terahertz-Band Communication Networks: A Cross-Layer Analysis

Terahertz (THz) band (0.1-10 THz) communication is envisioned as a key wireless technology to satisfy the need for wireless Terabit-per-second (Tbps) links in 6G systems. The THz band supports very large channel bandwidths with the cost of very high propagation losses. On the one hand, the absorption by water vapor molecules manifests itself in the form of absorption lines that broaden in frequency with distance, resulting into a highly distance-dependent channel bandwidth. On the other hand, the very high spreading or free-space losses require the use of highly directional antennas (DAs) simultaneously in transmission and reception at all times. As with the bandwidth, the beamwidth of such DAs is also related with the transmission distance, and introduces severe synchronization and, correspondingly, delay challenges. These issues become even worse when the system needs to support up to Tbps peak data-rates. The end-to-end (E2E) delay and, correspondingly, effective throughput in multi-hop THz communication networks can drastically suffer if all these peculiarities are not taken into account. In this paper, multi-hop relaying distribution strategies are developed for THz-band communication to minimize the multi-hop E2E delay by considering cross-layer effects between the THz channel, highly DAs, nodes’ buffer and the physical, link and network layers.

Min-Time Coverage in Constricted Environments: Problem Formulations and Complexity Analysis

This work deals with the task allocation and robot routing problems that arise in a class of networked mobile robot systems. The defining characteristics of these systems are: 1) the constricting nature of their operational environment and 2) the need to coordinate the robot motion in order to maintain full connectivity of a multihop wireless communication network connecting the robots with each other and a master controller that supervises the entire operation. These two elements give rise to resource allocation structures and traffic dynamics that transcend the state of the art of the corresponding theory and challenge our current understandings and insights for these dynamics and their effective management. We provide: 1) a systematic introduction of the considered problems and of the elements that differentiate them from similar task allocation and traffic scheduling problems already studied in the literature; 2) complete analytical characterizations of these problems in the form of mathematical programming formulations; and 3) a formal analysis of the worst-case computational complexity of these problems and of certain factors that determine this complexity. Furthermore, the presented results define a base for the development of solution approaches to the considered problems able to effectively and systematically manage the identified tradeoff between the operational efficiency of the derived solutions and their computational cost.

A mean field game-theoretic cross-layer optimization for multi-hop swarm UAV communications

Unmanned aerial vehicle (UAV) multi-hop communication networks are foreseen to be widely employed in both military and civilian scenarios. However, in ultra-dense scenarios with swarm UAVs, nodes are highly dynamic mobile, ultra-dense deployment and non-centralized distribution. These characteristics make the centralized resource management policy not apply. Meanwhile, existing routing protocols can't meet the performance challenges of high dynamic, topology and link frequency changes of ultra-dense scenarios with swarm UAVs. To solve the above challenges of resource management and routing protocol, a cross-layer optimization method is presented with a novel mean field game (MFG) in this paper. It is based on the cross-layer design method of the MFG theory and jointly considers the power resources in the physical layer, frequency resources in the medium access control (MAC) layer, and routing resources in the network layer. By dividing into subproblems, the original problem is solved. Meanwhile, the optimal data transmission path can be selected through the management and allocation of frequency resources and power resources. A cross-layer resource management dynamic source routing (CLRM-DSR) protocol is designed based on that which adds link quality measurement. The simulation results show that the presented CLRM-DSR with the proposed resource management scheme can improve the data packet transmission rate, reduce end-to-end delay, and lower routing overhead for the multi-hop swarm UAV communication network.

Multi-Hop RIS-Empowered Terahertz Communications: A DRL-Based Hybrid Beamforming Design

Wireless communication in the TeraHertz band (0.1-10 THz) is envisioned as one of the key enabling technologies for the future sixth generation (6G) wireless communication systems scaled up beyond massive multiple input multiple output (Massive-MIMO) technology. However, very high propagation attenuations and molecular absorptions of THz frequencies often limit the signal transmission distance and coverage range. Benefited from the recent breakthrough on the reconfigurable intelligent surfaces (RIS) for realizing smart radio propagation environment, we propose a novel hybrid beamforming scheme for the multi-hop RIS-assisted communication networks to improve the coverage range at THz-band frequencies. Particularly, multiple passive and controllable RISs are deployed to assist the transmissions between the base station (BS) and multiple single-antenna users. We investigate the joint design of digital beamforming matrix at the BS and analog beamforming matrices at the RISs, by leveraging the recent advances in deep reinforcement learning (DRL) to combat the propagation loss. To improve the convergence of the proposed DRL-based algorithm, two algorithms are then designed to initialize the digital beamforming and the analog beamforming matrices utilizing the alternating optimization technique. Simulation results show that our proposed scheme is able to improve 50% more coverage range of THz communications compared with the benchmarks. Furthermore, it is also shown that our proposed DRL-based method is a state-of-the-art method to solve the NP-hard beamforming problem, especially when the signals at RIS-assisted THz communication networks experience multiple hops.

Anonymous Authentication and Key Agreement Scheme Combining the Group Key for Vehicular Ad Hoc Networks

Vehicular ad hoc network (VANET) is a multihop mobile wireless communication network that can realize many vehicle-related applications through multitop communication. In the open wireless communication environment, security and privacy protection are important contents of VANET research. The most basic method of VANET privacy protection is anonymous authentication. Even through, there are many existing schemes to provide anonymous authentication for VANETs. Many existing schemes suffer from high computational cost by using bilinear pairing operation or need the assistance of the trust authorities (TAs) during the authentication process or rely on an ideal tamper-proof device (TPD), which requires very strong security assumption. In this study, an anonymous authentication and key negotiation scheme by using private key and group key is proposed, which is based on pseudonym using the nonsingular elliptic curve. In this scheme, there is no third party trust center to participate in the authentication, there is no need to query the database, and there is no need of the local database to save the identity information of many vehicles, which reduce the storage space and the authentication time compared with other schemes. The proposed scheme only needs realistic TPDs. In the proposed scheme, TPDs do not need to preinstall the system key as many other schemes do; hence, the failure of a single TPD does not affect the security of the entire system. The security of the scheme is proved under the random oracle model. Compared with the related schemes using bilinear pairings, the computational cost and communication cost of the proposed scheme are reduced by 82% and 50%, respectively.

Asymptotically Optimal Online Scheduling With Arbitrary Hard Deadlines in Multi-Hop Communication Networks

This paper firstly proposes a greedy online packet scheduling algorithm for the problem raised by Mao, Koksal and Shroff that allows arbitrary hard deadlines in multi-hop networks aiming at maximizing the total revenue. With the same assumption of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\rho _{M} / \rho _{m}={O}(1)$ </tex-math></inline-formula> where <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\rho _{M}$ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\rho _{\textit {}m}$ </tex-math></inline-formula> are the maximum and minimum revenue a packet may carry, our algorithm is <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${O}$ </tex-math></inline-formula> ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${P} _{M}$ </tex-math></inline-formula> )-competitive improving on MKS algorithm by a factor of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${O}$ </tex-math></inline-formula> (log <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${P} _{M}$ </tex-math></inline-formula> ), where <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${P} _{M}$ </tex-math></inline-formula> is the length of the longest path a packet may travel in the network. We prove that it is asymptotically optimal by presenting a lower bound of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${P} _{M}$ </tex-math></inline-formula> on the competitiveness for this problem. Secondly, this paper studies the extension of this problem that includes routing as a part of the solution. We prove that using the fastest path algorithm for the routing part, the greedy online algorithm also achieves asymptotically optimal competitiveness for the extended problem. Furthermore, we present a non-greedy online algorithm that not only is asymptotically optimal, but also can adaptively achieve a better competitiveness when the network has a larger <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${C} _{\textit {min}}$ </tex-math></inline-formula> , where <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${C} _{\textit {min}}$ </tex-math></inline-formula> is the minimum link capacity in the network. Finally, simulation results are reported, showing that not only do the greedy online algorithms achieve asymptotically optimal bounds, but also practically achieve better performance than the previously proposed algorithms.

On the performance of DF-based multi-hop system over α − κ − μ and α − κ − μ-extreme fading channels

Several emerging application scenarios for the multi-hop wireless networking have been introduced in 5G and beyond networks, to provide ultra-low latency and much higher data rate to the end users. In this work, an integrated performance evaluation of a decode-and-forward (DF) multi-hop wireless communication system is undertaken over the non-linear generalized α−κ−μ and α−κ−μ-Extreme fading models. Novel closed-form expressions for the amount of fading (AoF), channel capacity under various adaptive transmission techniques are derived. Additionally, decoding error probability for short packet communication is derived and analyzed. The provided expressions are very useful in designing the channel/link quality for practical multi-hop communication networks. The effects of the fading parameters and the number of hops on the system performance are demonstrated. The correctness of the proposed solutions has been corroborated by comparing them with Monte Carlo simulation results.

Spatial–temporal routing for supporting end-to-end hard deadlines in multi-hop networks

We consider the problem of routing packets with end-to-end hard deadlines in multihop communication networks. This is a challenging problem due to the complex spatial–temporal correlation among flows with different deadlines. To tackle this problem, we introduce the concepts of virtual links and virtual routes to incorporate end-to-end deadline constraints into routing and propose a novel virtual queue architecture to guide the spatial–temporal routing where the routing algorithm specifies where and when a packet should be routed. For the frame-based periodic traffic, the proposed policies can support any arrival within throughput region when the ratio between the link capacity and the packet size is sufficiently large. For the general traffic, we integrate a constrained resource-pooling heuristic into the spatial–temporal routing, which improves the delivery ratio and performs well. Our extensive simulations show that the policies outperform traditional policies such as backpressure and earliest-deadline-first (EDF) for more general traffic flows in multihop communication networks.

Scatternet Formation Protocol for Environmental Monitoring in a Smart Garden

The monitoring of different parameters in the smart garden environment requires thousands of nodes and actuators. They form a multi-hop communication network. The scatternets formed with Bluetooth protocol is a communication solution. However, there is no current algorithm that considers the different capabilities of the devices (sensors or actuators) and assigns a role according to these capabilities. In this paper, we present a network topology formation algorithm for role assignment and connection establishment which considers the capabilities of the devices and use slave-slave Bridge to communicate the piconets. We design the algorithms needed for this protocol and test it. We have simulated the algorithms in order to evaluate the time needed for role assignment and to establish the first connections of the piconet. The results include different scenarios composed by one or two masters and one to seven slaves. In addition, we evaluate the established connections in piconets and bridges in a real case of the smart garden sensor network. Finally, we present the changes in the piconet connections after the deployment of two nodes in an existing network.

Multihop Teleportation via the Composite of Asymmetric W State and Bell State

In this article, quantum teleportation schemes of a single qubit, two-qubit and N-qubit state are presented in a multihop communication network. All the schemes can be completed deterministicly. The shared entanglement resource between two adjacent nodes is the composition of the asymmetric W state and Bell state. It is not equivalent to the composite of GHZ state and Bell state used by Zou et al. (Phys. Lett. A 381, 76–81 2017).

An analytical model for wireless mesh networks with collision-free TDMA and finite queues

Wireless mesh networks are a promising technology for connecting sensors and actuators with high flexibility and low investment costs. In industrial applications, however, reliability is essential. Therefore, two time-slotted medium access methods, DSME and TSCH, were added to the IEEE 802.15.4 standard. They allow collision-free communication in multi-hop networks and provide channel hopping for mitigating external interferences. The slot schedule used in these networks is of high importance for the network performance. This paper supports the development of efficient schedules by providing an analytical model for the assessment of such schedules, focused on TSCH. A Markov chain model for the finite queue on every node is introduced that takes the slot distribution into account. The models of all nodes are interconnected to calculate network metrics such as packet delivery ratio, end-to-end delay, and throughput. An evaluation compares the model with a simulation of the Orchestra schedule. The model is applied to Orchestra as well as to two simple distributed scheduling algorithms to demonstrate the importance of traffic-awareness for achieving high throughput.

Network Movement Games

We introduce a new class of games, called Network Movement Games, naturally related to the movement problems of [7], which models the spontaneous creation of multi-hop communication networks by the distributed and uncoordinated movement of k selfish mobile devices placed on the nodes of an underlying graph. Devices are players aiming to find the final positions which achieve a global property of the induced subnetwork. We actually focus on solutions (i.e. Nash equilibria) connecting all the players while minimizing the distances from their home locations. We show that the game always admits a pure Nash equilibrium, and that the convergence after a finite number of improving moves is guaranteed only when players perform their best possible moves; in this case, we provide tight bounds on the speed of convergence to Nash equilibria, both when initial positions are arbitrary and when players start at their home positions. As for the Nash equilibria performances, we first prove that the price of stability is 1 (i.e., an optimal solution is also a Nash equilibrium). Furthermore, we provide tight bounds on the price of anarchy, also showing that better performances are obtained when players start at their home positions. Finally, through extensive experiments, we show that high bounds on the price of anarchy as well as high convergence time of best move dynamics to Nash equilibria are only due to pathological worst cases. Moreover, quite often improving move dynamics (i.e., where players do not necessarily perform a best possible move) converge to Nash equilibria on the tested instances even though the class of instances does not guarantee the convergence.

ZONE BASED OPTIMAL SELECTIVE FORWARDING (ZBOSF) ROUTING PROTOCOL FOR MANET

Ponte Academic JournalDec 2017, Volume 73, Issue 12 ZONE BASED OPTIMAL SELECTIVE FORWARDING (ZBOSF) ROUTING PROTOCOL FOR MANETAuthor(s): G. T. Chavan ,Vemuru SrikanthJ. Ponte - Dec 2017 - Volume 73 - Issue 12 doi: 10.21506/j.ponte.2017.12.23 Abstract:Owing to limited transmission range of mobile devices, the information between two nodes in a Mobile Ad-hoc Network (MANET) is transmitted using multi-hop communication network. Multi-hop routing along with the support of node mobility make data transfer in Ad-hoc network extremely dynamic. Conventional routing protocols for wireless networks do not perform well for MANET and thus call for a completely different kind of routing protocols. Numerous routing protocols have been proposed, nevertheless, there is a scope for attaining high throughput with less routing overhead and energy consumption. In this paper, we propose a novel approach Zone-Based Optimal Selective Forwarding (ZBOSF). In said approach, we initially identify the location of each node followed by parting the whole network into six zones. If the source and destination nodes belong to the same zone, Location-Aided Routing Protocol (LAR-2) is utilized to route the data, on the other hand, transmission is done through a Base station, if otherwise. ZBOSF lessens the area of discovering a new route to smaller zones thereby brings down the energy consumption of mobile nodes and also reduces flooding of data packets. Download full text:Check if you have access through your login credentials or your institution Username Password