Periodic Broadcast Research Articles

V2X Application Server and Vehicle Centric Distribution of Commitments for V2V Message Authentication

Safety applications, such as intersection collision warnings and emergency brake warnings, enhance road safety and traffic efficiency through periodic broadcast messages by vehicles and roadside infrastructure. While the Elliptic Curve Digital Signature Algorithm (ECDSA) is a widely used security approach, its performance limitations make it unsuitable for time-critical safety applications. As such, a symmetric cryptography-based technique called Timed Efficient Stream Loss-tolerant Authentication (TESLA) offers a viable alternative. However, applying standard TESLA in the context of vehicle-to-vehicle (V2V) communications has its own challenges. One challenge is the difficulty of distributing authentication information called commitments in the highly dynamic V2V environment. In this paper, we propose two novel solutions to this problem, namely, V2X Application Server (VAS)-centric and vehicle-centric. The former is an application-level solution that involves selective unicasting of commitments to vehicles by a central server, the VAS, and the latter is a reactive scheme that involves the periodic broadcast of commitments by the vehicles themselves. Extensive simulations are conducted using representatives of the real V2V environment to evaluate the performance of these approaches under different traffic situations; as well as performance comparison with a state-of-the-art distribution solution. The simulation results indicate that the VAS-centric solution is preferable for use in a TESLA-like V2V security scheme. It demonstrates desirable features, including timely delivery of commitments and high distribution efficiency, with over 95% of commitments sent by the VAS are associated with relevant safety messages when compared with the vehicle-centric and state-of-the-art solutions. Formal security analysis, conducted using the Random Oracle Model (ROM), proves the correctness of our proposed distribution schemes. Additionally, an informal security analysis shows the resilience of the proposed schemes against various attacks, including impersonation, replay, and bogus commitment messages.

An adaptive and multi-path greedy perimeter stateless routing protocol in flying ad hoc networks

In recent years, flying ad hoc networks (FANET), formed from unmanned aerial vehicles (UAVs), have absorbed the attention of academic and industrial research communities due to their many applications in military and civilian fields. FANETs benefit from unique features, including highly moving UAVs and dynamic topological structure. Therefore, most existing routing protocols, such as the greedy perimeter stateless routing (GPSR), are not compatible with the FANET environment and its specific features. To improve the performance of GPSR in FANET, it is important to address several challenges, namely the selection of the right period for broadcasting hello messages in the network, the selection of the right criteria for selecting the next-hop node, and the improvement of reliability in the data transfer process. In this paper, an adaptive and multi-path greedy perimeter stateless routing (AM-GPSR) protocol is suggested in FANETs. It includes two new strategies, namely adaptive hello strategy and multi-path greedy forwarding strategy. The adaptive hello strategy defines a special hello broadcast period for each UAV according to its speed and error between two estimated and actual positions. Furthermore, the greedy forwarding strategy carries out a filtering operation on candidate nodes and eliminates border UAVs and those that are far from the destination. Then, candidate UAVs are prioritized based on the time to reach the destination and buffer capacity, and UAVs with higher priorities are chosen to send data packets. Finally, AM-GPSR applies a greedy multi-path forwarding strategy to increase reliability in the data transmission process. Lastly, the simulation of AM-GPSR is done via the network simulator version 2 (NS2) to evaluate its performance. This evaluation process includes two different scenarios, i.e. change in the speed of UAVs and change in their communication range. In this process, AM-GPSR is compared with three other methods, namely the aerial greedy geographic routing (AGGR) protocol, the geolocation assisted aeronautical routing protocol (AeroRP), and GPSR. This comparison shows the successful performance of AM-GPSR in terms of delivery success rate, throughput, and delay. Although the control overhead of the proposed method is more than that of AGGR.

Understanding the impact of persistence and propagation on the Age of Information of broadcast traffic in 5G NR-V2X sidelink communications

