Energy Efficiency in ARQ-Based Multi-Hop Systems and the Tradeoff with Throughput

The minimum energy per bit(EPB)as the energy efficiency(EE)metric in an automatic retransmission request(ARQ)based multi-hop system is analyzed under power and throughput constraints.Two ARQ protocols including type-I(ARQ-I)and repetition redundancy(ARQ-RR)are considered and expressions for the optimal power allocation(PA)are obtained.Using the obtained optimal powers,the EE-throughput tradeoff(EETT)is analyzed and the EETT closed-form expressions for both ARQ protocols and in arbitrary average channel gain values are obtained.It is shown that how different throughput requirements,especially the high levels,affect the EE performance.Additionally,asymptotic analysis is made in the feasible high throughput values and lower and upper EETT bounds are derived for ARQ-I protocol.To evaluate the EE a distributed PA scenario,as a benchmark,is presented and the energy savinggain obtained from the optimal PA in comparison with the distributed PA for ARQ-I and ARQ-RR protocols is discussed in different throughput values and node locations.

Multiway Relay Based Framework for Network Coding in Multi-Hop WSNs

In today’s information technology(IT)world,the multi-hop wireless sensor networks(MHWSNs)are considered the building block for the Internet of Things(IoT)enabled communication systems for controlling everyday tasks of organizations and industry to provide quality of service(QoS)in a stipulated time slot to end-user over the Internet.Smart city(SC)is an example of one such application which can automate a group of civil services like automatic control of traffic lights,weather prediction,surveillance,etc.,in our daily life.These IoT-based networks with multi-hop communication and multiple sink nodes provide efficient communication in terms of performance parameters such as throughput,energy efficiency,and end-to-end delay,wherein low latency is considered a challenging issue in next-generation networks(NGN).This paper introduces a single and parallels stable server queuing model with amulti-class of packets and native and coded packet flowto illustrate the simple chain topology and complexmultiway relay(MWR)node with specific neighbor topology.Further,for improving data transmission capacity inMHWSNs,an analytical framework for packet transmission using network coding at the MWR node in the network layer with opportunistic listening is performed by considering bi-directional network flow at the MWR node.Finally,the accuracy of the proposed multi-server multi-class queuing model is evaluated with and without network coding at the network layer by transmitting data packets.The results of the proposed analytical framework are validated and proved effective by comparing these analytical results to simulation results.

Semantic-aware graph convolution network on multi-hop paths for link prediction

Knowledge graph(KG) link prediction aims to address the problem of missing multiple valid triples in KGs. Existing approaches either struggle to efficiently model the message passing process of multi-hop paths or lack transparency of model prediction principles. In this paper,a new graph convolutional network path semantic-aware graph convolution network(PSGCN) is proposed to achieve modeling the semantic information of multi-hop paths. PSGCN first uses a random walk strategy to obtain all-hop paths in KGs,then captures the semantics of the paths by Word2Sec and long shortterm memory(LSTM) models,and finally converts them into a potential representation for the graph convolution network(GCN) messaging process. PSGCN combines path-based inference methods and graph neural networks to achieve better interpretability and scalability. In addition,to ensure the robustness of the model,the value of the path thresholdKis experimented on the FB15K-237 and WN18RR datasets,and the final results prove the effectiveness of the model.

Secure Wireless Multicasting through Nakagami-m Fading Channels with Multi-Hop Relaying

The additional diversity gain provided by the relays improves the secrecy capacity of communications system significantly. The multiple hops in the relaying system is an important technique to improve this diversity gain. The development of an analytical mathematical model of ensuring security in multicasting through fading channels incorporating this benefit of multi-hop relaying is still an open problem. Motivated by this issue, this paper considers a secure wireless multicasting scenario employing multi-hop relaying technique over frequency selective Nakagami-m fading channel and develops an analytical mathematical model to ensure the security against multiple eavesdroppers. This mathematical model has been developed based on the closed-form analytical expressions of the probability of non-zero secrecy multicast capacity (PNSMC) and the secure outage probability for multicasting (SOPM) to ensure the security in the presence of multiple eavesdroppers. Moreover, the effects of the fading parameter of multicast channel, the number of hops and eavesdropper are investigated. The results show that the security in multicasting through Nakagami-m fading channel with multi-hop relaying system is more sensitive to the number of hops and eavesdroppers. The fading of multicast channel helps to improve the secrecy multicast capacity and is not the enemy of security in multicasting.

MILITARY MULTI-HOP ROUTING PROTOCOL

