Message Loss Research Articles

Understanding the influence of communication visibility in preventing knowledge sabotage: a knowledge power perspective

PurposeThis study explores the potential impact of enterprise social media (ESM) communication visibility on knowledge sabotage to reduce knowledge sabotage within organizations.Design/methodology/approachWe collected data from 389 Chinese employees across three stages and used hierarchical regression analysis and the bootstrap method to test our hypotheses.FindingsCommunication visibility negatively affects knowledge sabotage, and the loss of knowledge power mediates the relationship between communication visibility and knowledge sabotage. Digital work connectivity strengthens the negative relationship between message transparency and loss of knowledge power but weakens the negative relationship between network translucence and loss of knowledge power. Therefore, digital work connectivity plays a dual role.Practical implicationsManagers can encourage employees to share their knowledge advantages through ESM and seek cross-disciplinary knowledge cooperation, which helps restrain knowledge sabotage from the source. At the same time, maintaining appropriate digital work connectivity enables employees to leverage their knowledge interaction advantages of ESM, thereby fostering their knowledge competitiveness.Originality/valueThis study is the first to reveal the internal mechanism (loss of knowledge power) through which ESM communication visibility affects knowledge sabotage and explores the boundary condition (digital work connectivity) impacting the effectiveness of communication visibility. It contributes to a deeper understanding of the inherent nature of knowledge sabotage from an information technology perspective and offers novel technical insights into its management.

Моделювання систем реального часу з використанням RUDP протоколу передачі даних

The efficiency of real-time systems makes them applicable in various fields by utilizing protocols for data transmission. Well-known transport layer protocols include Transmission Control Protocol (TCP) and User Datagram Protocol (UDP), which facilitate such transmission. However, there are challenges in using these protocols [1] in real-time systems where data rapidly changes during application execution. Exclusively using one of these protocols adversely affects the stable operation of the application and increases the risk of data obsolescence. The objective of this work is to develop and model a data transmission subsystem for real-time systems that utilizes the Reliable UDP (RUDP) protocol [2] for data synchronization. Implementing the RUDP network protocol in the subsystem addresses network issues such as delay, packet loss, and duplication in the most optimal way during real-time data synchronization between sensors and the server, reducing the load on bandwidth. The tasks of the developed subsystem, consisting of a server and a client, include: reading user-specified system data, reliable message transmission between the server and the client using sockets for RUDP protocol operation, ensuring the most optimal message delivery in case of packet loss, subsystem operation modeling compared to well-known UDP and TCP protocols. The simulation results reveal that the maximum time spent by the subsystem is 2.03 seconds for the RUDP protocol and 6.22 seconds for the TCP protocol. Therefore, RUDP is recommended for data transmission in the future. In the event of message loss, retransmission occurs exponentially, calculated using the proposed formula. If the initial transmission occurs immediately, subsequent times exponentially increase but remain collectively less than the transmission time for the TCP protocol.

Full duplex based collision detection to enhance the V2X sidelink autonomous mode

The Third Generation Partnership Project (3GPP) recently introduced the fifth-generation (5G) new radio (NR) sidelink to enable vehicle-to-everything (V2X) communications supporting advanced safety services. Nevertheless, improvements over the previous generation still pose challenges to meet the reliability and latency requirements of V2X communications, particularly in the allocation of distributed resources, i.e., Mode 2. In Mode 2, vehicles autonomously select radio resources for their message transmissions and can maintain the selected resources for a given reservation period to efficiently handle periodic data traffic. However, potential collisions during this period may remain undetected due to half-duplex communications and unacknowledged broadcast transmissions, resulting in persistent message losses and posing a threat to road safety. This paper aims to improve the 5G NR-V2X sidelink for systems beyond 5G-Advanced by exploiting full-duplex transceivers. We propose a novel medium access control (MAC) scheme where vehicles can detect collisions while transmitting, dynamically adapt the collision detection threshold according to the measured channel load, and react to detected collisions through appropriate resource reselection and retransmission procedures. Extensive simulations conducted under various settings show that this MAC scheme brings substantial performance gains in terms of reliability and latency, compared to the current legacy Mode 2 procedure and a benchmark full-duplex scheme from the literature.

The impact of message losses and retransmissions on quantum cryptographic protocols

