Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (27)

Search Parameters:
Keywords = packet duplication

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
17 pages, 834 KiB  
Article
SSPRD: A Shared-Storage-Based Hardware Packet Reordering and Deduplication System for Multipath Transmission in Wide Area Networks
by Jiandong Ma, Zhichuan Guo and Mangu Song
Micromachines 2024, 15(11), 1323; https://doi.org/10.3390/mi15111323 - 30 Oct 2024
Viewed by 416
Abstract
To increase bandwidth and overcome packet loss in Wide Area Networks (WANs), per-packet multipath transmission and redundant transmission are increasingly being used as Software-Defined Wide Area Network (SD-WAN) solutions. However, this results in out-of-order and duplicate packets in the destination network. To restore [...] Read more.
To increase bandwidth and overcome packet loss in Wide Area Networks (WANs), per-packet multipath transmission and redundant transmission are increasingly being used as Software-Defined Wide Area Network (SD-WAN) solutions. However, this results in out-of-order and duplicate packets in the destination network. To restore sequential and unique data streams for multiple connections, hardware packet buffers with significant depth are required due to the large delay difference between WAN paths. To address this issue, SSPRD, a shared-storage-based packet reordering and deduplication system using a Field-Programmable Gate Array (FPGA), is proposed. The storage space for packets and sub-buffers is shared by all sessions with dynamic allocation. Packets are stored in the DDR and are sorted by their descriptors in the buffers. We also develop a sub-buffer-based timeout event handling algorithm. While supporting four sessions, SSPRD achieves a deep reorder buffer on hardware, with a depth of up to 15,360 packets per session. Compared with other solutions, SSPRD reduces buffer space usage by 62.5%, and reaches a packet reordering and deduplicating performance of 10 Gbps for 1500-byte packets. Full article
(This article belongs to the Topic Advanced Integrated Circuit Design and Application)
Show Figures

Figure 1

Figure 1
<p>System overview of SSPRD.</p>
Full article ">Figure 2
<p>Design of shared packet storage. (<b>a</b>) Partition of Packet Storage Space. (<b>b</b>) Allocation and freeing of packet IDs in Available Packet ID Pool. (<b>c</b>) Content of a packet descriptor.</p>
Full article ">Figure 3
<p>Available part of reorder buffer per session.</p>
Full article ">Figure 4
<p>Hierarchical storage of session buffer. Sub-buffer ID serves as the address of the sub-buffer.</p>
Full article ">Figure 5
<p>Comparison of the space usage based on shared storage strategy and pre-allocated storage strategy. (<b>a</b>) Size of packet descriptor buffer storage. (<b>b</b>) Size of packet storage.</p>
Full article ">Figure 6
<p>Test environment. (<b>a</b>) Test setup diagram. (<b>b</b>) Test hardware environment. Spirent C50 ports are on left side of picture, and FPGA ports are on right side.</p>
Full article ">Figure 7
<p>Performance test. (<b>a</b>) Deduplicating throughput. (<b>b</b>) Reordering throughput.</p>
Full article ">Figure 8
<p>A simulation of handling a timeout event in the sub-buffer. (<b>a</b>) Simulation waveform. (<b>b</b>) Processing diagram.</p>
Full article ">
29 pages, 4830 KiB  
Article
Enabling Seamless Connectivity: Networking Innovations in Wireless Sensor Networks for Industrial Application
by Shathya Duobiene, Rimantas Simniškis and Gediminas Račiukaitis
Sensors 2024, 24(15), 4881; https://doi.org/10.3390/s24154881 - 27 Jul 2024
Viewed by 943
Abstract
The wide-ranging applications of the Internet of Things (IoT) show that it has the potential to revolutionise industry, improve daily life, and overcome global challenges. This study aims to evaluate the performance scalability of mature industrial wireless sensor networks (IWSNs). A new classification [...] Read more.
The wide-ranging applications of the Internet of Things (IoT) show that it has the potential to revolutionise industry, improve daily life, and overcome global challenges. This study aims to evaluate the performance scalability of mature industrial wireless sensor networks (IWSNs). A new classification approach for IoT in the industrial sector is proposed based on multiple factors and we introduce the integration of 6LoWPAN (IPv6 over low-power wireless personal area networks), message queuing telemetry transport for sensor networks (MQTT-SN), and ContikiMAC protocols for sensor nodes in an industrial IoT system to improve energy-efficient connectivity. The Contiki COOJA WSN simulator was applied to model and simulate the performance of the protocols in two static and moving scenarios and evaluate the proposed novelty detection system (NDS) for network intrusions in order to identify certain events in real time for realistic dataset analysis. The simulation results show that our method is an essential measure in determining the number of transmissions required to achieve a certain reliability target in an IWSNs. Despite the growing demand for low-power operation, deterministic communication, and end-to-end reliability, our methodology of an innovative sensor design using selective surface activation induced by laser (SSAIL) technology was developed and deployed in the FTMC premises to demonstrate its long-term functionality and reliability. The proposed framework was experimentally validated and tested through simulations to demonstrate the applicability and suitability of the proposed approach. The energy efficiency in the optimised WSN was increased by 50%, battery life was extended by 350%, duplicated packets were reduced by 80%, data collisions were reduced by 80%, and it was shown that the proposed methodology and tools could be used effectively in the development of telemetry node networks in new industrial projects in order to detect events and breaches in IoT networks accurately. The energy consumption of the developed sensor nodes was measured. Overall, this study performed a comprehensive assessment of the challenges of industrial processes, such as the reliability and stability of telemetry channels, the energy efficiency of autonomous nodes, and the minimisation of duplicate information transmission in IWSNs. Full article
(This article belongs to the Special Issue IoT Sensors Development and Application for Environment & Safety)
Show Figures

Figure 1

