Search

Daily conversation is usually face-to-face and characterized by rapid and fluent exchange of turns between interlocutors. With the need to communicate across long distances, advances in communication media, online audio communication, and online video communication have become convenient alternatives for an increasing number of people. However, the fluency of turn-taking may be influenced when people communicate using these different modes. In this study, we conducted a corpus analysis of face-to-face, online audio, and online video conversations collected from the internet. The fluency of turn-taking in face-to-face conversations differed from that of online audio and video conversations. Namely, the timing of turn-taking was shorter and with more overlaps in face-to-face conversations compared with online audio and video conversations. This can be explained by the limited ability of online communication modes to transmit non-verbal cues and network latency. In addition, our study could not completely exclude the effect of formality of conversation. The present findings have implications for the rules of turn-taking in human online conversations, in that the traditional rule of no-gap–no-overlap may not be fully applicable to online conversations. [ABSTRACT FROM AUTHOR]

Blockchain technology promises transformative potential across diverse sectors, facilitating innovations in areas ranging from finance to healthcare. Despite its many promising applications, several barriers—including scalability challenges, regulatory complexities, and technical hurdles—limit its widespread adoption. This systematic literature review delves into scalability enhancements and explores the legal and regulatory landscapes impacting blockchain deployment in ten key sectors: IoT, healthcare, finance, education, social media, genomics, supply chain, vehicular networks, e-voting, and tourism. These sectors were selected based on their significant engagement with blockchain technology and their prominence in the analyzed literature. We examine key technological advancements such as Layer-2 techniques, sharding, consensus algorithm optimization, and rollups, and discuss their implications for throughput, latency, and compliance with regulatory standards such as the General Data Protection Regulation (GDPR). The review details these technological and regulatory developments and discusses their broader implications for industry and academia, emphasizing the need for interdisciplinary research and innovation. By identifying gaps in current research and suggesting future directions, this study serves as a roadmap for researchers, practitioners, and policymakers to develop secure, scalable, and compliant blockchain systems. Our comprehensive examination provides valuable insights into enhancing the efficiency, security, and regulatory compliance of blockchain technology. [ABSTRACT FROM AUTHOR]

With remarkable advancements in the development of connected and autonomous vehicles (CAVs), the integration of teleoperation has become crucial for improving safety and operational efficiency. However, teleoperation faces substantial challenges, with network latency being a critical factor influencing its performance. This survey paper explores the impact of network latency along with state-of-the-art mitigation/compensation approaches. It examines cascading effects on teleoperation communication links (i.e., uplink and downlink) and how delays in data transmission affect the real-time perception and decision-making of operators. By elucidating the challenges and available mitigation strategies, the paper offers valuable insights for researchers, engineers, and practitioners working towards the seamless integration of teleoperation in the evolving landscape of CAVs. [ABSTRACT FROM AUTHOR]

