Reliable Message Transmission Research Articles

Semantic Information Recovery in Wireless Networks.

Motivated by the recent success of Machine Learning (ML) tools in wireless communications, the idea of semantic communication by Weaver from 1949 has gained attention. It breaks with Shannon's classic design paradigm by aiming to transmit the meaning of a message, i.e., semantics, rather than its exact version and, thus, enables savings in information rate. In this work, we extend the fundamental approach from Basu et al. for modeling semantics to the complete communications Markov chain. Thus, we model semantics by means of hidden random variables and define the semantic communication task as the data-reduced and reliable transmission of messages over a communication channel such that semantics is best preserved. We consider this task as an end-to-end Information Bottleneck problem, enabling compression while preserving relevant information. As a solution approach, we propose the ML-based semantic communication system SINFONY and use it for a distributed multipoint scenario; SINFONY communicates the meaning behind multiple messages that are observed at different senders to a single receiver for semantic recovery. We analyze SINFONY by processing images as message examples. Numerical results reveal a tremendous rate-normalized SNR shift up to 20 dB compared to classically designed communication systems.

Method for calculation indicators steganographic systems in multiservice communication networks

An analysis of the performance indicators multiservice telecommunication networks using the sixth technological order based on the NGN (Next Generation Network) architectural concept and future FN (Future Networks) networks was carried out to build high-performance steganographic systems with increased covert channels throughput, ensuring the achievement of a certain level information security. Comprehensive criteria for the efficiency the functioning steganographic systems are considered and the channel capacity of the steganosystem as a communication system with packet switching is selected. On the basis of the study, a new approach to constructing a method for evaluating complex indicators of the quality of steganographic communication during embedding and extracting hidden data is proposed. The quality of steganographic communication refers to the properties stegano communication to ensure the efficiency of the system, both timely and reliable transmission of messages. On the basis of the proposed approach, the effectiveness steganographic systems in the construction of covert channels for the transmission secret data transmitted over communication channels was studied. Taking into account the new entropy approach, a method for calculating the indicators of the latent throughput steganographic systems in packet-switched communication networks has been created. As a result of the study calculation method, important analytical expressions were obtained for evaluating complex indicators throughput steganographic systems, such as the throughput of covert channels, the maximum possible value of the performance of a binary source packets, the average packet transmission time with the proposed coding scheme, and the residual throughput of the communication channel.

HPIM‐DM: A fast and reliable dense‐mode multicast routing protocol

AbstractThe Hard‐state Protocol Independent Multicast—Dense Mode (HPIM‐DM) multicast routing protocol is proposed. HPIM‐DM is a hard‐state version of PIM‐DM that overcomes its poor convergence times and lack of resilience to replay attacks. Like PIM‐DM, HPIM‐DM is meant for dense networks and supports its operation on a unicast routing protocol and reverse path forwarding. However, routers maintain sense of the multicast trees at all times, allowing fast reconfiguration in the presence of network failures or unicast route changes. This is achieved by (i) keeping information on all upstream neighbours from which multicast data can be received, (ii) ensuring the reliable transmission and sequencing of control messages, and (iii) synchronizing the routing information immediately when a new router joins the network. The correctness of the protocol was extensively validated using model checking and logical reasoning. The protocol was fully implemented in Python, and the implementation is publicly available. Finally, we show both theoretically and experimentally that HPIM‐DM has much better convergence times than PIM‐DM.

METHOD FOR CALCULATION MAXIMUM THROUGHPUT HIDDEN CHANNELS IN SYSTEMS OF STEGANOGRAPHIC COMMUNICATIONS

