Reliable Packet Delivery Research Articles

State of the Art, Reliable, and Trusted Communication in Vehicle to Everything (V2X) Networks

Abstract Transportation systems are a necessity of modern life. To achieve safe and fast transportation, the intelligent transportation system is being developed. In this system, the main base station facilitates communication between vehicles and all other roadside entities using vehicle to everything networks. Various technologies have been built to support this communication. After receiving the information, vehicles can make their own decisions. This data communication is done in real time. But, if any of these data packets are dropped, the vehicle will make inaccurate decisions, so we need to have reliable data communication. All data communication will be accomplished through a system of neighboring nodes. There may be some malfunctioning nodes that lose packets in between, so a trusted and reliable link is necessary for efficient and secure data communication among the nodes. This paper presents a survey of various algorithms designed for the reliable delivery of data packets, algorithms for secure data transfer, and various types of attacks. After that, various schemes for building trust in parties sending data packets if also presented for survey.

A lightweight packet forwarding verification in SDN using sketch

By decoupling the control plane and the data plane, Software Defined Networking (SDN) has reshaped the ossified network architecture and improved the programmability of the network. However, SDN is also susceptible to malicious injection, tampering, dropping and hijacking attacks against forwarding packets, and the SDN architecture cannot perceive the real behavior of switches in the data plane. Packet forwarding verification and exception localization are recognized as effective and promising methods, enabling reliable packet delivery in the data plane and allowing the controller in SDN to identify abnormal links. While existing mechanisms embed the linear-scale cryptographic tags into the packet header space as the transmission path lengthens to realize packet verification and exception localization, which cannot achieve a feasible tradeoff between efficiency and security. Leveraging the central controllability of SDN, we propose a lightweight packet forwarding verification mechanism. This mechanism splits the runtime of a flow into consecutive epochs by address hopping. The switches in the data plane forward packets based on hopping address, collecting the information of packets forwarded in a compact data structure, namely traffic sketch. The controller verifies traffic sketches and localizes exception in the epoch. We further prototype the proposed mechanism based on simulation network. The analysis and experiments demonstrate that the cost of proposed scheme is lower than the similar mechanisms, introducing no more than 9 % additional forwarding delay and less than 8 % throughput degradation.

Analysis of End-to-End Delay in the Transport Segment of Fronthaul 4G/5G Networks Based on TSN Technology

One of the characteristic features of 4G/5G mobile networks is the spatial separation of functional blocks. The corresponding segments of the xHaul transport network are used to connect these blocks. One of them is the Fronthaul front end segment, which connects remote radio equipment with their control equipment. The data streams of standard CPRI/eCPRI radio interfaces in this segment impose strict requirements on the quality of service and, above all, on delays. To meet these requirements, it was proposed to use in the Fronthaul segment Ethernet bridge network based on the technology of time-sensitive networks TSN (Time Sensitive Networking), which provides determinated delays, reliable packet delivery and high accuracy of synchronization of nodes in the network. The IEEE 802.1CM standard describes profiles of TSN networks that defines the functions, options, configurations, default values, protocols and procedures of bridges, stations and local networks required to build the Fronthaul transport segment. The article presents a methodology for determining the maximum end-to-end traffic delays of standard CPRI/eCPRI radio interfaces in the Fronthaul segment of 4G/5G networks, built on the basis of TSN technology, in accordance with the requirements of IEEE 802.1CM standard. Two main components of end-to-end delay are identified ‒ delays in TSN bridges and delays in xEthernet channels. For high-priority traffic flows of CPRI/eCPRI radio interfaces in bridges, characteristic cases of mutual influence of flows arriving simultaneously at different input ports are given. An example of numerical calculation is given, which allowed to determine the permissible physical length of the Fronthaul segment at a given boundary end-to-end delay of transmission of high-priority traffic.

A Survey on Routing Solutions for Low-Power and Lossy Networks: Toward a Reliable Path-Finding Approach

