Replication-Based Data Dissemination in Connected Internet of Vehicles

Due to the dynamically changing topology of Internet of Vehicles (IoV), it is a challenging issue to achieve efficient data dissemination in IoV. This paper considers strongly connected IoV with a number of heterogenous vehicular nodes to disseminate information and studies distributed replication-based data dissemination algorithms to improve the performance of data dissemination. Accordingly, two data replication algorithms, a deterministic algorithm and a distributed randomised algorithm, are proposed. In the proposed algorithms, the number of message copies spread in the network is limited and the network will be balanced after a series of average operations among the nodes. The number of communication stages needed for network balance shows the complexity of network convergence as well as network convergence speed. It is proved that the network can achieve a balanced status after a finite number of communication stages. Meanwhile, the upper and lower bounds of the time complexity are derived when the distributed randomised algorithm is applied. Detailed mathematical results show that the network can be balanced quickly in complete graph; thus highly efficient data dissemination can be guaranteed in dense IoV. Simulation results present that the proposed randomised algorithm outperforms the present schemes in terms of transmissions and dissemination delay.

Download Full-text

Data Dissemination for Industry 4.0 Applications in Internet of Vehicles Based on Short-term Traffic Prediction

ACM Transactions on Internet Technology ◽

10.1145/3430505 ◽

2022 ◽

Vol 22 (1) ◽

pp. 1-18

Author(s):

Chen Chen ◽

Lei Liu ◽

Shaohua Wan ◽

Xiaozhe Hui ◽

Qingqi Pei

Keyword(s):

Network Architecture ◽

Industry 4.0 ◽

Data Dissemination ◽

Dynamic Network ◽

Traffic Prediction ◽

Delay Model ◽

Ant Colony Optimization Algorithm ◽

Short Term ◽

Internet Of Vehicles ◽

Efficient Data

As a key use case of Industry 4.0 and the Smart City, the Internet of Vehicles (IoV) provides an efficient way for city managers to regulate the traffic flow, improve the commuting performance, reduce the transportation facility cost, alleviate the traffic jam, and so on. In fact, the significant development of Internet of Vehicles has boosted the emergence of a variety of Industry 4.0 applications, e.g., smart logistics, intelligent transforation, and autonomous driving. The prerequisite of deploying these applications is the design of efficient data dissemination schemes by which the interactive information could be effectively exchanged. However, in Internet of Vehicles, an efficient data scheme should adapt to the high node movement and frequent network changing. To achieve the objective, the ability to predict short-term traffic is crucial for making optimal policy in advance. In this article, we propose a novel data dissemination scheme by exploring short-term traffic prediction for Industry 4.0 applications enabled in Internet of Vehicles. First, we present a three-tier network architecture with the aim to simply network management and reduce communication overheads. To capture dynamic network changing, a deep learning network is employed by the controller in this architecture to predict short-term traffic with the availability of enormous traffic data. Based on the traffic prediction, each road segment can be assigned a weight through the built two-dimensional delay model, enabling the controller to make routing decisions in advance. With the global weight information, the controller leverages the ant colony optimization algorithm to find the optimal routing path with minimum delay. Extensive simulations are carried out to demonstrate the accuracy of the traffic prediction model and the superiority of the proposed data dissemination scheme for Industry 4.0 applications.

Download Full-text

Discrete radio communication model for energy efficient data dissemination in wireless sensor networks

4th International Conference on Intelligent Environments (IE 08) ◽

10.1049/cp:20081127 ◽

2008 ◽

Author(s):

S. Hussein ◽

M. Mallinson ◽

Jong Hyuk Park ◽

Deok Gyu Lee ◽

Sung-Eon Cho

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Energy Efficient ◽

Data Dissemination ◽

Wireless Sensor ◽

Communication Model ◽

Radio Communication ◽

Efficient Data

Download Full-text

Fuzzy logic based forwarder selection for efficient data dissemination in VANETs

Wireless Networks ◽

10.1007/s11276-021-02548-8 ◽

2021 ◽

Author(s):

S. Karimulla Basha ◽

T. N. Shankar

Keyword(s):

Fuzzy Logic ◽

Data Dissemination ◽

Efficient Data ◽

Selection For

Download Full-text

ON THE AVERAGE CASE CIRCUIT DELAY OF DISJUNCTION

Parallel Processing Letters ◽

10.1142/s0129626495000254 ◽

1995 ◽

Vol 05 (02) ◽

pp. 275-280 ◽

Cited By ~ 2

Author(s):

BEATE BOLLIG ◽

MARTIN HÜHNE ◽

STEFAN PÖLT ◽

PETR SAVICKÝ

Keyword(s):

Lower Bounds ◽

Wide Class ◽

Time Complexity ◽

Upper And Lower Bounds ◽

Average Case ◽

Asymptotically Optimal ◽

Circuit Delay ◽

Suitable Measure

For circuits the expected delay is a suitable measure for the average case time complexity. In this paper, new upper and lower bounds on the expected delay of circuits for disjunction and conjunction are derived. The circuits presented yield asymptotically optimal expected delay for a wide class of distributions on the inputs even when the parameters of the distribution are not known in advance.

Download Full-text

A Fast 3-D Visualization Methodology Using Characteristic Views of Objects

International Journal of Software Engineering and Knowledge Engineering ◽

10.1142/s021819409800008x ◽

1998 ◽

Vol 08 (01) ◽

pp. 97-114 ◽

Cited By ~ 5

Author(s):

Soochan Hwang ◽

Sang-Young Cho ◽

Taehyung Wang ◽

Phillip C.-Y. Sheu

Keyword(s):

Finite Number ◽

Real Time ◽

Time Complexity ◽

Object Oriented ◽

Equivalence Classes ◽

Visualization Method ◽

Tree Algorithm ◽

Projected Image ◽

Characteristic Views ◽

Run Time

This paper describes a 3-D visualization method based on the concept of characteristic views (CVs). The idea of characteristic views was derived based on the observation that the infinite possible views of a 3-D object can be grouped into a finite number of equivalence classes so that within each class all the views are isomorphic in the sense that they have the same line-junction graphs. To visualize the changes of scenes in real time, the BSP tree algorithm is known to be efficient in a static environment in which the viewpoint can be changed easily. However, if a scene consists of many objects and each object consists of many polygons, the time complexity involved in traversing a BSP tree increases rapidly so that the original BSP tree algorithm may not be efficient. The method proposed in this paper is object-oriented in the sense that, for all viewpoints, at the preprocessing stage the ordering for displaying the objects is determined. At run time, the objects are displayed based on a pre-calculated ordering according to the viewpoint. In addition, a CV is used as a basic 2-D projected image of a 3-D object.

Download Full-text