Figure 1
<p>LoWPAN system architecture.</p>
Full article ">Figure 2
<p>MQTT-SN system architecture.</p>
Full article ">Figure 3
<p>Proposed IIoT architecture based on PSO-DC algorithm.</p>
Full article ">Figure 4
<p>Flowchart of the proposed PSO-DC algorithm.</p>
Full article ">Figure 5
<p>Simulation models of network topologies: star, mesh, and tree.</p>
Full article ">Figure 6
<p>Schematic diagram for initial planning and visualisation.</p>
Full article ">Figure 7
<p>Topology of the WSN (<b>a</b>) deployed in the FTMC laboratory (<b>b</b>).</p>
Full article ">Figure 8
<p>Data delivery latency for fixed and movable nodes on four square areas of 25 × 25 m<sup>2</sup>, 50 × 50 m<sup>2</sup>, 75 × 75 m<sup>2</sup>, and 100 × 100 m<sup>2</sup>.</p>
Full article ">Figure 9
<p>Average hops count in the networks after WSN optimisation with different strategies: optimal mesh, IMR, and RL network in the areas of 25 × 25 m<sup>2</sup>, 50 × 50 m<sup>2</sup>, 75 × 75 m<sup>2</sup>, and 100 × 100 m<sup>2</sup>.</p>
Full article ">Figure 10
<p>Number of received packets per node versus nodes.</p>
Full article ">Figure 11
<p>Average radio duty cycle.</p>
Full article ">Figure 12
<p>Average power consumption of the nodes in different operation modes and components: LPM, the consumption of the CPU, radio listen, and transmission modes.</p>
Full article ">Figure 13
<p>Temperature readings collected by the WSN in the FTMC laboratory.</p>
Full article ">Figure 14
<p>Humidity readings collected by the WSN in the FTMC laboratory.</p>
Full article ">
16 pages, 1432 KiB  
Article
A Fundamental Study of Reliable Vehicle-to-Cloud Communication Using Multiple Paths with Redundancy Mitigation
by Rui Teng and Kenya Sato
Appl. Sci. 2024, 14(7), 2841; https://doi.org/10.3390/app14072841 - 28 Mar 2024
Viewed by 817
Abstract
The reliability of V2X (vehicle-to-everything) communication is important for safe automated driving. With the advances in wireless communication and multipath transport protocols, a vehicle can employ multiple wireless interfaces and carry out multipath communication. Although there has been extensive research into increasing the [...] Read more.
The reliability of V2X (vehicle-to-everything) communication is important for safe automated driving. With the advances in wireless communication and multipath transport protocols, a vehicle can employ multiple wireless interfaces and carry out multipath communication. Although there has been extensive research into increasing the Quality of Service (QoS) performance, such as throughput and delay in V2X communication, few studies have addressed explicit ways of improving the reliability of vehicle-to-cloud (V2C) communication through multipath-based redundancy. This paper addresses the issue of improving V2C reliably via multipath-based packet duplication, with particular consideration given to redundancy mitigation. We propose a method that employs dynamic adjustment of multipath redundancy to maintain packet-delivery reliability in V2C communication while enabling redundancy mitigation. The evaluation results show that the proposed method allows the vehicle to maintain the desired reliability in terms of successful packet transmission while reducing redundancy caused by packet duplication in a multipath connection. Full article
Show Figures

Figure 1

Figure 1
<p>System model.</p>
Full article ">Figure 2
<p>Dynamic adjustment of path redundancy.</p>
Full article ">Figure 3
<p>Algorithm implemented at the cloud server.</p>
Full article ">Figure 4
<p>Algorithm implemented at the vehicle side.</p>
Full article ">Figure 5
<p>Reliability performance.</p>
Full article ">Figure 6
<p>Summary of performance results.</p>
Full article ">Figure A1
<p>Reliability values for different offsets.</p>
Full article ">Figure A2
<p>Number of paths for different offsets.</p>
Full article ">Figure A3
<p>Redundancy values for different offsets.</p>
Full article ">
21 pages, 3761 KiB  
Article
Energy-Efficient De-Duplication Mechanism for Healthcare Data Aggregation in IoT
by Muhammad Nafees Ulfat Khan, Weiping Cao, Zhiling Tang, Ata Ullah and Wanghua Pan
Future Internet 2024, 16(2), 66; https://doi.org/10.3390/fi16020066 - 19 Feb 2024
Cited by 1 | Viewed by 1711
Abstract
The rapid development of the Internet of Things (IoT) has opened the way for transformative advances in numerous fields, including healthcare. IoT-based healthcare systems provide unprecedented opportunities to gather patients’ real-time data and make appropriate decisions at the right time. Yet, the deployed [...] Read more.
The rapid development of the Internet of Things (IoT) has opened the way for transformative advances in numerous fields, including healthcare. IoT-based healthcare systems provide unprecedented opportunities to gather patients’ real-time data and make appropriate decisions at the right time. Yet, the deployed sensors generate normal readings most of the time, which are transmitted to Cluster Heads (CHs). Handling these voluminous duplicated data is quite challenging. The existing techniques have high energy consumption, storage costs, and communication costs. To overcome these problems, in this paper, an innovative Energy-Efficient Fuzzy Data Aggregation System (EE-FDAS) has been presented. In it, at the first level, it is checked that sensors either generate normal or critical readings. In the first case, readings are converted to Boolean digit 0. This reduced data size takes only 1 digit which considerably reduces energy consumption. In the second scenario, sensors generating irregular readings are transmitted in their original 16 or 32-bit form. Then, data are aggregated and transmitted to respective CHs. Afterwards, these data are further transmitted to Fog servers, from where doctors have access. Lastly, for later usage, data are stored in the cloud server. For checking the proficiency of the proposed EE-FDAS scheme, extensive simulations are performed using NS-2.35. The results showed that EE-FDAS has performed well in terms of aggregation factor, energy consumption, packet drop rate, communication, and storage cost. Full article
Show Figures

Figure 1

