Relay Node Selection Research Articles

An efficient data transmission scheme through 5G D2D-enabled relays in wireless sensor networks

Energy-efficient data transmission is a key challenge in Wireless Sensor Networks (WSNs). Cluster heads (CHs) are often used to relay aggregated data from sensor nodes to a central base station (BS). However, the transmission range of such relay nodes is limited, necessitating multihop communication for forwarding data from edge relays to BS. Further, links may not be created due to the unavailability of suitable relays resulting in unreliable networks. The use of cellular device-to-device (D2D) communication eliminates the requirement of very short-range communication of WSNs and also helps in maintaining a good link throughput. In this paper, a cellular D2D-assisted relay communication scheme has been proposed for forwarding data where the issue of link disconnection is solved using dual connectivity of D2D and cellular communication among cluster heads. The proposed scheme, DSPA (D2D Relay Node (DRN) Selection and uplink Power Allocation), uses the Maximum Weight Bipartite Matching for selection of relays. Performance analysis shows that the higher sleeping probability of the sensor nodes improves the overall energy efficiency of the network and also increases the average hop gain.

Energy-efficient relay node selection scheme for sustainable wireless body area networks

Wireless Body Area Networks (WBAN) is one of the recent technology that provides actual-time health status that makes use of the sensors in, on or around the body to ensure the measurement of the biological specifications of the human body. For the long term sustainability of sensor devices, the development of energy-efficient WBAN is one of the major requirement. To deal with this issue, various existing researches have suggested the use of the relay node. The relay node selection can be considered as one of the Multi-Criteria Decision-Making Method (MCDM) problems. In this regard, this paper presents the hybrid version of Analytic Hierarchy Process (AHP) and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for the relay node selection problem. On conducting the experiments, in a scenario of WBAN with 10 different nodes. The proposed method shows significant improvement in the performance by increasing network sustainability through increased energy efficiency in the process of real-time health monitoring. It was found that the total energy consumption calculated using proposed method decreased by 8 % as compared to AHP.

Trusted and secured D2D-aided communications in 5G networks

The design of the forthcoming fifth generation (5G) system shall meet the severe requirement of managing an always increasing amount of traffic generated by both humans and machines, while guaranteeing data security. Among the enabling technologies that will turn 5G into a reality, Device-to-Device (D2D) and Multicasting will certainly play a key role because of their capability to largely improve network resources utilization and to address emerging use cases requiring the delivery of the same content to a large number of devices. D2D communications can help to improve traditional point-to-multipoint transmissions by reducing the multicast coverage area and exploiting properly selected relay nodes as data forwarders toward users with worse channel conditions. However, security issues are even more challenging for D2D connections, as data exchange happens directly between nodes in proximity. To enhance performance and security of delivered traffic in 5G-oriented networks, in this paper we design SeT-D2D (Secure and Trust D2D), according to which trustworthiness inferred from both direct interactions and social-awareness parameters is exploited to properly select relay nodes. Main contributions of our research consist in the introduction of a model for the assessment of network nodes’ trustworthiness and the implementation of security mechanisms to protect the data transmitted in D2D communications and the privacy of the involved users. The conducted simulation campaign testifies to the ability of the proposed solution to effectively select relay nodes, which leads to an improved network performance.

Relay-based Communications in WBANs

Wireless Body Area Networks (WBANs) constitute an emerging technology in the field of health care that makes health monitoring possible from one’s home itself. WBANs open many challenges by placing sensors on/inside human bodies for collecting various health-related information. Unlike traditional Wireless Sensor Networks (WSNs), communication in WBANs suffers from high channel fading and attenuation due to human body fat. Therefore, relay-based communication with data forwarding techniques is used to handle link failures and poor network connectivity. Accordingly, in this survey article, we present a comprehensive study of relay-based communication mechanisms in WBANs. We begin with a brief look at the multi-tiered architecture of WBANs, how direct communication works, and how relay-based communication is different. Subsequently, we present a detailed review of relay node selection approaches, which, in turn, also affects how a WBAN performs. In this context, we also look at the unique quality of service (QoS) demands of WBANs and how they can be assured.

TSIRP: A Temporal Social Interactions-Based Routing Protocol in Opportunistic Mobile Social Networks