An analysis of the performance indicators multiservice telecommunication networks using the sixth technological order based on the NGN (Next Generation Network) architectural concept and future FN (Future Networks) networks was carried out to build high-performance steganographic systems with increased covert channels through-put, ensuring the achievement of a certain level information security. Comprehensive criteria for the efficiency the functioning steganographic systems are considered and the channel capacity of the steganosystem as a communication system with packet switching is selected. On the basis of the study, a new approach to constructing a method for evaluating complex indicators of the quality of steganographic communication during embedding and extracting hidden data is proposed. The quality of steganographic communication refers to the properties steganocommunication to ensure the efficiency of the system, both timely and reliable transmission of messages. On the basis of the proposed approach, the effectiveness steganographic systems in the construction of covert channels for the transmission secret data transmitted over communication channels was studied. Taking into account the new entropy approach, a method for calculating the indicators of the latent throughput steganographic systems in packet- switched communication networks has been created. As a result of the study calculation method, important analytical expressions were obtained for evaluating complex indicators throughput steganographic systems, such as the throughput of covert channels, the maximum possible value of the performance of a binary source packets, the average packet transmission time with the proposed coding scheme, and the residual throughput of the communication channel. Based on the results obtained, covert channel performance in steganographic systems was simulated using the Communications Toolbox package, an extension of the standard Matlab environment designed for calculating and modeling communication systems. The table contains indicators of the residual throughput of the system and the parameters of covert channel, taking into account the lengths of the headers of the network and channel levels of the open systems interaction models. With the considered method counteraction, a graphical dependence of the maximum value residual system throughput on the covert channel parameter is plotted. On the basis of the analysis, actual problems are identified, recommendations are developed to improve the efficiency of the use steganographic systems architectures for multiservice telecommunication networks.

Privacy Preserving Reliable Data Transmission in Cluster Based Vehicular Adhoc Networks

VANETs are a subclass of mobile ad hoc networks (MANETs) that enable efficient data transmission between vehicles and other vehicles, road side units (RSUs), and infrastructure. The purpose of VANET is to enhance security, road traffic management, and traveler services. Due to the nature of real-time issues such as reliability and privacy, messages transmitted via the VANET must be secret and confidential. As a result, this study provides a method for privacy-preserving reliable data transmission in a cluster-based VANET employing Fog Computing (PPRDA-FC). The PPRDA-FC technique suggested here seeks to ensure reliable message transmission by utilising FC and an optimal set of cluster heads (CH). The proposed PPRDA-FC technique utilizes a moth flame optimization with levy flight based clustering (MFO-LFC) process to identify and form clusters from a suitable set of CHs. The CHs are responsible for monitoring each vehicle in their respective clusters. Simultaneously, the CHs provide the most efficient and secure pathways for message transmission. Finally, a deep neural network (DNN) is used as a classification tool to distinguish between attacker-controlled and real-world automobiles. To evaluate the suggested PPRDA-FC technique’s increased performance, a series of simulations were run and the results analyzed using a variety of metrics. The acquired experimental findings illustrate the suggested PPRDA-FC technique’s superiority to recent state-of-the-art procedures.

THE TRANSPORT LAYER OF THE ISO/OSI MODEL IN COM­PUTER NETWORKS

Background. The transport layer is designed to deliver data without errors, losses and duplication in the order in which they were transmitted. It provides data transfer between two applications with the required level of reliability. Transport layer protocols, which guarantee reliable data delivery, establish a virtual connection before data exchange and resend segments in case of loss or damage. The aim of the study was to determine the role of transport security protocols in computer networks. Materials and methods. To achieve the goal, the study used statistical analysis and a systematic approach. Results. TCP provides reliable message transmission through the formation of logical connections, while allowing peers on the sending computer and the receiving computer to support data exchange in duplex mode. It also has the ability to seamlessly send a byte stream generated on one of the computers to any other computer connected to the network.In addition, TCP controls the connection load, UDP does not control anything but the integrity of the received datagrams. Conclusion. The difference between TCP and UDP is the so-called "delivery guarantee". TCP requires a response from the client to whom the data packet is delivered, confirmation of delivery, and for this he needs a pre-established connection. TCP is also considered reliable, unlike UDP, which is called "unreliable datagram protocol". TCP eliminates data loss, duplication and shuffling of packets, delays, UDP allows all this, and it does not need a connection to work., as a result of which the data is transferred on UDP, should manage received, even with losses.

A batch delivery mechanism of network update in software‐defined wide area networks