Quantum cryptography promises information theoretic security of several cryptographic primitives. Most of the proposed security proofs work in an ideal communication scenario where all messages are correctly delivered after the first attempt. However, real networks are subject to message losses and require retransmissions to cope with them. While the latter is hardly ever a problem in classical cryptography, with quantum communication copy-and-retransmit could be impossible due to the famous no-cloning theorem. In this work, we analyze some quantum cryptoschemes such as public-key encryption, authentication and quantum money, assuming that quantum messages may be lost as they travel through the communication medium. Although all these schemes are theoretically secure, we show that this degree of realism renders some protocols insecure or impractical, while others are completely unaffected. When possible, we provide mitigations such as teleportation or protocol modifications to circumvent these challenges.

A Session Type System for Asynchronous Unreliable Broadcast Communication

Session types are formal specifications of communication protocols, allowing protocol implementations to be verified by typechecking. Up to now, session type disciplines have assumed that the communication medium is reliable, with no loss of messages. However, unreliable broadcast communication is common in a wide class of distributed systems such as ad-hoc and wireless sensor networks. Often such systems have structured communication patterns that should be amenable to analysis by means of session types, but the necessary theory has not previously been developed. We introduce the Unreliable Broadcast Session Calculus, a process calculus with unreliable broadcast communication, and equip it with a session type system that we show is sound. We capture two common operations, broadcast and gather, inhabiting dual session types. Message loss may lead to non-synchronised session endpoints. To further account for unreliability we provide with an autonomous recovery mechanism that does not require acknowledgements from session participants. Our type system ensures soundness, safety, and progress between the synchronised endpoints within a session. We demonstrate the expressiveness of our framework by implementing Paxos, the textbook protocol for reaching consensus in an unreliable, asynchronous network.

DEVELOPMENT OF NETWORK SIMULATION MODEL FOR EVALUATING THE EFFICIENCY OF DISTRIBUTED CONSENSUS TAKING INTO ACCOUNT THE INSTABILITY OF NETWORK CONNECTIONS

The dynamic and unpredictable nature of network environments poses a significant challenge for distributed systems, particularly those relying on consensus algorithms for state management and fault tolerance. To address this challenge, this article introduces a novel simulation model designed to study the impact of unstable network connections on clusters running consensus algorithms. The model is engineered to mimic varying degrees of network instability, including latency fluctuations and connection disruptions, which are characteristic of real-world distributed systems. Our proposed model represents a significant advancement in the simulation of distributed networks. It employs a sophisticated network emulation layer capable of generating a wide spectrum of unstable network conditions. The core of the model is a highly configurable consensus mechanism simulator that allows for the adjustment of key parameters such as heartbeat intervals, election timeouts, and message loss rates. This level of configurability enables a comprehensive analysis of consensus behaviors under different network scenarios. The article focuses on the methodology behind the development of the model, detailing the theoretical underpinnings and the implementation strategies used to ensure a realistic representation of network instability. We also discuss the potential applications of the model, which extend beyond academic research into practical domains where distributed ledger technologies and distributed databases are prevalent. Through the deployment of this model, researchers and system architects can gain deeper insights into the resilience and adaptability of consensus algorithms. The model serves as a tool for preemptively identifying and addressing potential issues in distributed systems, facilitating the development of more robust and reliable technologies. In summary, the article showcases the design and capabilities of a new model that enables an in-depth understanding of the delicate interplay between network instability and consensus efficiency. By focusing on the model itself, the article aims to lay a foundation for future studies and improvements in the field of distributed systems.

A Method for the Rapid Propagation of Emergency Event Notifications in a Long Vehicle Convoy

Convoys composed of autonomous vehicles could improve the transportation and freight industries in several ways. One of the avenues of improvement is in fuel efficiency, where the vehicles maintain a close following distance to each other in order to reduce air resistance by way of the draft effect. While close following distances improve fuel efficiency, they also reduce both the margin of safety and the system’s tolerance to disturbances in relative position. The system’s tolerance to disturbances is known as string stability, where the error magnitude either grows or decays as it propagates rearward through the convoy. One of the major factors in a system’s string stability is its delay in sending state updates to other vehicles, the most pertinent being a hard braking maneuver. Both external sensors and vehicle-to-vehicle communication standards have relatively long delays between peer vehicle state changes and the information being actionable by the ego vehicle. The system presented here, called the Convoy Vehicular Ad Hoc Network (Convoy VANET), was designed to reliably propagate emergency event messages with low delay while maintaining reasonable channel efficiency. It accomplishes this using a combination of several techniques, notably relative position-based retransmission delays. Our results using Network Simulator 3 (ns3) show the system propagating messages down a 20-vehicle convoy in less than 100 ms even with more than a 35% message loss between vehicles that are not immediately adjacent. These simulation results show the potential for this kind of system in situations where emergency information must be disseminated quickly in low-reliability wireless environments.