Figure 1
<p>System Model.</p>
Full article ">Figure 2
<p>Phases of EE-FDAS.</p>
Full article ">Figure 3
<p>The impact of the Number of Attributes on Average Aggregation is explained in (<b>a</b>) while Energy Consumption during the data phase is shown in (<b>b</b>).</p>
Full article ">Figure 4
<p>The impact of the Number of Attributes on Average SL is shown in (<b>a</b>) whereas Needed Transmission Slots are displayed in (<b>b</b>).</p>
Full article ">Figure 5
<p>The impact of the Number of Attributes on Control overhead is shown in (<b>a</b>) whereas Communication Cost is exhibited in (<b>b</b>).</p>
Full article ">Figure 6
<p>In (<b>a</b>), the graph displays Packet Delivery Ratio, representing successfully delivered packets per unit time, while (<b>b</b>) illustrates the Packet Loss Ratio.</p>
Full article ">Figure 7
<p>The Storage Cost by Number of packets per unit time.</p>
Full article ">
20 pages, 5082 KiB  
Article
Lightweight Differentiated Transmission Based on Fuzzy and Random Modeling in Underwater Acoustic Sensor Networks
by Jiabao Cao, Jinfeng Dou, Jilong Liu, Hongzhi Li and Hao Chen
Sensors 2023, 23(15), 6733; https://doi.org/10.3390/s23156733 - 27 Jul 2023
Viewed by 893
Abstract
Energy-efficient and reliable underwater acoustic communication attracts a lot of research due to special marine communication conditions with limited resources in underwater acoustic sensor networks (UASNs). In their final analysis, the existing studies focus on controlling redundant communication and route void that greatly [...] Read more.
Energy-efficient and reliable underwater acoustic communication attracts a lot of research due to special marine communication conditions with limited resources in underwater acoustic sensor networks (UASNs). In their final analysis, the existing studies focus on controlling redundant communication and route void that greatly influence UASNs’ comprehensive performances. Most of them consider directional or omnidirectional transmission for partial optimization aspects, which still have many extra data loads and performance losses. This paper analyzes the main issue sources causing redundant communication in UASNs, and proposes a lightweight differentiated transmission to suppress extra communication to the greatest extent as well as balance energy consumption. First, the layered model employs layer ID to limit the scale of the data packet header, which does not need depth or location information. Second, the layered model, fuzzy-based model, random modeling and directional-omnidirectional differentiated transmission mode comb out the forwarders step by step to decrease needless duplicated forwarding. Third, forwarders are decided by local computation in nodes, which avoids exchanging controlling information among nodes. Simulation results show that our method can efficiently reduce the network load and improve the performance in terms of energy consumption balance, network lifetime, data conflict and network congestion, and data packet delivery ratio. Full article
(This article belongs to the Section Sensor Networks)
Show Figures

Figure 1

Figure 1
<p>UASN remote sensing and ineffective network running example.</p>
Full article ">Figure 2
<p>UASN Layered model. Sensor nodes with different depths are divided into Layer 1, Layer 2, …, Layer <span class="html-italic">n</span> from the bottom to the top, which sense and send the data toward the sink by directional transmission or broadcast. The upper valid nodes forward the data.</p>
Full article ">Figure 3
<p>Packet format.</p>
Full article ">Figure 4
<p>Control information transmitted for each protocol.</p>
Full article ">Figure 5
<p>Sample of control package.</p>
Full article ">Figure 6
<p>Example of effective relay nodes and directional-omnidirectional transmission.</p>
Full article ">Figure 7
<p>Network load with various numbers of nodes in the network.</p>
Full article ">Figure 8
<p>Network lifetime when (<b>a</b>) the first sensor node, (<b>b</b>) 30% nodes, and (<b>c</b>) 50% nodes exhaust their energy.</p>
Full article ">Figure 9
<p>Number of dead nodes in different rounds.</p>
Full article ">Figure 10
<p>(<b>a</b>) Total number of times each node forwarding packet running until the 100th round. (<b>b</b>) Total number of times each node forwarding packet running until the 300th round. (<b>c</b>) Total number of times each node forwarding packet running until the 500th round.</p>
Full article ">Figure 10 Cont.
<p>(<b>a</b>) Total number of times each node forwarding packet running until the 100th round. (<b>b</b>) Total number of times each node forwarding packet running until the 300th round. (<b>c</b>) Total number of times each node forwarding packet running until the 500th round.</p>
Full article ">Figure 11
<p>Packet delivery ratio varies with various number of nodes in the network: (<b>a</b>) when 30% nodes are dead; and (<b>b</b>) when 50% nodes are dead.</p>
Full article ">Figure 12
<p>Residual energy distribution of nodes with different numbers of death nodes.</p>
Full article ">
19 pages, 4803 KiB  
Article
Efficient Dissemination of Safety Messages in Vehicle Ad Hoc Network Environments
by Jongtae Lim, Dowoong Pyun, Dojin Choi, Kyoungsoo Bok and Jaesoo Yoo
Appl. Sci. 2023, 13(11), 6391; https://doi.org/10.3390/app13116391 - 23 May 2023
Cited by 3 | Viewed by 1184
Abstract
The number of people owning vehicles has been steadily growing, resulting in increased numbers of vehicles on the roads, making roads more congested, and increasing the risk of accidents. In addition, heavy rain, snow, and fog have increased due to abnormal weather caused [...] Read more.
The number of people owning vehicles has been steadily growing, resulting in increased numbers of vehicles on the roads, making roads more congested, and increasing the risk of accidents. In addition, heavy rain, snow, and fog have increased due to abnormal weather caused by global warming. These bad weather conditions can also affect the safety of vehicles and drivers. The need to disseminate safety messages on the social Internet of Vehicles due to these problems has been steadily increasing. In this paper, we propose an efficient safety message dissemination scheme that focuses on urban environments with high vehicle density and mobility to address these problems. The proposed scheme reduces packet loss by considering frequent cluster departures and subscriptions through an efficient cluster management technique. In a vehicle-to-vehicle environment, the dissemination of safety messages is divided into intracluster and intercluster emergencies, as well as a general safety message dissemination technique. In a vehicle-to-infrastructure environment, the proposed scheme reduces the number of processing requests and duplicate messages made to roadside units (RSUs) through a request operation process for each vehicle and an RSU scheduling technique. We conducted several performance evaluations of message packet loss and the number of RSU processing requests to demonstrate the superiority of the proposed scheme. Full article
(This article belongs to the Special Issue Big Data Applications in Transportation)
Show Figures

Figure 1