SummaryIn software‐defined network (SDN) architecture, the network decisions are all located on a logically centralized controller. Based on installing rules into switches of the data plane, the controller directly initiates and schedules a network update and which will cause a delay in the completion time of a network update. The situation is aggravated in wide area networks (WANs) further due to the switches deployed in a wide geographical area bring long propagation delay. On account of adopting the in‐band transmission style to deliver control messages instead of dedicated control channels is economics in WANs, the retransmission of control messages causing by congestion of the data channels is another unbearable delay source. This paper describes a new control information batch delivery mechanism (CIBDM) of network updates to relieve the delay and enhance the reliability of control message transmission in SD‐WANs. The characteristics of the novel scheme include the following: (1) every control information message may contain multiple update information of different forwarding devices, and each update information consists of a set of update instructions with dependencies; (2) by using a similar mechanism of onion routing, in the delivering process of control messages, it attains the security for each control rule of the specified devices; (3) with delegating the update consistency coordination into the data plane, it improves network update on the completion time. A comprehensive evaluation runs on 10 network topologies selected from all over the world. Experimental results show that CIBDM achieves rapid network updates with reliable message transmission.

RPO-MAC: reciprocal Partially observable MAC protocol based on application-value-awareness in VANETs

Numerous safety-related applications have rigid requirements for the threshold of latency limitation of message transmissions to enhance safety and traffic efficiency of vehicles on the road in vehicular ad-hoc networks (VANETs). Consequently, a medium access control (MAC) protocol for reliable and fast transmission of safety messages should focus on the maximum transmission delay. Herein, we refer to the concept of packet value and integrate it with the latency of different messages determined by the waiting interval of packets in a queue. Subsequently, we propose a reciprocal revenue function, i.e., the transmission probability of the participants, by considering both its own benefit and the other nodes’ revenue. Additionally, an inter-vehicle cross-layer cooperative game model based on the local optimal utility of participants is constructed. We then theoretically prove the existence of an equilibrium using the partially observable Markov decision process (POMDP), and provide a specific approach for obtaining the channel access probability of a vehicle by using deep reinforcement learning. Finally, the analysis and simulation results in saturated and non-saturated data traffic conditions are presented to evaluate the performance of Reciprocal Partially Observable MAC Protocol (RPO-MAC) proposed in this paper and compare it with the IEEE 802.11p standard protocol. These comparisons demonstrate the advantages of our proposed reciprocal revenue game method in the case of channel network congestion, especially in terms of delay. It is shown that the RPO-MAC protocol can provide a strong support to delay-sensitive safety related applications.

Transmission Power Control for Anchor-Assisted Localization in Wireless Sensor Networks

Energy-efficiency and localization play significant roles in Wireless Sensor Networks. Localization provides geographical information about the sensors deployed in a certain geographical region. Single mobile anchor-assisted localization is considered as an energy-efficient approach where numerous GPS-equipped sensors are removed to reduce the consumption of energy in the network. In recent years, various path planning mechanisms for mobile anchor have been proposed with single transmission power assigned to the anchor. Preservation of power is critical while performing mobile beacon-assisted localization so as to increase the lifetime. Providing the ability to dynamically adjust transmission power for the anchor node does not only reduce the energy consumption but also improves the overall performance of the localization. In this article, we propose a new trajectory, Anchor-power, that provides transmission power control for the mobile beacon. Anchor-power efficiently adjusts the transmission power of the beacon node for the reliable transmission of beacon messages. Experimental results reveal that our proposed approach enables unknown sensors to locate themselves with better accuracy in comparison with the existing models. Anchor-power improves performance in terms of accuracy and energy efficiency along with the localization success ratio and localization time.

On one-round reliable message transmission

In this paper, we consider one-round protocols for reliable message transmission (RMT) when t out of n=2t+1 available channels are controlled by an adversary. We show impossibility of constructing such a protocol that achieves a transmission rate of less than Θ(n) for constant-size messages and arbitrary reliability parameter. In addition, we show how to improve two existing protocols for RMT to allow for either larger messages or reduced field sizes.

Performance analysis of ZigBee network topologies for underground space monitoring and communication systems

The advancement in tunnelling and underground space technologies and the need for large scale monitoring and communication systems for safe and efficient operations has triggered the era of wireless sensor networks (WSNs). The progress of WSNs have been associated with the innovation of sensor nodes with the more significant features of smaller size, more cost-effectiveness, lower latency and powerful antenna coverage. The sensor nodes arrangement in dense industrial WSNs is one of the crucial issues for a better quality of service and a reliable message transmission through the network. In this study, we investigate various sensor node arrangements of ZigBee networks for underground space monitoring and communication systems. The performance of ZigBee topologies are analysed in 12, 20, 30, 40 and 50-node scenarios for stationary node deployment in underground environments. The metrics used for the performance evaluation include throughput, packet delivery ratio (PDR), end-to-end delay, energy consumption and packet delivery security. The results evaluation confirms the mesh topology is prioritised in WSNs design considering higher throughput, packet delivery ratio and network security, while the cluster-tree topology is preferred in case of lower end-to-end delay and lower energy consumption. The analyses show that the mesh topology creates a more reliable monitoring and communication network with an adequate quality of service in underground spaces and tunnels. Therefore, greater end-to-end delay and energy consumption could not be major concerns for the mesh topology in underground mine applications based on the acceptable data latency and using mine power.

