Message Transmission Scheme Research Articles

Discharging driven energy sharing protocol for V2V communication in vehicular energy networks

With the growing concern over range anxiety among electric vehicle (EV) owners due to limited battery capacity and sparse charging infrastructure, EV-to-EV (V2V) energy sharing emerges as a crucial solution to extend driving range. Leveraging the vehicular energy network (VEN) enabled by dynamic wireless power transfer (DWPT) technology, energy sharing among EVs in motion becomes feasible. However, the effective establishment of communication and identification of suitable V2V energy sharing pairs pose significant challenges, particularly for EVs with discharging demands. To address this challenge, we propose a new discharging driven energy sharing protocol based on vehicular ad-hoc networks (VANETs). Firstly, we present a routing approach for transmitting discharging information through VANETs, considering key factors such as distance, state of charge, number of neighbor vehicles, and vehicle speed. This routing scheme facilitates efficient relay node selection on road segments and intersections, ensuring optimal communication paths. Subsequently, we formulate a charging requester selection model to identify the most suitable requester for energy sharing. This model optimizes individual utility while accounting for the state of charge of the requesters, ensuring a comprehensive and inclusive approach to V2V energy sharing. Finally, we develop an acknowledgment message transmission scheme to ensure the completion of selection acknowledgment between discharging EVs and charging EVs. This scheme includes provisions for recovery in case of forwarding link failures, ensuring robust communication in dynamic vehicular environments. Extensive simulations conducted using network simulator 2 (NS-2) demonstrate the superior performance of the proposed protocol in terms of packet delivery ratio, end-to-end delay, and overall V2V energy sharing efficiency.

FSEE: A Forward Secure End-to-End Encrypted Message Transmission System for IoT

Leakage of long-term secrets is a major concern when cryptographic schemes are implemented on devices with weak protection capability, especially for resource-constrained IoT devices. Forward secrecy is a means to minimize the damage when such an event takes place. For pub-/sub-based IoT systems, several end-to-end (from publisher to subscriber) encrypted message transmission schemes have been proposed to tackle the confidentiality problems brought by malicious message brokers. But none of them provide forward secrecy. This article presents FSEE, a forward secure end-to-end encrypted message transmission system for pub-/sub-based IoT. To support FSEE, we design a novel group key exchange protocol BA-GKE, which relies on a semi-trusted key exchange server to provide forward secrecy and support asynchronous communication between group members. We prove its forward secrecy by ProVerif. The core idea of FSEE is to establish a forward secure symmetric key per device using BA-GKE asynchronously, and this device-specific key is shared with the device and its authorized subscribers for encrypting messages securely. By adding a semi-trusted key exchange server to realize BA-GKE in the current IoT architecture, FSEE does not need to change the existing message broker and could be deployed incrementally. The experimental results show that FSEE has comparable performance to existing prominent research and provides higher security.

Improving the Performance of Cooperative Platooning With Restricted Message Trigger Thresholds

Cooperative Vehicular Platooning (Co-VP) is one of the most prominent and challenging applications of Intelligent Traffic Systems. To support such vehicular communications, the ETSI ITS G5 standard specifies event-based communication profiles, triggered by kinematic parameters such as speed. The standard defines a set of threshold values for such triggers but no careful assessment in realistic platooning scenarios has been done to confirm the suitability of such values. In this work, we investigate the safety and performance limitations of such parameters in a realistic platooning co-simulation environment. We then propose more conservative threshold values, that we formalize as a new profile, and evaluate their impact in the longitudinal and lateral behaviour of a vehicular platoon as it carries out complex driving scenarios. Furthermore, we analyze the overhead introduced in the network by applying the new threshold values. We conclude that a pro-active message transmission scheme leads to improved platoon performance for highway scenarios, notably an increase greater than 40% in the longitudinal performance of the platoon, while not incurring in a significant network overhead. The obtained results also demonstrated an improved platoon performance for for semi-urban scenarios, including obstacles and curves, where the heading error decreases in 26%, with slight network overhead.

Activity-based routing algorithm in opportunistic mobile social networks

In opportunistic mobile social networks, nodes are clustered according to their interests or hobbies and take part in different activities regularly. We delve into the temporal and spatial mobility characteristics of network nodes and put forward an activity-based message opportunistic forwarding algorithm. The main idea of the algorithm is that we choose different message forwarding methods according to the situation of nodes participating in activities. If the source node and the destination node are both attend in the same activities, we select the best relay node which has the biggest delivery probability. While the source node and the destination node are not in the same activities at the same time, we need to find the optimal path which owns highest indirect delivery probability, and messages will be transmitted through the optimal path. The simulation results show that the proposed routing algorithm can not only improve the successful delivery ratio of messages but also reduce the network delay and the network overhead obviously, in comparison with the classical opportunistic routing algorithms, such as community-aware message opportunistic transmission algorithm, community-based message transmission scheme algorithm, PRoPHET, Epidemic algorithm, and interest characteristic probability prediction algorithm.