Low-Power and Lossy Networks (LLNs) have grown rapidly in recent years owing to the increased adoption of Internet of Things (IoT) and Machine-to-Machine (M2M) applications across various industries, including smart homes, industrial automation, healthcare, and smart cities. Owing to the characteristics of LLNs, such as Lossy channels and limited power, generic routing solutions designed for non-LLNs may not be adequate in terms of delivery reliability and routing efficiency. Consequently, a routing protocol for LLNs (RPL) was designed. Several RPL objective functions have been proposed to enhance the routing reliability in LLNs. This paper analyses these solutions against performance and security requirements to identify their limitations. Firstly, it discusses the characteristics and security issues of LLN and their impact on packet delivery reliability and routing efficiency. Secondly, it provides a comprehensive analysis of routing solutions and identifies existing limitations. Thirdly, based on these limitations, this paper highlights the need for a reliable and efficient path-finding solution for LLNs.

Distance Energy-Efficient Soft Computing Model for Data Forwarding in Healthcare Sensor Network

Data forwarding is a crucial process in computer networking and telecommunications. It involves the transmission of data packets from a source to a destination within a network. The forwarding process is fundamental for enabling communication between devices on different segments of a network and plays a vital role in maintaining the overall performance and reliability of the network infrastructure. This paper presents the development and evaluation of the Threshold Congestion Data Forwarding Soft Computing (TCDF-SC) algorithm, designed for healthcare sensor networks. The algorithm combines threshold-based congestion management with soft computing techniques to enhance data forwarding efficiency in dynamic healthcare environments. Through extensive simulations, TCDF-SC demonstrates scalability, achieving high total packets forwarded and maintaining a reliable packet delivery ratio as the network scales. The algorithm minimizes average transmission delay and optimizes energy consumption, ensuring timely and energy-efficient data transmission. Comparative analysis against existing protocols, LEACH and BCP, highlights TCDF-SC’s superior performance across key metrics, positioning it as a promising solution for healthcare sensor networks. This research contributes to the advancement of data transmission optimization in healthcare, addressing critical requirements of reliability, energy efficiency, and adaptability in dynamic healthcare settings. Further validation and real-world experimentation will enhance the algorithm’s applicability in diverse healthcare scenarios, fostering advancements in patient monitoring and healthcare applications.

Edge computing for Vehicle to Everything: a short review.

Vehicle to Everything (V2X) communications and services have sparked considerable interest as a potential component of future Intelligent Transportation Systems. V2X serves to organise communication and interaction between vehicle to vehicle (V2V), vehicle to infrastructure (V2I), vehicle to pedestrians (V2P), and vehicle to networks (V2N). However, having multiple communication channels can generate a vast amount of data for processing and distribution. In addition, V2X services may be subject to performance requirements relating to dynamic handover and low latency communication channels. Good throughput, lower delay, and reliable packet delivery are the core requirements for V2X services. Edge Computing (EC) may be a feasible option to address the challenge of dynamic handover and low latency to allow V2X information to be transmitted across vehicles. Currently, existing comparative studies do not cover the applicability of EC for V2X. This review explores EC approaches to determine the relevance for V2X communication and services. EC allows devices to carry out part or all of the data processing at the point where data is collected. The emphasis of this review is on several methods identified in the literature for implementing effective EC. We describe each method individually and compare them according to their applicability. The findings of this work indicate that most methods can simulate the EC positioning under predefined scenarios. These include the use of Mobile Edge Computing, Cloudlet, and Fog Computing. However, since most studies are carried out using simulation tools, there is a potential limitation in that crucial data in the search for EC positioning may be overlooked and ignored for bandwidth reduction. The EC approaches considered in this work are limited to the literature on the successful implementation of V2X communication and services. The outcome of this work could considerably help other researchers better characterise EC applicability for V2X communications and services.

An Opportunistic Routing Based on Directional Transmission in the Internet of Underwater Things

The Internet of Underwater Things (IoUT) has attracted a lot of attention because of its promising applications in underwater environmental monitoring; however, the characteristics of acoustic communication, e.g., long propagation delay and high attenuation, pose great challenges for efficient and reliable underwater data transmission. Currently, opportunistic routing is regarded as a key technology to improve the packet delivery ratio, because it can dynamically choose several forwarding nodes and leverage their cooperative forwarding to increase network throughput. However, choosing an excessive number of forwarding nodes may result in energy waste and lengthy communication delays. Therefore, an Opportunistic Routing based on Directional Transmission (ORDT) is studied to improve packet delivery timeliness and reliability and lower energy consumption. ORDT mainly contains three phases: forwarding area division, candidate forwarder selection, and candidate forwarder coordination. The forwarding region is first established based on directional transmission. Only neighbors located in the forwarding region can forward packets. Following that, candidate forwarders in the forwarding region are chosen depending on their forwarding capability. Additionally, the chosen candidate’s time of holding packets is specified so that they might collaborate to reduce redundant data transmission and transmit packets to gateway nodes. Then, an Autonomous Underwater Vehicle (AUV) is employed to gather packets from gateway nodes. Simulation findings demonstrate that ORDT performs better than existing opportunistic routing in terms of packet delivery success rate, transmission latency, and energy usage.

