Message Transmission Protocol Research Articles

Fractional mayfly optimization algorithm‐based Infrastructure‐to‐Vehicle and Vehicle‐to‐Vehicle scheduling for service message transmission in IoV‐fog

SummaryFor the rising number of vehicles, and the advancement of communication and computation technologies, the perception of Internet of Vehicles (IoV) is introduced. It is utilized to capture vehicle‐based information that includes road description, road congestion, vehicle speed, and location. However, this information is important, and it showed more benefits in different ways, like route selection and message dissemination. IoV is the self‐structured network composed with vehicles lies in the road and the road side units (RSUs). It offers Infrastructure‐to‐Vehicle (I2V), as well as Vehicle‐to‐Vehicle (V2V) data transmission mechanism for transmitting service messages. To reliably broadcast the service information to the intended recipient in the IoV network still faced issues. Hence, an efficient service message transmission protocol is developed using the proposed fractional mayfly optimization algorithm (FMA) for selecting the relay vehicle and cooperative vehicle for transmitting service messages to the destination vehicle from RSU through the process of I2V and V2V scheduling. The RSU selects the relay vehicle for every service message using the proposed algorithm and allocates the cooperative vehicle by RSU for scheduling V2V transmission. The simulation results showed that the proposed scheduling method obtains the best channel quality indicator (CQI), delay, distance, packet delivery ratio (PDR), and throughput value of 0.92 for 150 vehicles and 0.005891, 6.060731, 83.45%, and 171.50 Mbps for 100 vehicles.

РАЗРАБОТКА СИСТЕМЫ СВЯЗИ НА ОСНОВЕ ПЕРЕДАЧИ ИНФОРМАЦИИ ЗА СЧЕТ МАГНИТНОЙ КОМПОНЕНТЫ ЭЛЕКТРОМАГНИТНОГО ПОЛЯ

A communication system based on the transmission of information due to the magnetic component of the electromagnetic field has been developed. The review of the subject area and prerequisites for the creation of a magnetic communication system is carried out. The purpose and objectives of the study are formulated. The purpose of the study: to develop a communication system that provides a wireless channel for transmitting information through the thickness of conductive matter. The relevance of the research is justified by the need to provide wireless communication through the thickness of the conductive medium in local execution conditions with limited radiation power. A general concept of the communication system has been developed, as well as its constituent elements: a magnetic field sensor, a magnetic emitter, a modulation method, and a message transmission protocol. A prototype of a magnetic communication system has been manufactured. Subject of research: wireless transmission of information due to the magnetic component of the electromagnetic field. Object of research: information transmission system. Methodology: a set of methods and tools for the development of elements and nodes of wireless communication in relation to the information transmission system due to the magnetic component of the electromagnetic field. The main result: a wireless communication system has been developed using a magnetic component of an electromagnetic field. Practical significance: the results of the research can be useful for automation and telecommunications systems, the organization of wireless communication through environments with significant electromagnetic wave absorption.

An In-depth Guide to Cross-chain Protocols under a Multi-chain World

In 2021, public blockchains have made remarkable progress with the support of investors and developers, ushering in the era of the multi-chain world, which represents a paradigm shift that is unlikely to be reversed. Cross-chain protocols have become an essential infrastructure in this new world, referring to a standardized set of rules and processes that enable the secure transfer of assets or information between different blockchain networks. To help researchers and industry practitioners better understand the concepts, advantages, and limitations of cross-chain technologies, this paper presents a comprehensive guide to cross-chain protocols. We cover a range of topics, including message transmission protocols, leading cross-chain bridges, and other cross-chain applications. Additionally, we discuss potential risks and challenges associated with cross-chain protocols and explore the future of cross-chain protocol development. Our work is intended to offer valuable insights and references for anyone looking to delve deeper into cross-chain protocols, whether they are academic researchers or industry professionals.

Improved Delay and PDR For Iov-Fog Nets Using Fractional Mayfly Optimization Algorithm