Secure message transmission scheme in wireless sensor networks

Wireless sensor networks (WSNs) have been the subject of intensive research in the past few years and the backbone of most maximum present information technology. WSNs have been employed in various applications such as track monitoring battlegrounds in military fields and patients’ medical requirements in the civilian field. The wireless sensor networks are always randomly distributed in an open area (hostile), pervasive environment, and open media channel. Thus, WSNs are vulnerable to several species of attacks. Moreover, messages may be easily intercepted or altered because the transmission is not secure, hence effective key management scheme is strongly needed to reduce the risks. Cryptography methods are a crucial aspect of WSNs to reach security goals. In this paper, we propose an efficient and secure message transmission scheme that combines the Knapsack algorithm with the Diffie-Hellmann process to encrypt messages. The results and analysis show that the proposed scheme is efficient and it achieves most of the security goals providing high privacy and security. It is also resilient against some of the well-known attacks.

Secure Message Transmission for V2V Based on Mutual Authentication for VANETs

The advancements in Vehicular Ad Hoc Networks (VANETs) require more intelligent security protocols that ultimately provide unbreakable security to vehicles and other components of VANETs. VANETs face various types of security pitfalls due to the openness characteristics of the VANET communication infrastructure. Researchers have recently proposed different mutual authentication schemes that address security and privacy issues in vehicle‐to‐vehicle (V2V) communication. However, some V2V security schemes suffer from inadequate design and are hard to implement practically. In addition, some schemes face vehicle traceability and lack anonymity. Hence, this paper’s primary goal is to enhance privacy preservation through mutual authentication and to achieve better security and performance. Therefore, this article first describes the vulnerabilities of a very recent authentication scheme presented by Vasudev et al. Our analysis proves that the design of Vasudev et al.’s scheme is incorrect, and resultantly, the scheme does not provide mutual authentication between a vehicle and vehicle server when multiple vehicles are registered with the vehicle sever. Furthermore, this paper proposes a secure message transmission scheme for V2V in VANETs. The proposed scheme fulfills the security and performance requirements of VANETs. The security analysis of the proposed scheme using formal BAN and informal discussion on security features confirm that the proposed scheme fulfills the security requirements, and the performance comparisons show that the proposed scheme copes with the lightweightness requirements of VANETs.

Performance Analysis of V2V Communications: A Novel Scheduling Assignment and Data Transmission Scheme

Vehicle-to-vehicle (V2V) communications is a key enabler for traffic management and road safety, where vehicles exchange real-time information. Major challenges for practical V2V communications include strict requirements for latency, collision avoidance, throughput, and reliability. This paper proposes a novel scheduling assignment (SA) and data transmission scheme for mode 4-based non-adjacent V2V communications. The main objective of the proposed scheme is to decrease the contention of radio resources to achieve better performance gain. To achieve this, we propose the SA-embedded data message transmission scheme instead of transmitting the SA and data messages separately. To investigate the achievable performance, a mathematical model for the proposed scheme has been derived using the finite state Markov chain. Using this mathematical model, we have derived expressions (validated by simulations) to quantify the collision probability, throughput, transmission probability, and the load on the network. Furthermore, we explore several design parameters and their effects on system performance. Through system level simulation and analytical results, the significant improvement of overall network performance in terms of the throughput maximization and resource collision minimization for the proposed scheme has been shown.

마케팅 효과 극대화 및 비용절감 효과성에 대한 기업용 메시징서비스 효율화 연구

스마트 커머스 시장에서 소비자는 개인 성향에 최적화된 개인화된 서비스와 소비자 취향을 고려한 맞춤형 쇼핑 경험을 원하고 있다. 즉, 소비자는 개인화된 맞춤형 서비스를 요구하고 있다. 이러한 요구에 따라 기업들은 메시징서비스를 소비자에게 제공하고 있지만, 각 개인에 맞춤형 서비스를 포함하지 못하고 있다. 따라서 본 연구는 메시징서비스에 개인화 서비스기술을 결합하여 기업용 메시징서비스의 통합 모형 및 시스템 구축방안을 제시하고, 이를 통해 마케팅 효과를 극대화하고 비용절감 효과를 분석한다. 제안된 통합 모형 작동방식은 고객 요구사항에 따라 개인화된 정보를 통해 개인화모형 적용하여 효과적인 개인화를 통한 메시징 전송 방안을 제시하고 있다. 본 연구의 개인화 통합모형은 검색서비스와 결합되었을 경우 매우 높은 효과가 있을 것으로 판단된다. In a smart commerce market, customers are seeking customized shopping services optimized for personal tastes and customized shopping experiences based on customers' tastes. Accordingly, individually customized services are needed more than anytime now. According to this demand, companies provide messaging services to the consumer, but do not include a personalized service for each individual. The purpose of this study is to combine the techniques of personalized services with messaging services and presents system construction plan and integrated model system for corporate messaging services and thereby possible are maximizing marketing effects and analyzing effects of cost savings. Applying the operation of the integrated model is proposed and message transmission scheme through effective personalization can be applied to personalized model using the personalized information according to customers' requirements. The integrated model of personalization on this study is expected to be highly effective when combined with the search service.

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.

