Intermediate Relay Nodes Research Articles

Sustainable Next-Generation Network Design using Social Aware and Delay Tolerant Approach

With the ever-growing popularity of smartphones, new services are emerging where the local and positioning aspects become more important. Additionally, new routing algorithms are being developed based on various networking technology such as Delay Tolerance Networks (DTN), Deviceto- Device communication, Opportunistic Network, etc. DTN is categorized as stable and unstable, a continuous path between the source and the destination node. Here, communication is done by carrying the message through the intermediate relay node on the store and carry forward paradigm. In this work, a Sustainable Energy Delay Tolerance Approach (SEDA) considers nodes mobility patterns for energy-efficient data transmission. This routing model is based on the appropriate usage of node information along with node mobility and its contacts for data dissemination. Next step is applying some techniques to predict the most likely position for next encounter. We will design and implement a social relation-aware routing relation-awareness the social relation as a part of the routing matrix. We assume that most of the movement of nodes are included in various numbers of social contacts; therefore, there is a higher probability of message delivery to the destination. Simulation results show that the proposed routing protocol improves the delivery ratio by reducing network size and distance, which also impacts energy saving.

Opportunistic coding across on‐route dominating nodes in a flow‐orientedSDNenabledWSN

SummaryWith the aid of network coding, numerous packets can be mixed at intermediary nodes if any encoding opportunity exists. However, it is challenging to choose intermediate relay nodes of probable opportunistic coding in distributed wireless networks. In this work, a wireless sensor network (WSN) is employed with a software defined network (SDN) architecture along with a connected dominating set (CDS)‐based routing technique. The SDN offers a centrally managed architecture that lowers energy usage and network traffic by reducing the controlling and managing overheads in sensory networks. In addition, the CDS‐based routing and the potential for opportunistic coding at dominant nodes are coupled to enhance network performance. The proposed CDS‐based flow‐oriented coding‐aware energy‐efficient routing (CFCER) is contrasted with existing traditional wireless sensor networks and software‐defined sensor networks in terms of throughput, packet delay, and energy usage. CFCER increases network throughput by 15% more than SDN‐based WSN and by about 25% more than traditional WSN. However, compared to standard WSN, a significant improvement was made in packet delay and energy conservation. Over SDN‐WSN, packet delay is reduced by about 18%, and the energy consumption is cut by 10%.

Performance analysis and optimization of energy harvesting cognitive multi-hop relay network over mixed Rayleigh and double-Rayleigh fading channels

In this paper, we investigate the outage performance of an energy harvesting underlay cognitive multi-hop relay network. In the network, energy-constrained secondary network (SN) nodes harvest energy from radio frequency signal of a power beacon (PB) node. The source node transmits information to destination node via multiple intermediate relay nodes by using a time division broadcast protocol, and the hardware impairments of SN nodes’ transceiver are modeled. The outage performance of SN is analyzed and evaluated by accurately approximate and asymptotic closed-form expressions of outage probability (OP) over quasi-static mixed Rayleigh and double-Rayleigh fading channels. Additionally, due to the complexity of OP expression, a chaotic dragonfly algorithm (CDA) is proposed to jointly optimize energy harvesting ratio and PB node’s abscissa, which can achieve OP minimization of SN. Extensive simulations demonstrate the correctness of theoretical analysis and the effectiveness of the proposed CDA.

Navigation for UAV Pair‐Supported Relaying in Unknown IoT Systems with Deep Reinforcement Learning

Unmanned aerial vehicles (UAVs) have recently been regarded as a promising technology in Internet of things (IoT). UAVs functioned as intermediate relay nodes are capable of establishing uninterrupted and high-quality communication links between remotely deployed IoT devices and the destination. Multiple UAVs are required to be deployed due to their limited onboard energy. We study a UAV pair-supported relaying in unknown IoT systems, which consists of transmitter and receiver. Our goal is that transmitter gathers the data from each device then transfers the information to receiver, and receiver finally transmits the information to the destination, while meeting the constraint that the amount of information received from each device reaches a certain threshold. This is an optimization problem with highly coupled variables, such as trajectories of transmitter and receiver. On account of no prior knowledge of the environment, a dueling double deep Q network (dueling DDQN) algorithm is proposed to solve the problem. Whether it is in the phase of transmitter’s receiving information or the phase of transmitter’s forwarding information to receiver, the effectiveness and superiority of the proposed algorithm is demonstrated by extensive simulationsin in comparison to some base schemes under different scenarios.

Bit error rate and outage probability analysis for multi-hop decode-and-forward relay-aided NOMA with imperfect SIC and imperfect CSI