The integration of the automobile industry with communication technology has led to the concept of the Internet of Vehicles (IoV). It is a self-organized network that consists of vehicles and RSUs and employs Infrastructure-to-Vehicle (I2V) and Vehicle-to-Vehicle (V2V) data transmission mechanisms. The IoV system uses an efficient service message transmission protocol, the Fractional Mayfly algorithm (FMA), for reliable broadcasting of service information. Experimental results indicate that the FMA-based scheduling method is superior in terms of delay and PDR, particularly for 100 and 150 vehicles. The Fog Computing approach is also used for communication and data processing in the IoV system.

Approbation of the stochastic group virus protection model

The article discusses the implementation in Java of the stochastic collaborative virus defense model developed within the framework of the Distributed Object-Based Stochastic Hybrid Systems (DOBSHS) model and its analysis. The goal of the work is to test the model in conditions close to the real world on the way to introducing its use in the practical environment. We propose a method of translating a system specification in the SHYMaude language, intended for the specification and analysis of DOBSHS models in the rewriting logic framework, into the corresponding Java implementation. The resulting Java system is deployed on virtual machines, the virus and the group virus alert system are modeled stochastically. To analyze the system we use several metrics, such as the saturation time of the virus propagation, the proportion of infected nodes upon reaching saturation and the maximal virus propagation speed. We use Monte Carlo method with the computation of confidence intervals to obtain estimates of the selected metrics. We perform analysis on the basis of the sigmoid virus propagation graph over time in the presence of the defense system. We implemented two versions of the system using two protocols for transmitting messages between nodes, TCP/IP and UDP. We measured the influence of the protocol type and the associated costs on the defense system effectiveness. To assess the potential of cost reduction associated with the use of different message transmission protocols, we performed analysis of the original DOBSHS model modified to model message transmission delays. We measured the influence of other model parameters important for the next steps towards the practical use of the model. To address the system scalability, we propose a hierarchical approach to the system design to make possible its use with a large number of nodes.

Privacy-Preserving and Verifiable Outsourcing Message Transmission and Authentication Protocol in Iot with Edge Computing

Privacy-Preserving and Verifiable Outsourcing Message Transmission and Authentication Protocol in Iot with Edge Computing

CRedit-based and reputation retrieval system

The challenge of a mobile ad-hoc network (MANET) or hybrid wireless network (HWN) is that every node must rely on others to forward its messages, but selfish nodes might refuse to forward those messages or move to other subnetworks at any time, thus degrading network speed and retrieval efficiency. This paper presents a system called “cRedit-based and Reputation Retrieval system” that employs a distributed message transmission protocol to avoid censorship problems, forwarding and reliable routing algorithms to ensure reliable message routing, reputation and credit algorithms to encourage greater cooperation incentives, location and refresh algorithms to deal with nodes’ limited view even in high-churn network, and a protection algorithm to address the problem of selfish nodes. A series of experiments confirmed the system’s effectiveness in achieving superior network scalability, high retrieval rates, low transmission costs, and mobility resilience in hybrid wireless networks.

NA-SMT: A Network-Assisted Service Message Transmission Protocol for Reliable IoV Communications

Cellular V2X (C-V2X) is an emerging standard that will enable the employment of the 6G Internet of Vehicles (IoV). It is envisaged to provide seamless connectivity, long-range communications, higher data rate transmissions, and centralized and ad hoc modes of communications for vehicular applications. In particular, service applications that require data transmission between vehicles and infrastructure stations known as Road Side Units (RSUs) can greatly benefit from C-V2X. In this paper, we propose a Network-Assisted Service Message Transmission (NA-SMT) protocol that uses Uu and PC5 links of C-V2X to efficiently disseminate service messages from RSUs to the vehicles. In the first phase of the NA-SMT protocol, RSUs select downlink relay vehicles for each service message with the highest Channel Quality Indicator ( $CQI$ ) within a defined reliable range of the destination vehicle. The second phase of the NA-SMT protocol schedules V2V transmission by cooperative sub-channel allocation by the RSUs to reliably disseminate service messages to the destination. Simulation results show that NA-SMT protocol improves packet reception ratio and end-to-end delay of service messages at different channel conditions and service message generation rates.