In free-space optical satellite networks (FSOSNs), satellites can have different laser inter-satellite link (LISL) ranges for connectivity. As the LISL range increases, the number of satellites from among all the satellites in the constellation that will be needed on the shortest path between a source and a destination ground station decrease, and thereby the number of the LISLs on the shortest path decreases. Greater LISL ranges can reduce network latency of the path but can also result in an increase in transmission power for satellites on the path. Consequently, this tradeoff between satellite transmission power and network latency should be investigated, and in this work we examine it in FSOSNs drawing on the Starlink Phase 1 Version 3 (i.e., the latest version of Starlink's Phase 1) and Kuiper Shell 2 (i.e., Kuiper's biggest shell) constellations for different LISL ranges and different inter-continental connections. We use appropriate system models for calculating the average satellite transmission power (i.e., the average of the transmission power of all satellites on the shortest path) and network latency (i.e., the end-to-end latency of the shortest path). The results show that the mean network latency (i.e., the mean of network latency over all time slots) decreases and mean average satellite transmission power (i.e., the mean of average satellite transmission power over all time slots) increases with an increase in LISL range. For the Toronto–Sydney inter-continental connection in an FSOSN with Starlink's Phase 1 Version 3 constellation, when the LISL range is approximately 2,900 km, the mean network latency and mean average satellite transmission power intersect are approximately 135 ms and 380 mW, respectively. For an FSOSN with the Kuiper Shell 2 constellation in this inter-continental connection, this LISL range is around 3,800 km, and the two parameters are approximately 120 ms and 700 mW, respectively. For the Toronto–Istanbul and Toronto–London inter-continental connections, the LISL ranges at the intersection are different and vary from 2,600 km to 3,400 km. Furthermore, we analyze outage probability performance of optical uplink/downlink due to atmosphere attenuation and turbulence.

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The performance of multipath transmission control protocol (MPTCP) subflow through the enhancement mechanism of the MPTCP communication is improved. When dealing with multiple MPTCP subflows occupying the same transmission path, critical issues such as selection and optimization of multipath, and efficient scheduling of available multiple tracks are effectively addressed by incorporating the technology called software defined network (SDN) that is constructed based on four key parameters, namely, network transmission bandwidth, transmission paths, path capacity, and network latency. Besides, critical equipment such as the network physical device layer and SDN controller are integrated with the four parameters. So, the network model defines the transmission control process and data information. Considering the predetermined total network bandwidth capacity to select multiple paths, the adequate bandwidth capacity is determined by defining the data transfer rate between MPTCP terminals and MPTCP servers. However, the processing latency of the OpenFlow switch and the SDN controller is excluded. The effective network transmission paths are calculated through two rounds of path selection algorithms. Moreover, according to the demand capacity of the data transmission and the supply capacity of the required occupied network resource, a supply and demand strategy is formulated by considering the bandwidth capacity of the total network and invalid network latency factors. Then, the available network transmission path from the valid network transmission path is calculated. The shortest path calculation problem, which is the calculation and sorting of the shortest path, is transformed into a clustering, Inter-Cluster Average Classification (ICA), problem. The instruction of the OpenFlow communication flow is designed to schedule MPTCP subflows. Thus, various validation objectives, including the network model, effective network latency, effective transmission paths, supply-demand strategies, ineffective transmission paths, shortest feasible paths, and communication rules are addressed by the proposed method whose reliability, stability, and data transmission performance are validated through comparative analysis with other conventional algorithms. Found that the network latency is around 20 s, the network transmission rate is approximately 10 Mbps, the network bandwidth capacity reaches around 25Mbps, the network resource utilization rate is about 75%, and the network swallowing volume is approximately 3 M/s. [ABSTRACT FROM AUTHOR]

With remarkable advancements in the development of connected and autonomous vehicles (CAVs), the integration of teleoperation has become crucial for improving safety and operational efficiency. However, teleoperation faces substantial challenges, with network latency being a critical factor influencing its performance. This survey paper explores the impact of network latency along with state-of-the-art mitigation/compensation approaches. It examines cascading effects on teleoperation communication links (i.e., uplink and downlink) and how delays in data transmission affect the real-time perception and decision-making of operators. By elucidating the challenges and available mitigation strategies, the paper offers valuable insights for researchers, engineers, and practitioners working towards the seamless integration of teleoperation in the evolving landscape of CAVs.

Abstract In this paper, the potential for conserving energy has been used inside the collaborative network. The purpose of this work is to examine a model of a collaborative mobile cloud with the objective of lowering the total energy consumption of network nodes. This model is made up of many different network nodes, all of which collaborate with one another to build the network. We performed a theoretical examination into the quantity of energy that is used by the nodes when they are functioning as part of the network. In addition, a user grouping and scheduling-based system was established in order to establish when and how users should participate in the creation of the network. This was done so that the system could identify when and how users should contribute to the construction of the network. The proposed methodology took into consideration both the user and the base station components, and it made an effort to strike a balance between reducing the amount of energy that was consumed and ensuring that everyone was treated in an equitable manner. Even with higher delay values, the collaborative method may minimise energy use. The suggested approach uses slower but more energy-efficient nodes by increasing the allowable latency, which reduces energy usage and benefits from the diversity of nodes. The results of the simulation are presented by our proposed method from the perspective of user fairness as well as presenting the advantages of conserving energy that are associated with employing the collaborative strategy.

The development of teleoperated devices is a growing area of study since it can improve cost effectiveness, safety, and healthcare accessibility. However, due to the large distances involved in using teleoperated devices, these systems suffer from communication degradation, such as latency or signal loss. Understanding degradation is important to develop and improve the effectiveness of future systems. The objective of this research is to identify how a teleoperated system's behavior is affected by latency and to investigate possible methods to mitigate its effects. In this research, the end-effector position error of a 4-degree-of-freedom (4-DOF) teleultrasound robot was measured and correlated with measured time delay. The tests were conducted on a Wireless Local Area Network (WLAN) and a Virtual Local Area Network (VLAN) to monitor noticeable changes in position error with different network configurations. In this study, it was verified that the communication channel between master and slave stations was a significant source of delay. In addition, position error had a strong positive correlation with delay time. The WLAN configuration achieved an average of 300 ms of delay and a maximum displacement error of 7.8 mm. The VLAN configuration showed a noticeable improvement with a 40% decrease in average delay time and a 70% decrease in maximum displacement error. The contribution of this work includes quantifying the effects of delay on end-effector position error and the relative performance between different network configurations. [ABSTRACT FROM AUTHOR]

