Reliable Packet Delivery Research Articles

Comprehensive Performance Analysis of Privacy Protection Protocols Utilizing Fake Packet Injection Techniques

In many Internet of Things (IoT) systems and monitoring wireless sensor networks (WSNs), sensor nodes are expected to function for prolonged periods of time with no scope of recharging the sensor node batteries. Similarly, in safety-critical monitoring applications, the WSNs are expected to guarantee effective source location privacy (SLP) protection throughout the network lifetime. Fake packet-based SLP protocols are often energy-inefficient, they incur short network lifetime, and have high probability of packet collision events. Therefore, it is important to evaluate features such as the capability of the protocols to guarantee effective SLP protection for prolonged periods of time and reliable packet delivery. The existing studies show some deficit in the performance evaluation of the protocols. Consequently, this paper presents some investigations on the performance of the fake packet-based SLP protocols. Comprehensive performance analysis of four existing protocols is done under varied network parameters and configurations. Performance is observed under varied sensor node residual energy, source-sink distance, lifetime, source packet rate, network size, and node density. Analysis results establish that the protocols are capable of achieving high levels of SLP protection. However, the privacy protection is short-lived. Furthermore, the results show that long source-sink distance, long fake packet routes, short distance between fake packet sources and phantom nodes, and large amounts of fake packet traffic can improve the SLP protection while diminishing the packet delivery reliability, energy efficiency, and the network lifetime. The results also show that when the source packet rate is increased it influences some negative effects on the performance of the protocols. Moreover, it is observed that integrating fake packet routing and packet flooding techniques can impact some positive effects on the SLP protection and negative effects on the network lifetime. Based on the observations and analysis results, some recommendations are presented to improve the performance of the protocols.

Reliable Communication and Latency Bound Generation in Wireless Cyber-Physical Systems

Low-power wireless communication has been widely used in cyber-physical systems that require time-critical data delivery. Achieving this goal is challenging because of link burstiness and interference. Based on significant empirical evidence of 21 days and over 3.6 M packet transmissions per link, we propose both routing and scheduling algorithms that produce latency bounds of the real-time periodic streams and accounts for both link bursts and interference. The solution is achieved through the definition of a new metric B max that characterizes links by their maximum burst length, and by choosing a novel least-burst-route that minimizes the sum of worst-case burst lengths over all links in the route. With extensive data-driven analysis, we show that our algorithms outperform existing solutions by achieving accurate latency bound with much less energy consumption. In addition, a testbed evaluation consisting of 48 nodes spread across a floor of a building shows that we obtain 100% reliable packet delivery within derived latency bounds. We also demonstrate how performance deteriorates and discuss its implications for wireless networks with insufficient high-quality links.

An efficient routing protocol for cognitive radio networks of energy-limited devices

In the era of Internet-of-things (IoT), the future 5G networks are supposed to provide ubiquitous connectivity, high speed, as well as low latency and energy efficiency at low cost to billions of battery-powered wireless devices. The anticipated tremendous demand for wireless bandwidth in 5G networks calls for efficient usage of the underutilized licensed frequency spectrum that preserves the energy consumption of these energy-limited devices. This is feasible by embracing the cognitive radio concept and making use of its functionalities and capabilities to form 5G-CR incorporation. As a step towards this goal, an efficient routing protocol for cognitive radio (ERCR) networks is proposed in this paper. The proposed protocol is location-based and can fully operate over a single wireless channel using a channel access mechanism that follows the IEEE 802.11 distributed coordination function. It selects the route with the minimum number of forwarding nodes that have sufficient remaining energy. This, in turn, increases the per-node capacity to meet the operational requirements of different IoT applications. Meanwhile, it conserves the limited energy of battery-powered devices. The efficiency of the proposed protocol has been evaluated using extensive network simulator-2 computer simulations for a wide range of performance metrics under different activity levels of licensed users in terms of channel occupancy likelihood and duration. The simulation results reveal that ERCR is capable of providing reliable packet delivery at a low packet transfer latency while saving the energy of the cognitive radio network nodes with a fairly small overhead.

Fuzzy Informer Homed Routing Protocol for Wireless Sensor Network