A Secured Message Transmission Protocol for Vehicular Ad Hoc Networks

Vehicular Ad hoc Networks (VANETs) become a very crucial addition in the Intelligent Transportation System (ITS). It is challenging for a VANET system to provide security services and parallelly maintain high throughput by utilizing limited resources. To overcome these challenges, we propose a blockchain-based Secured Cluster-based MAC (SCB-MAC) protocol. The nearby vehicles heading towards the same direction will form a cluster and each of the clusters has its blockchain to store and distribute the safety messages. The message which contains emergency information and requires Strict Delay Requirement (SDR) for transmission are called safety messages (SM). Cluster Members (CMs) sign SMs with their private keys while sending them to the blockchain to confirm authentication, integrity, and confidentiality of the message. A Certificate Authority (CA) is responsible for physical verification, key generation, and privacy preservation of the vehicles. We implemented a test scenario as proof of concept and tested the safety message transmission (SMT) protocol in a real-world platform. Computational and storage overhead analysis shows that the proposed protocol for SMT implements security, authentication, integrity, robustness, non-repudiation, etc. while maintaining the SDR. Messages that are less important compared to the SMs are called non-safety messages (NSM) and vehicles use RTS/CTS mechanism for NSM transmission. Numerical studies show that the proposed NSM transmission method maintains 6 times more throughput, 2 times less delay and 125% less Packet Dropping Rate (PDR) than traditional MAC protocols. These results prove that the proposed protocol outperforms the traditional MAC protocols.

ATmega128 기반 단문 메시지 전송 프로토콜 IMCP 구현

ATmega128 기반 단문 메시지 전송 프로토콜 IMCP 구현

The Design of the Control System of Fire Control and Smoke Extraction Robot Based on PLC

The purpose of this paper is to design a plc-based control system of fire control and smoke extraction robot, which can realize the purpose of water cannon, vehicle body movement and non-line-of-sight operation. This control system is mainly composed of PLC control system, video system, remote control system, motor drive system. PLC Through CANopen message transmission protocol, the function of distributed control system is realized. The main task is to receive the CAN command of remote control, so as to realize the command control of vehicle body action (multi-way valve), yuntai action and water cannon action. The design meets the design requirements, has good operability and reliability, in the industry has a certain promotion significance.

Key Technologies of Seamless Location in Emergency Rescue

Objectives Emergency location is one of the key technologies for emergency rescue of major emergencies such as earthquake, fire, mine accident and so on. However, at the present stage, the research on the theory and technology of emergency location is still not systematized, the rapid construction method of seamless benchmark and collaborative location model for emergency location are not robust enough, and the lack of positioning terminals has become an urgent problem to be solved. Methods Firstly, we expound the research status at home and abroad according to the three commonly used emergency positioning modes of GNSS(global navigation satellite system), autonomous positioning and local area network electromagnetic wave positioning.Secondly, based on the technologies of emergency CORS(continuously operating reference stations) and UWB(ultra wide band) networking, a general emergency seamless positioning solution for many kinds of disasters is constructed. Then, the key technologies such as low power consumption of emergency positioning terminal manufacturing, synchronous information acquisition and efficient calculation of embedded firmware are overcome, and hardware equipment such as GNSS/UWB base station is developed. And, the emergency location service system is designed and developed, which solves the problems of emergency position networking, personnel location and on-site scheduling. Finally, the message transmission protocol of emergency navigation and location service system is proposed, which promotes the development of emergency rescue equipment standardization. Results Through the research on the key technologies such as the manufacture of emergency location terminals such as GNSS/UWB base station, the development of emergency location and location service system based on cloud platform, and the formulation of message transmission protocol of emergency navigation and location service system, we put forward a seamless positioning solution for indoor and outdoor under emergency conditions, which solves the problems of rapid construction of indoor and outdoor seamless positioning datum, personnel positioning and command scheduling in emergency. Conclusions The purpose is to create an emergency-oriented indoor seamless positioning technology system and innovate the existing emergency positioning technology methods.