The current Cellular V2X (C-V2X) standard for direct communication between vehicles is based on the so called Semi-Persistent Scheduling (SPS) algorithm. It is based on the multiple access structure of 5G New Radio (NR) and exploits sensing and persistence to realize a randomized multiple access. We consider the application of SPS to support periodic broadcast traffic where no acknowledgments are provided. Persistence is a key feature, which consists of a node using the same resource for its transmissions for multiple frames. The specific resource used is randomly selected from among those that are perceived to be idle, and reselected anew after a randomized number of frames. We define a model to gain insight into the interplay between persistence and key performance metrics for the type of traffic considered, namely probability of successful delivery and Age of Information (AoI). A core version of the model is validated against simulations and used to show that there exists an optimal level that minimizes AoI. The model is then extended to account for a distance-dependent propagation model, allowing further insight into the effects of the interplay between sender–receiver distance and persistence. Finally, an even more detailed model is investigated, using ns-3-based simulations. This further analysis confirms the qualitative behaviors revealed by the analytical model and provides more insight into the complex interactions of system parameters and channel characteristics. The obtained results help to identify the limits of SPS, opening the way to system-principled parameter optimization and design of more powerful variants of the multiple access scheme.

A smart filtering-based adaptive optimized link state routing protocol in flying ad hoc networks for traffic monitoring

Nowadays, the use of drones as a fundamental element of smart cities has attracted the attention of many researchers to monitor and control the traffic of vehicles. Because of the high flexibility of multi-drone systems, like flying ad hoc networks (FANETs), they provide various services and improve modern life in smart cities. However, due to the unique features of FANET, especially the high speed of drones and rapid changes in network topology, communication reliability is a serious challenge in this network. Hence, traditional routing protocols, such as optimized link state routing (OLSR) scheme, cannot work well in these networks. In this paper, a smart filtering-based adaptive optimized link state routing (SFA-OLSR) scheme is proposed in FANETs. To increase adaptability to the FANET environment, SFA-OLSR provides a new solution to adjust the hello broadcast period so that each flying node specifies its broadcast period based on a new scale called cosine similarity between real and predicted positions. Furthermore, in SFA-OLSR, each flying node develops a filtering algorithm based on two parameters, namely link lifetime and remaining energy. The purpose of this algorithm is to reduce the size of the single-hop neighboring set of each flying node and minimize the search space when finding multi-point relays (MPRs). This increases the convergence speed of the algorithm. Then, SFA-OLSR exploits the sparrow search algorithm (SSA) to single out the best MPRs. This algorithm introduces a multi-objective function by focusing on three components, including energy, link lifespan, and neighbor degree. Lastly, the simulation process of SFA-OLSR is performed by the NS3 simulator. This process evaluates the performance of the proposed method and three schemes, namely Gangopadhyay et al., P-OLSR, and OLSR-ETX. These evaluations show that SFA-OLSR has a good performance in terms of three scales, namely packet delivery ratio, delay, and throughput, but its overhead is more than other methods.

A Novel Optimized Link-State Routing Scheme with Greedy and Perimeter Forwarding Capability in Flying Ad Hoc Networks

A flying ad hoc network (FANET) is formed from a swarm of drones also known as unmanned aerial vehicles (UAVs) and is currently a popular research subject because of its ability to carry out complicated missions. However, the specific features of UAVs such as mobility, restricted energy, and dynamic topology have led to vital challenges for making reliable communications between drones, especially when designing routing methods. In this paper, a novel optimized link-state routing scheme with a greedy and perimeter forwarding capability called OLSR+GPSR is proposed in flying ad hoc networks. In OLSR+GPSR, optimized link-state routing (OLSR) and greedy perimeter stateless routing (GPSR) are merged together. The proposed method employs a fuzzy system to regulate the broadcast period of hello messages based on two inputs, namely the velocity of UAVs and position prediction error so that high-speed UAVs have a shorter hello broadcast period than low-speed UAVs. In OLSR+GPSR, unlike OLSR, MPR nodes are determined based on several metrics, especially neighbor degree, node stability (based on velocity, direction, and distance), the occupied buffer capacity, and residual energy. In the last step, the proposed method deletes two phases in OLSR, i.e., the TC message dissemination and the calculation of all routing paths to reduce routing overhead. Finally, OLSR+GPSR is run on an NS3 simulator, and its performance is evaluated in terms of delay, packet delivery ratio, throughput, and overhead in comparison with Gangopadhyay et al., P-OLSR, and OLSR-ETX. This evaluation shows the superiority of OLSR+GPSR.