Fish Tank: An IoT-Based Mini Aquarium Control System

The manual management of aquarium systems is a meticulous process involving hands-on monitoring of various critical parameters such as water quality, feeding, lighting, and maintenance. However, this approach comes with challenges, including significant time consumption, the potential for human errors, and a lack of remote monitoring capabilities. To overcome these challenges, the development of automated smart aquarium systems has emerged as a transformative solution. These systems aim to simplify maintenance, enhance the well-being of aquatic life, provide remote accessibility, and contribute valuable data for research and education in the field. In the context of this evolutionary shift, this paper proposes a comprehensive Fish Tank system built upon the innovative IoT solution, IoT talk. This system utilizes sensors to drive actuators in real-time, enabling intelligent control of various water conditions within the aquarium. A notable feature of this proposed system is the implementation of a precise fish-feeding mechanism, enhancing the overall care provided to aquatic life. The paper goes further to present an analytic model, simulation, and measurement experiments that delve into the effects of IoT message delays and loss on water condition control, contributing valuable insights to the efficiency of the proposed system. Moreover, the proposed Fish Tank system incorporates advanced monitoring tools seamlessly connected to a robust database. This integration allows for efficient data storage and retrieval, enhancing the overall performance and reliability of the system. By extending this connectivity to a mobile application, the solution not only reduces human effort and errors in aquarium management but also provides users with convenient remote access. This transformative approach ensures continuous monitoring and control of the aquarium environment, ultimately contributing to the sustained health and well-being of aquatic life

A checkpointing mechanism for virtual clusters using memory-bound time-multiplexed data transfers

Transparent hypervisor-level checkpoint-restart mechanisms for virtual clusters (VCs) or clusters of virtual machines (VMs) offer an attractive fault tolerance capability for cloud data centers. However, existing mechanisms have suffered from high checkpoint downtimes and overheads. This paper introduces Mekha, a novel hypervisor-level, in-memory coordinated checkpoint-restart mechanism for VCs that leverages precopy live migration. During a VC checkpoint event, Mekha creates a shadow VM for each VM and employs a novel memory-bound timed-multiplex data (MTD) transfer mechanism to replicate the state of each VM to its corresponding shadow VM. We also propose a global ending condition that enables the checkpoint coordinator to control the termination of the MTD algorithm for every VM in a VC, thereby reducing overall checkpoint latency. Furthermore, the checkpoint protocols of Mekha are designed based on barrier synchronizations and virtual time, ensuring the global consistency of checkpoints and utilizing existing data retransmission capabilities to handle message loss. We conducted several experiments to evaluate Mekha using a message passing interface (MPI) application from the NASA advanced supercomputing (NAS) parallel benchmark. The results demonstrate that Mekha significantly reduces checkpoint downtime compared to traditional checkpoint mechanisms. Consequently, Mekha effectively decreases checkpoint overheads while offering efficiency and practicality, making it a viable solution for cloud computing environments.

One-step quantum dialogue

Quantum dialogue (QD) enables two communication parties to directly exchange secret messages simultaneously. In conventional QD protocols, photons need to transmit in the quantum channel for two rounds. In this paper, we propose a one-step QD protocol based on the hyperentanglement. With the help of the non-local hyperentanglement-assisted Bell state measurement (BSM), the photons only need to transmit in the quantum channel once. We prove that our one-step QD protocol is secure in theory and numerically simulate its secret message capacity under practical experimental condition. Compared with previous QD protocols, the one-step QD protocol can effectively simplify the experiment operations and reduce the message loss caused by the photon transmission loss. Meanwhile, the non-local hyperentanglement-assisted BSM has a success probability of 100% and is feasible with linear optical elements. Moreover, combined with the hyperentanglement heralded amplification and purification, our protocol is possible to realize long-distance one-step QD.