To store, analyse and process the large volume of data generated by IoT traditional cloud computing, is used everywhere. However, the traditional cloud data centres have their limitations to handle high latency issues in time-critical applications of IoT and cloud. Their applications are computer gaming, e-healthcare, telemedicine and robot surgery. The high latency in IoTs and cloud includes high computational, communication latency (service) and network latencies. The vital requirement of IoT is to have minimum network, service and computation latencies for real-time applications. Network latency causes a delay in transmitting a message or communication from one location to another. Services that require data in real-time are almost impossible to access the data via the cloud. Traditional cloud computing approaches are unable to fulfil the quality-of-service (QoS) requirements in IoT devices. Researches related to latency reduction techniques are still in infancy. Some new approaches to minimize the latency for transmitting time-sensitive data in real-time are discussed in this paper for cloud and IoT devices. This research will help the researchers and industries to identify the techniques and technologies to minimize the latencies in IoT and cloud. The paper also discusses the research trends and the technical differences between the various technologies and techniques. With the increasing interest in the literature on latency minimization and its requirements for time-sensitive applications; it is important to systematically review and synthesize the approaches, tools, challenges and techniques to minimize latencies in IoT and cloud. This paper aims at systematically reviewing the state of the art of latency minimization to classify approaches, and techniques. The paper uses a PRISMA technique for a systematic review. The paper further identifies challenges and gaps in this regard for future research. We have identified 23 approaches and 32 technologies associated with latencies in the cloud and IoT. A total of 112 papers on latency reduction have been examined under this study. The existing research gaps and works for latency reduction in IoTs are discussed in detail. There are several challenges and gaps, which requires future research work for improving the latency minimization techniques and technologies. Finally, we present some open issues which will determine the future research direction. [ABSTRACT FROM AUTHOR]

Networked music is no longer a future genre: the global quarantine event of 2020 launched the concept of performing together over the Internet into the mainstream. While the demand for performing at a distance may be a new imperative, musicians find themselves faced with technological and performative processes that do not appear to be suitable for performing music together online, due particularly to network latency which disrupts the ability for musicians to synchronize. The research presented in this paper investigates and challenges the reasons why networked music is not readily embraced by musicians and describes how that might change, by way of interviews with practitioners and an in-depth review of the technical constraints. Limitations that might cause frustration are in fact shown to have creative strategies that give rise to aesthetic approaches, distinct to the platform. By exploiting the constraints, in tandem with developing technology designed specifically for remote performance, aesthetic implications arise that not only accommodate the inconveniences of latency and acoustic feedback but can help us adapt and transform how we engage in real-time online, towards a future where we can imagine performing together over even more dramatic distances such as high-latency, low-bandwidth locations outside of urban areas—or even over galactic distances. [ABSTRACT FROM AUTHOR]

Mobile wireless sensor networks (MWSNs) have been a hot topic of research, and numerous routing methods have been developed to increase energy efficiency and extend longevity. Nodes close to the sink often use more energy to transmit data from their neighbors to the sink, which causes them to run out of energy faster. These places are also referred to as rendezvous points, and choosing the best one is a hard task. The likelihood of choosing an ideal node as the rendezvous point will be extremely low because hierarchical algorithms only use their local information to select these places. The warm spot problem is addressed from four angles in this work using the Enhanced Power-Efficient Gathering in Sensor Information Systems (EPEGASIS) technique. In order to limit the amount of energy used during transmission, the ideal communication distance is first calculated. To balance the energy consumption among the nodes, mobile sink technology is employed once a threshold value is set to safeguard the dying nodes. The node can then modify its communication range based on how far away the sink node is from it. Thorough testing has been done to demonstrate that our suggested EPEGASIS works better in terms of longevity, drive usage, and web latency. [ABSTRACT FROM AUTHOR]

