Multi-hop Communication Research Articles

Optimal reliable design of energy-efficient Wireless Body Area Networks

A Wireless Body Area Network (WBAN) is a network of wireless devices that are used to monitor the health of individuals or provide them with information pertinent to their personal health. A WBAN typically consists of multiple sensors and a central sink and it enables the tracking of multiple body signals without the need for cables or other wired connections, allowing for a more comfortable user experience. The used sensors are extremely small and lightweight, making them well-suited for long-term medical monitoring. In this paper, we consider the joint problem of device positioning and data routing in WBANs leveraging relay-based multi-hop communication to address network energy consumption and reliable data transmission, which are two fundamental challenges in the WBAN design. The deployment of a WBAN is the most important factor that impacts both the network lifetime and reliability. On the other side, routing in multi-hop WBANs is of paramount importance for efficient communications between sensors and the centralized hub. For this reason, we define and assign to each relay a concave and non-increasing function (called reliability function) which permits to decrease consistently congestion occurrence in the network by balancing relays loads. In this work, we consider the problem of designing an energy-aware routing on WBANs while ensuring that all data are delivered to the sink with a sufficiently large probability. This problem is formulated as a non-convex mixed-integer non-linear programming problem and proven to be NP-hard. We first present an efficient linearization technique for the problem and then propose lower- and upper-bounding schemes for the problem, which can be applied within a cutting plane algorithm-based heuristic to solve the problem. Finally, we evaluate the proposed model with a real topology scenario and compare its performance with the most notable methods presented in the literature. Numerical results show that our model, independently of patient body movement, can transfer data through reliable paths from biosensors to the sink while further offering these options: (1) the probability that each biosensor successfully transfers its data to the sink is adjustable according to the desired application; (2) congestion is limited through a careful balancing of incoming traffic to relays, and (3) a small number of relays is installed, while ensuring an energy-efficient routing of data.

Distributed Relative Localization Algorithms for Multi-Robot Networks: A Survey.

For a network of robots working in a specific environment, relative localization among robots is the basis for accomplishing various upper-level tasks. To avoid the latency and fragility of long-range or multi-hop communication, distributed relative localization algorithms, in which robots take local measurements and calculate localizations and poses relative to their neighbors distributively, are highly desired. Distributed relative localization has the advantages of a low communication burden and better system robustness but encounters challenges in the distributed algorithm design, communication protocol design, local network organization, etc. This paper presents a detailed survey of the key methodologies designed for distributed relative localization for robot networks. We classify the distributed localization algorithms regarding to the types of measurements, i.e., distance-based, bearing-based, and multiple-measurement-fusion-based. The detailed design methodologies, advantages, drawbacks, and application scenarios of different distributed localization algorithms are introduced and summarized. Then, the research works that support distributed localization, including local network organization, communication efficiency, and the robustness of distributed localization algorithms, are surveyed. Finally, popular simulation platforms are summarized and compared in order to facilitate future research and experiments on distributed relative localization algorithms.

Heterogeneous VLC/RF multi-hop cluster V2V channel allocation algorithm based on equivalent SINR.

To address low communication quality and limited transmission rate between vehicle nodes in the vehicularad hoc network (VANET), this paper builds a heterogeneous visible light communication (VLC) and radio frequency (RF) communication multi-hop communication model based on vehicle node clustering, and then a heterogeneous VLC/RF multi-hop cluster vehicle-to-vehicle (V2V) channel allocation algorithm based on equivalent signal to interference plus noise ratio (SINR) (NCAABES) is presented. This algorithm is based on the clustering of vehicle nodes, which introduces the concept of equivalent SINR. The equivalent SINR of the VLC channel between the cluster head (CH) and cluster member (CM) is used as the condition for channel allocation. When the channel between CH and CM is blocked or low quality, the neighboring vehicle between two vehicles is used as a relay node to communicate in a multi-hop way, and the channel with the best SINR is chosen as the current CH-CM or CM-CM communication method. The simulation results show that the SINR of NCAABES in this paper increases by 21.73%, 30.23%, and 70.96% compared to the novel multi-hop clustering scheme based on the weighted virtual distance detection (MCSVDD), the VLC network (VLCnet), and the RF network (RFnet), respectively. And the NCAABES's bit error rate (BER) is always the lowest compared to MCSVDD, VLCnet, and RFnet, even when the number of vehicles and transmission power change. This algorithm can improve the quality of communication between vehicle nodes, make VANET more efficient, and get a higher transmission rate.