Controller placement with critical switch aware in software-defined network (CPCSA).

Software-defined networking (SDN) is a networking architecture with improved efficiency achieved by moving networking decisions from the data plane to provide them critically at the control plane. In a traditional SDN, typically, a single controller is used. However, the complexity of modern networks due to their size and high traffic volume with varied quality of service requirements have introduced high control message communications overhead on the controller. Similarly, the solution found using multiple distributed controllers brings forth the 'controller placement problem' (CPP). Incorporating switch roles in the CPP modelling during network partitioning for controller placement has not been adequately considered by any existing CPP techniques. This article proposes the controller placement algorithm with network partition based on critical switch awareness (CPCSA). CPCSA identifies critical switch in the software defined wide area network (SDWAN) and then partition the network based on the criticality. Subsequently, a controller is assigned to each partition to improve control messages communication overhead, loss, throughput, and flow setup delay. The CPSCSA experimented with real network topologies obtained from the Internet Topology Zoo. Results show that CPCSA has achieved an aggregate reduction in the controller's overhead by 73%, loss by 51%, and latency by 16% while improving throughput by 16% compared to the benchmark algorithms.

SYNTHESIS OF A COMPUTER NETWORK FOR CONTROLLING MOVING OBJECTS

Today, there are many methods of synthesis of the basic network of the computer control system. But they do not take into account the mobility of control objects. Therefore, the purpose of the article is to develop a method of synthesis of the basic network of the computer control system, which takes into account the mobility of control objects. The method is based on the use of the function of the average loss of messages in the network at the input load and the dynamic resource allocation plan. Regardless of the selected class of the basic network, the developed method assumes: the selection of an appropriate management efficiency assessment function; synthesis of control algorithms for restricting access to the network; synthesis of adaptive routing algorithms that ensure optimal distribution of flows on the short-circuit network. The direction of further research is to take into account the placement of base stations of the computer system.

Asynchronous Byzantine reliable broadcast with a message adversary

This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behave arbitrarily (Byzantine processes). In addition, for each message m broadcast by a correct (i.e., non-Byzantine) process, a message adversary may prevent up to d correct processes from receiving m. (This message adversary captures network failures such as transient disconnections, silent churn, or message losses.) Considering such a “double” adversarial context and assuming n>3t+2d, a reliable broadcast algorithm is presented. Interestingly, when there is no message adversary (i.e., d=0), the algorithm terminates in two communication steps (so, in this case, this algorithm is optimal in terms of both Byzantine tolerance and time efficiency). It is then shown that the condition n>3t+2d is necessary for implementing reliable broadcast in the presence of both Byzantine processes and a message adversary (whether the underlying system is enriched with signatures or not).

UDP-RT: A UDP-based reliable transmission scheme for power WAPS

It is expected that TCP/IP networks take the place of point-to-point fiber channels for the communications of WAPS. In TCP/IP networks, TCP does not guarantee real-time while UDP does not guarantee reliability. An efficient method is demanded for WAPS to guarantee the real-time and reliability of messages transmitted in TCP/IP networks under congestion states. To address the challenge, we propose a UDP-based reliable transmission (UDP-RT) scheme, which achieves low latency by adopting UDP at the transport layer and high reliability by adding the mechanisms of error correction, error detection, resending and timeout retransmission at the application layer. The error correction mechanism employs TPCs, which has low complexity and good performance at high code rate, to correct errors in a message. A blocking rule for TPCs considering the features of communication channels and messages of WAPS is presented. The error detection mechanism is for detecting whether all errors in the message are corrected by the error correction mechanism. The resending mechanism and the timeout retransmission mechanism (optional) is for ensuring the reliability in the two cases of message loss and not all errors corrected. Additionally, algorithms for UDP-RT are presented, and their correctness are validated through experiment. Our analyses demonstrate that the proposed scheme can meet the real-time requirements of WAPS businesses when network congesting and has higher reliability than the TCP transmission scheme and other UDP transmission schemes.

Efficient Anonymous Batch Authentication Scheme With Conditional Privacy in the Internet of Vehicles (IoV) Applications