A wireless sensor network consists of severalsensor nodes. Sensor nodes collaborate to collect meaningful environmental information and send them to the base station. During these processes, nodes are prone to failure, due to the energy depletion, hardware or software failure, etc. Therefore, fault tolerance and energy efficiency are two important objectives for reliable packet delivery. To address these objectives a novel method called fuzzy informer homed routing protocol is introduced. The proposed method tries to distribute the workload between every sensor node. A fuzzy logic approach is used to handle uncertainties in cluster head communication range estimation. The simulation results show that the proposed method can significantly reduce energy consumption as compared with IHR and DHR protocols. Furthermore, results revealed that it performs better than IHR and DHR protocols in terms of first node dead and half of the nodes alive, throughput and total remaining energy. It is concluded that the proposed protocol is a stable and energy efficient fault tolerance algorithm for wireless sensor networks.

Utility-Aware Enhanced Reliable Opportunistic Routing Protocol for Mobile Adhoc Networks

Usually, the nodes in Mobile Adhoc Networks (MANET) are bounded with the limited power resources to interact with each other nodes without any backbone infrastructures. As a result, an allocation of unbalanced traffic among nodes may increase the power dissipation in the overloaded nodes and path failures that degrade the network lifetime. To tackle this problem, an on-demand Power and Load-Aware (PLA) multipath node-disjoint source routing scheme was proposed based on the Dynamic Source Routing (DSR) protocol that uses a new cost function to determine the multiple node-disjoint power and select the load-aware optimal paths to their destinations. However, this protocol was affected by control overhead and the reliable packet delivery was also not effective. Hence in this article, Power and Load-aware i.e., Utility-Aware Reliable Opportunistic Routing (UAROR) protocol is proposed to enhance the efficiency and reliability of the routing protocol. In this protocol, topology control and link lifetime prediction algorithms are integrated into the PLA algorithm to predict the effect of the node mobility on routing performance. The link prediction algorithm considers both mobility speed and direction for improving the accuracy. As well, an opportunistic topology control algorithm uses packet delivery ratio to maintain the node’s stability. Moreover, Utility-Aware Enhanced ROR (UAEROR) protocol is proposed to improve the node’s stability and reduce the control overhead by employing the neighbor detection algorithm that uses degree and reachability of nodes. Finally, the simulation results show that the effectiveness of the proposed protocol compared to the existing protocol in terms of throughput, end-to-end delay, packet delivery ratio, network lifetime, energy consumption and control overhead.

MEGAN: Multipurpose Energy-Efficient, Adaptable, and Low-Cost Wireless Sensor Node for the Internet of Things

In this paper, we present the design of a new sensor node, named Multipurpose EnerGy-efficient Adaptable low-cost sensor Node ( MEGAN ), with all the desired features such as reconfigurability, flexibility, energy efficiency, and low-cost required to build the Internet of Things (IoT). Apart from the ability to interface a maximum of 32 different sensors and actuators, MEGAN allows a user to choose the desired communication module, depending on the required range of communication. We design a power management circuit to extend the lifetime of the resource-constrained sensor node. Additionally, it has an integrated recharging circuit on board, which can use the energy harvested from any unregulated energy source. MEGAN combats a major drawback of application-specific sensor nodes, because of the integration of switches and a programming port. The flexibility of MEGAN, with respect to the integration of any sensor or actuator, makes it a multipurpose adaptable sensor node. The analysis of the lifetime, received signal strength indicator, packet delivery ratio, adaptability, and reliability of MEGAN under different operating conditions establish the energy efficiency and superiority of its hardware design.

FAST PACKETS DELIVERY TECHNIQUES FOR URGENT PACKETS IN EMERGENCY APPLICATIONS OF INTERNET OF THINGS

Internet of Things (IoT) has been receiving a lot of interest around the world in academia, industry and telecommunication organizations. In IoT, many constrained devices can communicate with each other which generate a huge number of transferred packets. These packets have different priorities based on the applications which are supported by IoT technology. Emergency applications such as calling an ambulance in a car accident scenario need fast and reliable packets delivery in order to receive an immediate response from a service provider. When a client sends his request with specific requirements, fast and reliable return contents (packets) should be fulfilled, otherwise, the network resources may be wasted and undesirable circumstances may be counted. Content-Centric Networking (CCN) has become a promising network paradigm that satisfies the requirements of fast packets delivery for emergency applications of IoT. In this paper, we propose fast packets delivery techniques based on CCN for IoT environment, these techniques are suitable for urgent packets in emergency applications that need fast delivery. The simulation results show how the proposed techniques can achieve high throughput, a large number of request messages, fast response time and a low number of lost packets in comparison with the normal CCN.