Security for Multi-hop Communication of Two-tier Wireless Networks with Different Trust Degrees

Many effective strategies for enhancing network performance have been put forth for wireless communications’ physical-layer security. Up until now, wireless communications security and privacy have been optimized based on a set assumption on the reliability or network tiers of certain wireless nodes. Eavesdroppers, unreliable relays, and trustworthy cooperative nodes are just a few examples of the various sorts of nodes that are frequently categorized. When working or sharing information for one another, wireless nodes in various networks may not always have perfect trust in one another. Modern wireless networks’ security and privacy may be enhanced in large part by optimizing the network based on trust levels. To determine the path with the shortest total transmission time between the source and the destination while still ensuring that the private messages are not routed through the untrusted network tier, we put forth a novel approach. Toexamine the effects of the transmit SNR, node density, and the percentage of the illegitimate nodes on various network performance components, simulation results are provided.

Link Failure Approach to Maintain Quality of Service in Mobile Ad hoc Network

Abstract: Mobile Ad hoc Network is a network in which numerous are contained. These nodes are dynamic in nature and utilize multi-hop communication for communicating with one another. There isn’t any central controller included in such a network. These nodes have random mobility and they are allowed to move in any direction due to the infrastructure less quality of this network. DFCP is a routing algorithm using which a path can be established amid source and target. The link failure leads to mitigate the efficacy of this protocol whose enhancement is required for maintaining the QoS. This research work suggests the enhancement of DFCP algorithm to recover the path when the link is failed. NS2 is applied to deploy the suggested algorithm. The simulation outcomes exhibit that the suggested algorithm outperformed the traditional methods concerning higher throughput and lower packet loss.

Classification of Secure Routing Protocols in Wireless Sensor Networks

A wireless sensor network (WSN) is a collection of wirelessly connected multifunction sensor devices (referred to as wireless sensor nodes) in an area that requires sensing. In WSNs, wireless sensor nodes have a short transmission range, and processing capacity, storage, and power supply to the node are also limited. In addition, WSNs often include a significant number of sensor nodes, deployed in a large area to meet the requirements set forth, and communication in WSNs must be through multi-hop communication connections. Therefore, the secure routing protocols (SRPs) in WSNs are responsible for finding and maintaining secure and reliable connection routes and are especially energy-efficient (because the wireless sensor node is limited in terms of the power supply). Therefore, energy-efficient routing, as well as secure communication and data transmission between wireless sensor nodes are fundamental challenges for providing security services in WSNs. Currently, many energy-efficient and SRPs in WSNs have been proposed. In this paper, we synthesize the classification and arrangement of energy-efficient and SRPs, as well as provide a method to calculate attack probability (AP) for secure routing in WSN.

VKECE-3D: Energy-Efficient Coverage Enhancement in Three-Dimensional Heterogeneous Wireless Sensor Networks Based on 3D-Voronoi and K-Means Algorithm

During these years, the 3D node coverage of heterogeneous wireless sensor networks that are closer to the actual application environment has become a strong focus of research. However, the direct application of traditional two-dimensional planar coverage methods to three-dimensional space suffers from high application complexity, a low coverage rate, and a short life cycle. Most methods ignore the network life cycle when considering coverage. The network coverage and life cycle determine the quality of service (QoS) in heterogeneous wireless sensor networks. Thus, energy-efficient coverage enhancement is a significantly pivotal and challenging task. To solve the above task, an energy-efficient coverage enhancement method, VKECE-3D, based on 3D-Voronoi partitioning and the K-means algorithm is proposed. The quantity of active nodes is kept to a minimum while guaranteeing coverage. Firstly, based on node deployment at random, the nodes are deployed twice using a highly destructive polynomial mutation strategy to improve the uniformity of the nodes. Secondly, the optimal perceptual radius is calculated using the K-means algorithm and 3D-Voronoi partitioning to enhance the network coverage quality. Finally, a multi-hop communication and polling working mechanism are proposed to lower the nodes' energy consumption and lengthen the network's lifetime. Its simulation findings demonstrate that compared to other energy-efficient coverage enhancement solutions, VKECE-3D improves network coverage and greatly lengthens the network's lifetime.

Event-Triggered Approximate Byzantine Consensus With Multi-Hop Communication