Optimal Broadcast Scheduling Algorithm for a Multi-AUV Acoustic Communication Network

In systems of multiple autonomous underwater vehicles (AUVs), to achieve cooperative operation and cluster intelligence, information is often disseminated via broadcasting. However, due to the long propagation delay and slow transmission rate of underwater acoustic communication, traditional broadcast scheduling algorithms require a long broadcast period to avoid signal collision. To improve the channel utilization rate as much as possible and improve the update rate for broadcast information, we propose an optimal broadcast scheduling algorithm. This algorithm uses the location information of AUVs to adjust the broadcast sequence and broadcast schedule, to achieve the shortest possible collision-free broadcast period in the broadcast network for the current node distribution. Simulation experiments show that this algorithm can achieve a broadcast period much shorter than that of traditional TDMA and higher channel utilization without signal collision. In addition, the simulations prove the feasibility of applying the algorithm in an actual MAC protocol.

Decentralized piggybacking-based dissemination of Cooperative Awareness Messages in vehicular ad-hoc networks

Vehicle-to-Vehicle (V2V) communication has shown great promise to improve road safety and traffic efficiency via the periodic broadcasting of Cooperative Awareness Messages (CAMs), in which traffic information could be exchanged among adjacent vehicles. Since each CAM contains local-observed traffic information such as geolocation, speed, and safety alerts, frequent CAM losses will decrease the reliability on avoiding crashes and injuries on the road. Existing solutions tend to recover the lost CAMs through either source-based re-transmission or neighbor-based forwarding, which may suffer from significant performance degradation due to the fast movement of vehicles and high dynamic network topology. In this paper, we develop a decentralized cooperative broadcasting protocol for CAM dissemination, where each vehicle can piggyback some received CAMs in its routine broadcasting to help others recover their lost CAMs. To promote cooperation of CAM piggybacking, a new data structure called bitmap is introduced to record the packet receiving status at each vehicle, based on which time slots could be allocated to vehicles with low data collisions, lost CAMs could be detected only using each vehicle’s local information, and the qualities of wireless links could be estimated dynamically. Then, we propose two piggybacking schemes, Benefit-based Piggybacking (BP) and Suggestion-based Piggybacking (SP), aiming to maximize the average CAM delivery ratio. We evaluate the proposed schemes in simulations with realistic vehicle mobility traces and channel models. Simulation results show that our bitmap-based lost CAM detection has superior performance than traditional request-based solutions. In comparison with forwarding-based schemes, our schemes can achieve much higher CAM broadcast reliability with short time delay and small communication overhead.

Antenna Combiner for Periodic Broadcast V2V Communication Under Relaxed Worst-Case Propagation

The performance of a previously developed analog combining network (ACN) of phase shifters for periodic broadcast vehicle-to-vehicle (V2V) communication is investigated. The original ACN was designed to maximize the sum of signal-to-noise ratios (SNRs) for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$K$</tex-math> </inline-formula> consecutive cooperative awareness messages (CAMs). The design was based on the assumption of a dominant propagation path with an angle of arrival (AOA) that is constant for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$K$</tex-math> </inline-formula> messages. In this work, we relax this assumption by allowing the AOA and path-loss (PL) of the dominant path to be time-variant. Assuming a highway scenario with a line of sight (LOS) propagation between vehicles, we use affine approximations to model the time variation of different path quantities, including the PL, the relative distance-dependent phase shift between antennas, and the AOA-dependent far-field function of the antennas. By leveraging these approximations, we analytically derive the ACN sum-SNR as each one of these quantities varies over <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$K$</tex-math> </inline-formula> CAMs. Moreover, we suggest a design rule for a phase slope that is robust against time variation of the dominant path and optimal under time-invariant conditions. Finally, we validate this design rule using numerical computations and an example of vehicular communication antenna elements.

Criticism of Government During New Order Era in Film Langitku Rumahku (1989)