Enhancing Packet Reliability in Wireless Multimedia Sensor Networks using a Proposed Distributed Dynamic Cooperative Protocol (DDCP) Routing Algorithm

Wireless Multimedia Sensor Networks (WMSNs) are being extensively utilized in critical applications such as environmental monitoring, surveillance, and healthcare, where the reliable transmission of packets is indispensable for seamless network operation. To address this requirement, this work presents a pioneering Distributed Dynamic Cooperation Protocol (DDCP) routing algorithm. The DDCP algorithm aims to enhance packet reliability in WMSNs by prioritizing reliable packet delivery, improving packet delivery rates, minimizing end-to-end delay, and optimizing energy consumption. To evaluate its performance, the proposed algorithm is compared against traditional routing protocols like Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), as well as proactive routing protocols such as Optimized Link State Routing (OLSR). By dynamically adjusting the transmission range and selecting optimal paths through cooperative interactions with neighboring nodes, the DDCP algorithm offers effective solutions. Extensive simulations and experiments conducted on a wireless multimedia sensor node testbed demonstrate the superior performance of the DDCP routing algorithm compared to AODV, DSR, and OLSR, in terms of packet delivery rate, end-to-end delay, and energy efficiency. The comprehensive evaluation of the DDCP algorithm against multiple routing protocols provides valuable insights into its effectiveness and efficiency in improving packet reliability within WMSNs. Furthermore, the scalability and applicability of the proposed DDCP algorithm for large-scale wireless multimedia sensor networks are confirmed. In summary, the DDCP algorithm exhibits significant potential to enhance the performance of WMSNs, making it a suitable choice for a wide range of applications that demand robust and reliable data transmission.

Network Coded Constrained Application Protocol With Improved Energy Efficiency for IIoT Networks

Constrained Application Protocol (CoAP) for low-power low-rate data transport in Industrial Internet of Things (IIoT) networks is typically running with two modes, namely, confirmable mode and non-confirmable mode, respectively. Confirmable mode relies on retransmission to ensure a guaranteed Quality of Service (QoS) in terms of packet loss rate at the cost of increased latency and power consumption. Whereas non-confirmable mode consumes less power, it is known to be packet loss prone. To enrich the CoAP transport for IIoT networks, we propose a packet-level Forward Error Correction (FEC) mechanism based on systematic coding with adaptive code rate to provide energy-efficient and reliable packet delivery. We mathematically analyze packet loss and cost of energy consumption of the proposed mechanism and compare it with confirmable CoAP transport scheme in the Gilbert-Elliott channel model. We demonstrate that the proposed mechanism can enhance the performance of non-confirmable CoAP to be comparable to confirmable CoAP in terms of packet loss rate, while outperforming it in energy consumption. The analytical and simulation results verify that the proposed mechanism is suitable for IIoT networks especially in high erasure burstiness scenarios.

Edge computing for Vehicle to Everything: a short review

Vehicle to Everything (V2X) communications and services have sparked considerable interest as a potential component of future Intelligent Transportation Systems. V2X serves to organise communication and interaction between vehicle to vehicle (V2V), vehicle to infrastructure (V2I), vehicle to pedestrians (V2P), and vehicle to networks (V2N). However, having multiple communication channels can generate a vast amount of data for processing and distribution. In addition, V2X services may be subject to performance requirements relating to dynamic handover and low latency communication channels. Good throughput, lower delay, and reliable packet delivery are the core requirements for V2X services. Edge Computing (EC) may be a feasible option to address the challenge of dynamic handover and low latency to allow V2X information to be transmitted across vehicles. Currently, existing comparative studies do not cover the applicability of EC for V2X. This review explores EC approaches to determine the relevance for V2X communication and services. EC allows devices to carry out part or all of the data processing at the point where data is collected. The emphasis of this review is on several methods identified in the literature for implementing effective EC. We describe each method individually and compare them according to their applicability. The findings of this work indicate that most methods can simulate the EC positioning under predefined scenarios. These include the use of Mobile Edge Computing, Cloudlet, and Fog Computing. However, since most studies are carried out using simulation tools, there is a potential limitation in that crucial data in the search for EC positioning may be overlooked and ignored for bandwidth reduction. The EC approaches considered in this work are limited to the literature on the successful implementation of V2X communication and services. The outcome of this work could considerably help other researchers better characterise EC applicability for V2X communications and services.