This paper investigates a multi-hop decode-and-forward (DF) relay-aided non-orthogonal multiple access (MH-DF-R-NOMA) scheme. The model overcomes the problems associated with poor channel quality and disconnection communication with the broadcast station for the users through the path from the intermediate relay nodes to deliver the signal to the users. We assume that we have multiple intermediate relay nodes that constitute the path to transmit the signal to two users who have different channel qualities. Consequently, the closed-form expressions for bit error rate (BER) and outage probability (OP) at all intermediate relay nodes and users are derived. In the analysis, the imperfect channel state information (CSI) and imperfect successive interference cancellation (SIC) are taken into account. Computer simulation are presented to validate theoretical analyzes. The results indicate that the degradation of BER and OP performances for the near user is higher than the far user. We also show the superiority of our model over the single relay scheme. Furthermore, the OP of MH-DF-R-NOMA outperforms its counterpart in OMA.

Transmit antenna selection – An effective method for improving the performance of spatial modulation full-duplex relay networks with wireless energy harvesting

Full-duplex (FD) communications have been proved as an inevitable techniques to obtain high quality of service in modern wireless communications. In this paper, an integrated communication scheme using spatial modulation (SM) with transmit antenna selection (TAS) and wireless energy harvesting (EH) is proposed to enhance the overall spectral efficiency and diversity order of full-duplex relaying (FDR) networks as well as to overcome the battery shortage problem at the intermediate relay nodes. The performance of this EH-SM-FDR system is investigated thoroughly by deriving the exact-form expressions of the outage probability (OP) and network throughput. The impact of residual self-interference (RSI) at FD relay and the EH time-switching ratio is also analyzed, from which the optimal value of EH time-switching ratio to minimize the OP and maximize the network throughput of the system is obtained. It is recommended from our analysis that more receive antennas should be equipped at the relay than at the destination to achieve better OP performance. This analysis also recommends best suitable data transmission rate depending on the source transmit power to reach lowest OP and highest throughput. Finally, Monte Carlo simulations are conducted to validate all analytical results.

An enhanced energy proficient clustering (EEPC) algorithm for relay selection in heterogeneous WSNs

The recent advancements in Wireless Sensor Networks (WSNs) have brought attention to the field of sensor tracking events. Habitat monitoring is considered as one of the most important applications of WSNs, which ensures wildlife conservation. Researchers have proposed various solutions to select the optimal path in the field of sensor tracking. However, energy dissipation of sensor nodes and fault tolerance during data transformation is still one of the major challenges of the WSN environment in dynamic scenarios. In this paper, an Enhanced Energy Proficient Clustering (EEPC) is proposed to reduce the energy consumption of the entire sensor nodes in the field of tracking events. The network is created with both fixed and mobile nodes. Initially, fixed nodes broadcast information, and mobile nodes select the cluster head from fixed nodes. The mobile nodes select their cluster head (CH) based on their associated placement and energy level. Mobile sensor nodes (SNs) transmit data to the CH. It introduces the concept of finding relay nodes, which are fixed nodes. The EEPC algorithm selects the relay nodes based on their velocity and location by calculating particle fitness value. The selected intermediate relay nodes transmit the collected information to the Base Station (BS) using the sensor data fusion technique. The link fault of nodes could be predicted based on the deviation value. The simulation results show that the proposed approach points out progress with reference to various performance metrics. The proposed work minimizes the energy depletion and enhances the network lifetime compared to other existing protocols.

WITHDRAWN: Sequence number based secure routing algorithm for IoT networks

Internet of Things (IoT) is one among the rapid growing networks, commonly used in smart mobile devices such as laptops, tablets, smartphones, etc. Due to the dynamic nature and partial resource availability of the IoT nodes, its communication links between intermediate relay nodes may fail frequently and this will affect the routing performance of the network. While designing secure routing algorithm for IoT networks, limits in existing proactive and reactive routing protocols creates challenges. Also due to Mobility, Bandwidth, Energy Constraints, Routing cost and Delay, the availability of the nodes may vary from node to node and thus causing an issue in identifying the positions of mobile malicious nodes. To overcome these issues, in the present paper Sequence Number based Secure Routing (SNSR) algorithm has been implemented using existing IoT packet structure. The objective of this paper is to maximizes the packet delivery ratio and network life-time in order to improve the network performance. On comparing simulation results of SNSR algorithm with AODV and ABR routing algorithm, SNSR algorithm produced better performance of 95% than others.