Information theoretic approach in molecular interactions and implications in molecular evolution

Shannon’s information communication theory tells much about the reliable message transmission and has a wide scope of application in communication technologies. The aim of this work is to present the implementation of the information communication theory in the cellular recognition or molecular interaction event models to quantify the message transmission capacities of molecular binding patterns and complexes. It has implications in molecular evolution such that the pattern formation by varied combinations of a possible number of binding events does not necessitate the presence of different types of receptor–ligand complexes. Signals through the same and different types of receptor–ligand complexes seem to have equal information amounts. This is suggesting the possible role of pattern formation in differentiation of distinct conditions, maybe even changing local concentration gradients or so, through sensing the patterns of relevance. Further, recognition of the patterns that are formed up of the same binding partners would be the step preceding the recognition of the patterns with discrete binding partners. All these considerations are valid for cellular networks, wherein the communicating cells are the sources of binding target molecules and are thus imposing diffusion dependent concentration gradients and variations in the probabilities of the binding events.

Design and Implementation of a Reliable Message Transmission System Based on MQTT Protocol in IoT

Internet of Things is one of most important IT trend and it is getting more popular in home automation fast. A message transmission system is important component in an IoT device for collecting dat...

CoAP-based Reliable Message Transmission Scheme in IoT Environments

In this paper, we propose reliable message transmission scheme based on CoAP, considering the constrained feature of IoT device, such as low power, the limited memory size and low computing capacity. Recently, the various kinds of application protocol has been studied to support IoT environments. In particular, CoAP protocol was developed as application protocol for IoT at the IETF core WG. However, because CoAP protocol is deigned to be used in constrained node, this protocol uses UDP at transport layer. Thus, data loss may occur frequently in network congestion environments. The proposed scheme, in this paper, is to overcome the problem of frequent data loss with low overhead. Also it includes the function which is to minimize the data loss in sleep mode of IoT device.

Event-Driven Messaging for Offline Data Quality Monitoring at ATLAS

During LHC Run 1, the information flow through the offline data quality monitoring in ATLAS relied heavily on chains of processes polling each other's outputs for handshaking purposes. This resulted in a fragile architecture with many possible points of failure and an inability to monitor the overall state of the distributed system. We report on the status of a project undertaken during the LHC shutdown to replace the ad hoc synchronization methods with a uniform message queue system. This enables the use of standard protocols to connect processes on multiple hosts; reliable transmission of messages between possibly unreliable programs; easy monitoring of the information flow; and the removal of inefficient polling-based communication.

LTE Mobility Enhancements for Evolution into 5G

Network densification is regarded as the dominant driver for wireless evolution into the era of 5G. However, in this context, interference-limited dense small cell deployments are facing technical challenges in mobility management. The recently announced results from an LTE field test conducted in a dense urban area show a handover failure (HOF) rate of over 21%. A major cause of HOFs is the transmission failure of handover command (HO CMD) messages. In this paper, we propose two enhancements to HO performance in LTE networks — radio link failure-proactive HO, which helps with the reliable transmission of HO CMD messages while the user equipment is under a poor radio link condition, and Early Handover Preparation with Ping-Pong Avoidance (EHOPPPA) HO, which assures reliable transmission of HO CMD under a good radio link condition. We analyze the HO performance of EHOPPPA HO theoretically, and perform simulations to compare the performance of the proposed schemes with that of standard LTE HO. We show that they can decrease the HOF rate to nearly zero through an analysis, and based on the simulation results, by over 70%, without increasing the ping-pong probability.

End-to-end Reliable Message Transmission Considering Load Balancing in Wireless Networks