The Internet of Vehicles (IoV) has emerged as a robust solution to improve real-time road traffic conditions, safety, and driving comfort. However, the road’s dynamic environment and network heterogeneity make communication insecure. It poses many security threats like man-in-the-middle attacks, impersonation attacks, replay attacks, etc. Therefore, the message exchanges and real identities of nodes over the IoV network need to be preserved. The existing authentication schemes are inefficient and incur computational and communication overhead. They are unsuitable for resource-constrained IoV networks due to their highly dynamic nature, open communication, and chaotic road environment. Therefore, this paper proposes an elliptic curve cryptography-based secure and efficient anonymous batch authentication scheme with conditional privacy (EABAS-CP) for the IoV environment. The EABAS-CP scheme achieves conditional privacy by tracing the malicious vehicle efficiently. The RSU’s distributed parameters generate a pseudo-identity for vehicles and unique signatures that do not require secure channels and trusted authorities (TAs) for secure communication. Furthermore, the EABAS-CP scheme supports batch signature verification in which multiple signatures can be verified simultaneously and efficiently. The Random Oracle Model (RoM) provides unforgeability against adaptive message attacks by using the Elliptic Curve Discrete Logarithm Problem (ECDLP). The AVISPA simulation tool is used to evaluate the proposed protocol for its reliability and protection from the attacks like man-in-the-middle and replay attacks. The proposed EABAS-CP scheme is also proven secure against replay, impersonation, stolen verifier, ephemeral secret leakage, and linkability attacks. The network performance of the EABAS-CP scheme has been evaluated in terms of end-to-end delay, throughput, average message delay, average message loss ratio, communication cost, and computation cost through the NS-2 simulator and compared with existing schemes to demonstrate its efficiency.

Multifactor QoE scores in IoT topologies

Quality of Experience (QoE) is key to Internet of Things (IoT) applications. Indeed, depending on the nature of the application, different application message loss and latency requirements lead to different QoE metrics. In this context, and considering as inspiration the Mean Option Scores (MOS) typically associated with Real Time Communication (RTC), this paper introduces QoE scores that can be used to assess the performance of IoT applications. Taking into account physical, link, network, transport, and application layer features like the transmission rate, network layer loss and latency, the topology and the session layer protocol under consideration, linear regression mechanisms are used to estimate these QoE scores. Some of these features are regular system parameters while others are extracted from standard mechanisms and protocols used for traffic analysis as Key Performance Indicators (KPIs). This model is then trained and evaluated against a large number of Wireless Personal Area Network (WPAN) and Low Power Wide Area Network (LPWAN) architectures.

BEPHAP: A Blockchain-based Efficient Privacy-Preserving Handover Authentication Protocol with key agreement for Internet of Vehicles

The Internet of Vehicles (IoV) can significantly improve transportation efficiency and ensure traffic safety. Authentication is regarded as the fundamental defense line against attacks in IoV. However, the state-of-the-art approaches suffer from several drawbacks, including bottlenecks of the single cloud server model, high computational overhead of operations, excessive trust in cloud servers and roadside units (RSUs), and leakage of vehicle trajectory privacy. This paper introduces BEPHAP, a Blockchain-based Efficient Privacy-preserving Handover Authentication Protocol with key agreement for internet of vehicles, to address these problems. BEPHAP achieves anonymous cross-domain mutual handover authentication with key agreement based on the tamper-proof blockchain, symmetric cryptography, and the chameleon hash function under a security model that cloud servers and RSUs may launch attacks. BEPHAP is particularly well suited for IoV since it allows vehicles to only perform lightweight cryptographic operations during authentication. BEPHAP also achieves data confidentiality, unlinkability, traceability, non-repudiation, non-frameability, and key escrow freeness. Formal verification based on ProVerif and formal security proofs based on the BAN logic indicates that BEPHAP is resistant to various typical attacks, such as man-in-the-middle attacks, impersonation attacks, and replay attacks. Performance analysis demonstrates that BEPHAP surpasses existing works in both computation and communication efficiencies. It is worth noting that BEPHAP reduces the computational cost of vehicles by 2 to 4 orders of magnitude compared to current schemes. And the message loss rate remains 0 at 5000 requests per second, which meets the requirement of IoV.

The effects of message framing on self-management behavior among people with type 2 diabetes: A randomized controlled trial