Military tactical network is one of the most important applications of ad hoc network. Currently the existing routing protocols are put forward based on the simple and universal network model which has the ability of multi-hop routing but cannot work efficiently in the special military applications. The narrow bandwidth and limited energy of the wireless network make general routing protocols seem to be more redundant. In order to satisfy military needs properly, this letter makes a detailed analysis of physical nodes and traffic distribution in military network, uses cross-layer design concept tbr reference, combines traffic characteristic of application layer with routing protocol design. It categorized routing problem as crucial routes and non-crucial routes which adopted separate maintenance methods. It not only realizes basic transmission function but also works efficiently. It is quite fit for military application.

A Multi-Hop Dynamic Path-Selection (MHDP) Algorithm for the Augmented Lifetime of Wireless Sensor Networks

In Wireless Sensor Networks (WSN), the lifetime of sensors is the crucial issue. Numerous schemes are proposed to augment the life time of sensors based on the wide range of parameters. In majority of the cases, the center of attraction will be the nodes’ lifetime enhancement and routing. In the scenario of cluster based WSN, multi-hop mode of communication reduces the communication cast by increasing average delay and also increases the routing overhead. In this proposed scheme, two ideas are introduced to overcome the delay and routing overhead. To achieve the higher degree in the lifetime of the nodes, the residual energy (remaining energy) of the nodes for multi-hop node choice is taken into consideration first. Then the modification in the routing protocol is evolved (Multi-Hop Dynamic Path-Selection Algorithm—MHDP). A dynamic path updating is initiated in frequent interval based on nodes residual energy to avoid the data loss due to path extrication and also to avoid the early dying of nodes due to elevation of data forwarding. The proposed method improves network’s lifetime significantly. The diminution in the average delay and increment in the lifetime of network are also accomplished. The MHDP offers 50% delay lesser than clustering. The average residual energy is 20% higher than clustering and 10% higher than multi-hop clustering. The proposed method improves network lifetime by 40% than clustering and 30% than multi-hop clustering which is considerably much better than the preceding methods.

Design and implementation of multi-hop video transmission experiment system in VANET

Abts ract A wireless mutl i-hop videot ransmission experiment system is designed and implemented for vehiculra ad-hoc networks VANET and the rt ansm ission control protocol and routing protocol are proposed. This system in tegrates the embedded Linux system witha n ARM kernel and oc ns ists of a S3C6410 main control module a wirel ss local arean etwork WLAN card a LCD screne and so on.In the scenario of a wireless multi-hop video transmission both the H.264 and JPEG are used and their performances such as the compression rate delay and frame loss rate are analyzed in theory andc ompared in the experiment.The system is tested in the real indoor and outdoor environment.The results show that the scheme of the multi-hop video transmission experiment system can be applicable for VANET and multiple scenes and the transmission control protocol and routing protocol proposed can achieve real-time transmission and meet multi-hop requirements.

Multi-hop teleportation based on W state and EPR pairs

Multi-hop teleportation has significant value due to long-distance delivery of quantum information. Many studies about multi-hop teleportation are based on Bell pairs, partially entangled pairs or W state. The possibility of multi-hop teleportation constituted by partially entangled pairs relates to the number of nodes. The possibility of multi-hop teleportation constituted by double W states is （4/9）~n after n-hop teleportation. In this paper, a multi-hop teleportation scheme based on W state and EPR pairs is presented and proved. The successful possibility of quantum information transmitted hop by hop through intermediate nodes is deduced. The possibility of successful transmission is （2/3）~n after n-hop teleportation.

Physical Layer Security of Multi-hop Aided Downlink MIMO heterogeneous Cellular Networks

This study investigates physical layer security in downlink multipleinput multiple-output(MIMO) multi-hop heterogeneous cellular networks(MHCNs),in which communication between mobile users and base stations(BSs) is established by a single or multiple hops,to address the problem of insufficient security performance of MIMO heterogeneous cellular networks.First,two-dimensional homogeneous Poisson point processes(HPPPs) are utilized to model the locations of K-tier BSs in MIMO MHCNs and receivers,including those of legitimate users and eavesdroppers.Second,based on the channel gain distribution and the statistics property of HPPP,the achievable ergodic rates of the main and eavesdropper channels in direct and ad hoc links are derived,respectively.Third,the secrecy coverage probability and the achievable ergodic secrecy throughput of downlink MIMO MHCNs are explored,and their expressions are derived.Lastly,the correctness of the theoretical derivation is verified through Monte Carlo simulations.

A Novel Multi-Hop Algorithm for Wireless Network with Unevenly Distributed Nodes