In this paper, the potential for conserving energy has been used inside the collaborative network. The purpose of this work is to examine a model of a collaborative mobile cloud with the objective of lowering the total energy consumption of network nodes. This model is made up of many different network nodes, all of which collaborate with one another to build the network. We performed a theoretical examination into the quantity of energy that is used by the nodes when they are functioning as part of the network. In addition, a user grouping and scheduling-based system was established in order to establish when and how users should participate in the creation of the network. This was done so that the system could identify when and how users should contribute to the construction of the network. The proposed methodology took into consideration both the user and the base station components, and it made an effort to strike a balance between reducing the amount of energy that was consumed and ensuring that everyone was treated in an equitable manner. Even with higher delay values, the collaborative method may minimise energy use. The suggested approach uses slower but more energy-efficient nodes by increasing the allowable latency, which reduces energy usage and benefits from the diversity of nodes. The results of the simulation are presented by our proposed method from the perspective of user fairness as well as presenting the advantages of conserving energy that are associated with employing the collaborative strategy. [ABSTRACT FROM AUTHOR]

A significant technological transformation has recently occurred in the agriculture sector. Precision agriculture is one among those transformations that largely focus on the acquisition of the sensor data, identifying the insights, and summarizing the information for better decision-making that would enhance the resource usage efficiency, crop yield, and substantial quality of the yield resulting in better profitability, and sustainability of agricultural output. For continuous crop monitoring, the farmlands are connected with various sensors that must be robust in data acquisition and processing. The legibility of such sensors is an exceptionally challenging task, which needs energy-efficient models for handling the lifetime of the sensors. In the current study, the energy-aware software-defined network for precisely selecting the cluster head for communication with the base station and the neighboring low-energy sensors. The cluster head is initially chosen according to energy consumption, data transmission consumption, proximity measures, and latency measures. In the subsequent rounds, the node indexes are updated to select the optimal cluster head. The cluster fitness is assessed in each round to retain the cluster in the subsequent rounds. The network model's performance is assessed against network lifetime, throughput, and network processing latency. The experimental findings presented here show that the model outperforms the alternatives presented in this study. [ABSTRACT FROM AUTHOR]

The rapid development of today’s Internet has led to the emergence of a large number of real-time applications, and they have put forward more stringent requirements on the availability of routing in the network. In order to maintain routing availability, it need to adopt certain routing protection strategies to prevent the possible impact of network failures on the network. Therefore, a routing availability framework based on node bias order relationship is proposed, which first constructs a directed acyclic graph using the bias order relationship between nodes, and then calculates the backup next-hop node for each node based on the constructed directed acyclic graph. Based on this framework, four routing protection methods are proposed based on the biased order relationship between nodes. The experimental results show that all four routing protection algorithms have high fault protection rate and effectively reduce the network disruption caused by faults, which can reach 89.76% in the real topology and 98.995% in the simulated topology, almost close to 100%. [ABSTRACT FROM AUTHOR]

In blockchain-based systems whose consensus mechanisms resort to Proof-of-Work (PoW), it is expected that a miner’s share of total block revenue is proportional to their share of hashing power with respect to the rest of the network. The protocol relies on the immediate broadcast of blocks by miners, to earn precedence in peers’ local blockchains. However, a deviation from this strategy named selfish mining (SM), may lead miners to earn more than their “fair share”. In this paper, we introduce an agent-based model to simulate the dynamics of SM behaviour by a single miner as well as mining pools to understand the influence of (a) mining power distribution, (b) overlay network topology, (c) positioning of the selfish nodes within the peer to peer network. Our minimalistic model allows us to find that in high levels of latency, SM is always a more profitable strategy; our results are very robust to different network topologies and mining nodes’ centrality in the network. Moreover, the power-law distribution of the miners’ hashing power can make it harder for a selfish miner to be profitable. In addition, we analyze the effect of SM on system global efficiency and fairness. Our analysis confirms that SM is always more profitable for hashing powers representing more than one-third of the total computing power. Further, it also confirms that SM behaviour could cause a statistically significant high probability of continuously mined blocks opening the door for empirical verification of the phenomenon.

The development of teleoperated devices is a growing area of study since it can improve cost effectiveness, safety, and healthcare accessibility. However, due to the large distances involved in using teleoperated devices, these systems suffer from communication degradation, such as latency or signal loss. Understanding degradation is important to develop and improve the effectiveness of future systems. The objective of this research is to identify how a teleoperated system’s behavior is affected by latency and to investigate possible methods to mitigate its effects. In this research, the end-effector position error of a 4-degree-of-freedom (4-DOF) teleultrasound robot was measured and correlated with measured time delay. The tests were conducted on a Wireless Local Area Network (WLAN) and a Virtual Local Area Network (VLAN) to monitor noticeable changes in position error with different network configurations. In this study, it was verified that the communication channel between master and slave stations was a significant source of delay. In addition, position error had a strong positive correlation with delay time. The WLAN configuration achieved an average of 300 ms of delay and a maximum displacement error of 7.8 mm. The VLAN configuration showed a noticeable improvement with a 40% decrease in average delay time and a 70% decrease in maximum displacement error. The contribution of this work includes quantifying the effects of delay on end-effector position error and the relative performance between different network configurations.