Understanding and Improving the Performance of Constructive Interference Using Destructive Interference in WSNs

The constructive interference (CI) phenomenon has been exploited by a number of protocols for providing energy-efficient, low-latency, and reliable data collection and dissemination services in wireless sensor networks. These protocols consider CI to provide highly reliable packet delivery. This has attracted attention to understand the working of CI; however, the existing works present inconsistent views. Furthermore, these works do not study in the real-world settings where the physical conditions of deployment and unreliable wireless channels also impact the performance of CI. Therefore, we study the phenomenon of CI, considering a receiver’s viewpoint and analyze the parameters that affect CI. We validate our arguments with results from extensive and rigorous experimentation in real-world settings. This paper presents comprehensive insights into the CI phenomenon. With the understanding, we develop the destructive interference-based power adaptation (DIPA), an energy-efficient and distributed algorithm, that adapts transmission power to improve the performance of CI. Since CI-based protocols cannot have an explicit acknowledgment packet, we make use of destructive interference on a designated byte to provide a feedback. We leverage this feedback to adapt transmission powers. We compared CI with and without DIPA in two real-life testbeds. On one testbed, we achieve around 25% lower packet losses while using only half of its transmission power for 64-B packets. On the other testbed, we achieve 25% lower packet losses while consuming only 47% of its transmission power for 128-B packets. Existing CI-based protocols can easily incorporate DIPA into them to achieve lower packet losses and higher energy efficiencies.

Cooperative and Delay Minimization Routing Schemes for Dense Underwater Wireless Sensor Networks

Symmetry in nodes operation in underwater wireless sensor networks (WSNs) is crucial so that nodes consume their energy in a balanced fashion. This prevents rapid death of nodes close to water surface and enhances network life span. Symmetry can be achieved by minimizing delay and ensuring reliable packets delivery to sea surface. It is because delay minimization and reliability are very important in underwater WSNs. Particularly, in dense underworks, packets reliability is of serious concern when a large number of nodes advance packets. The packets collide and are lost. This inefficiently consumes energy and introduces extra delay as the lost packets are usually retransmitted. This is further worsened by adaptation of long routes by packets as the network size grows, as this increases the collision probability of packets. To cope with these issues, two routing schemes are designed for dense underwater WSNs in this paper: delay minimization routing (DMR) and cooperative delay minimization routing (CoDMR). In the DMR scheme, the entire network is divided into four equal regions. The minor sink nodes are placed at center of each region, one in each of the four regions. Unlike the conventional approach, the placement of minor sink nodes in the network involves timer based operation and is independent of the geographical knowledge of the position of every minor sink. All nodes having physical distance from sink lower than the communication range are able to broadcast packets directly to the minor sink nodes, otherwise multi-hopping is used. Placement of the minor sinks in the four regions of the network avoids packets delivery to water surface through long distance multi-hopping, which minimizes delay and balances energy utilization. However, DMR is vulnerable to information reliability due to single path routing. For reliability, CoDMR scheme is designed that adds reliability to DMR using cooperative routing. In CoDMR, a node having physical distance from the sink greater than its communication range, sends the information packets by utilizing cooperation with a single relay node. The destination and the relay nodes are chosen by considering the lowest physical distance with respect to the desired minor sink node. The received packets at the destination node are merged by fixed ratio combining as a diversity technique. The physical distance computation is independent of the geographical knowledge of nodes, unlike the geographical routing protocols. This makes the proposed schemes computationally efficient. Simulation shows that DMR and CoDMR algorithms outperform the counterpart algorithms in terms of total energy cost, energy balancing, packet delivery ratio (PDR), latency, energy left in the battery and nodes depleted of battery power.

Ultrareliable and Low-Latency Communication Techniques for Tactile Internet Services