A novel authenticated encryption scheme and its extension

An authenticated encryption scheme is a message transmission scheme, which can send a message in a secure and authentic way, and allows the specified recipient to simultaneously recover and verify the validity of a message. In the large message transmission, traditional authenticated encryption schemes have the disadvantages that communication overheads and the computation costs are too high. In this work, we propose a secure authentication encryption scheme and show that the scheme is secure in the random oracle model. In comparison with Lv et al.’s scheme and Li et al.’s scheme, our proposed scheme is the most efficient one in terms of computation complexity and communication cost. Finally, we extend our proposed scheme to adapt to the authenticated encryption for a large message, which is secure against the message block being reordered, replicated or partially deleted during transmission.

Real-time synchronization method based on dual ring fieldbus in CNC system

As the popularization of dual ring fieldbus, the optimized dual ring synchronization methods are still in short. The current synchronization methods are generally established in traditional industrial fieldbus, in which transmission is commonly considered in single track, the two-way transmitting cannot take full effect, and would result in unwanted idle load on equipment lines. In stamp-transferring part, the synchronizing algorithm is not properly processed to diminish the latency, so the real-time performance of entire system cannot be ensured. To support the synchronization control of stations in the CNC system, a real-time time synchronization method for dual ring fieldbus in the CNC system is designed in this paper. In this method a synchronizing message transmission scheme based on dual ring architecture and the synchronization algorithm between master and secondary stations are integrated. In the scheme, the clock models of both master and secondary stations are optimized with corresponding modules and the stamp data transmission based on the dual ring fieldbus is devised exclusively, so the transmitting efficiency improves with less idle work. In the algorithm, all the secondary stations can accomplish the consistent state with master station by updating clock discrepancy information in one communication cycle, and it takes the advantage of two-way transmitting and makes the best use of dual ring structure, so the real-time performance of the system can be promoted while retaining the precision of synchronization. To evaluate the performance, the costs of the method and errors during synchronizing are noted and analyzed based on the actual running environment in the industrial fieldbus. The results show that it reduces communication cost and ensures the smoothness of the system with low lag effects under heavy load. The proposed time synchronization method optimizes the architecture of sync message transmission in dual ring fieldbus, and improves the efficiency of time synchronization in the stations of CNC system.

Degraded Broadcast Diamond Channels With Noncausal State Information at the Source

A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadcasting structure, while the relays-to-destination cut is a general multiple access channel controlled by a random state. It is assumed that the source has noncausal channel state information and the relays have no state information. Under this model, first, the capacity is characterized for the case where the destination has state information, i.e., has access to the state sequence. It is demonstrated that in this case, a joint message and state transmission scheme via binning is optimal. Next, the case where the destination does not have state information, i.e., the case with state information at the source only, is considered. For this scenario, lower and upper bounds on the capacity are derived for the general discrete memoryless model. Achievable rates are then computed for the case in which the relays-to-destination cut is affected by an additive Gaussian state. Numerical results are provided that illuminate the performance advantages that can be accrued by leveraging noncausal state information at the source.

Community-based message transmission scheme in opportunistic social networks

Since the mainstream forwarding protocol in opportunistic networks does not consider the sociality of node movement,a layering routing algorithm based on copy restriction and human sociality was proposed.This algorithm could dynamically adapt to divide network nodes into different communities according to the nodes intensity of social relation,in which the message copy redundancy was reduced by restricting the number of message copies,and the nodes of high activity were utilized to drive the forwarding and transferring of messages.The simulation results show that it can ensure higher delivery ratio and relatively lower delivery delay,and also reduce the resource consumption of network.

A Community-driven Hierarchical Message Transmission Scheme in Opportunistic Networks

Opportunistic networks, in which nodes take advantage of nodes’ mobility to transmit messages, are one of the most effective technologies for developing wireless networks. However, due to the high delay and low delivery ratio in opportunistic networks, such networks have poor transmission performance. In this paper, we propose a Community-driven Hierarchical Message Transmission Scheme (CHMTS) to improve opportunistic routing. In the scheme, we divide the network into communities. We count the encountering times between communities and assign them as communication weights. In the intra-community transmission, we transmit messages based on Prophet Algorithm; however, in inter-community transmission, we transmit messages based on communication weight. Experiments on the ONE show that CHMTS can raise the delivery ratio, improve the efficiency of forwarding messages, and reduce the delivery delay to some extent.