There is a large gap between current AI-based autonomous-driving cars and fully autonomous cars, where the remote control of vehicles can be a unique solution to fill the gap. The remote control enables valuable operational data to be obtained, thus laying the groundwork for gradually increasing autonomous driving performance in the future. Moreover, human assistance through remote driving can offer more flexibility and intelligence than a single artificial intelligence. However, the real-time transmission of data and images is particularly crucial for remotely driven vehicles. The latency between a vehicle and the controller depends on the video streaming communication methods and transport protocols. Furthermore, the control or driving performance also depends on the vehicle speed likewise. Therefore, in this paper, we explore the impact of different communication methods of video streaming and vehicle “speed” on the performance of remote driving. We design a vehicle remote driving system based on ROS (Robot Operating System) with ROS as the core communication architecture to realize remote control of vehicles. The video stream is transmitted using three different streaming methods: ROS multi-computer communication, TCP protocol, and UDP protocol. To be specific, we implement a simple remote driving system for a “model” car, drive it at different speeds, and analyze how the drivers perform in terms of whether the vehicle gets off the track while driving. Based on the results, we find that “UDP-based video streaming” achieves 720P video streaming with a latency of less than 50ms, which is helpful for further research on remote driving. The experiment by “directly” observing the vehicle with eyes instead of using video streaming is also conducted to remove the video streaming latency. The experiment results show that the speed of the vehicle and the video streaming methods have a significant impact on the driving performance, and UDP protocol-based video streaming method is better suited for remote driving. The results imply that remote driving should be used in a low-speed environment rather than at high speed.

Laser inter-satellite links (LISLs) between satellites in a free-space optical satellite network (FSOSN) can be divided into two classes: permanent LISLs (PLs) and temporary LISLs (TLs). TLs are not desirable in next-generation FSOSNs (NG-FSOSNs) due to high LISL setup time, but they may become feasible in next-next-generation FSOSNs (NNG-FSOSNs). Using the satellite constellation for Phase I of Starlink, we study the impact of TLs on network latency in an NG-FSOSN (which has only PLs) versus an NNG-FSOSN (which has PLs and TLs) under different long-distance inter-continental data communications scenarios, including Sydney–Sao Paulo, Toronto–Istanbul, Madrid–Tokyo, and New York–Jakarta, and different LISL ranges for satellites, including 659.5 km, 1,319 km, 1,500 km, 1,700 km, 2,500 km, 3,500 km, and 5,016 km. It is observed from the results that TLs provide higher satellite connectivity and thereby higher network connectivity, and they lead to lower average network latency for the NNG-FSOSN compared to the NG-FSOSN in all scenarios at all LISL ranges. In comparison with the NG-FSOSN, the improvement in latency with the NNG-FSOSN is significant at LISL ranges of 1,500 km, 1,700 km, and 2,500 km, where the improvement is 16.83 ms, 23.43 ms, and 18.20 ms, respectively, for the Sydney–Sao Paulo inter-continental connection. For the Toronto–Istanbul, Madrid–Tokyo, and New York–Jakarta inter-continental connections, the improvement is 14.58 ms, 23.35 ms, and 23.52 ms, respectively, at the 1,700 km LISL range.

Differing from tremendous existing works that mainly focus on optimizing backscatter communication, Radio-to-Bus (R2B) communication utilizes backscatter to offload processors from IoT devices to the gateway, achieving processor-free devices of significantly reduced power and hardware cost. However, R2B communication is not suitable for large-scale backscatter networks, since R2B cannot support parallel and long-range communication between the gateway and hundreds of R2B devices. In this article, we present Chipnet, a network that supports hundreds of long-range and concurrent connections between the gateway and multiple processor-free devices. The high-level design of Chipnet includes a parallel frequency-division uplink mechanism that can work on processor-free devices and a processor-free MAC layer protocol that supports gateway to broadcast downlink data and individually manage each processor-free device. This design addresses practical issues facing the processor-free device architecture, such as synchronizing hundreds of processorfree devices, assigning unique channel frequencies to every device, and realizing power-efficient processorfree signal conversion. The results demonstrate that a Chipnet network can achieve a task throughput of 2,400 tasks/s with a latency of 72.23ms. Compared with the R2B network, Chipnet achieves 3×–5× improvements in network coverage range and two orders of magnitude improvement in both network throughput and network latency. [ABSTRACT FROM AUTHOR]