Reliable Wireless Networking via Soft-Source Information Combining

This article puts forth a multistream networking paradigm, referred to as soft-source-information-combining (SSIC), to support wireless Internet of Things (IoT) applications with ultrareliability requirements. For SSIC networking, an SSIC dispatcher at the source dispatches duplicates of packets over multiple streams, which may be established over different physical wireless networks. If a packet on a stream cannot be decoded due to wireless interference or noise, the decoder makes available the packet’s soft information. An aggregator then combines the soft information of the duplicates to boost reliability. Of importance are two challenges: 1) how to descramble the scrambled soft information from different streams to enable correct SSIC and 2) the construct of an SSIC dispatching and aggregation framework compatible with commercial network interface cards (NICs) and TCP/IP networks. To address the challenges, we put forth: 1) a soft descrambling (SD) method to minimize the bit-error rate (BER) and packet-error rate (PER) at the SSIC’s output and 2) an SSIC networking architecture readily deployable over today’s TCP/IP networks without specialized NICs. For concept proving and experimentation, we realized an SSIC system over two Wi-Fi’s physical paths in such a way that all legacy TCP/IP applications can enjoy the reliability brought forth by SSIC without modification. Experiments over our testbed corroborate the effectiveness of SSIC in lowering the packet delivery failure rate and the possibility of SSIC in providing 99.99% reliable packet delivery for short-range communication.

DARVAN: A fully decentralized anonymous and reliable routing for VANets

With the recent advances in the automobile industry and the emergence of smart self-driving vehicles, the increasing need for proper and optimal Vehicular Ad-hoc Network (VANet) protocols has drawn the attention of many researchers. Nevertheless, the VANet community has yet to agree on a unified and suitable set of protocols for such networks. One of the major concerns in these networks is security considerations, which are significant because of the specific characteristics of VANet. In this article, we aim to address the location privacy and reliability issues in VANet routing protocols. We propose DARVAN, a fully decentralized infrastructure that provides anonymous and reliable routing in VANets. By employing a distributed database and collective consensus, DARVAN minimizes the exposure of critical data, which is conventionally stored and processed in centralized units. DARVAN is deployed by modifying the I2P protocol, which aims to improve routing reliability and resilience to many adversary activities in VANets. Specifically, with DARVAN, we present an effective and efficient network-level mitigation for Sybil attacks in Vanets. Our extensive simulations on NS3 show that DARVAN performs well in terms of packet delivery ratio, overhead, delay, and reliability compared to the previous anonymous scheme proposed for VANet routing.

Retraction Note: Reliable Packet Delivery in Wireless Body Area Networks Using TCDMA Algorithm for e‑Health Monitoring System

Retraction Note: Reliable Packet Delivery in Wireless Body Area Networks Using TCDMA Algorithm for e‑Health Monitoring System

Effective and Enhanced Congestion Control Technique using Adaptive Routing Protocol to Improve the Performance of Crammed WSN

Nowadays, congestion on the network becomes a usual fact which is to be focused and to be addressed appropriately especially in Wireless Sensor Networks (WSN) for crammed type networks. Limited capacity on channel and wastage of energy are the root cause of congestion in WSN. The effects of congestion implies on QoS parameters, queue length, data arrival rate etc. Furthermore, data packets should be transmitted energy-efficiently to the sink node. In this regard, an Energy-Efficient Routing Protocol is offered to efficiently transmit the nodes to their end node or destination. To control congestion, an Adaptive Buffer trade-off and Improved Trust-based Energy Efficient Routing protocol are first presented, this method identifies the congestion free paths and the Buffer trade-off handles the buffer effectively. To route the protocol, a Cross-Layer Security-Based Fuzzy Logic Energy Efficient Packet Loss Preventive Routing Protocol has been developed. The proposed protocol routes the nodes and the protocol adopts a routing protocol that imparts security in terms of avoiding malicious nodes and preventing data loss. Consequently, to improve the lifetime of the network, a Density Aware Optimal Clustering Approach is presented. The proposed method is evaluated based on the Matlab software and the QoS performance metrics are Energy Consumption, Packet Delivery Ratio, Trust Value Computation, latency, reliability, energy efficiency, end-to end delay, Average Throughput, accuracy and network lifetime. The effectiveness of the research is evaluated by comparing it with other existing techniques, including Trust Aware Secure Routing Protocol (TASRP), Artificial Flora Algorithm Based Support Vector Machine (SVM-AF), Well-Organized Trust Estimation Based Routing Scheme (ETERS), Lion Fuzzy Bee, and Bat Fuzzy Bee Algorithm. Accordingly, the suggested method’s performance is higher than the existing methods for Packet delivery ratio, throughput, network lifetime, energy efficiency, and reliability. Consequently, the proposed method improves the congestion control performance in an energy-efficient manner, in future; a recently advanced technique is proposed to effectively improve the network performance respectively.