During the New Order era, all comments, protests against the government, or depicting reality would receive harsh punishment, and some would be arrested. The government silences everyone’s right to freedom of speech and express opinions through state security measures. The film Langitku Rumahku (1989) owned by Slamet Rahardjo and Erros Djarot had become a controversial film because it dared to describe a picture of social differences between two classes of society which was interpreted as a criticism of the New Order government at that time so finally this film had its broadcast period limited and withdrawn from circulation. This study aims and focuses on describing criticism of the New Order government in the film Langitku Rumahku. To approach this problem, the Semiotics theory (Ferdinand de Saussure) is used to see signifier and signified which is strengthened by several social theories to describe the socio-political atmosphere of that era. Data were collected through films and analyzed qualitatively. This study concludes that criticism is clearly illustrated through the discrimination of the characters, symbols, and dialogues displayed in the film so that they have relevance to the research objectives.

PARouting: Prediction-supported adaptive routing protocol for FANETs with deep reinforcement learning

Flying Ad-hoc Networks (FANETs) are becoming increasingly popular for various applications. Effective routing protocols for FANETs are essential yet challenging due to the high dynamic nature of Unmanned Aerial Vehicles (UAVs). Most existing routing protocols require the periodic broadcast of Hello packets to maintain neighbor tables that store the locations of neighbors, mobility patterns, etc. However, the frequent exchange of Hello packets leads to a large routing overhead in FANETs. This paper proposes PARouting, a prediction-supported adaptive routing protocol with Deep Reinforcement Learning, which introduces a novel UAV mobility prediction algorithm using Deep Learning (DL-UMP) to estimate the locations of UAVs. Based on DL-UMP, we design an adaptive Hello packet mechanism to realize on-demand broadcasting of Hello packets, which reduces routing overhead. The routing process is formulated as a Partially Observable Markov Decision Process, and a new Q-network structure is proposed to select the optimal next hop. Simulation results confirm the accuracy of the DL-UMP and show that PARouting outperforms benchmark routing protocols in terms of packet delivery rate, end-to-end delay, and routing overhead.

Prediction model of crowd noise in large waiting halls.

Crowd noise is usually the primary noise in large waiting halls, and it is difficult to predict because it is influenced by several factors such as room acoustics and crowd characteristics. This study developed a crowd noise prediction model based on the superposition of direct and reverberant sound energy using the factors of the spatial layout of waiting halls, number and distribution of crowds, behavior ratio (ratio of vocal passengers to the total number of passengers), and average crowd sound power. To verify the model, on-site measurements were conducted in two large waiting halls to obtain the necessary input parameters. The crowd noise levels in one of the waiting halls were obtained from 1-s noise level data after excluding broadcast periods. A method for determining an individual's average sound power based on the model was also presented and found to be approximately 70.6 dB. Finally, the model was verified using measured data, and it showed that the model could accurately predict the average crowd noise level and changing trend of crowd noise in temporal and spatial dimensions with an average R-square of approximately 0.55 and average difference of approximately 1.1 dBA between the predicted and measured results.

Distributed Job Dispatching in Edge Computing Networks With Random Transmission Latency: A Low-Complexity POMDP Approach

Job dispatching is a fundamental problem in edge computing for load balancing among multiple edge servers. When implementing an edge computing system with distributed job dispatchers in a sizable network, such as a metropolitan area network (MAN), the highly dynamic transmission latency is nonnegligible, which could lead to outdated information being shared. Moreover, the fully observed system state is beyond reach as the reception of any broadcast is time consuming. In this article, we investigate the online distributed job dispatching problem in edge computing, where multiple access points (APs) collect jobs and then dispatch each job to an edge server. The distributed dispatcher on each AP would receive partially and outdated information exchanged via periodic broadcast. Hence, we formulate the distributed job dispatching problem by leveraging the partially observable Markov decision process (POMDP) and propose a novel approximate Markov decision process (MDP) solution framework, called <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">DecMDP</monospace> , that bypasses the huge time complexity of conventional POMDP solutions. Both analytical and semi-analytical performance lower bounds are derived for the approximate MDP solution. Furthermore, we extend <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">DecMDP</monospace> to handle a more general scenario where <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a priori</i> knowledge of the system is absent. Finally, extensive simulations based on the Google Cluster traces show that our policy can achieve the best performance when compared with heuristic baselines, e.g., achieving 20.67% reduction in average job response time, and consistently performs well under various parameter settings.

Machine Learning Based Misbehaviour Detection in VANET Using Consecutive BSM Approach