GCORP: Geographic and Cooperative Opportunistic Routing Protocol for Underwater Sensor Networks

Underwater Sensor Network (UWSN) is gaining popularity among researchers due to its peculiar features. But there are so many challenges in the design of the UWSN system, and these are quite unsustainable due to the dynamic nature of water waves. Perhaps the most tedious challenge for UWSNs is how to transfer the data at the destination with a minimal energy rate. It can be accomplished by exploiting geographic and opportunistic routing schemes to send the data efficiently to the surface sinks in cooperation with relay nodes. With this aim, we introduce a new protocol for routing, named Geographic and Cooperative Opportunistic Routing Protocol (GCORP). In GCORP, the packets are routed from the source node to the surface sinks in coordination with intermediate relay nodes. In GCORP protocol, initially, multiple sinks-based network architecture is established. Then, a relay forwarding set is being determined by the source node on the basis of depth fitness factor. Finally, the best relay is determined through the weight calculation scheme from the relay forwarding set. We conduct the simulations in NS3 to validate the proposed GCORP routing protocol concerning different network metrics. The simulations conclude that the GCORP protocol shows better performance than existing approaches.

Multi-objective based deployment of throwboxes in Delay Tolerant Networks for the Internet of Things environment

Recent advances in Delay Tolerant Networks find its way into the Internet of Things leading to a new framework known as DTN-IoT. Delay Tolerant Network models can be effectively implemented within the Internet of Things framework to overcome intermittent connectivity problems. This could be made possible by deploying a few strategic nodes called throwboxes, which act as intermediate relay nodes and increase communication opportunities among the nodes. Each throwbox is assumed to have a pre-specified transmission range. Increase in the connection opportunities in a throwbox assisted DTN-IoT environment depends mainly on the optimal deployment of throwboxes. The objective of this paper is to identify optimal deployment locations for placement of throwboxes in a throwbox assisted DTN-IoT environment by (1) maximizing the coverage of all the throwboxes (2) minimizing the average delay and (3) maximizing the delivery ratio among all the nodes. We use an efficient Multi-Objective Differential Evolution and a popular Non-Dominated Sorting Genetic Algorithm-II for finding the optimal deployment location of throwboxes. The simulation results are compared to find a preferable strategy in throwbox deployment and enhance the performance of throwbox assisted DTN-IoT environment.

Power- and time-optimized MMSE-based joint beam-forming with relay selection for future generation MIMO networks using Modified Cuckoo-Search Optimization algorithm

Multiple Input Multiple Output (MIMO) networks operating in millimeter wave frequency band bring promising solutions for the increased demand of future generation networks in terms of data rate, signal quality, power optimization and computational complexity. A joint beam-forming (JBF) system working concurrently on source–relay–destination nodes leads to faithful delivery of signals by mitigating the effect of interferences. The traditional JBF designs in MIMO networks yield power wastage due to undesirable participation of intermediate relay nodes for message forwarding. The computational delay in beam-forming (BF) matrix update is tedious in traditional systems. This paper proposes a novel design of power-optimized JBF that facilitates optimum relay selection for solving power wastage issues. The selected relays co-operate in BF with the power constraint, and all other relays are powered down and enter into sleeping mode. Modified Cuckoo-Search Optimization (MCSO) algorithm is used for relay selection and minimum mean square error algorithm is used for BF matrix calculation. The proposed JBF is able to maximize Achievable Sum Rate (ASR) for optimum value of transmission power. The maximum power efficiency is achieved for distant communication with the aid of selected relays contributing to maximizing the ASR value. The proposed work minimizes the sum of mean square error and concurrently computes optimum time slot for BF matrix update, and hence computational delay is reduced. Thus a hybrid optimization for power and time in JBF design is achieved with relay selection and it can be widely used in future generation networks for high-quality and interference-free communication.

Physical security layer with friendly jammer in half-duplex relaying networks over rayleigh fading channel: intercept probability analysis

In this research, we proposed and investigated physical security with power beacon assisted in half-duplex relaying networks over a Rayleigh fading channel. In this model, the source (S) node communicates with the destination (D) node via the helping of the intermediate relay (R) node. The D and R nodes harvest energy from the power beacon (PB) node in the presence of a passive Eavesdropper (E) node. Then we derived the integral form of the system outage probability (OP) and closed form of the intercept probability (IP). The correctness of the analytical of the OP and IP is verified by the Monte Carlo simulation. The influence of the main system parameters on the OP and IP also is investigated. The research results indicated that the analytical results are the same as the simulation ones.

Secured Routing Using Neighbour Coverage with Minimum Overhead in Ad Hoc Networks