Edge computing for Vehicle to Everything: a short review

Vehicle to Everything (V2X) communications and services have sparked considerable interest as a potential component of future Intelligent Transportation Systems. V2X serves to organise communication and interaction between vehicle to vehicle (V2V), vehicle to infrastructure (V2I), vehicle to pedestrians (V2P), and vehicle to networks (V2N). However, having multiple communication channels can generate a vast amount of data for processing and distribution. In addition, V2X services may be subject to performance requirements relating to dynamic handover and low latency communication channels. Good throughput, lower delay, and reliable packet delivery are the core requirements for V2X services. Edge Computing (EC) may be a feasible option to address the challenge of dynamic handover and low latency to allow V2X information to be transmitted across vehicles. Currently, existing comparative studies do not cover the applicability of EC for V2X. This review explores EC approaches to determine the relevance for V2X communication and services. EC allows devices to carry out part or all of the data processing at the point where data is collected. The emphasis of this review is on several methods identified in the literature for implementing effective EC. We describe each method individually and compare them according to their applicability. The findings of this work indicate that most methods can simulate the EC positioning under predefined scenarios. These include the use of Mobile Edge Computing, Cloudlet, and Fog Computing. However, since most studies are carried out using simulation tools, there is a potential limitation in that crucial data in the search for EC positioning may be overlooked and ignored for bandwidth reduction. The EC approaches considered in this work are limited to the literature on the successful implementation of V2X communication and services. The outcome of this work could considerably help other researchers better characterise EC applicability for V2X communications and services.

Authentication and Resource Allocation Strategies during Handoff for 5G IoVs Using Deep Learning

One of the most sought-after applications of cellular technology is transforming a vehicle into a device that can connect with the outside world, similar to smartphones. This connectivity is changing the automotive world. With the speedy growth and densification of vehicles in Internet of Vehicles (IoV) technology, the need for consistency in communication amongst vehicles becomes more significant. This technology needs to be scalable, secure, and flexible when connecting products and services. 5G technology, with its incredible speed, is expected to power the future of vehicular networks. Owing to high mobility and constant change in the topology, cooperative intelligent transport systems ensure real time connectivity between vehicles. For ensuring a seamless connectivity amongst the entities in vehicular networks, a significant alternative to design is support of handoff. This paper proposes a scheme for the best Road Side Unit (RSU) selection during handoff. Authentication and security of the vehicles are ensured using the Deep Sparse Stacked Autoencoder Network (DS2AN) algorithm, developed using a deep learning model. Once authenticated, resource allocation by RSU to the vehicle is accomplished through Deep-Q learning (DQL) techniques. Compared with the existing handoff schemes, Reinforcement Learning based on the MDP (RL-MDP) has been found to have a 13% lesser decision delay for selecting the best RSU. A higher level of security and minimum time requirement for authentication is achieved using DS2AN. The proposed system simulation results demonstrate that it ensures reliable packet delivery, significantly improving system throughput, upholding tolerable delay levels during a change of RSUs.

Energy-Efficient and Disjoint Multipath Using Face Routing in Wireless Sensor Networks