For data communications over long distances, optical wireless satellite networks (OWSNs) can offer lower latency than optical fiber terrestrial networks (OFTNs). However, when is it beneficial to switch or crossover from an OFTN to an OWSN for lower latency data communications? In this article, we introduce a crossover function that enables to find the crossover distance, i.e., a distance between two points on the surface of the Earth beyond which switching or crossing over from an OFTN to an OWSN for data communications between these points is useful in terms of latency. Numerical results reveal that a higher refractive index of optical fiber (or $i$) in an OFTN and a lower altitude of satellites (or $h$) in an OWSN result in a shorter crossover distance. To account for the variation in the end-to-end propagation distance that occurs over the OWSN, we examine the crossover function in four different scenarios. Numerical results indicate that the crossover distance varies with the end-to-end propagation distance over an OWSN and is different for different scenarios. We calculate the average crossover distance over all scenarios for different $h$ and $i$ and use it to evaluate the simulation results. Furthermore, for a comparative analysis of OFTNs and OWSNs in terms of latency, we study three different OFTNs having different refractive indexes and three different OWSNs having different satellite altitudes in three different scenarios for long-distance intercontinental data communications, including connections between New York and Dublin, Sao Paulo and London, and Toronto and Sydney. All three OWSNs offer better latency than OFTN2 (with $i_{2}$ = 1.3) and OFTN3 (with $i_{3}$ = 1.4675) in all scenarios. For example, for Toronto–Sydney connection, OWSN1 (with $h_{1}$ = 300 km), OWSN2 (with $h_{2}$ = 550 km), and OWSN3 (with $h_{3}$ = 1100 km) perform better than OFTN2 by 18.11%, 16.08%, and 10.30%, respectively, while they provide an improvement in latency of 27.46%, 25.67%, and 20.54%, respectively, compared to OFTN3. OWSN1 performs better than OFTN1 (with $i_{1}$ = 1.1) for Sao Paulo–London and Toronto–Sydney connections by 2.23% and 3.22%, respectively, while OWSN2 outperforms OFTN1 for Toronto–Sydney connection by 0.82%. For New York–Dublin connection, all OWSNs while for Sao Paulo–London connection, OWSN2 and OWSN3 exhibit higher latency than OFTN1 as the corresponding average crossover distances are greater than the shortest terrestrial distances between cities in these scenarios. Multiple satellites (or laser intersatellite links) on its shortest paths drive up the propagation distance to the extent that OWSN3 ends up with a higher latency than OFTN1 for the Toronto–Sydney intercontinental connection scenario although the related average crossover distance is less than the shortest terrestrial distance between Toronto and Sydney. The challenges related to OWSNs and OFTNs that may arise from this work in future are also highlighted. [ABSTRACT FROM AUTHOR]

AR Drum Circle, is an augmented reality (AR) platform we developed to facilitate a collaborative remote drumming experience. We explore the effects of virtual avatars that are rendered in a player’s view to provide the joy and sensation of co-present music creation. AR Drum Circle uses a head mounted AR display, providing players with visual effects to assist drummers in coordinating musical ideas while simultaneously using a latency-optimized remote collaboration service (JackTrip). AR Drum Circle helps overcome barriers in music collaboration introduced when using remote collaboration tools on their own, which typically do not support real-time video, lack spatial information, and volume control between players, all of which are important for in-person drum circles and music collaboration. This paper presents the results of several investigations: (1) analysis of an in-depth, free-form response survey of drumming communication provided by a small group of expert drummers, (2) observations and analysis of 20 videos of live drum circles, (3) a case study using the AR Drum Circle application in pairs of remotely located participants, and (4) a collaborative drumming case study using a popular networked conferencing application (Zoom). Findings suggest that substantial communicative information including facial expressions, hand-tracking, and eyecontact is lost when using AR alone. Findings also indicate that the AR Drum Circle application can make players less self-conscious and more willing to participate while playing drums improvisationally with others. [ABSTRACT FROM AUTHOR]

In wireless sensor networks (WSNs), especially in underwater sensor networks, the problem of reporting data to the sink with minimum latency has been widely discussed in many research works. Many studies address using data aggregation to report the same type of data to the sink without data collision in a short period of time. However, due to the rapid development of sensor technology in recent years, a sensor is allowed to have multiple sensing capabilities, that is, it can generate and collect different types of data. Because different types of data have different meanings and required aggregation functions, only the data that belong to the same type are allowed to be aggregated. In addition, due to the interference of the environment or noise, the links in the WSNs are often not bidirectional. This motivates us to study the problem of using minimum latency scheduling to aggregate and report data to the sink without data collision in multiple-data-type WSNs having unidirectional links, which is shown to be NP-hard in the article. The Relative-Collision-Graph-Based Scheduling Algorithm (RCGBSA) is proposed accordingly. Simulations are conducted to demonstrate the performance of the RCGBSA. [ABSTRACT FROM AUTHOR]