This paper presents novel ultrareliable and low-latency communication (URLLC) techniques for URLLC services, such as Tactile Internet services. Among typical use-cases of URLLC services are tele-operation, immersive virtual reality, cooperative automated driving, and so on. In such URLLC services, new kinds of traffic such as haptic information including kinesthetic information and tactile information need to be delivered in addition to high-quality video and audio traffic in traditional multimedia services. Further, such a variety of traffic has various characteristics in terms of packet sizes and data rates with a variety of requirements of latency and reliability. Furthermore, some traffic may occur in a sporadic manner but require reliable delivery of packets of medium to large sizes within a low latency, which is not supported by current state-of-the-art wireless communication systems and is very challenging for future wireless communication systems. Thus, to meet such a variety of tight traffic requirements in a wireless communication system, novel technologies from the physical layer to the network layer need to be devised. In this paper, some novel physical layer technologies such as waveform multiplexing, multiple access scheme, channel code design, synchronization, and full-duplex transmission for spectrally-efficient URLLC are introduced. In addition, a novel performance evaluation approach, which combines a ray-tracing tool and system-level simulation, is suggested for evaluating the performance of the proposed schemes. Simulation results show the feasibility of the proposed schemes providing realistic URLLC services in realistic geographical environments, which encourages further efforts to substantiate the proposed work.

Reliable Communication in Transmission Grids based on Nondisjoint Path Aggregation Using Software-Defined Networking

In electrical transmission grids, the redundant communication paths nondisjointly overlapping at links can be established between certain substations and the control center to guarantee reliable packet delivery under link failures. However, the generation of nondisjoint paths with multiplicative and concave constraints is with the NP-complete complexity and the failovers can lead to out-of-order packets. This paper presents an OpenFlow-based nondisjoint path aggregation mechanism to heuristically compute the constrained nondisjoint paths in a centralized fashion and reorganize the out-of-order packets at edge switches. The solution is evaluated through simulations of the IEEE 30-bus network scenario under 2% link failure rate and the result confirms its effectiveness: the packet delivery success rate is significantly improved in comparison with the current nondisjoint and disjoint path algorithms. TCP throughput is improved by 121.62% with the packet reordering. Also, the memory usage for the packet reordering buffer is reduced by 76.563% compared with the distributed cognitive packet network.

A Mathematical Model for Cross Layer Protocol Optimizing Performance of Software-Defined Radios in Tactical Networks

Unlike conventional mobile ad hoc networks, tactical networks, which provide communication of software-defined radios (SDRs) in mission critical and time-sensitive applications, require cognitive functions across the TCP/IP stack to encounter strict constraints while providing smooth incorporation with IP-based applications. The tactical applications are mission-critical and thus pose unique requirements for the network, including decentralized control and mission specific latency bounds for end-to-end data delivery. This paper presents a mathematical model for a cross-layer design, which optimizes trade-offs among different configurations of the SDRs to achieve maximum performance in terms of energy efficiency, reliable packet delivery at an appropriate data rate and within affordable latency bounds in multi-hop tactical networks. The proposed model is used in a number of mission-critical network scenarios to demonstrate enhanced performance, where SDRs effectively adapt to the dynamic environment.

Synchronous LoRa Mesh Network to Monitor Processes in Underground Infrastructure

Collecting precise real-time information on urban drainage system performance is essential to identify, predict, and manage critical loading situations, such as urban flash floods and sewer overflows. Although emerging low-power wireless communication techniques allow efficient data transfers with great above-ground performance, for underground or indoor applications in a large coverage range are difficult to achieve due to physical and topological limitations, particularly in dense urban areas. In this paper, we first discuss the range limitations of the LoRaWAN standard based on a systematic evaluation of a long-term operation of a sensor network monitoring in-sewer process dynamics. Analyses reveal an-on average-five-fold higher data packet loss for sub-surface nodes, which steadily grows with increasing distance to the gateway. Second, we present a novel LPWAN concept based on the LoRaR technology that enhances transmission reliability, efficiency, and flexibility in range-critical situations through meshed multi-hop routing and ensures a precise time-synchronization through optional GPS or DCF77 long-wave time signaling. Third, we illustrate the usefulness of the newly developed concept by evaluating the radio transmission performance for two independent full-scale field tests. Test results show that the synchronous LoRa mesh network approach clearly outperforms the standard LoRaWAN technique with regard to the reliability of packet delivery when transmitting from range-critical locations. Hence, the approach is expected to generally ease data collection from difficult-to-access locations such as underground areas.

