scholarly journals A low-delay information sharing algorithm for multiple-radio-per-platform networking

2021 ◽  
Vol 17 (2) ◽  
pp. 155014772199442
Author(s):  
Ge Lin ◽  
Xu Renhui ◽  
Peng Laixian ◽  
Li Aijing ◽  
Yang Yaoqi
Keyword(s):  
Information Sharing ◽  
Real Time ◽  
Network Performance ◽  
Ad Hoc ◽  
Phased Array Antenna ◽  
Low Delay ◽  
Virtual Links ◽  
Transmission Capability ◽  
Real Time Information ◽  
Delay Information

In order to ensure the strong real-time information sharing of Aerial Ad hoc Network, a low-delay information sharing algorithm for multiple-radio-per-platform networking is proposed based on the directional transmission capability of phased-array antenna. The algorithm introduces virtual nodes and virtual links in the process of topology generation first. By extracting topology information and choosing link grouping, it can effectively reduce redundant transmission and transmission latency of information sharing. Then, it is verified through simulation that the algorithm can reduce the latency by up to 49.8% and eliminate transmission redundancy. In addition, a direction selection algorithm is proposed for the variation of antenna beam direction. Simulation results show that the algorithm can further reduce the latency of information sharing and ensure the real time of information sharing, thus further improving the network performance.

scholarly journals A Double-Layer Combination Algorithm for Real-Time Information-Sharing Network Design Problem

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Qi Sun ◽  
Liwen Jiang ◽  
Haitao Xu
Keyword(s):  
Information Sharing ◽  
Real Time ◽  
Double Layer ◽  
Design Problem ◽  
Carbon Emission ◽  
Bacterial Foraging ◽  
Time Problem ◽  
Bacterial Foraging Algorithm ◽  
Real Time Information ◽  
Time Information

The accumulation of real-time data has attracted the attention of various industries because valuable information can be extracted from the effective model and method design. This paper designs a low-carbon model and focuses on the real-time information-sharing network in order to get sustainable strategies promptly and exactly. The design problem is concerned with determining optimal integration strategies on a series of multilocation, multipath, and multiwarehouse freight provided by an information-sharing network to find an effective balance between the total costs and carbon emission. Firstly, the biobjective information-sharing network model is established to describe real-time problem with total cost and carbon emission factor. Secondly, a double-layer bacterial foraging algorithm is divided into inner and outer layers to solve the model, in which the inner section solves the transportation and inventory problems, and the outer section solves the supplier location problem. The double-layer bacterial foraging algorithm realizes the optimization of multisource e-commerce information-sharing model through nesting inside and outside layers. Finally, double-layer bacterial foraging algorithm can be confirmed to get the global optimal solution rapidly based on test data and the e-business case study of Jingdong, China.

scholarly journals Improving Performance in Trust Based Multi-Link-Rat Communication for V2x Heterogeneous Vehicular Network

2021 ◽  
pp. 458-464
Author(s):  
G. Baskaran ◽  
G. Pragathi ◽  
S. Prithika ◽  
P. Rajeswari ◽  
B. Rubasri
Keyword(s):  
Real Time ◽  
Traffic Management ◽  
Vehicular Networks ◽  
Ad Hoc ◽  
Road Traffic ◽  
Vehicle Speed ◽  
V2v Communications ◽  
Real Time Information ◽  
Traffic Detection ◽  
Time Information

The dynamic nature of vehicular networks imposes a lot of challenges in multi hop data transmission as links are vulnerable in their existence due to associated mobility of vehicles. It is very difficult to establish and maintain end-to-end connections in a vehicle ad hoc network (VANET) as a result of high vehicle speed, long inter-vehicle distance, and varying vehicle density. Here propose a distributed heterogeneous V2V communications algorithm that allows each vehicle to dynamically select the RAT that is more suitable at each point in time. Multi-link is the capability of a device to communicate using multiple wireless links simultaneously. Multi-RAT is the capability of a device to communicate using different RATs. To propose a Predictive Routing based on Markov Model (PRM) to ensure more reliable and timely data transmissions in VANETs. In the case of accident management, emergency messages may be sent to a pre-determined road rescue site upon the occurrence of an accident, such as a crash on the highway during a snow day and a car spontaneous combustion due to the stored explosives. PRM can facilitate the transmission of real-time information from vehicles to a road traffic controller for more efficient traffic management. Rather than using passive traffic detection through sensors, the real-time reports of traffic data through V2V and V2I can avoid the costs of installing and maintaining a large number of sensors.

An Efficient Selfishness Control Mechanism for Mobile Ad hoc Networks

2021 ◽  
pp. 432-449
Author(s):  
D. Rajalakshmi ◽  
Meena K.
Keyword(s):  
Real Time ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Resource Constraints ◽  
Selfish Nodes ◽  
Security Issue ◽  
Malicious Nodes ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A MANET (mobile ad hoc network) is a self-organized wireless network. This network is more vulnerable to security failure due to dynamic topology, infrastructure-less environment, and energy consumption. Based on this security issue, routing in MANET is very difficult in real time. In these kinds of networks, the mobility and resource constraints could lead to divide the networks and minimize the performance of the entire network. In real time it is not possible because some selfish nodes interacts with other nodes partially or may not share the data entirely. These kind of malicious or selfish nodes degrade the network performance. In this chapter, the authors proposed and implemented the effect of malicious activities in a MANETs using self-centered friendship tree routing. It's a novel replica model motivated by the social relationship. Using this technique, it detects the malicious nodes and prevents hacking issues in routing protocol in future routes.

Sign in / Sign up

Export Citation Format

Share Document