Figure 1
<p>Proposed safe message dissemination environment.</p>
Full article ">Figure 2
<p>Cluster management scheme process.</p>
Full article ">Figure 3
<p>Cluster head candidate selection process.</p>
Full article ">Figure 4
<p>V2V communication.</p>
Full article ">Figure 5
<p>V2I communication.</p>
Full article ">Figure 6
<p>Packet loss rate as a function of CH departure cycle.</p>
Full article ">Figure 7
<p>Packet loss rate as a function of number of CM vehicles.</p>
Full article ">Figure 8
<p>Number of RSU requests as a function of probability of message existing in cluster.</p>
Full article ">Figure 9
<p>Duplicate messages removed as a function of probability of message existing in cluster.</p>
Full article ">Figure 10
<p>Number of RSU requests as a function of density of vehicles.</p>
Full article ">Figure 11
<p>Duplicate messages removed as a function of density of vehicles.</p>
Full article ">
14 pages, 6912 KiB  
Article
Performance Analysis of Overcurrent Protection under Corrupted Sampled Value Frames: A Hardware-in-the-Loop Approach
by Ângelo Felipe Sartori, Adriano Peres de Morais, Ulisses Chemin Netto, Diomar Adonis Copetti Lima, Daniel Pinheiro Bernardon and Wagner Seizo Hokama
Energies 2023, 16(8), 3386; https://doi.org/10.3390/en16083386 - 12 Apr 2023
Viewed by 1381
Abstract
The IEC 61850 standard aims at digitization substations and provides interoperability between various Intelligent Electronic Device vendors. The digitization process is accompanied by several challenges related to data transmission on the ethernet network and the protection behavior under these conditions. Among the challenges, [...] Read more.
The IEC 61850 standard aims at digitization substations and provides interoperability between various Intelligent Electronic Device vendors. The digitization process is accompanied by several challenges related to data transmission on the ethernet network and the protection behavior under these conditions. Among the challenges, we can mention packet loss, delay, and duplicate frame, which occurs when the merging units (publisher) transmit the sampled values and, for some reason, these packets do not reach the subscriber or are duplicated. Nowadays, most Intelligent Electronic Device manufacturers block the protection function when some sampled value packets are corrupted. The effects of blocking protection when packet loss occurs under normal operating conditions do not cause significant problems. However, when a fault occurs, the corrupted packets can cause a delay in fault clearance, causing even more damage to the grid. The purpose of this article is to present the effects of corrupted sampled values on the performance of overcurrent protection. All the evaluations were performed in real time using the hardware-in-loop simulation approach with a commercial Intelligent Electronic Device. The OP5700 hardware platform from OPAL-RT, with the library “IEC 61850 Data Integrity Manipulation”, was used. The results show that corrupted sampled value frames affect the functioning of the protections. Full article
Show Figures

Figure 1

Figure 1
<p>SV packet captured in Wireshark software.</p>
Full article ">Figure 2
<p>Current signal with 25 packets lost.</p>
Full article ">Figure 3
<p>Current signal with packet duplicate. (<b>a</b>) Duplicate packet. (<b>b</b>) Duplicate packet in sequence.</p>
Full article ">Figure 4
<p>Current signal with packet delay.</p>
Full article ">Figure 5
<p>smpCnt value (<b>a</b>) without manipulation; (<b>b</b>) with reduction in the value of smpCnt; (<b>c</b>) with increase in the value of smpCnt.</p>
Full article ">Figure 6
<p>Current signal with A/D error.</p>
Full article ">Figure 7
<p>Substation test system.</p>
Full article ">Figure 8
<p>Simulation test system.</p>
Full article ">Figure 9
<p>Three-phase fault current—phase A—without SV manipulation condition.</p>
Full article ">Figure 10
<p>Instantly initiate faults and perform detailed package manipulations.</p>
Full article ">Figure 11
<p>Three-phase fault current—phase A—without SV manipulation condition.</p>
Full article ">Figure 12
<p>Tripping time (IED processing + GOOSE) for ANSI 50.</p>
Full article ">Figure 13
<p>Tripping time results ANSI 50—packets loss.</p>
Full article ">Figure 14
<p>Tripping time results ANSI 50—duplicated packets.</p>
Full article ">Figure 15
<p>Tripping time results ANSI 50—delayed packets.</p>
Full article ">Figure 16
<p>Tripping time results ANSI 50—smpCnt manipulation of SV packets.</p>
Full article ">Figure 17
<p>Tripping time (IED processing + GOOSE) for ANSI 51.</p>
Full article ">Figure 18
<p>Tripping time results ANSI 51—loss of SV packets.</p>
Full article ">Figure 19
<p>Tripping time results ANSI 51—duplicate of SV packets.</p>
Full article ">Figure 20
<p>Tripping time results ANSI 51—delay of SV packets.</p>
Full article ">Figure 21
<p>Tripping time results ANSI 51—smpCnt manipulation of SV packets.</p>
Full article ">
23 pages, 1601 KiB  
Article
Multi-Connectivity-Based Adaptive Fractional Packet Duplication in Cellular Networks
by Rahul Arun Paropkari and Cory Beard
Signals 2023, 4(1), 251-273; https://doi.org/10.3390/signals4010014 - 22 Mar 2023
Cited by 4 | Viewed by 1855
Abstract
Mobile networks of the fifth generation have stringent requirements for data throughput, latency and reliability. Dual or multi-connectivity is implemented to meet the mobility requirements for certain essential 5G use cases, and this ensures the user’s connection to one or more radio links. [...] Read more.
Mobile networks of the fifth generation have stringent requirements for data throughput, latency and reliability. Dual or multi-connectivity is implemented to meet the mobility requirements for certain essential 5G use cases, and this ensures the user’s connection to one or more radio links. Packet duplication (PD) over multi-connectivity is a method of compensating for lost packets by reducing re-transmissions on the same erroneous wireless channel. Utilizing two or more uncorrelated links, a high degree of availability can be attained with this strategy. However, complete packet duplication is inefficient and frequently unnecessary. The wireless channel conditions can change frequently and not allow for a PD. We provide a novel adaptive fractional packet duplication (A-FPD) mechanism for enabling and disabling packet duplication based on a variety of parameters. The signal-to-interference-plus-noise ratio (SINR) and fade duration outage probability (FDOP) are important performance indicators for wireless networks and are used to evaluate and contrast several packet duplication scenarios. Using ns-3 and MATLAB, we present our simulation results for the multi-connectivity and proposed A-FPD schemes. Our technique merely duplicates enough packets across multiple connections to meet the outage criteria. Full article
Show Figures