Network latency is a crucial factor affecting the quality of communications networks due to the irregularity of vehicular traffic. To address the problem of performance degradation or instability caused by latency in vehicular networks, this paper proposes a time delay prediction algorithm, in which digital twin technology is employed to obtain a large quantity of actual time delay data for vehicular networks and to verify autocorrelation. Subsequently, to meet the prediction conditions of the ARMA time series model, two neural networks, i.e., Radial basis function (RBF) and Elman networks, were employed to construct a time delay prediction model. The experimental results show that the average relative error of the RBF is 7.6%, whereas that of the Elman-NN is 14.2%. This indicates that the RBF has a better prediction performance, and a better real-time performance than the Elman-NN. [ABSTRACT FROM AUTHOR]

In blockchain-based systems whose consensus mechanisms resort to Proof-of-Work (PoW), it is expected that a miner's share of total block revenue is proportional to their share of hashing power with respect to the rest of the network. The protocol relies on the immediate broadcast of blocks by miners, to earn precedence in peers' local blockchains. However, a deviation from this strategy named selfish mining (SM), may lead miners to earn more than their "fair share". In this paper, we introduce an agent-based model to simulate the dynamics of SM behaviour by a single miner as well as mining pools to understand the influence of (a) mining power distribution, (b) overlay network topology, (c) positioning of the selfish nodes within the peer to peer network. Our minimalistic model allows us to find that in high levels of latency, SM is always a more profitable strategy; our results are very robust to different network topologies and mining nodes' centrality in the network. Moreover, the power-law distribution of the miners' hashing power can make it harder for a selfish miner to be profitable. In addition, we analyze the effect of SM on system global efficiency and fairness. Our analysis confirms that SM is always more profitable for hashing powers representing more than one-third of the total computing power. Further, it also confirms that SM behaviour could cause a statistically significant high probability of continuously mined blocks opening the door for empirical verification of the phenomenon. [ABSTRACT FROM AUTHOR]

AR Drum Circle, is an augmented reality (AR) platform we developed to facilitate a collaborative remote drumming experience. We explore the effects of virtual avatars that are rendered in a player’s view to provide the joy and sensation of co-present music creation. AR Drum Circle uses a head mounted AR display, providing players with visual effects to assist drummers in coordinating musical ideas while simultaneously using a latency-optimized remote collaboration service (JackTrip). AR Drum Circle helps overcome barriers in music collaboration introduced when using remote collaboration tools on their own, which typically do not support real-time video, lack spatial information, and volume control between players, all of which are important for in-person drum circles and music collaboration. This paper presents the results of several investigations: (1) analysis of an in-depth, free-form response survey of drumming communication provided by a small group of expert drummers, (2) observations and analysis of 20 videos of live drum circles, (3) a case study using the AR Drum Circle application in pairs of remotely located participants, and (4) a collaborative drumming case study using a popular networked conferencing application (Zoom). Findings suggest that substantial communicative information including facial expressions, hand-tracking, and eye-contact is lost when using AR alone. Findings also indicate that the AR Drum Circle application can make players less self-conscious and more willing to participate while playing drums improvisationally with others.

A significant technological transformation has recently occurred in the agriculture sector. Precision agriculture is one among those transformations that largely focus on the acquisition of the sensor data, identifying the insights, and summarizing the information for better decision-making that would enhance the resource usage efficiency, crop yield, and substantial quality of the yield resulting in better profitability, and sustainability of agricultural output. For continuous crop monitoring, the farmlands are connected with various sensors that must be robust in data acquisition and processing. The legibility of such sensors is an exceptionally challenging task, which needs energy-efficient models for handling the lifetime of the sensors. In the current study, the energy-aware software-defined network for precisely selecting the cluster head for communication with the base station and the neighboring low-energy sensors. The cluster head is initially chosen according to energy consumption, data transmission consumption, proximity measures, and latency measures. In the subsequent rounds, the node indexes are updated to select the optimal cluster head. The cluster fitness is assessed in each round to retain the cluster in the subsequent rounds. The network model’s performance is assessed against network lifetime, throughput, and network processing latency. The experimental findings presented here show that the model outperforms the alternatives presented in this study.