With the increasing number of smart device users, data transmission between users is becoming more important, and a network architecture called opportunistic mobile social network (OMSN) is gaining attention. However, routing in OMSNs is a challenging problem due to the frequent disconnection between nodes and the absence of paths from the source to the destination. It results in a complex topology and a low packet transmission success rate. Therefore, we propose a novel routing algorithm called the temporal social interactions-based routing protocol (TSIRP) for solving the problem of low network performance due to the improper selection of message relay nodes. First, we focus on the temporal context of social interactions. Specifically, at a certain time of the day, a person has specific people with whom the person usually interacts (e.g., workers usually meet co-workers during working hours; students usually meet their classmates during class). Based on temporal social interactions between nodes, potential forwarding metrics are proposed and calculated for each time of the day to make forwarding decisions. Second, we propose a new scheme to control the message spreading rate, which allows achieving a balance between delivery latency and overhead ratio. In addition, an analytical model is also designed using an absorbing Markov chain to estimate the performance of TSIRP. Simulations were also conducted, and the results indicate that TSIRP can achieve better performance than existing routing protocols in terms of packet delivery ratio, delivery latency, network overhead ratio, and average hop count.

Cross-Layer MAC/Routing Protocol for Reliable Communication in Internet of Health Things

Internet of Health Things (IoHT) involves intelligent, low-powered, and miniaturized sensors nodes that measure physiological signals and report them to sink nodes over wireless links. IoHTs have a myriad of applications in e-health and personal health monitoring. Because of the data’s sensitivity measured by the nodes and power-constraints of the sensor nodes, reliability and energy-efficiency play a critical role in communication in IoHT. Reliability is degraded by the increase in packets’ loss due to inefficient MAC, routing protocols, environmental interference, and body shadowing. Simultaneously, inefficient node selection for routing may cause the depletion of critical nodes’ energy resources. Recent advancements in cross-layer protocol optimizations have proven their efficiency for packet-based Internet. In this article, we propose a MAC/Routing-based Cross-layer protocol for reliable communication while preserving the sensor nodes’ energy resource in IoHT. The proposed mechanism employs a timer-based strategy for relay node selection. The timer-based approach incorporates the metrics for residual energy and received signal strength indicator to preserve the vital underlying resources of critical sensors in IoHT. The proposed approach is also extended for multiple sensor networks, where sensor in vicinity are coordinating and cooperating for data forwarding. The performance of the proposed technique is evaluated for metrics like Packet Loss Probability, End-To-End delay, and energy used per data packet. Extensive simulation results show that the proposed technique improves the reliability and energy-efficiency compared to the Simple Opportunistic Routing protocol.

Improving the performance of opportunistic routing using min-max range and optimum energy level for relay node selection in wireless sensor networks.

Opportunistic routing is an emerging routing technology that was proposed to overcome the drawback of unreliable transmission, especially in Wireless Sensor Networks (WSNs). Over the years, many forwarder methods were proposed to improve the performance in opportunistic routing. However, based on existing works, the findings have shown that there is still room for improvement in this domain, especially in the aspects of latency, network lifetime, and packet delivery ratio. In this work, a new relay node selection method was proposed. The proposed method used the minimum or maximum range and optimum energy level to select the best relay node to forward packets to improve the performance in opportunistic routing. OMNeT++ and MiXiM framework were used to simulate and evaluate the proposed method. The simulation settings were adopted based on the benchmark scheme. The evaluation results showed that our proposed method outperforms in the aspect of latency, network lifetime, and packet delivery ratio as compared to the benchmark scheme.

A Route Segmented Broadcast Protocol Based on RFID for Emergency Message Dissemination in Vehicular Ad-Hoc Networks

Efficiency of position-based emergency message broadcast protocols of Vehicular Ad-hoc Networks (VANET) is affected by the position of vehicles that depends entirely on accuracy of the positioning system. In addition, GPS-based dissemination protocols encounter many challenges due to high-energy consumption, low accuracy, and the need for up-to-date maps for real-world automatic applications. In this paper, a Route Segmented Broadcast Protocol based on Radio Frequency identification technology (RSBP-RF) is proposed to eliminate GPS-based problems and increase the efficiency of emergency message broadcasting by improving the positioning accuracy. In this protocol, embedded passive RFID tags are used to segment the route and provide a position-aware technique. In RSBP-RF, each vehicle is informed of its position by crossing on the tags and immediately broadcasts a beacon to its neighbors. Moreover, the proposed protocol includes a proactive relay vehicle selection scheme that uses the received beacons to select the farthest neighboring node. The results of the conducted simulations in the NS-3 tool have validated the effectiveness of the proposed protocol in terms of end-to-end delay, delivery ratio, one-hop delay, collision ratio, relay node selection accuracy, and dissemination performance. Moreover, analysis of the time complexity and message complexity proves the lightness of the RSBP-RF protocol.