Figure 1

Figure 1
<p>(<bold>a</bold>) Intra-Band Contiguous. (<bold>b</bold>) Intra-Band Non-Contiguous. (<bold>c</bold>) Inter-Band CA.</p>
Full article ">Figure 2
<p>Carrier aggregation and dual connectivity.</p>
Full article ">Figure 3
<p>Adaptive packet duplication.</p>
Full article ">Figure 4
<p>ns-3 simulation setupwith one UE, two base stations and one building.</p>
Full article ">Figure 5
<p>Instantaneous SINR of base station 1.</p>
Full article ">Figure 6
<p>Instantaneous SINR of base station 2.</p>
Full article ">Figure 7
<p>Instantaneous and the best SINR of the two base stations.</p>
Full article ">Figure 8
<p>Packet Duplication with an average (500 sample size) SINR difference of &lt;=10 dB.</p>
Full article ">Figure 9
<p>Packet Duplication with an average (500 sample size) SINR difference of &lt;=20 dB.</p>
Full article ">Figure 10
<p>Packet Duplication with an average (50 sample size) SINR difference of &lt;=10 dB.</p>
Full article ">Figure 11
<p>Packet Duplication with an average (50 sample size) SINR difference of &lt;=20 dB.</p>
Full article ">Figure 12
<p>Difference in the average SINR-based (500 sample size) Packet Duplication.</p>
Full article ">Figure 13
<p>Difference in the average SINR-based (50 sample size) Packet Duplication.</p>
Full article ">Figure 14
<p>Actual number of times that Packet Duplication is triggered.</p>
Full article ">Figure 15
<p>Packet Duplication with an average (500 sample size) fade threshold of 15 dB.</p>
Full article ">Figure 16
<p>Packet Duplication with an average (500 sample size) fade threshold of 30 dB.</p>
Full article ">Figure 17
<p>Packet Duplication with an average (50 sample size) fade threshold of 15 dB.</p>
Full article ">Figure 18
<p>Packet Duplication with an average (50 sample size) fade threshold of 30 dB.</p>
Full article ">Figure 19
<p>Fade-threshold-based (500 sample size) Packet Duplication.</p>
Full article ">Figure 20
<p>Fade-threshold-based (50 sample size) Packet Duplication.</p>
Full article ">Figure 21
<p>Actual number of times that Packet Duplication is triggered.</p>
Full article ">Figure 22
<p>Packet Duplication based on exponential random variable.</p>
Full article ">Figure 23
<p>Corrupt Packet Duplication based on an exponential random variable.</p>
Full article ">Figure 24
<p>Actual number of times that Packet Duplication is triggered.</p>
Full article ">
23 pages, 416 KiB  
Article
Broadcast Approach to Uplink NOMA: Queuing Delay Analysis
by Maha Zohdy, Ali Tajer and Shlomo Shamai (Shitz)
Entropy 2022, 24(12), 1757; https://doi.org/10.3390/e24121757 - 30 Nov 2022
Cited by 1 | Viewed by 1851
Abstract
Emerging wireless technologies are envisioned to support a variety of applications that require simultaneously maintaining low latency and high reliability. Non-orthogonal multiple access techniques constitute one candidate for grant-free transmission alleviating the signaling requirements for uplink transmissions. In open-loop transmissions over fading channels, [...] Read more.
Emerging wireless technologies are envisioned to support a variety of applications that require simultaneously maintaining low latency and high reliability. Non-orthogonal multiple access techniques constitute one candidate for grant-free transmission alleviating the signaling requirements for uplink transmissions. In open-loop transmissions over fading channels, in which the transmitters do not have access to the channel state information, the existing approaches are prone to facing frequent outage events. Such outage events lead to repeated re-transmissions of the duplicate information packets, penalizing the latency. This paper proposes a multi-access broadcast approach in which each user splits its information stream into several information layers, each adapted to one possible channel state. This approach facilitates preventing outage events and improves the overall transmission latency. Based on the proposed approach, the average queuing delay of each user is analyzed for different arrival processes at each transmitter. First, for deterministic arrivals, closed-form lower and upper bounds on the average delay are characterized analytically. Secondly, for Poisson arrivals, a closed-form expression for the average delay is delineated using the Pollaczek-Khinchin formula. Based on the established bounds, the proposed approach achieves less average delay than single-layer outage approaches. Under optimal power allocation among the encoded layers, numerical evaluations demonstrate that the proposed approach significantly minimizes average sum delays compared to traditional outage approaches, especially under high arrival rates. Full article
(This article belongs to the Special Issue Information Theoretic Methods for Future Communication Systems)
Show Figures

Figure 1

Figure 1
<p>Deterministic: Symmetric.</p>
Full article ">Figure 2
<p>Deterministic: Asymmetric.</p>
Full article ">Figure 3
<p>Poisson: Symmetric.</p>
Full article ">Figure 4
<p>Poisson: Asymmetric.</p>
Full article ">
17 pages, 690 KiB  
Article
Cluster-Based Routing Protocol with Static Hub (CRPSH) for WSN-Assisted IoT Networks
by Rakesh Kumar Lenka, Manjur Kolhar, Hitesh Mohapatra, Fadi Al-Turjman and Chadi Altrjman
Sustainability 2022, 14(12), 7304; https://doi.org/10.3390/su14127304 - 15 Jun 2022
Cited by 34 | Viewed by 2735
Abstract
The Internet of Things (IoT) is an evolving concept that has achieved prominence in the modern era. An autonomous sensor-equipped device is the major component of WSN-assisted IoT infrastructure. These devices intelligently sense the environment, automatically collect the data, and deliver the information [...] Read more.
The Internet of Things (IoT) is an evolving concept that has achieved prominence in the modern era. An autonomous sensor-equipped device is the major component of WSN-assisted IoT infrastructure. These devices intelligently sense the environment, automatically collect the data, and deliver the information to paired devices. However, in WSN-assisted IoT networks, energy depletion and hardware faults might result in device failures. Additionally, this might affect data transmission. A reliable route significantly reduces data retransmissions, which can help in congestion reduction and energy conservation. Generally, the sensor devices are typically deployed densely throughout the WSN-assisted IoT networks. A high number of sensor devices covering a monitoring area might result in duplicate data. The clustering method can be used to overcome this problem. The clustering technique reduces network traffic, whereas the multipath technique ensures path reliability. In CRPSH, we used the clustering technique to reduce the duplicate data. Moreover, the multipath approach can increase the reliability of the proposed protocol. CRPSH is intended to minimize the overhead associated with control packets and extend the network’s lifetime. The complete set of simulations is carried out using the Castalia simulator. The proposed protocol is found to reduce energy consumption and increase the lifetime of IoT infrastructure networks. Full article
Show Figures