This paper proposes a load balanced reliable routing protocol called LBR (Load Balanced Reliable routing) in wireless networks. The LBR protocol transmits messages through a reliable path considering the balancing of the traffic load. Recently, the authors have proposed a multipath-based reliable routing protocol called MRFR, which is an appealing protocol for fault tolerant reliable data transmission. However, However, MRFR has no concern with the problem of load balancing, which results in increasing congestion and consuming high energy at some network nodes. As a result, the problem affects negatively the performance of the network. Taking account of load balancing as a route selection criteria can avoid routing through the congested nodes and allows to find better routes. In this paper, we extend MRFR by considering load balancing in the route discovery process of reliable communication. The simulation results showed that the proposed protocol outperforms AODV in terms of end-to-end delay, packet delivery radio, and average jitter. Compared to MRFR, the LBR protocol has the same packet delivery ratio, and obtains a better efficiency of load balancing.

Interplay between (im)perfectness, synchrony and connectivity: The case of reliable message transmission

Reliable message transmission is a fundamental problem in distributed communication networks. Of late, several interesting results have been obtained by modelling the network as a directed graph. An important result among them was due to Bhavani et al. [Unconditionally reliable message transmission in directed networks, 18 in: SODA’08: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, USA, 2008, pp. 1048–1055], where it was shown that if a negligible probability of error is allowed, the connectivity required in a synchronous network for unconditionally reliable message transmission (URMT) is significantly reduced.We refer to the variant of URMT studied by them as Monte Carlo URMT; here the receiver is allowed to output an incorrect message with small probability. Another interesting variant which has received little attention so far in the literature is the Las Vegas variant, where the receiver is allowed to abort with a small probability, but never to output an incorrect message.We show that the minimum connectivity requirements for the existence of Las Vegas URMT protocols over synchronous networks are the same as that of Monte Carlo URMT protocols over asynchronous networks—a surprising equivalence between two very different models. Furthermore, we show that the higher connectivity requirements of Las Vegas URMT over asynchronous networks match exactly with that of zero-error (perfect) variant over (a)synchronous networks. We also show that there exists a family of graphs where in the number of critical edges for the ‘easier’ randomized variants are asymptotically higher than that for the perfect variants.Hence, our results demonstrate an interesting interplay between (im)perfectness, synchrony and connectivity for the case of reliable message transmission.

DBR: A Simple, Fast and Efficient Dynamic Network Reconfiguration Mechanism Based on Deadlock Recovery Scheme

Dynamic network reconfiguration is described as the process of replacing one routing function with another while the network keeps running. The main challenge is avoiding deadlock anomalies while keeping limitations on message injection and forwarding minimal. Current approaches, whose complexity is so high that their practical applicability is limited, either require the existence of extra network resources like virtual channels, or they affect the performance of the network during the reconfiguration process. In this paper we present a simple, fast and efficient mechanism for dynamic network reconfiguration which is based on regressive deadlock recoveries instead of avoiding deadlocks. The mechanism which is referred to as DBR guarantees a deadlock-free reconfiguration based on wormhole switching (WS) and it does not require additional resources. In this approach, the need for a reliable message transmission has led to a modified WS mechanism which includes additional flits or control signals. DBR allows cycles to be formed and in such conditions when a deadlock occurs, the messages suffer from time-out. Then, this method releases the buffers and channels from the current node and thus the source retransmits the message after a random time gap. Evaluating results reveal that the mechanism shows substantial performance improvements over the other methods and it works efficiently in different topologies with various routing algorithms.

On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission

Perfectly reliable message transmission (PRMT) is one of the fundamental problems in distributed computing. It allows a sender to reliably transmit a message to a receiver in an unreliable network, even in the presence of a computationally unbounded adversary. In this article, we study the inherent trade-off between the three important parameters of the PRMT protocols, namely, the network connectivity ( n ), the round complexity ( r ), and the communication complexity by considering the following generic question (which can be considered as the holy grail problem) in the context of the PRMT protocols. Given an n -connected network, a message of size ℓ (to be reliably communicated) and a limit c for the total communication allowed between the sender and the receiver, what is the minimum number of communication rounds required by a PRMT protocol to send the message, such that the communication complexity of the protocol is O( c )? We answer this interesting question by deriving a nontrivial lower bound on the round complexity. Moreover, we show that the lower bound is tight in the amortized sense, by designing a PRMT protocol whose round complexity matches the lower bound. The lower bound is the first of its kind, that simultaneously captures the inherent tradeoff between the three important parameters of a PRMT protocol.