Outage probability of dual-hop cooperative communication networks over the Nakagami-m fading channel with RF energy harvesting

Cooperative communication systems with wireless power transfer are being investigated for future advanced wireless networks. In this research, we propose applying a wireless power transfer to dual-hop cooperative communication systems, in which a relay node harvests the energy from the radiofrequency in order to forward the received signal, and a source node can communicate with a destination node directly or through the selected relay nodes. The system performance is evaluated by an outage probability that is calculated over independent and identically distributed (i.i.d) Nakagami-m distributions in two scenarios, i.e., integer m and arbitrary m. Furthermore, the closed forms of the outage probability expressions are derived in the case of both the amplify-and-forward (AF) and decode-and-forward (DF) protocols. The Monte Carlo method is utilized to simulate the system with the aims of evaluating the system performance and verifying the theoretical analysis. The numerical results highlight that the proposed calculation method and the closed form of the outage probability are accurate. We also compare the system performance of both the AF and DF protocols and show the effect of parameter m on the performance of the system.

MACO-QCR: Multi-Objective ACO-Based QoS-Aware Cross-Layer Routing Protocols in WSN

Recent advances in microelectronics have encouraged the implementation of a wireless sensor network (WSN) in Intelligent Monitoring Systems (IMSs). The event data traffic in IMS applications requires timely and reliable delivery in order to react immediately with the appropriate actions. However, a sensor node's limited energy resource forces a trade-off to be made between delay and energy consumption while determining the route towards the BS. To cope up with the multi-constrained routing problem introduced by event data traffic in IMS, a multi-objective ant-colony-optimization based QoS-aware cross-layer routing (MACO-QCR) protocol has been proposed for inter-cluster communication in WSN-based IMS. The ACO algorithm is improved to be a multi-objective routing algorithm with considering the energy consumption cost and the end-to-end delay cost of a routing path as two optimization objectives, in which a routing path is produced through the multi pheromone information and the multi heuristic information consisting of two objective functions. To obtain Pareto optimal solutions, the MACO-ACO uses an external archive method based on fuzzy membership function to assign fitness values to the non-dominated solutions. Moreover, MACO-QCR adopts a cross layer approach that enables interaction between routing and medium access layer (MAC) layers for relay node selection. The simulation analysis shows that MACO-QCR has up to 10.5% and 6.8% more energy efficient, and has up to 19.1% and 25.3% less end-to-end delay compared to IAMQER and O_ARA protocols for a varying proportion of nodes having event data traffic in the network.

HPSO-SA: hybrid particle swarm optimization-simulated annealing algorithm for relay node selection in wireless body area networks

In the modern world, wireless body area networks (WBANs) play an essential role in psychological and biomedical applications. The use of WBANs in medical applications is limited due to various issues related to the sensors, viz., irregularity in data production, replacement and recharging of their batteries and the energy consumed by the networks. This manuscript addresses how these problems can be solved along with optimization of the energy consumption through efficient design of the system by applying routing protocols and heuristic-based optimization algorithms. In this paper, the particle swarm optimization (PSO) algorithm is a heuristic search algorithm that relies on an upgrade mechanism of the velocity and position of swarms. Although PSO has excellent exploration capability in global search, it becomes quickly stuck in local minima. To enhance the local search function of the current PSO algorithm, a simulated annealing (SA) algorithm has been incorporated in the exploitation phase. The newly developed hybrid PSO-SA (hPSO-SA) algorithm is validated with other state-of-the-art nature-inspired algorithms on eighteen benchmarks and five real engineering design problems. The statistical results of the proposed hPSO-SA algorithm are promising and indicate very good efficiency. The paper also aims at the application of the proposed algorithm to the WBAN design problem for minimization of the energy consumption through better selection of the relay node. The proposed hPSO-SA algorithm outperforms twelve other metaheuristic algorithms, taking hybrid variants for comparison.