Vehicular ad-hoc network (VANET) is an emerging technology for vehicle-to-vehicle communication vital for reducing road accidents and traffic congestion in an Intelligent Transportation System (ITS). VANET communication is vulnerable to various attacks and cryptographic techniques are commonly used for message integrity and authentication of vehicles. However, cryptograhpic techniques alone may not be sufficient to protect against insider attacks. Many VANET safety applications rely on periodic broadcast of basic safety messages (BSMs) from surrounding vehicles that contain important status information about a vehicle such as its position, speed, and heading. If an attacker (misbehaving vehicle) injects false position information in a BSM, it can lead to serious consequences including traffic congestion or even accidents. Therefore, it is imperative to accurately detect and identify such attackers to ensure safety in the network. This paper presents a novel data-centric approach to detect <i>position falsification</i> attacks, using machine learning (ML) algorithms. Unlike existing techniques, the proposed approach combines information from 2 consecutive BSMs for training and testing. Simulations using the Vehicular Reference Misbehavior (VeReMi) dataset demonstrate that the proposed model clearly outperforms existing approaches for identifying a range of different attack types.

Interference-Aware Transmission Scheduling for Internet of Vehicles

Next-generation Intelligent Transportation Systems (ITS) use wirelessly connected vehicles for safety and non-safety applications such as autonomous driving, cooperative awareness, route guidance and multimedia transmissions. This network known as the Internet of Vehicles (IoVs) suffers from many challenges such as collisions due to hidden terminals, and interference from simultaneously transmitting vehicles. Moreover, the packet reception ratio of transmissions between vehicles is significantly reduced at high vehicle densities and severe fading scenarios. As safety applications require periodic broadcast of safety messages from each vehicle to all other vehicles in the neighborhood, the development of an efficient medium access technique is a key challenge. In this paper, we propose an interference-aware medium access protocol for vehicular networks that allocate time slots to the vehicles such that interference due to hidden nodes is minimized. We first provide an analytical model to compute the interference range of a vehicle in the presence of simultaneously transmitting vehicles. We also propose a scheduling algorithm that uses vehicle GPS positions and reuse the same time slot only at a distance greater than the interference range. Simulation results show that the proposed technique improves the packet reception ratio by 70% as compared to the standard IEEE 802.11p based CSMA/CA protocol.

Beacon-Based Hybrid Routing Protocol for Large-Scale Unmanned Vehicle Ad Hoc Network

In this paper, we designed a beacon-based hybrid routing protocol to adapt to the new forms of intelligent warfare, accelerate the application of unmanned vehicles in the military field, and solve the problems such as high maintenance cost, path failure, and repeated routing pathfinding in large-scale unmanned vehicle network communications for new battlefields. This protocol used the periodic broadcast pulses initiated by the beacon nodes to provide synchronization and routing to the network and established a spanning tree through which the nodes communicated with each other. An NS3 platform was used to build a dynamic simulation environment of service data to evaluate the network performance. The results showed that when it was used in a range of 5 ~ 35 communication links, the beacon-based routing protocol’s PDR was approximately 10% higher than that of AODV routing protocol. At 5 ~ 50 communication links, the result was approximately 20% higher than the DSDV routing protocol. The routing load was not related to the number of nodes and communication link data and the protocol had better performance than traditional AODV and DSDV routing protocol, which reduced the cost of the routing protocol and effectively improved the stability and reliability of the network. The protocol we designed is more suitable for the scenarios of large-scale unmanned vehicle network communication in the future AI battlefield.

Proposed emerged and enhanced routing protocols for wireless networks

The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as DS-ZRP routing protocol. The third proposed routing protocol is designed based on using the advantaged of multipoint relays in OSLR protocol with the advantages of route cashing in DSR protocol, and we named it as OLS-DSR routing protocol. Then, some experimental tests are doing by demonstration case studies and the experimental results proved that our proposed routing protocols outperformed than current wireless routing protocols in terms of important network performance metrics such as periodical broadcast, network control overhead, bandwidth overhead, energy consumed and latency.

Balancing Awareness and Congestion in Vehicular Networks Using Variable Transmission Power