Node location estimation is not only the promise of the wireless network for target recognition,monitoring,tracking and many other applications,but also one of the hot topics in wireless network research.In this paper,the localization algorithm for wireless network with unevenly distributed nodes is discussed,and a novel multi-hop localization algorithm based on Elastic Net is proposed.The proposed approach is formulated as a regression problem,which is solved by Elastic Net.Unlike other previous localization approaches,the proposed approach overcomes the shortcomings of traditional approaches assume that nodes are distributed in regular areas without holes or obstacles,therefore has a strong adaptability to the complex deployment environment.The proposed approach consists of three steps:the data collection step,mapping model building step,and location estimation step.In the data collection step,training information among anchor nodes of the given network is collected.In mapping model building step,the mapping model among the hop-counts and the Euclidean distances between anchor nodes is constructed using Elastic Net.In location estimation step,each normal node finds its exact location in a distributed manner.Realistic scenario experiments and simulation experiments do exhibit the excellent and robust location estimation performance.

QMCR:A Q-Learning-Based Multi-Hop Cooperative Routing Protocol for Underwater Acoustic Sensor Networks

Routing plays a critical role in data transmission for underwater acoustic sensor networks(UWSNs)in the internet of underwater things(IoUT).Traditional routing methods suffer from high end-toend delay,limited bandwidth,and high energy consumption.With the development of artificial intelligence and machine learning algorithms,many researchers apply these new methods to improve the quality of routing.In this paper,we propose a Qlearning-based multi-hop cooperative routing protocol(QMCR)for UWSNs.Our protocol can automatically choose nodes with the maximum Q-value as forwarders based on distance information.Moreover,we combine cooperative communications with Q-learning algorithm to reduce network energy consumption and improve communication efficiency.Experimental results show that the running time of the QMCR is less than one-tenth of that of the artificial fish-swarm algorithm(AFSA),while the routing energy consumption is kept at the same level.Due to the extremely fast speed of the algorithm,the QMCR is a promising method of routing design for UWSNs,especially for the case that it suffers from the extreme dynamic underwater acoustic channels in the real ocean environment.

Multi-Hop Free Space Optical Communications Using Serial Decode-and-Forward Relay Transmissions

This paper investigates the performance of multi-hop Free Space Optical(FSO) communications using serial Decode-and-Forward(DF) relay transmissions.A statistical model for the optical intensity fluctuation at the receiver due to the combined effects of atmospheric turbulence-induced fading,mis alignment fading and pass-loss is presented.Under given weather and mis alignment conditions,a closed-form analytical expression for the end-to-end outage probability of serial Decode-and-Forward(DF) multi-hop FSO communications is derived.Numerical results show that the serial DF multi-hop transmission is a promising technology to enhance the performance of FSO communications.Moreover,the derived analytical expression can provide close approximations to the simulation results.

Radio resource management scheme and outage analysis for network- assisted multi-hop D2D communications

In a cellular network it＇s very difficult to make spectrum resource more efficiently. Device-to-Device （D2D） technology enables new service opportunities, and provides high throughput and reliable communication while reducing the base station load. For better total performance, short-range D2D links and cellular links share the same radio resource and the management of interference becomes a crucial task. Here we argue that single-hop D2D technology can be used to further improve cellular networks performance if the key D2D radio resource management algorithms are suitably extended to support multi-hop D2D communications. Aiming to establish a new paradigm for the analysis and design of multi-hop D2D communications, We propose a radio resource allocation for multi-hop D2D routes based on interference avoidance approach in LTE-A networks. On top of that, we investigate the outage probability of D2D communication. We first introduce a new definition of outage probability by considering the maximum distance to be allowable for single-hop transmission. Then we study and analyze the outage performance of a multi-hop D2D route. We derive the general dosed form expression of outage probability of the multi-hop D2D routes. The results demonstrate that the D2D radio, sharing the same resources as the cellular network, provide higher capacity compared to pure cellular communication where all the data is transmitted through the base station. They also demonstrate that the new method of calculation of D2D multi hop outage probability has better performance than classical method defined in the literature.

Energy Efficient Constrained Shortest Path First-Based Joint Resource Allocation and Route Selection for Multi-Hop CRNs

Cognitive radio networks(CRNs) are expected to improve spectrum utilization efficiently by allowing secondary users(SUs) to opportunistically access the licensed spectrum of primary users(PUs).In CRNs,source and destination SUs may achieve information interaction in an ad hoc manner.In the case that no direct transmission link between the SU transmission pairs is available,multi-hop relay SUs can be applied to forward information for the source and destination SUs,resulting in multi-hop CRNs.In this paper,we consider a multi-hop CRN consisting of multiple PUs,SU transmission pairs and relay SUs.Stressing the importance of transmission hops and the tradeoff between data rate and power consumption,we propose an energy efficient constrained shortest path first(CSPF)-based joint resource allocation and route selection algorithm,which consists of two sub-algorithms,i.e.,CSPF-based route selection sub-algorithm and energy efficient resource allocation sub-algorithm.More specifically,we first apply CSPF-based route selection sub-algorithm to obtain the shortest candidate routes(SCRs) between the SU pair under the transmission constraints.Then,an energy efficient resource allocation problem of the SCRs is formulated and solved by applying iterative algorithm and Lagrange dual method.Simu-lation results demonstrate the effectiveness of the proposed algorithm.