Performance and evaluation of energy optimization techniques for wireless body area networks

BackgroundWireless body area networks are created to retrieve and transmit human health information by using sensors on the human body. Energy efficiency is considered a foremost challenge to increase the lifetime of a network. To deal with energy efficiency, one of the important mechanisms is selecting the relay node, which can be modeled as an optimization problem. These days nature-inspired algorithms are being widely used to solve various optimization problems. With regard to this, this paper aims to compare the performance of the three most recent nature-inspired metaheuristic algorithms for solving the relay node selection problem.ResultsIt has been found that the total energy consumption calculated using grey wolf optimization decreased by 23% as compared to particle swarm optimization and 16% compared to ant lion optimization.ConclusionsThe results suggest that grey wolf optimization is better than the other two techniques due to its social hierarchy and hunting behavior. The findings showed that, compared to well-known heuristics such as particle swarm optimization and ant lion optimization, grey wolf optimization was able to deliver extremely competitive results.Graphical

Flexible multipoint relay selection for suitable route in mobile ad hoc networks

The dynamic formations of the mobile ad hoc networks require routing protocols to handle the routing requirements in run-time. The purpose of this work is to improve the endurance, quality, and trust of the path chosen by the link state routing in mobile ad hoc networks. The multipoint relay concept has been fascinating in link sate routing optimization to reduce duplicate retransmissions in the same region. In this paper, we present the notion of flexibility and suitability in choosing the multipoint relays. A suitable multipoint relay selection algorithm has been proposed to choose the appropriate multipoint relays which are trustworthy, restrain appropriate residual battery and possess a good quality link for interconnections. The algorithm also takes care of the willingness, reachability, degree, and the relative mobility of the nodes in the selection process. The results illustrate that the selection of the appropriate relay nodes offers substantial improvements.

CoopStor: a cooperative reliable and efficient data collection protocol in fault and delay tolerant wireless networks

Internet of things consist in the deployment of constrained and battery-powered devices with a radio interface. Most industrial applications require to respect strict reliability and delay constraints. Lossy links imply mechanisms to retransmit the packets to improve the reliability. However, transient faults (e.g. obstacles, interference) may also impact the reliability, and require to change the routes. In this article, we present cooperative storing mode (CoopStor), that detects the faults and triggers action before a packet is dropped. In particular, the packets are cooperatively stored in the network, until the routing protocol re-converges. The congested zone gradually increases to serve as a local storage facility. CoopStor relies on a selection of relay and leaf nodes to reduce the energy consumption while providing a low end-to-end delay in steady state. Our performance evaluation campaign highlights a reduction of packet drops and an improved energy-efficient data collection procedure.

A framework for mobile relay node selection for serving outdoor cell edge users

Relaying has received significant interest in the wireless communication community and standardization bodies. It aims to improve the cell edge coverage and performance by extending the reach of the base station. Mobile relays can offer attractive advantages over fixed relays in terms of reduced cost and suitability to varying network connection demands, especially when exploiting the availability of public vehicles, such as busses, taxis, and delivery vehicles that roam streets at relatively low speeds. The use of Mobile Relay Nodes (MRNs) to enhance the indoor user signal quality has been studied in the literature, and shows that a significant coverage gain can be achieved. In this work, we explore the use of mobile relay nodes for outdoor UE connectivity enhancement. We propose a UE-MRN association framework and identify cases of relay distribution where the use of mobile relays can be most beneficial. We evaluate two association strategies, taking into consideration two interference scenarios. Our simulation results illustrate that the operator can achieve a significant gain by enabling mobile relaying using public transportation vehicles that could normally be found roaming within the area that is close to the cell edge.

RETRACTED ARTICLE: Secure routing scheme with multi-dimensional trust evaluation for wireless sensor network