Remote robotic-assisted endovascular interventions require real-time control of the robotic system to conduct precise device navigation. The delay (latency) between the input command and the catheter response can be affected by factors such as network speed and distance. This study evaluated the effect of network latency on robotic-assisted endovascular navigation in three vascular beds using in-vivo experimental model. Three operators performed femoral, carotid, and coronary endovascular robotic navigation blinded from the hybrid room with the prototype remote-enabled CorPath GRX system in a porcine model. Navigation was performed to different targets with randomly assigned network latencies from 0 to 1000 ms. Outcome measurements included navigation success, navigation time, perceived lag (1 = imperceptible, 5 = too long), and procedural impact scored by the operators (1 = no impact, 5 = unacceptable). Robotic-assisted remote endovascular navigation was successful in all 65 cases (9 femoral, 38 external carotid, 18 coronary). Guidewire times were not significantly different across the simulated network latency times. Compared to 0 ms added latency, both the procedural impact and perceived lag scores were significantly higher when the added latency was 400 ms or greater (< 0.01). Remote endovascular intervention was feasible in all studied anatomic regions. Network latency of 400 ms or above is perceptible, although acceptable to operators, which suggests that remote robotic-assisted femoral, carotid or coronary arterial interventions should be performed with network latency below 400 ms to provide seamless remote device control. [ABSTRACT FROM AUTHOR]

Fog Computing extends storage and computation resources closer to end-devices. In several cases, the Internet of Things (IoT) applications that are time-sensitive require low response time. Thus, reducing the latency in IoT networks is one of the essential tasks. To this end, fog computing is developed with a motive for the data production and consumption to always be within proximity; therefore, the fog nodes must be placed at the edge of the network, which is near the end devices, such that the latency is minimized. The optimal location selection for fog node placement within a network out of a very large number of possibilities, such as minimize latency, is a challenging problem. So, it is a combinatorial optimization problem. Hard combinatorial optimization problems (NP-hard) involve huge discrete search spaces. The fog node placement problem is an NP-hard problem. NP-hard problems are often addressed by using heuristic methods and approximation algorithms. Combinatorial optimization problems can be viewed as searching for the best element of some set of discrete items; therefore in principle, any metaheuristic can be used to solve them. To resolve this, meta-heuristic-based methods is proposed. We apply the Simulated Annealing (SA), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) technique to design fog node placement algorithms. Genetic Algorithm is observed to give better solutions. Since Genetic Algorithm may get stuck in local optima, Hybrid Genetic Algorithm, and Simulated Annealing (GA-SA), Hybrid Genetic Algorithm and Particle Swarm Optimization (GA-PSO) were compared with GA. By extensive simulations, it is observed that hybrid GA-SA-based for node placement algorithm outperforms other baseline algorithms in terms of response time for the IoT applications. [ABSTRACT FROM AUTHOR]

Voluntary computing initiatives aim to engage with the public and educate them about scientific and technological advancements. The goal and the science underpinning these initiatives may be learned a great deal by a volunteer who is involved with any of these volunteer computing programs. It is necessary to maintain a trust factor in order for volunteers in computing projects to not feel threatened by the usage of their sensitive data within the projects' scope. Using the findings of this study, we have elevated volunteer cloud computing to a new level by enabling more effective and secure communication between clients, allowing them to freely consume and provide resources. [ABSTRACT FROM AUTHOR]

In view of the problem of large network latency when the controller synchronized information to maintain the global network view,the latency-based SDN controller on-demand placement scheme was proposed.Firstly,the satellite subnet division method based on redundant coverage was designed according to the relative velocity of satellite and terminal.Then,the controller placement model was established by analyzing the response latency of the satellite distributed control.Finally,the controller placement problem was transformed into the soft capacitated facility location problem,and the approximation algorithm was designed to solve the model.The experimental results show that the proposed scheme can optimize network latency while meeting networking coverage demands.

This paper proposed a 5 G environment-based current time stabilization(CTS) model,in order to figure out shortcomings of the existing car-following models.Firstly,this car-following model considered the influence of the time variability of the network delay on the car-following model,and secondly considered the effects of the network delay on the real-time speed,acceleration,and driver response time of the vehicle to ensure that the CTS model was more in line with actual driving conditions.It derived the critical stability conditions of the car-following model theoretically.The simulation results show that when the network delays are different,the stability of the CTS model increases continuously with the decrease of the network delay;under the same disturbance,the stability of the CTS model is improved by 32.5% compared with the traditional optimal velocity follow-up model. [ABSTRACT FROM AUTHOR]