General Error Decodable Secret Sharing Scheme and Its Application

Consider a model of secret sharing schemes with cheaters. We say that a secret sharing scheme is error decodable if we can still recover the secret <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</i> correctly from a noisy share vector (share <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> ', ..., share <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> '). In this paper, we first prove that a perfect secret sharing scheme is error decodable if and only if the adversary structure Γ satisfies a certain condition called <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Q</i> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> . Next, for such Γ , we show a scheme such that the decoding algorithm runs in polynomial-time in | <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</i> | and the size of a linear secret sharing scheme which realizes Γ. We finally show an application to 1-round perfectly secure message transmission schemes (PSMT).

Round-efficient perfectly secure message transmission scheme against general adversary

In the model of Perfectly Secure Message Transmission Schemes (PSMTs), there are n channels between a sender and a receiver, and they share no key. An infinitely powerful adversary A can corrupt (observe and forge) the messages sent through some subset of n channels. For non-threshold adversaries called Q 2, Kumar et al. showed a many round PSMT (Ashwin Kumar et al. On perfectly secure communication over arbitrary networks. PODC 2002, pp. 193---202, 2002). In this paper, we show round efficient PSMTs against Q 2-adevrsaries. We first give a 3-round PSMT which runs in polynomial time in the size of the underlying linear secret sharing scheme. We next present a 2-round PSMT which is inefficient in general. (However, it is efficient for some special case.)

Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

An error decodable secret-sharing scheme is a secret-sharing scheme with the additional property that the secret can be recovered from the set of all shares, even after a coalition of participants corrupts the shares they possess. In this paper, schemes that can tolerate corruption by sets of participants belonging to a monotone coalition structure are considered. This coalition structure may be unrelated to the authorised sets of the secret-sharing scheme. This is generalisation of both a related notion studied in the context of multiparty computation, and the well-known error-correction properties of threshold schemes based on Reed-Solomon codes. Necessary and sufficient conditions for the existence of such schemes are deduced, and methods for reducing the storage requirements of a technique of Kurosawa for constructing error-decodable secret-sharing schemes with efficient decoding algorithms are demonstrated. In addition, the connection between one-round perfectly secure message transmission (PSMT) schemes with general adversary structures and secret-sharing schemes is explored. We prove a theorem that explicitly shows the relation between these structures. In particular, an error decodable secret-sharing scheme yields a one-round PSMT, but the converse does not hold. Furthermore, we are able to show that some well-known results concerning one-round PSMT follow from known results on secret-sharing schemes. These connections are exploited to investigate factors affecting the performance of one-round PSMT schemes such as the number of channels required, the communication overhead, and the efficiency of message recovery.

Security Analysis of a Convertible Multiauthenticated Encryption Scheme

Multi-authenticated encryption scheme is message transmission scheme, which sends message in a secure and authentic way, and allows a group of signers to cooperatively produce a valid authenticated ciphertext so that only the specific recipient can recover the message and verify the signature. Recently, Wu et al. proposed a convertible multi-authenticated encryption scheme and claimed that the scheme was secure. In this paper, we show that Wu et. al’s scheme is not secure against rogue-key attacks. To overcome such attack, we give an improved multi-authenticated encryption scheme by including two hash functions. And our improved scheme is the same efficiency as Wu et.al.’s scheme.

Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme

In the model of perfectly secure message transmission (PSMT) schemes, there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe and forge) the messages sent through t out of n channels. The sender wishes to send a secret s to the receiver perfectly privately and perfectly reliably without sharing any key with the receiver. In this paper, we show the first 2-round PSMT for n = 2t + 1 such that not only the transmission rate is O(n) but also the computational costs of the sender and the receiver are both polynomial in n. This means that we solve the open problem raised by Agarwal, Cramer, and de Haan at CRYPTO 2006. The main novelty of our approach is to introduce a notion of pseudobasis to the coding theory. It will be an independent interest for coding theory, too.

Almost Secure (1-Round, n-Channel) Message Transmission Scheme

It is known that perfectly secure (1-round, n-channel) message transmission (MT) schemes exist if and only if n ≥ 3t + 1, where t is the number of channels that the adversary can corrupt. Then does there exist an almost secure MT scheme for n = 2t + 1 ? In this paper, we first sum up a number flaws of the previous almost secure MT scheme presented at Crypto 2004 . We next show an equivalence between almost secure MT schemes and secret sharing schemes with cheaters. By using our equivalence, we derive a lower bound on the communication complexity of almost secure MT schemes. Finally, we present a near optimum scheme which meets our bound approximately. This is the first construction of provably secure almost secure (1-round, n-channel) MT schemes for n = 2t + 1.