BackgroundMessage framing describes how information is communicated and demonstrated to influence its effect on future attitudes and behaviors. Message content can be structured as ‘gain-framed’, emphasizing the benefits of engagement as recommended, whereas ‘loss-framed’ describes the negative consequences of not engaging as recommended. However, the impact of message framing on behavior change in people with chronic diseases like diabetes is not well understood. ObjectiveAnalyze the impact of message framing in diabetes education on self-management in people with type 2 diabetes, and identify potential moderating effects of patient activation on message framing. DesignA three-arm randomized controlled trial was performed. Setting(s)Participants were recruited from inpatients in the endocrine and metabolic unit of a university-affiliated hospital in Changchun. ParticipantsA total of 84 adults with type 2 diabetes were equally randomized into gain-, loss-, or no-message framing groups and received a 12-week intervention. MethodsBoth the message framing groups received 30 video messages. One group of participants received the gain-framed messages emphasizing desirable outcomes from effective diabetes self-care. The other group of participants received the loss-framed messages emphasizing the undesirable consequences of ineffective diabetes self-care. The control group received 30 videos about diabetes self-care without message framing. Self-management behavior, self-efficacy, patient activation, diabetes knowledge, attitudes, and quality of life were measured at baseline and 12 weeks. ResultsCompared with the control group, participants who watched either gain or loss-framed messages had significant increases in self-management behavior and quality of life after the intervention. The scores of self-efficacy, patient activation, knowledge, and attitudes of the loss-framing group were considerably higher than the control group. Further analysis revealed an interaction between patient activation and message framing (P = 0.002), with gain and loss message framing interventions more effective in increasing self-management behaviors in people with type 2 diabetes who had a higher and lower activation level, respectively. ConclusionsUsing message framing in diabetes education is a promising strategy to build and foster self-management behavior. It also suggests that appropriate message framing be chosen to enhance self-management behavior based on the level of patient activation. Registration numberChiCTR2100045772.

TRUCON: Blockchain-Based Trusted Data Sharing With Congestion Control in Internet of Vehicles

The Internet of vehicles (IoV) has a substantial impact on traffic efficiency improvement and accidents avoidance. Due to restricted resources, vehicles must share observed data with RSUs and other vehicles to execute some time-tolerant computing tasks. However, data provided by vehicles cannot always be trusted due to the presence of attackers. Fake messages could have catastrophic ramifications, such as vehicle collisions. Furthermore, extensive data sharing might cause channel congestion, resulting in the loss of vital messages during delivery. To overcome the aforementioned issues, we propose TRUCON, a blockchain-based trusted data sharing mechanism with congestion control in IoV. Firstly, we propose a Kademlia algorithm-based traffic data forwarding method to control channel congestion state. By adjusting the bucket size and distance threshold, source vehicles can limit the number of reference vehicles forwarded. Secondly, we present a cuckoo filter-based traffic data deduplication and discrimination approach. To avoid repetitive sharing, vehicles and RSUs can check their local filters to verify if the current data report has been shared. Based on the foregoing, we propose a blockchain-based trust management mechanism with congestion control. RSUs serve as full nodes while vehicles are light nodes in the blockchain. Finally, we develop a trust management prototype system with congestion control that incorporates both on-chain and off-chain parts. It signifies that our scheme is both feasible and effective.

Simulative Assessment of the Listen before Talk Adaptive Frequency Agility Medium Access Control Protocol for LoRaWAN Networks in IoT Scenarios

The work presents an extensive simulative assessment of a LoRaWAN network that adopts the Listen Before Talk (LBT) Adaptive Frequency Agility (AFA) channel access technique in compliance with the ETSI regulations. The paper presents the results obtained in several scenarios with a different number of nodes and different configurations of the LoRaWAN Medium Access Control (MAC) parameters. The aim of the paper is to give insights about the performance achievable by changing the configuration parameters. For example, in all the scenarios considered in this work, once the number of nodes is fixed, the impact on the message loss ratio of the considered MAC parameters is always lower than 7%. Conversely, the impact of such parameters on the end-to-end delay is much more significant. The methodology of this assessment is of general validity and can be exploited by the network designer during the network configuration phase to obtain the most suitable combination of the MAC parameters for the network under consideration, based on the number of nodes and the application requirements.