A wireless ad hoc network is a dispersed type of wireless network. The network is called as ad hoc as it does not rely on any pre existing infrastructure. Routing decisions are ready by node itself, so the determination of which node to forward data is prepared dynamically based on network connectivity. The overhead of a route discovery cannot be neglected. In this, Neighbour coverage protocol proposes for reducing routing overhead and to utilize the neighbour coverage knowledge and the probabilistic mechanism, which can radically decrease the number of retransmissions to reduce the routing overhead, and can also improve the routing performance. Due to high mobility of nodes in ad hoc networks, there exist regular link breakages, which lead to frequent path failures and route discoveries. ALERT dynamically partitions the network field into zones and arbitrarily chooses nodes in zones as intermediate relay nodes, which form a non-traceable unsigned route. In addition, it conceals the data initiator/receiver among many initiators/receivers to build up source and destination anonymity protection. Thus, ALERT offers anonymity security to sources, destinations, and routes for effective counter intersection and timing attacks and overheads are reduced.

Physical security with power beacon assisted in half-duplex relaying networks over Rayleigh fading channel: performance analysis

In this research, we proposed and investigated physical security with power beacon assisted in half-duplex relaying networks over a Rayleigh fading channel. In this model, the source (S) node communicates with the destination (D) node via the helping of the intermediate relay (R) node. The D and R nodes harvest energy from the power beacon (PB) node in the presence of a passive eavesdropper (E) node. Then we derived the integral form of the system outage probability (OP) and closed form of the intercept probability (IP). The correctness of the analytical of the OP and IP is verified by the Monte Carlo simulation. The influence of the main system parameters on the OP and IP also is investigated. The research results indicated that the analytical results are the same as the simulation ones.

Energy efficient intra-cluster data aggregation technique for wireless sensor network

Cluster based routing strategies are popular categories of routing protocols among wireless sensor networks (WSNs). In a typical cluster based routing protocols, few nodes are elected as cluster Head (CH) nodes and they form clusters with other nodes of the networks known as cluster members. The data sensed by cluster members is sent to CH node for data aggregation and further processing. Data Aggregation is considered to be one of the important methods used to prolong the network lifetime of WSN. Data aggregation is quite popular among cluster based routing protocols for WSN, where the data packets are aggregated by intermediate nodes till it reaches to BS. Data aggregation ultimately helps in reducing the number of data messages thereby assisting in network life prolongation. In this paper, an intra-cluster data aggregation technique (ICA) for WSNs is proposed. ICA constructs the intra cluster data aggregation path from a source node to its CH node in an energy efficient way. The data packets are aggregated along the aggregation path by intermediate relay nodes till the message reaches to designated CH node. Comparative analysis of ICA, LEACH and LEACH-C protocols are carried by considering the parameters such as number of alive nodes, energy consumption, number of data packets received by BS. Results obtained show that ICA performs better compared to LEACH and LEACH-C protocols.

Security and Reliability Analysis of a Two-Way Half-Duplex Wireless Relaying Network Using Partial Relay Selection and Hybrid TPSR Energy Harvesting at Relay Nodes

In recent years, physical layer security has been considered as an effective method to enhance the information security beside the cryptographic techniques that are used in upper layers. In this paper, we provide the security analysis for a two-way relay network, where the two sources can only communicate through the intermediate relay nodes. In particular, we consider the scenario that there is an eavesdropper in the vicinity of one source node. Both reliability and security aspects are taken into consideration in our work. To enhance the reliability of communication, the intermediate relays are supplied with the energy harvested from the sources' radio frequency (RF) signals using hybrid time-switching and power splitting (TPSR) protocol. Also, we apply the relay selection technique to select the best relay for the information exchange between two sources. Regarding security, the secrecy of information is improved with the help of friendly jammers nearby the eavesdropper. We provide the in-dept reliability and security analysis in terms of the closed-form expressions of the outage probability (OP) at the source nodes, the intercept probability (IP) at the eavesdropper, the secrecy outage probability (SOP), and the average secrecy capacity (ASC) of the system. Finally, the Monte Carlo simulations are also conducted to verify the correctness of our analysis and the effectiveness of the proposed scheme. Numerical results confirms that with the appropriate and feasible choices of involved parameters, both outage OP and IP can be kept at small values to guarantee the reliable and secure communication of the system.

Self-Energized UAV-Assisted Scheme for Cooperative Wireless Relay Networks