Fuzzy Informer Homed Routing Protocol for Wireless Sensor Network

A wireless sensor network consists of several sensor nodes. Sensor nodes collaborate to collect meaningful environmental information and send them to the base station. During these processes, nodes are prone to failure, due to the energy depletion, hardware or software failure, etc. Therefore, fault tolerance and energy efficiency are two important objectives for reliable packet delivery. To address these objectives a novel method called fuzzy informer homed routing protocol is introduced. The proposed method tries to distribute the workload between every sensor node. A fuzzy logic approach is used to handle uncertainties in cluster head communication range estimation. The simulation results show that the proposed method can significantly reduce energy consumption as compared with IHR and DHR protocols. Furthermore, results revealed that it performs better than IHR and DHR protocols in terms of first node dead and half of the nodes alive, throughput and total remaining energy. It is concluded that the proposed protocol is a stable and energy efficient fault tolerance algorithm for wireless sensor networks.

ENERGY SENTIENT QOS IMPLEMENTED NODE-DISJOINT MULTIPATH ROUTING PROTOCOLFOR MANET

Some of the main challenges dealing with mobile ad-hoc networks are typically associated with insufficiency of energy and attaining QoS requirements. In order to attain efficient utilization of energy and improve the operational lifetime of the mobile ad-hoc network while at the same time providing reliable packets delivery, energy efficient node disjoint multipath routing was suggested. In such networks attaining Quality of Service (QoS) routing is a not an easy task due to the network breakage by node mobility or high power consumption of mobile nodes. This paper presents a new adaptation of Energy Sentient QoS Implemented in Node- Disjoint Multipath Routing Protocol (ESQI-NDMRP) incorporated with cluster head selection in clusters to allow the sharp selection of node- disjoint routes, and these node-disjoint routes are selected in various cluster head at clusters from the environment circumstance of the network to satisfy the QoS requirements. The performance of our protocol is contrasted with ESQI-NDMRP. From simulation results attained from NS2 simulator by implementing the proposed method, show improved result in terms of energy consumption and throughput as compared to ESQI-NDMRP.

TESLA: Traffic-Aware Elastic Slotframe Adjustment in TSCH Networks

Low-power wireless network for the emerging Internet of Things (IoT) should be reliable enough to satisfy the application requirements, and also energy-efficient for embedded devices to remain battery powered. Synchronized communication methods such as Time Slotted Channel Hopping (TSCH) have shown promising results for these purposes, achieving end-to-end reliability over 99% with low duty-cycles. However, they lack one thing: flexibility to support a wide variety of applications and services with unpredictable traffic load and routing topology due to “fixed” slotframe sizes. To this end, we propose TESLA, a traffic-aware elastic slotframe adjustment scheme for TSCH networks which enables each node to dynamically self-adjust its slotframe size at run time. TESLA aims to minimize its energy consumption without sacrificing reliable packet delivery by utilizing incoming traffic load to estimate channel contention level experienced by each neighbor. We extensively evaluate the effectiveness of TESLA on large-scale 110-node and 79-node testbeds, demonstrating that it achieves up to 70.2% energy saving compared to Orchestra (the de facto TSCH scheduling mechanism) while maintaining 99% reliability.

Fuzzy Informer Homed Routing Protocol for Wireless Sensor Network

A wireless sensor network consists of several sensor nodes. Sensor nodes collaborate to collect meaningful environmental information and send them to the base station. During these processes, nodes are prone to failure, due to the energy depletion, hardware or software failure, etc. Therefore, fault tolerance and energy efficiency are two important objectives for reliable packet delivery. To address these objectives a novel method called fuzzy informer homed routing protocol is introduced. The proposed method tries to distribute the workload between every sensor node. A fuzzy logic approach is used to handle uncertainties in cluster head communication range estimation. The simulation results show that the proposed method can significantly reduce energy consumption as compared with IHR and DHR protocols. Furthermore, results revealed that it performs better than IHR and DHR protocols in terms of first node dead and half of the nodes alive, throughput and total remaining energy. It is concluded that the proposed protocol is a stable and energy efficient fault tolerance algorithm for wireless sensor networks.