Vehicular ad Hoc networks (VANETs) support a variety of applications ranging from critical safety applications to “infotainment” or “comfort” applications. In North America, 75 MHz of the spectrum in the 5.9 GHz band has been allocated for vehicular communication. Safety applications rely on event-driven “alert” messages as well as the periodic broadcast of Basic Safety Messages (BSMs) containing critical information, e.g., position, speed, and heading from participating vehicles. The limited channel capacity and high message rates needed to ensure an adequate level of awareness make the reliable delivery of BSMs a challenging problem for VANETs. In this paper, we propose a decentralized congestion control algorithm that uses variable transmission power levels to reduce the channel busy ratio while maintaining a high level of awareness for nearby vehicles. The simulation results indicate that the proposed approach is able to achieve a suitable balance between awareness and bandwidth usage.

MDPRP: A Q-Learning Approach for the Joint Control of Beaconing Rate and Transmission Power in VANETs

Vehicular ad-hoc communications rely on periodic broadcast beacons as the basis for most of their safety applications, allowing vehicles to be aware of their surroundings. However, an excessive beaconing load might compromise the proper operation of these crucial applications, especially regarding the exchange of emergency messages. Therefore, congestion control can play an important role. In this article, we propose joint beaconing rate and transmission power control based on policy evaluation. To this end, a Markov Decision Process (MDP) is modeled by making a set of reasonable simplifying assumptions which are resolved using Q-learning techniques. This MDP characterization, denoted as MDPRP (indicating Rate and Power), leverages the trade-off between beaconing rate and transmission power allocation. Moreover, MDPRP operates in a non-cooperative and distributed fashion, without requiring additional information from neighbors, which makes it suitable for use in infrastructureless (ad-hoc) networks. The results obtained reveal that MDPRP not only balances the channel load successfully but also provides positive outcomes in terms of packet delivery ratio. Finally, the robustness of the solution is shown since the algorithm works well even in those cases where none of the assumptions made to derive the MDP model apply.

Chain-Based Covert Data Embedding Schemes in Blockchain

The quality of covert communications is determined by the choice of communication channels and the design of data embedding schemes. Recently, the Bitcoin system is prevalent as a covert communication channel. The consensus mechanism requires participants to spread their found valid blocks under an adjustable difficulty, which provides a stable periodic broadcast channel. Moreover, senders and receivers are difficult to be traced, because the Bitcoin system is pseudonymous. However, since the historical data in the ledger cannot be removed from the Bitcoin system, the openness and the persistent storage of the ledger in the Bitcoin system post new challenges when designing data embedding schemes. More concreteness, most traditional data embedding schemes either design by heuristic or empirical algorithms or use a fixed field to embed data in the transactions. Therefore, the covert data can be recognized once the algorithm is leaked or the pattern is explored. In this article, we first propose a hash chain-based covert data embedding (HC-CDE) scheme. The embedded transactions are difficult to be discovered. We further propose an elliptic curve Diffie–Hellman chain-based covert data embedding (ECDHC-CDE) scheme to enhance the security of the HC-CDE scheme. Experimental analysis on the Bitcoin Testnet verifies the security and the efficiency of the proposed schemes.

A Scalable and Secure Group Key Management Method for Secure V2V Communication.

Safety applications based on vehicle-to-everything (V2X) communications can significantly enhance road safety and reduce traffic fatalities. Ensuring the security and privacy of the vehicular network is essential for the widespread adoption of V2X communications for commercial use. V2X safety and service applications require periodic broadcast communications among all the vehicles. However, compared to unicast communication, it is extremely challenging to provide broadcast communication with network security requirements such as confidentiality, in infotainment contents distribution, sensor data sharing, and security credentials management services. To address the providing confidentiality of vehicle-to-vehicle (V2V) broadcasting, we propose a group key management and message encryption method that is secure, lightweight, and scalable. The proposed group key management method can efficiently handle various scenarios like a node joining or leaving the group, with scalable rekeying algorithms. It employs a distributed and scalable architecture that offers several advantages such as the reduction of the key management overhead and the enhancement of the security level by keeping the key sizes with large networks. In addition, the proposed method employs a lightweight matrix-based encryption algorithm that can be easily applicable with the proposed group key management method. Further, we have implemented the proposed method and evaluated the performance using a V2V network simulator with several networks of highly dynamic group members. The simulation results show that the proposed method can reduce computation time for group key generation and message encryption by more than 80% compared to existing methods.