Unmanned aerial vehicles (UAVs) have recently been envisaged as an enabling technology of 5G. UAVs act as an intermediate relay node to facilitate uninterrupted, high quality communication between information sources and their destination. However, UAV energy management has been a major issue of consideration due to limited power supply, affecting flight duration. Thus, we introduce in this paper a unified energy management framework by resorting to wireless power transfer (WPT), simultaneous wireless information and power transfer (SWIPT) and self-interference (SI) energy harvesting (EH) schemes, in cooperative relay communications. In our new technique, UAVs are deployed as relays equipped with a decode and forward protocol and EH capability operating in a full-duplex (FD) mode. The UAV assists information transmission between a terrestrial base station and a user. The UAV's transmission capability is powered exclusively by the energy harvested from WPT, radio frequency signal transmitted from the source via time-switching SWIPT protocol and SI exploitation. We improve the overall system throughput by the use of FD based UAV-assisted cooperative system. In this proposed system, we formulate two optimization problems to minimize end-to-end outage probability, subject to UAV's power profile and trajectory for a DF relay scheme, respectively. The KKT conditions have been used to obtain closed-form solutions for the two formulated problems. Numerical simulation results validate all the theoretical results. We demonstrate that the performance of our proposed unified EH scheme outperforms that of existing techniques in the literature.

Secure Data Communications in Wireless Networks Using Multi-Path Avoidance Routing

Due to software implementation failure and misuse of cryptography, data encryption can no longer be considered a safeguard from security attacks. As a result, adversaries with eavesdropping capability along a routing path can compromise data privacy. In addition, should an adversary be one of the intermediate relay nodes in a path, she can deny data forwarding to disconnect the end-to-end communications. One solution is to avoid message routing through certain insecure areas, such as malicious countries or likely-compromised nodes. To this end, an avoidance routing based on the single path has been proposed. However, this single-path-based protocol relies on the availability of a safe path, i.e., no adversary is in the proximity of the whole path, which is difficult to achieve and therefore limits the routing opportunity. To tackle this issue, we propose an avoidance routing framework, namely timer-based multi-path avoidance routing (TMPAR). In our approach, a source node first encodes a message into $k$ different pieces, and each piece is sent via a different path. During its path discovery phase, a timer is used to efficiently discover a better set of paths. The destination can assemble the original message easily. Under the condition that no adversary obtains all the $k$ pieces of the message, the proposed TMPAR can securely deliver a message to its destination in spite of eavesdropping. The extensive ns-2 simulation results demonstrate that our TMPAR achieves its design goals.

Vehicular Adhoc Network Based Location Routing Protocol for Secured Energy

ALERT chiefly uses irregular message routing copy to supply namelessness protection. The projected protocol provides the ALERT routing high namelessness protection, EALERT additionally dynamically partitions a network field into zones and haphazardly chooses nodes in zones as intermediate relay nodes, that Anon-traceable anonymous route. It then haphazardly chooses a node inside the choice zone as a result of subsequent relay node and uses the EGPSR formula as a variant of GPSR in awake to send the information to the relay node. Within the last step, the information is broadcasted to k nodes at intervals the destination zone, providing k-anonymity to the destination. In addition, the protocol contains a method to hide the information instigator among sort of initiators to strengthen the k-anonymity protection of the provision. The projected Energy aware ALERT detects the Sybil attack within the network, Routing protocol, geographical routing.

CONTEXT-AWARE ENERGY CONSERVING ROUTING ALGORITHM FOR INTERNET OF THINGS

Internet of Things (IoT) is the fast- growing technology, mostly used in smart mobile devices such as notebooks, tablets, personal digital assistants (PDA), smartphones, etc. Due to its dynamic nature and the limited battery power of the IoT enabled smart mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Existing algorithm does not concentrate about communication links and battery power/energy, but these node links are a very important factor for improving the quality of routing in IoT. In this paper, Context-aware Energy Conserving Algorithm for routing (CECA) was proposed which employs QoS routing metrics like Inter-Meeting Time and residual energy and has been applied to IoT enabled smart mobile devices using different technologies with different microcontroller which resulted in an increased network lifetime, throughput and reduced control overhead and the end to end delay. Simulation results show that, with respect to the speed of the mobile nodes from 2 to 10m/s, CECA increases the network lifetime, thereby increasing the average residual energy by 11.1% and increasing throughput there by reduces the average end to end delay by 14.1% over the Energy-Efficient Probabilistic Routing (EEPR) algorithm. With respect to the number of nodes increases from 10 to 100 nodes, CECA algorithms increase the average residual energy by16.1 % reduces the average end to end delay by 15.9% and control overhead by 23.7% over the existing EEPR.