Figure 1

Figure 1
<p>Average Energy Consumption.</p>
Full article ">Figure 2
<p>Average End-to-End Delay.</p>
Full article ">Figure 3
<p>Packet Delivery Ratio.</p>
Full article ">Figure 4
<p>Network Lifetime.</p>
Full article ">
11 pages, 908 KiB  
Article
An Efficient Opportunistic Routing Based on Prediction for Nautical Wireless Ad Hoc Networks
by Lige Ge and Shengming Jiang
J. Mar. Sci. Eng. 2022, 10(6), 789; https://doi.org/10.3390/jmse10060789 - 8 Jun 2022
Cited by 8 | Viewed by 1743
Abstract
Nautical wireless ad hoc networks are becoming increasingly popular in oceans due to their easy deployment and self-curing capability. They may alternate frequently between connected mobile ad hoc networks and partitioned opportunistic networks due to mobility in large spaces. Traditional mobile ad hoc [...] Read more.
Nautical wireless ad hoc networks are becoming increasingly popular in oceans due to their easy deployment and self-curing capability. They may alternate frequently between connected mobile ad hoc networks and partitioned opportunistic networks due to mobility in large spaces. Traditional mobile ad hoc network routing is used to find the shortest route for connected networks. However, for opportunistic networks, routing schemes with a broadcast nature mainly exploit the reduction in message duplication and the local relaying technologies described in the literature, which may lead to unnecessary resource waste and low packet delivery ratios. To solve the problem, we propose an efficient opportunistic routing scheme based on prediction for nautical wireless ad hoc networks. The scheme first develops an effective candidate intermediate region to recognize the unavailability of some apparently qualified intermediate nodes, and then takes into account the packet reception ratio between nodes and relay advancement prediction, to improve packet delivery. The proposed scheme achieves performance improvements regarding packet loss ratio and throughput with a tolerable latency increase, compared to other schemes. Full article
(This article belongs to the Section Ocean Engineering)
Show Figures

Figure 1

Figure 1
<p>An example of packet routing with node mobility.</p>
Full article ">Figure 2
<p>The network model for opportunistic routing.</p>
Full article ">Figure 3
<p>(<b>a</b>) Packet loss ratio vs. 10 coefficient combinations. (<b>b</b>) Throughput vs. 10 coefficient combinations.</p>
Full article ">Figure 4
<p>Comparison of different schemes. (<b>a</b>) Packet loss ratio vs. node density. (<b>b</b>) Throughput vs. node density. (<b>c</b>) Average latency vs. node density.</p>
Full article ">
24 pages, 3635 KiB  
Article
An ICN-Based IPFS High-Availability Architecture
by Ruibin Zeng, Jiali You, Yang Li and Rui Han
Future Internet 2022, 14(5), 122; https://doi.org/10.3390/fi14050122 - 19 Apr 2022
Cited by 6 | Viewed by 4940
Abstract
The Interplanetary File System (IPFS), a new type of P2P file system, enables people to obtain data from other peer nodes in a distributed system without the need to establish a connection with a distant server. However, IPFS suffers from low resolution efficiency [...] Read more.
The Interplanetary File System (IPFS), a new type of P2P file system, enables people to obtain data from other peer nodes in a distributed system without the need to establish a connection with a distant server. However, IPFS suffers from low resolution efficiency and duplicate data delivery, resulting in poor system availability. The new Information-Centric Networking (ICN), on the other hand, applies the features of name resolution service and caching to achieve fast location and delivery of content. Therefore, there is a potential to optimize the availability of IPFS systems from the network layer. In this paper, we propose an ICN-based IPFS high-availability architecture, called IBIHA, which introduces enhanced nodes and information tables to manage data delivery based on the original IPFS network, and uses the algorithm of selecting high-impact nodes from the entitled network (PwRank) as the basis for deploying enhanced nodes in the network, thus achieving the effect of optimizing IPFS availability. The experimental results show that this architecture outperforms the IPFS network in terms of improving node resolution efficiency, reducing network redundant packets, and improving the rational utilization of network link resources. Full article
(This article belongs to the Special Issue 5G Wireless Communication Networks)
Show Figures

Figure 1