On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission

In a network of $n$ nodes (modeled as a digraph), the goal of a perfectly secret message transmission ( PSMT ) protocol is to replicate sender’s message $m$ at the receiver’s end without revealing any information about $m$ to a computationally unbounded adversary that eavesdrops on any $t$ nodes. The adversary may be mobile too that is, it may eavesdrop on a different set of $t$ nodes in different rounds. We prove a necessary and sufficient condition on the synchronous network for the existence of $r$ -round PSMT protocols, for any given $r > 0$ ; further, we show that round-optimality is achieved without trading-off the communication complexity; specifically, our protocols have an overall communication complexity of $O(n)$ elements of a finite field to perfectly transmit one field element. Apart from optimality/scalability, two interesting implications of our results are: 1) adversarial mobility does not affect its tolerability: PSMT tolerating a static $t$ -adversary is possible if and only if PSMT tolerating mobile $t$ -adversary is possible; and 2) mobility does not affect the round optimality: the fastest PSMT protocol tolerating a static $t$ -adversary is not faster than the one tolerating a mobile $t$ -adversary.

On minimal connectivity requirements for secure message transmission in directed networks

In a synchronous distributed network of n nodes, the goal of a Secure Message Transmission (SMT) protocol is to securely deliver the sender's message at the receiver's end in the presence of a computationally unbounded adversary that can partially control the network by corrupting some of its nodes (except the sender and the receiver). In a network modelled as a directed graph, to achieve unconditional security tolerating tb Byzantine faults, it is known that: (1) if all the paths are one-way connected from the sender to the receiver – called as forward channels – then2tb+1 vertex-disjoint forward channels are necessary and sufficient (2) for 1≤u≤tb, if there exist 2tb+1−u vertex-disjoint forward channels then u vertex-disjoint paths from the receiver to the sender – known as feedback channels – are necessary and sufficient. Moreover, similar characterization exists for tolerating mixed faults – up to tf fail-stop faults in addition to tp passive faults.We notice that these results characterized the networks by studying the required number of extra vertex-disjoint feedback channels, conditioned on the existence of a certain number of forward channels. In this work, we give a generic characterization without attaching any such if condition. Specifically, we answer the following questions. In a given directed graph, that is abstracted as a collection of strong paths from S to R and R to S, under what conditions is SMT (im)possible tolerating: (1) up to tp passive faults?, (2) mixed faults – up to tf fail-stop faults in addition to tp passive faults?, and (3) up to tb Byzantine faults? Also, for each of these three problems, we explicitly show that there are networks in which SMT protocols exist whereas the existing results do not characterize such networks.

Secure Message Transmission against Remote Control System

A remote control system (RCS) can monitor a user’s confidential information by using the broadcast receivers in Android OS. However, the current RCS detection methods are based only on a virus vaccine. Therefore, if the user’s smartphone is infected by a brand new RCS, these methods cannot detect this new RCS immediately. In this paper, we present a secure message transmission medium. This medium is completely isolated from networks and can communicate securely through a QR code channel by using symmetric key cryptography such as the AES block cipher and public key cryptography such as elliptic curve cryptography for providing security. Therefore, the RCS cannot detect any confidential information. This approach is completely immune to any RCS attacks. Furthermore, we present a secure QR code-based key exchange protocol by using the elliptic curve Diffie–Hellman method and message transmission protocols; the proposed protocol has high usability and is very secure.

Emergency Broadcasting over CATV Channel using FM Subcarrier Technology