Novel Technique in Multihop Environment for Efficient Emergency Message Dissemination and Lossless Video Transmission in VANETS

Vehicular ad hoc networks (VANETs) support safety- and non-safety-related applications that require the transmission of emergency safety messages and periodic beacon messages. The dedicated short-range communication (DSRC) standard in VANETs is used to exchange safety messages, and is involved in multi-hop data dissemination and routing. Many researchers have focused either on emergency data dissemination or routing, but both are critical. Routing protocols are commonly used for position-based routing and distancebased routing. This paper focuses on both emergency data dissemination and multi-hop routing, with the selection of the best data disseminator and trustworthy forwarder. To select the best forwarder, ring partitioning is performed, which segregates vehicles into rings based on the coverage area for routing. Each partition is selected with a best forwarder, which minimizes the hop count for data transmission. The work also includes effective video transmission for a user’s request. Video transmission in VANETs is involved in this work to provide efficient video delivery between rapidly travelling vehicles with reduced delay owing to the selection of good-quality channels. Video transmission is prioritized according to frame types, and they are then transmitted with respect to the preference of channels. The major issue in video streaming is the loss of packets, which is our focus to minimize it. Our proposed VANET environment is simulated in OMNeT++, and the results show remarkable improvements in terms of the packet delivery ratio, end-to-end delay, and reliability.

Performance Analysis of the Differences Restricted Access Window (RAW) on IEEE 802.11ah Standard with Enhanced Distributed Channel Access (EDCA)

IEEE 802.11 standard is a WLAN (Wireless LAN) standard that has been used in all over the world. IEEE 802.11ah is the newer technology that designed to supports Internet of Things (IoT) and Machine-to-machine Communication (M2M). IEEE 802.11ah has a feature called Restricted Access Window (RAW) that capable to reduce power usage and have satisfying Quality of Service (QoS). In this research, Enhanced Distributed Channel Access (EDCA) is also applied. Same as RAW, EDCA also be able to affect QoS by modified the MAC Layer in 802.11 standard. This research used 3 different scenarios for RAW parameters: Modifying the number of RAW Group, Modifying the number of RAW Slot, and Comparing 2 Datamode. The EDCA Parameters that used in this research were: Contention Window and Arbitrary inter-frame Spacing Number. The values that expected to be the output in this research are: Delay, Throughput, Packet Delivery Ratio, Availability, and Reliability. After the research has been simulated, the results are: First, the lowest of average delay was Ngroup = 1, the highest of PDR was Ngroup = Nsta/2, and the highest of Throughput was Ngroup = Nsta/2. Second, the lowest of average delay was RAW Slot = 6, the highest of PDR were RAW Slot = 3 and 4, and the highest of Throughput was RAW Slot = 4. Third, the lowest of average delay was Datamode 3,9 Mbps BW 2 MHz, the highest of PDR was Dat mode 3,9 Mbps BW 2 MHz, and the highest of Throughput was Datamode 3,9 Mbps BW 2 MHz. Reliability, Availability, and Energy Consumption also can be affected by modifying RAW parameters, in 802.11ah Energy Consumption can be reduced by increasing the number of RAW Stations and RAW Groups.

RETRACTED ARTICLE: Reliable Packet Delivery in Wireless Body Area Networks Using TCDMA Algorithm for e-Health Monitoring system

Recent advancements in wireless technologies enabled healthcare sector to deliver a wide range of efficient e-Health services through Wireless Body Area Network (WBAN). A WBAN monitors the physiological signals and send corresponding data through wireless transmission. Reliable transmission of data assumes more importance in the case of WBAN. A decision-making algorithm is mandatory for selecting critical data for reliable packet delivery to reduce the chance of casualty. This paper proposes a new algorithm called Time Criticality based Decision Making Algorithm for reliable and preferential transmission of critical data. To achieve this decision making, a lower and upper threshold limit is set for each body parameter. Any data outside the interval specified by these thresholds are considered abnormal and transmitted by the coordinator. Proposed work shows a better performance in terms of Packet Delivery Ratio, throughput and normal energy utilization than Priority based Allocation of Time Slots and other time division based techniques. These Healthcare services enable to monitor patients not only in hospitals and medical center but also from remote locations without affecting the patient's usual activities.