Figure 1
<p>Determined Latency Name Resolution (DLNR) Architecture.</p>
Full article ">Figure 2
<p>ICN-Based IPFS High Availability (IBIHA) Architecture.</p>
Full article ">Figure 3
<p>Resolution method in IBIHA.</p>
Full article ">Figure 4
<p>Scenarios for information management tables.</p>
Full article ">Figure 5
<p>Comparison of the resolution probability of IPFS nodes and enhanced nodes in different scenarios. (<b>a</b>) The effect of the number of replicas on the probability of resolution; (<b>b</b>) The effect of the number of enhanced node deployments on the probability of resolution.</p>
Full article ">Figure 6
<p>The impact of network scale on the overall resolution performance of the enhanced nodes.</p>
Full article ">Figure 7
<p>Enhanced nodes for different roles.</p>
Full article ">Figure 8
<p>Performance comparison. (<b>a</b>) Average resolution delay of the network at different network sizes; (<b>b</b>) proportion of duplicate packets in the network at different network sizes; (<b>c</b>) average resolution delay at different wave numbers; (<b>d</b>) Comparison of simulated data with model predicted values.</p>
Full article ">Figure 8 Cont.
<p>Performance comparison. (<b>a</b>) Average resolution delay of the network at different network sizes; (<b>b</b>) proportion of duplicate packets in the network at different network sizes; (<b>c</b>) average resolution delay at different wave numbers; (<b>d</b>) Comparison of simulated data with model predicted values.</p>
Full article ">Figure 9
<p>This is an example of a network topology diagram that contains 24 nodes with node numbers 1–24.</p>
Full article ">Figure 10
<p>Comparison of algorithm performance in example networks. (<b>a</b>) comparison of the ratio of the number of duplicate packets; (<b>b</b>) comparison of the resolution probability; (<b>c</b>) comparison of the resolution delay.</p>
Full article ">Figure 11
<p>Real network topology.</p>
Full article ">Figure 12
<p>Performance comparison under real network topology data. (<b>a</b>) comparison of the ratio of the number of duplicate packets; (<b>b</b>) comparison of the resolution probability; (<b>c</b>) comparison of the resolution delay.</p>
Full article ">
22 pages, 841 KiB  
Article
Cluster-Based Transmission Diversity Optimization in Ultra Reliable Low Latency Communication
by Md. Amirul Hasan Shanto, Binodon, Amit Karmaker, Md. Mahfuz Reza and Md. Abir Hossain
Network 2022, 2(1), 168-189; https://doi.org/10.3390/network2010012 - 17 Mar 2022
Cited by 1 | Viewed by 2793
Abstract
Intra-vehicular communication is an emerging technology explored spontaneously due to higher wireless sensor-based application demands. To meet the upcoming market demands, the current intra-vehicular communication transmission reliability and latency should be improved significantly to fit with the existing 5G and upcoming 6G communication [...] Read more.
Intra-vehicular communication is an emerging technology explored spontaneously due to higher wireless sensor-based application demands. To meet the upcoming market demands, the current intra-vehicular communication transmission reliability and latency should be improved significantly to fit with the existing 5G and upcoming 6G communication domains. Ultra-Reliable Low-Latency Communication (URLLC) can be widely used to enhance the quality of communication and services of 5G and beyond. The 5G URLLC service is highly dependable for transmission reliability and minimizing data transmission latency. In this paper, a multiple-access scheme named Cluster-based Orthogonal Frequency Subcarrier-based Multiple Access (C-OFSMA) is proposed with 5G URLLC’s high requirement adaptation for intra-vehicular data transmission. The URLLC demanded high reliability of approximately 99.999% of the data transmission within the extremely short latency of less than 1 ms. C-OFSMA enhanced the transmission diversity, which secured more successful data transmission to fulfill these high requirements and adapt to such a network environment. In C-OFSMA, the available sensors transmit data over specific frequency channels where frequency selection is random and special sensors (audio and video) transmit data over dedicated frequency channels. The minimum number of subcarrier channels was evaluated for different arrival rates and different packet duplication conditions in order to achieve 99.999% reliability within an air-interface latency of 0.2 ms. For the fixed frequency channel condition, C-OFSMA and OFSMA were compared in terms of reliability response and other packet duplication. Moreover, the optimal number of clusters was also evaluated in the aspects of the reliability response for the C-OFSMA system. Full article
Show Figures

Figure 1

Figure 1
<p>A vehicle installed with a finite number of sensors for wireless backbone connectivity.</p>
Full article ">Figure 2
<p>System Model.</p>
Full article ">Figure 3
<p>Collision scenario of OFSMA.</p>
Full article ">Figure 4
<p>Collision scenario of proposed C-OFSMA.</p>
Full article ">Figure 5
<p>Collision analysis.</p>
Full article ">Figure 6
<p>Determine minimum subcarrier channels to satisfy URLLC’s reliability 99.999% for 3-, 5-, and 7-packet duplication. (<b>a</b>) Mathematical, (<b>b</b>) Simulation.</p>
Full article ">Figure 7
<p>Determine reliability using 90 channels for both OFSMA and C-OFSMA scheme.</p>
Full article ">Figure 8
<p>Determine reliability for different clusters using 3-packet duplication. (<b>a</b>) Mathematical, (<b>b</b>) Simulation.</p>
Full article ">Figure 9
<p>Determine reliability for different clusters using 5-packet duplication. (<b>a</b>) Mathematical, (<b>b</b>) Simulation.</p>
Full article ">Figure 10
<p>Determine reliability for different clusters using 7-packet duplication. (<b>a</b>) Mathematical, (<b>b</b>) Simulation.</p>
Full article ">Figure 11
<p>Collision percentages for different packet duplication.</p>
Full article ">Figure 12
<p>Determine received power at various points.</p>
Full article ">Figure 13
<p>Determine air interference latency in different packet size.</p>
Full article ">
18 pages, 2217 KiB  
Article
Communication Transport Protocol Strategies for Rail Applications
by Romeo Giuliano, Alessandro Vizzarri, Antonino Calderone and Franco Mazzenga
Appl. Sci. 2022, 12(6), 3013; https://doi.org/10.3390/app12063013 - 16 Mar 2022
Cited by 1 | Viewed by 3573
Abstract
Current technologies for managing rail traffic such as the Global System for Mobile communications for Railway (GSM-R) will be no longer be available within the upcoming years. The European Shift2Rail Joint Undertaking (S2R-JU) proposed the Adaptable Communication System (ACS) to overcome this problem. [...] Read more.
Current technologies for managing rail traffic such as the Global System for Mobile communications for Railway (GSM-R) will be no longer be available within the upcoming years. The European Shift2Rail Joint Undertaking (S2R-JU) proposed the Adaptable Communication System (ACS) to overcome this problem. In this work, we model the ACS by abstracting it at the Internet Protocol (IP) level, using tunnels for datagrams’ transmission as a communication bearer is available along the rail. Then, to evaluate its performance, an ACS emulator has been implemented. The core part of it is a Tunnel Manager which can establish pseudo-virtual circuits through multi-bearer tunnels, forcing datagrams on a service-basis to follow specific paths between gateways (i.e., from on-board to a train to the network-side rail control center and vice versa). The Tunnel Manager can properly select a given tunnel/bearer for sending messages (and duplicating them on redundant paths) of critical rail applications for train traffic management, relying on tunnels based on either connection-oriented protocol (i.e., the Transport Control Protocol, TCP), connectionless protocol (i.e., the User Datagram Protocol, UDP) or a mix of them. In this paper, we investigate the best solutions in terms of transport protocols for implementing tunnels through the bearers. Results are based on two main use cases: i. the position report/movement authority messages for the European Rail Traffic Management System (ERMTS) and ii. the critical file transmission, considering either TCP or UDP as tunnel transport protocol. For the first rail application, one UDP bearer can be selected only if the end-to-end channel delay is lower than 100 ms and the experienced packet loss is lower than 4% in the whole crossed network. Two UDP bearers, one TCP bearer or two mixed UDP/TCP bearers should be selected in case the channel delay is greater than 300 ms and the experienced packet loss is greater than 15%. Considering the critical file transfer in the rail scenario, TCP should be selected with two bearers to have a throughput greater than 50 Mbit/s even for a packet loss of 1%. Full article
(This article belongs to the Section Electrical, Electronics and Communications Engineering)
Show Figures