In WSNs, multipath is well-known as a method to improve the reliability of packet delivery by making multiple routes from a source node to a destination node. To improve reliability and load-balancing, it is important to ensure that disjoint characteristics of multipath do not use same nodes during path generation. However, when multipath studies encounter a hole area from which is hard to transmit data packets, they have a problem with breaking the disjoint features of multipath. Although existing studies propose various strategies to bypass hole areas, they have side effects that significantly accelerate energy consumption and packet transmission delay. Therefore, to retain the disjoint feature of multipath, we propose a new scheme that can reduce delay and energy consumption for a node near a hole area using two approaches—global joint avoidance and local avoidance. This scheme uses global joint avoidance to generate a new path centered on a hole area and effectively bypasses the hole area. This scheme also uses local joint avoidance that does not select the same nodes during new path generation using a marking process. In simulations, the proposed scheme has an average 30% improvement in terms of average energy consumption and delay time compared to other studies.

Edge computing for Vehicle to Everything: a short review

Vehicle to Everything (V2X) communications and services have sparked considerable interest as a potential component of future Intelligent Transportation Systems. V2X serves to organise communication and interaction between vehicle to vehicle (V2V), vehicle to infrastructure (V2I), vehicle to pedestrians (V2P), and vehicle to networks (V2N). However, having multiple communication channels can generate a vast amount of data for processing and distribution. In addition, V2X services may be subject to performance requirements relating to dynamic handover and low latency communication channels. Good throughput, lower delay, and reliable packet delivery are the core requirements for V2X services. Edge Computing (EC) may be a feasible option to address the challenge of dynamic handover and low latency to allow V2X information to be transmitted across vehicles. Currently, existing comparative studies do not cover the applicability of EC for V2X. This review explores EC approaches to determine the relevance for V2X communication and services. EC allows devices to carry out part or all of the data processing at the point where data is collected. The emphasis of this review is on several methods identified in the literature for implementing effective EC. We describe each method individually and compare them according to their applicability. The findings of this work indicate that most methods can simulate the EC positioning under predefined scenarios. These include the use of Mobile Edge Computing, Cloudlet, and Fog Computing. However, since most studies are carried out using simulation tools, there is a potential limitation in that crucial data in the search for EC positioning may be overlooked and ignored for bandwidth reduction. The EC approaches considered in this work are limited to the literature on the successful implementation of V2X communication and services. The outcome of this work could considerably help other researchers better characterise EC applicability for V2X communications and services.

Weighted Greedy Approach for Low Latency Resource Allocation on V2X Network

In Vehicular ad-hoc networks (VANETs), resource allocation has become one of the primary tasks. Thus, a system should be well-designed so that information could be transmitted reliably and efficiently. As vehicular communication has several characteristics, efficient resource allocation scheme for D2D communications is highly required in VANET. The network topology changes rapidly as the vehicles are moving fast on the road and this makes it harder to communicate among the vehicles by predicting the best available channel. So as to overcome these issues, the proposed technique is offered in which the channel availability is predicted based on the novel mechanism like contention latency prediction using interframe spaces like Short interframe space, Distributed Coordination Function interframe space, Pointed Coordination Function and scattering based greedy weight matrix method. The implementation of this greedy mechanism in turn enhances the prediction probability of best channels that are available. Thus, the best available channel offered using greedy weight matrix scheme thereby estimates the decision probability at which the collision for available channel is computed. Thus, from this the best available channel is provided to the requested user. At last, the performance analysis is made in terms of packet delivery ratio, throughput, delay, reliability, and rate of message loss and is compared with existing techniques to prove the effectiveness of proposed strategy.

CEPRAN-Cooperative Energy Efficient and Priority Based Reliable Routing Protocol with Network Coding for WBAN

The wireless body area network (WBAN) can effectively modify the health and lifestyle monitoring specifically where multiple body parameters are measured using biomedical sensor devices. However, power consumption and reliability are crucial issues in WBAN. Cooperative Communication usually prolongs the network lifetime of WBAN and allows reliable delivery of bio-medical packets. Hence, the main aim of this investigation is to propose a novel protocol Cooperative Energy efficient and Priority based Reliable routing protocol with Network coding (CEPRAN) to enhance the reliability and energy efficiency of WBAN using cooperative communication method. Firstly, to identify a relay node from the group of sensor nodes for data forwarding, an enhanced Cuckoo search optimization algorithm is proposed. Secondly, Cooperative Random Linear Network Coding approach is incorporated into the relay node to improve the packet transfer rate. CEPRAN is implemented in Ns-3 simulator and the experimental results prove that the proposed protocol outperforms the existing SIMPLE Protocol.