Security has been always a major concern in wireless network irrespective of evolving safety protocols, which motivates various researchers to explore an effective security solution. Existing encryption-based solution offers security but at the cost of resources which are sometime highly limited in communication devices. Therefore, this paper discusses about trust evaluation that is one of the critical operations for ascertaining the degree of security strength offered by the sensor nodes in Wireless Sensor Network (WSN). Existing research work has been carried out to find a strong connection between the resource efficiency and the critical security approaches; however, these approaches are not proven for lightweight energy efficient security scheme. Therefore, the proposed system developed using analytical approach offers a secured communication scheme that evaluates the comprehensive trust value for the target relay node followed by reputation value from the neighboring node in order to perform an effective selection of legitimate relay node. The authentication process has been carried out using progressive key-generation process while the resource efficiency is maintained by developing multi-dimensional trust computation. The essential contribution of the proposed model is to offer an effective balance between resource efficiency and trust-reputation based security strengthening features. The outcome shows that proposed model offers 75% of retention of energy-efficient nodes with more predictable energy dissipation trend. It also offers 82% of reduction of energy fluctuation during the entire operation which is again found to be 35% faster than existing approaches. The simulated outcome of study exhibits that proposed system offers better data transmission performance with significant energy efficiency in comparison to existing scheme.

Heuristic Relay-Node Selection in Opportunistic Network Using RNN-LSTM Based Mobility Prediction

Heuristic Relay-Node Selection in Opportunistic Network Using RNN-LSTM Based Mobility Prediction

AHP–neutrosophic decision model for selection of relay node in wireless body area network

The medical health systems empowered by wireless body area networks (WBANs) are becoming a reliable technology with unmatched facilities for personalised health monitoring and managing real-time health issues. A WBAN is primarily composed of a miniature, and smart devices called sensors that are worn in, on, or around the human body. In recent years, research has been mainly centred towards the reduction of the energy consumption and stability of the network. The selection of the relay node is one of the foremost issues for balancing the energy consumption in WBAN. To overcome this issue, the authors propose a hybrid analytic hierarchy process–neutrosophic method for making the decision of the relay node selection, in which the analytic hierarchy process (AHP) technique calculates the weights for different criteria and forwards them to the neutrosophic technique which finds out the best alternative solution or choice which is closest to the ideal solution. A detailed analysis is carried out on multi-criteria decision-making techniques by comparing the proposed AHP–neutrosophic and AHP techniques taking into account various criteria and alternatives. The experimental outcomes of this research indicate a significant reduction in terms of energy consumption and enhanced overall network-stability.

Enhancing sensor network sustainability with fuzzy logic based node placement approach for agricultural monitoring

Wireless sensor networks are widely used in many areas such as underground monitoring, underwater monitoring, and agricultural monitoring. Agricultural monitoring is mostly used in rural areas by farmers with the aim of increasing agricultural productivity. Therefore, the technique of determining the locations where sensor nodes are located in terms of cost and sustainability is very important. The locations where the nodes are located affect the probability of the target region that is within the detection area of a sensor node, relay node, and their connection to the collector station. In this article, a new approach is proposed in which a large number of sensor nodes are placed over a wide agricultural area. In addition, fuzzy logic-based relay selection approach is proposed to enhance network sustainability for agricultural monitoring. Sensor nodes are considered to sense values such as temperature, humidity, pressure, etc. in an agricultural area. Sensor nodes are placed to cover the entire agricultural region to detect these parameters. The values sensed by the sensor nodes are collected by the collector station, which is stationary in the center. The simulation model of the proposed approach was carried out using the Riverbed Modeler software. Thanks to the proposed node placement and relay node selection approaches, it is provided to monitor a certain agricultural area with the least number of wireless sensor nodes.

Epidemic and Timer-Based Message Dissemination in VANETs: A Performance Comparison

Data dissemination is among the key functions of Vehicular Ad-Hoc Networks (VANETs), and it has attracted much attention in the past decade. We address distributed, efficient, and scalable algorithms in the context of VANETs adopting the paradigm. We introduce an epidemic algorithm for message dissemination. The algorithm, named EPIC, is based on few assumptions, and it is very simple to implement. It uses only local information at each node, broadcast communications, and timers. EPIC is designed with the goal to reach the highest number of vehicles “infected” by the message, without overloading the network. It is tested on different scenarios taken from VANET simulations based on real urban environments (Manhattan, Cologne, Luxembourg). We compare our algorithm with a standard-based solution that exploits the contention-based forwarding component of the ETSI GeoNetworking protocol. On the other hand, we adapt literature based on a connected cover set to assess the near-optimality of our proposed algorithm and gain insight into the best selection of relay nodes as the size of the graph over which messages are spread scales up. The performance evaluation shows the behavior of EPIC and allows us to optimize the protocol parameters to minimize delay and overhead.