Figure 1

Figure 1
<p>Separation of the communication technology (or bearer) with the rail application.</p>
Full article ">Figure 2
<p>ACS Conceptual Diagram.</p>
Full article ">Figure 3
<p>ACS Protocol Stack.</p>
Full article ">Figure 4
<p>ACS Model Scheme for testbed.</p>
Full article ">Figure 5
<p>SIP hop-by-hop signaling process.</p>
Full article ">Figure 6
<p>Example of SIP registration sequence and logical IP address assignment in ACS.</p>
Full article ">Figure 7
<p>SIP INVITE method used to create virtual circuit in ACS.</p>
Full article ">Figure 8
<p>ACS simulator: testbed scheme.</p>
Full article ">Figure 9
<p>ACS GW simulator software architecture scheme.</p>
Full article ">Figure 10
<p>Tunnel Manager packet processing.</p>
Full article ">Figure 11
<p>PR/MA Procedure with a PR transmission period <math display="inline"><semantics> <msub> <mi>δ</mi> <mi>P</mi> </msub> </semantics></math>, a channel latency <math display="inline"><semantics> <mi>δ</mi> </semantics></math> and a MA receiving threshold <math display="inline"><semantics> <mi>ξ</mi> </semantics></math>: (<b>a</b>) successful case; (<b>b</b>) unsuccessful case due to high packet loss; (<b>c</b>) unsuccessful case due to high packet loss and high channel delay.</p>
Full article ">Figure 12
<p>PR/MA over-limit outage vs. network packet losses for a delay of 100 ms.</p>
Full article ">Figure 13
<p>PR/MA over-limit percentage vs. network packet losses for 1 TCP bearer and 2 TCP bearers: considered delays are 0, 50, 100, 200 and 400 ms.</p>
Full article ">Figure 14
<p>PR/MA over-limit percentage vs. network packet losses for one UDP bearer and two UDP bearers: considered delays are 0, 50, 100, 200 and 400 ms.</p>
Full article ">Figure 15
<p>Selection of the transport protocol strategy based on the experienced couple <math display="inline"><semantics> <mrow> <mo>&lt;</mo> <mi>p</mi> <mi>a</mi> <mi>c</mi> <mi>k</mi> <mi>e</mi> <mi>t</mi> <mspace width="0.166667em"/> <mi>l</mi> <mi>o</mi> <mi>s</mi> <mi>s</mi> <mo>,</mo> <mi>d</mi> <mi>e</mi> <mi>l</mi> <mi>a</mi> <mi>y</mi> <mo>&gt;</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 16
<p>Data Transfer Throughput vs. Increasing Packet Loss on Bearer Interfaces.</p>
Full article ">Figure 17
<p>Data Transfer Throughput vs. Increasing Latency with fixed Packet Loss equal to 1% on Bearer Interfaces.</p>
Full article ">
18 pages, 844 KiB  
Article
Dynamic Packet Duplication for Industrial URLLC
by David Segura, Emil J. Khatib and Raquel Barco
Sensors 2022, 22(2), 587; https://doi.org/10.3390/s22020587 - 13 Jan 2022
Cited by 7 | Viewed by 2629
Abstract
The fifth-generation (5G) network is presented as one of the main options for Industry 4.0 connectivity. To comply with critical messages, 5G offers the Ultra-Reliable and Low latency Communications (URLLC) service category with a millisecond end-to-end delay and reduced probability of failure. There [...] Read more.
The fifth-generation (5G) network is presented as one of the main options for Industry 4.0 connectivity. To comply with critical messages, 5G offers the Ultra-Reliable and Low latency Communications (URLLC) service category with a millisecond end-to-end delay and reduced probability of failure. There are several approaches to achieve these requirements; however, these come at a cost in terms of redundancy, particularly the solutions based on multi-connectivity, such as Packet Duplication (PD). Specifically, this paper proposes a Machine Learning (ML) method to predict whether PD is required at a specific data transmission to successfully send a URLLC message. This paper is focused on reducing the resource usage with respect to pure static PD. The concept was evaluated on a 5G simulator, comparing between single connection, static PD and PD with the proposed prediction model. The evaluation results show that the prediction model reduced the number of packets sent with PD by 81% while maintaining the same level of latency as a static PD technique, which derives from a more efficient usage of the network resources. Full article
(This article belongs to the Section Internet of Things)
Show Figures

Figure 1

Figure 1
<p>A downlink packet duplication scheme in a NR-NR DC scenario.</p>
Full article ">Figure 2
<p>Block diagram of the system.</p>
Full article ">Figure 3
<p>Random forest prediction scheme.</p>
Full article ">Figure 4
<p>UE movement over the entire scenario.</p>
Full article ">Figure 5
<p>Latency samples. (<b>a</b>) SINR, (<b>b</b>) Modulation index and (<b>c</b>) Reception Success.</p>
Full article ">Figure 6
<p>ECDF of the latency received.</p>
Full article ">Figure 7
<p>ECDF of the latency gain when the predictor activates PD.</p>
Full article ">
Back to TopTop