In this paper, we consider a resilient consensus problem for the multi-agent network where some of the agents are subject to Byzantine attacks and may transmit erroneous state values to their neighbors. In particular, we develop two event-triggered update schemes to tackle this problem as well as reduce the communication for each agent. Our approach is based on the mean subsequence reduced (MSR) algorithm with agents being capable to communicate with multi-hop neighbors through relaying process. Since communication delays are critical in such an environment, we provide necessary graph conditions for the proposed algorithms to perform well with delays in the communication. Moreover, a novel multi-hop relay scheme with event-triggered feature is proposed. It can reduce more transmissions than the conventional one-hop event-triggered algorithm. We also highlight that through multi-hop communication, the network connectivity can be reduced especially in comparison with the common one-hop communication case. Lastly, we show the effectiveness of the proposed algorithms by numerical examples.

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 a multi-class of packets and native and coded packet flow to illustrate the simple chain topology and complex multiway relay (MWR) node with specific neighbor topology. Further, for improving data transmission capacity in MHWSNs, 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.

Blockchain-based Secure Routing Algorithm with Accumulating Trust in VANETs

The popularity of vehicles and the upgrading of sensors are driving the development of the Internet of Vehicles. Therefore, a number of Vehicular Adhoc networks (VANETs) routing algorithms have emerged. However, vehicles in complex road environments are exposed to numerous malicious attacks. Especially in multi-hop communications, these malicious attacks become more dangerous. So it remains a great challenge to transmit the packet safely to the destination through multi-hop routing when a vehicle is in the area outside the Road Side Unit (RSU) signal coverage. Considering the process of past communication between the vehicles benefits our assessment of the vehicle's security. In this paper, we propose a secure multi-hop routing algorithm based on accumulating trust. First, we obtain the number of times the vehicle forwards the packets through neighbor nodes. Then, we calculate the current trust value of the vehicle based on it, and RSUs will put the current trust value into the blockchain to form an accumulating trust value. Finally, the appropriate route is selected for communication based on the accumulating trust value of the vehicular nodes. At the end of the paper, we carry out a simple numerical simulation for our routing algorithm.

Improved Load-Balanced Clustering for Energy-Aware Routing (ILBC-EAR) in WSNs

Sensors are considered as important elements of electronic devices. In many applications and service, Wireless Sensor Networks (WSNs) are involved in significant data sharing that are delivered to the sink node in energy efficient manner using multi-hop communications. But, the major challenge in WSN is the nodes are having limited battery resources, it is important to monitor the consumption rate of energy is very much needed. However, reducing energy consumption can increase the network lifetime in effective manner. For that, clustering methods are widely used for optimizing the rate of energy consumption among the sensor nodes. In that concern, this paper involves in deriving a novel model called Improved Load-Balanced Clustering for Energy-Aware Routing (ILBC-EAR), which mainly concentrates on optimal energy utilization with load-balanced process among cluster heads and member nodes. For providing equal rate of energy consumption among nodes, the dimensions of framed clusters are measured. Moreover, the model develops a Finest Routing Scheme based on Load-Balanced Clustering to transmit the sensed information to the sink or base station. The evaluation results depict that the derived energy aware model attains higher rate of life time than other works and also achieves balanced energy rate among head node. Additionally, the model also provides higher throughput and minimal delay in delivering data packets.

Modified Adhoc On-Demand Distance Vector for Trust Evaluation And Attack Detection

Recently, Wireless Sensor Network (WSN) becomes most potential technologies for providing improved services to several data gathering and tracking applications. Because of the wireless medium, multi-hop communication, absence of physical protectivity, and accumulated traffic, WSN is highly vulnerable to security concerns. Therefore, this study explores a specific type of DoS attack identified as a selective forwarding attack where the misbehaving node in the network drops packet on a selective basis. It is challenging to determine if packet loss is caused by a collision in the medium access path, poor channel quality, or a selective forwarding assault. Identifying misbehaving nodes at the earliest opportunity is an acceptable solution for performing secure routing in such networks. As a result, in this study effort, we present a unique Modified Ad Hoc On-Demand Distance Vector (AODV) Routing protocol depending upon the One time password (OTP) method that employs the RSA algorithm. Finally, a trust evaluation process determines which approach is the most optimal. According to the simulation findings of the suggested routing protocol and comparison with existing routing protocols provided in this article, the proposed work is both efficient and cost-effective.

Layered routing algorithm for wireless sensor networks based on energy balance