Emergency broadcasting is of importance method to alert people when disaster happens, but the development of network is slow in Chinese rural areas. So it is necessary to propose an emergency broadcasting solution for Chinese rural areas based on the available network. In this paper, a method that adopts FM subcarrier technology over CATV channel to broadcast emergency message have been proposed. In the method, emergency program is transmitted by CATV channel and emergency order is carried in FM subcarrier. As usual, to communicate emergency message to the public efficiently and effectively, a complete emergency broadcasting system should have following functions such as parallel broadcasting, compatibility, robustness, security, and so on. In the context, to satisfy above requirements, corresponding system construction, communication scheme, and message transmission protocol have been proposed as well. To verify the practicability, the solutions have been test in Chinese rural areas MiYun and gain good results.

QUANTUM KEY EVOLUTION AND ITS APPLICATIONS

Quantum key distribution (QKD) enables two authenticated parties to share a perfectly secure key. However, repeatedly using the same key to encrypt many different messages is not perfectly secure. A trivial method to update the key is to use QKD to re-establish a new key for each message. In this paper, we present a method, called quantum key evolution (QKE), to update the secret key using less qubits. Hence, it is more efficient for long messages. More precisely, we present a secure and efficient protocol, called quantum message transmission (QMT) protocol, to transmit long secret message using less qubits than the methods of incorporating QKD with one-time pad, as well as some quantum secure direct communication (QSDC) protocols.

Active Source routing protocol in Mobile Network

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multi-hop wireless network with frequently changing topology. To effectively cope with arbitrary malicious disruption of data transmissions, we propose and evaluate the secure message transmission (SMT) protocol and its alternative, the secure single-path (SSP) protocol. Among the salient features of SMT and SSP is their ability to operate solely in an end-to-end manner and without restrictive assumptions on the network trust and security associations. As a result, the protocols are applicable to a wide range of network architectures. We demonstrate that highly reliable communication can be sustained with small delay and small delay variability, even when a substantial portion of the network nodes systematically or intermittently disrupt communication. SMT and SSP robustly detect transmission failures and continuously configure their operation to avoid and tolerate data loss, and to ensure the availability of communication. This is achieved at the expense of moderate transmission and routing overhead, which can be traded off for delay. Overall, the ability of the protocols to mitigate both malicious and benign faults allows fast and reliable data transport even in highly adverse network environments. Keywords-Secure Message Transmission, Multi-path Routing, Secure Routing, Secure Routing Protocol , Fault tolerance, mobile ad hoc network (MANET) security, network security, secure data transmission.

Network Connection and Perfectly Secure Message Transmission on Wireless Mobile Networks

In this paper we proposed perfectly secure message transmission for reliable and secure communications in order to ensure that an adversary cannot obtain information (in the information theoretic sense) about messages. There are numerous studies about the interplay of network connectivity and perfectly secure message transmission under a Byzantine adversary capable of corrupting up to t players. It is known that perfectly secure communication among any pair of players is possible if and only if the underlying synchronous wired network is (2t+1)-connected. But existing studies deal with traditional wired networks and neglect perfectly secure message transmission on mobile networks. Therefore, we proposed a perfectly secure message transmission protocol and analyzed the interplay of mobile network connectivity and perfectly secure message transmission. We considered that network connection takes priority over other factors for perfectly secure message transmission, and we showed that the number of paths needed to ensure mobile network connection is   n K n N log = in an undirected graph with n nodes. And, we proved that the connectivity (2T+1) on mobile networks with n nodes, where   n K t T log = , must be higher than the connectivity (2t+1) of wired networks.

Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

We study the interplay of network connectivity and the issues related to the 'possibility', 'feasibility' and 'optimality' for unconditionally reliable message transmission (URMT) and unconditionally secure message transmission (USMT) in an undirected synchronous network, under the influence of an adaptive mixed adversary having unbounded computing power, who can corrupt some of the nodes in the network in Byzantine, omission, fail-stop and passive fashion respectively. We consider two types of adversary, namely threshold and non-threshold. One of the important conclusions we arrive at from our study is that allowing a negligible error probability significantly helps in the 'possibility', 'feasibility' and 'optimality' of both reliable and secure message transmission protocols. To design our protocols, we propose several new techniques which are of independent interest.