Hierarchical simultaneous entanglement swapping for multi-hop quantum communication based on multi-particle entangled states

Entanglement swapping is a key technology for multi-hop communication based on entanglement in quantum networks. However, the end-to-end delay of the traditional sequential entanglement swapping (SEQES) grows rapidly withthe increase of network scale. To solve this problem, we first propose a low-delay multi-particle simultaneous entanglementswapping (SES) scheme to establish the remote four-particle Greenberger–Horne–Zeilinger (GHZ) channel states for thebidirectional teleportation of three-particle GHZ states, in which the intermediate nodes perform Bell state measurements,send the measurement results and the Bell state type to the user node Bob (or Alice) through classical channel simultaneously. Bob (or Alice) only needs to carry out a proper unitary operation according to the information he (or she) hasreceived. Further, we put forward a hierarchical simultaneous entanglement swapping (HSES) scheme to reduce the classical information transmission cost, which is composed of level-1 SES and level-2 SES (schemes). The former is an innersegment SES, and the latter is an inter segments SES. Theoretical analysis and simulation results show the HSES can obtainthe optimal performance tradeoff between end-to-end delay and classical cost.

Consensus of multi-vehicle cooperative attack with stochastic multi-hop time-varying delay and actuator fault

A consensus-distributed fault-tolerant(CDFT)control law is proposed for a class of leader-following multi-vehicle cooperative attack(MVCA)systems in this paper.In particular,the switching communication topologies,stochastic multi-hop timevarying delays,and actuator faults are considered,which may lead to system performance degradation or on certain occasions even cause system instability.Firstly,the estimator of actuator faults for the following vehicle is designed to identify the actuator faults under a fixed topology.Then the CDFT control protocol and trajectory following error are derived by the relevant content of Lyapunov stability theory,the graph theory,and the matrix theory.The CDFT control protocol is proposed in the same manner,where a more realistic scenario is considered,in which the maximum trajectory following error and information on the switching topologies during the cooperative attack are available.Finally,numerical simulation are carried out to indicate that the proposed distributed fault-tolerant(DFT)control law is effective.

Adaptive Optimal Capacity Perception and Control for Wireless Multi-Hop Networks

In wireless multimedia communications, it is extremely difficult to derive general end-to-end capacity results because of decentralized packet scheduling and the interference between communicating nodes. In this paper, we present a state-based channel capacity perception scheme to provide statistical Quality-of-Service (QoS) guarantees under a medium or high traffic load for IEEE 802.11 wireless multi-hop networks. The proposed scheme first perceives the state of the wireless link from the MAC retransmission information and extends this information to calculate the wireless channel capacity, particularly under a saturated traffic load, on the basis of the interference among flows and the link state in the wireless multi-hop networks. Finally, the adaptive optimal control algorithm allocates a network resource and forwards the data packet by taking into consideration the channel capacity deployments in multi-terminal or multi-hop mesh networks. Extensive computer simulations demonstrate that the proposed scheme can achieve better performance in terms of packet delivery ratio and network throughput compared to the existing capacity prediction schemes.

Practical network coding-aware routing protocol for multi-hop wireless networks

Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless networks, a practical network coding aware routing protocol is proposed in this paper, for unicast sessions in multi- hop wireless networks. The protocol is based on a novel routing metric design that captures the characteristics of network coding and unicast sessions. To ensure the novel routing mettle can operate with practical and widely available path calculation algorithms, a unique mapping process is used to map a real wireless network to a virtual network. The mapping process ensures that the paths with the biggest coding opportunities will be selected by commonly used path calculation algorithms. Simulation results show that the proposed routing protocol is effective to improve the network throughput.

Load balancing strategy of heterogeneous wireless networks based on multi-hop routing algorithm of ad hoc network

Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.

Power-Effective in the Cell Sectorization Using Wide-Beam and Narrow-Beam for Multi-hop Relay Network

Multi-hop relay is a significant topic in the wireless communication and it is provisioned in the 802.16j standards.At present,the major research on multi-hop relay is focused on the capacity,coverage,coordination,throughput,etc.But in this paper,a new concept about power-effective was discussed.Then,two power-effective coverage extension methods using two sectorized cellular approaches were introduced,i.e.,the widebeam three sector cell(WBTC) and the narrow-beam three sector cell(NBTC).Under such topologies,the consumption of power and optimal numbers of base stations(BSs) and relay stations(RSs) with respect to various user traffic densities were investigated.Finally,it is found that the performance of WBTC is better than NBTC.