Aiming at the shortcomings of traditional LEACH routing protocol in wireless sensor network (WSN) data transmission applications, such as high total energy consumption, low residual energy and short network life, a hierarchical routing algorithm based on energy balance is proposed. This algorithm is based on the energy consumption model of WSN communication, and adopts the non-uniform clustering algorithm to introduce the threshold. According to the relationship between the distance between cluster head node and sink node and the threshold, the implementation method of network communication is selected. In addition, a simple correlation multi-path route is designed to realise the multi hop communication between clusters. By considering the communication cost and the residual energy value of nodes, the hierarchical route with balanced energy consumption is realised. Experimental results show that the algorithm has obvious advantages in balancing network energy consumption and prolonging network lifetime.

Comparative Analysis of Low and High Scalable VANET in terms of Receive Rate, Packets Received, MAC/PHY Overhead and Average Goodput

The modern advancements in mobile and wireless communications have made an tremendous change in human lifestyles. Mobile Ad-hoc Networks (MANETs) are self-organized and self-configured networks consisting of moving nodes that communicate through wireless communication systems. Vehicular Ad-hoc Network (VANET) is a special category of MANETs with some distinctive set of characteristics. Some common features of VANET are its use of multi-hop communications between mobile vehicles with limited bandwidth and self-organization of the moving vehicles. Also, VANET is differed from MANET by the feature of high mobility of nodes. One significant advantage of VANET over MANET is that the computing devices get continuous power from its vehicles. Scalability refers to a VANET's ability to accept a rising number of communicating vehicles without experiencing disruption or loss in data transfer or traffic loading, which increases administrative complexity and reduces network performance. Because of its difficult properties, designing a scalable and robust network is an open topic of research in VANET. When VANETs go from sparse to dense mode, or from high mobility to slow traffic conditions, several design methods fall short. The performance metrics Average Goodput, MAC/PHY overhead, packet received, and receive rate over four VANET routing protocols- Ad-hoc On Demand Vector (AODV), Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), and Optimized Link State Routing (OLSR) in a defined area. The results showed that DSR performed well in average goodput,MAC/PHY overhead, receive rate, and packets received in low and highly scalable scenarios.

CEER: Cooperative Energy-Efficient Routing Mechanism for Underwater Wireless Sensor Networks Using Clusters

Underwater acoustic sensor networks (UWASNs) aim to find varied offshore ocean monitoring and exploration applications. In most of these applications, the network is composed of several sensor nodes deployed at different depths in the water. Sensor nodes located at depth on the seafloor cannot invariably communicate with nodes close to the surface level; these nodes need multi-hop communication facilitated by a suitable routing scheme. In this research work, a Cluster-based Cooperative Energy Efficient Routing (CEER) mechanism for UWSNs is proposed to overcome the shortcomings of the Co-UWSN and LEACH mechanisms. The optimal role of clustering and cooperation provides load balancing and improves the network profoundly. The simulation results using MATLAB show better performance of CEER routing protocol in terms of various parameters as compared to Co-UWSN routing protocol, i.e., the average end-to-end delay of CEER was 17.39, Co-UWSN was 55.819 and LEACH was 70.08. In addition, the average total energy consumption of CEER was 9.273, Co-UWSN was 12.198, and LEACH was 45.33. The packet delivery ratio of CEER was 53.955, CO-UWSN was 42.047, and LEACH was 30.31. The stability period CEER was 130.9, CO-UWSN was 129.3, and LEACH was 119.1. The obtained results maximized the lifetime and improved the overall performance of the CEER routing protocol.

Relay-Aided D2D MIMO Scheme (RAS) for Achieving Energy Efficiency in Satellite-Air-Ground Integrated Networks (SAGIN) Schéma D2D MIMO assisté par relais (RAS) pour atteindre l’efficacité énergétique dans les réseaux intégrés satellite-air-sol (SAGIN)

Space-air-ground integrated network (SAGIN), as a three-tiered architecture that assimilates satellite systems, aerial, and terrestrial communication networks, has become an intensive research domain in the present era of communications. SAGIN-based communication models are developed to enhance the user’s quality of experience (QoE). Besides providing noteworthy benefits in various applications and services, SAGIN has unprecedented challenges because of its self-organized, unpredictable, and heterogeneous nature. Relaying equipment in SAGIN can be a very low-orbit satellite, a base station (BS), and an unmanned vehicle assisting a pair of mobile users’ communications. Thus, developing a robust device-to-device (D2D) direct and relaying communication model concerning channel distribution is crucial. Based on this concern, this article proposes a relay-aided D2D multiple–input and multiple–output (MIMO) scheme (RAS) for enhancing the optimal energy efficiency (EE) as a function of spectral efficiency (SE). The proposed model derives a relay-based amplify-and-forward (AF) MIMO multihop communication system for implementation. The proposed computations of optimal EE and SE for D2D MIMO show that the approximation provided by a random matrix approximation is constrained to a specific signal-to-noise ratio (SNR) range when the optimal SE and EE are derived using Gaussian quadrature and a hypergeometric function.

Optimization of Contention Window and Relay Selection for Efficient Routing Using Fuzzy Logic Model

The rapid increase in vehicle density on roads owing to urbanization and motorization has led to increased risks of roadblocks, traffic jams, and accidents. To ensure the reliability of transportation, it is crucial to have stable and timely transmission of safety messages through Vehicle Ad-hoc Networks (VANETs). However, frequent vehicle movement and changes in the network topology may cause link breakage and packet loss. This paper proposes a solution that uses a fuzzy logic system in both the Medium Access Control (MAC) layer and the network layer to broadcast safety messages efficiently. The proposed rule-based model optimizes the Contention Window (CW) and relay selection process to adapt to different traffic conditions. The dynamic CW MAC (DYCW-MAC) model selects the optimum size of CW based on network parameters such as density, velocity, and link quality factor. For multi-hop communication, the model determines the next forwarding relay by considering factors such as direction, velocity difference, coverage factor, and Fast-Expected Transmission Count (F-ETX) between the sender vehicle and surrounding vehicles within its transmission range. The simulation results indicate that the DYCW-MAC model enhances the network throughput and decreases the average packet delay in comparison to other models.

An optimised QoS-based clustering with multipath secure routing protocol for wireless sensor networks

Recent advances in wireless technology with networking capabilities have generated a lot of interest to design secure routing protocol for wireless sensor networks (WSNs). Generally, residual energy of sensors in sink coverage area is drained very quickly compared to other area nodes in WSNs. The proposed optimised QoS-based clustering with multipath secure routing protocol (OQoS-CMSRP) for WSNs reduces the energy consumption in sink coverage area and solving hot spot problem. The proposed protocol is used to find near optimal multi-hop communication path from sink to sensors for selecting the next hop neighbour nodes. An enhanced (k, n)-threshold secret sharing scheme is required to make n shares and recover the secret by using k shares based on Hermite's interpolating polynomial. The proposed protocol is to provide end-to-end security from different network layer attacks and to provide an efficient service for transmitting data in secure and reliable manner.

A Novel Algorithm for Redundant Data Filtering in WSN and RFID Integrated Networks

Wireless sensor networks (WSN) and radio frequency identification (RFID) are base technologies employed in decentralised dynamic environments. In the hybrid network formed by integrating RFID and WSN, RFID data can be used applying WSN protocols for multi-hop communications. However, RFID data contain excessive duplication, which increases time delay and energy consumption, resulting in wastage of different resources. There exist four popular RFID–WSN integration architectures: hierarchical RFID-sensor topology, network RFID-sensor topology, reader-sensor nodes topology, and mixed topology. In this paper, we propose a new plan for a WSN–RFID integrated network. The entire network is divided into clusters, and the clustering hierarchical routing algorithm is employed to send data from the head nodes to the base station. Further, we propose two algorithms to overcome redundant data on the hybrid network. Our simulation results demonstrate that the proposed method reduces redundant data and processing time compared with existing methods.

Coverage, Rate, and Last Hop Selection in Multi-Hop Communications in Highway Scenarios

The recent 3GPP initiative to extend IAB technology to mobile nodes in recently stated Release 18 opens up new opportunities for services operators in highway scenarios, where the extreme density of base stations (BS) is required to deliver uninterrupted coverage. The latter problem is specifically important for millimeter wave (mmWave) and future sub-terahertz (sub-THz) deployments. However, in such systems, there are inherent trade-offs between the rate provided over the multi-hop chain, the so-called “bridge”, and the inter-site distance. One of the critical factors involved in this trade-off is the choice of the last hop. In this paper, we utilize realistic channel measurements at 300 GHz to develop a framework characterizing the above-mentioned trade-off. Then, we proceed proposing a simple technique to maximize the latter by addressing the “last-hop problem” and compare its performance to the set of alternative solutions. Our numerical results illustrate that bumper location is better in terms of relaying communication distance. Furthermore, the proposed last hop selection strategies allow for extreme performance gains in terms of data rate as compared to the traditional approaches reaching 100% for large ISD and 400–500% for small ISDs. In absolute numbers, the proposed relying with the last hop selection strategy allows for reducing the required BS density along the highways by 15–30% depending on the vehicle density and required level of connectivity.