Reliable Message Dissemination Research Articles

Heterogeneous IoT/LTE ProSe virtual infrastructure for disaster situations

Natural disasters of any kind can have catastrophic consequences for properties, infrastructure, and human lives. During large-scale calamities, two common problems are faced: (i) the partial or even complete destruction of communications infrastructure, and (ii) the difficulty of collecting accurate information on the disaster area and trapped victims. These two problems prevent a quick and accurate assessment of damage, leading to inefficient rescue operations and putting the lives of rescuers and victims in great danger. The LTE Proximity Services (ProSe) and the Internet of Things (IoT) are promising technologies that can offer an efficient solution to the aforementioned problems in the form of a rapidly established emergency network for post-disaster management. In this paper, we propose a solution for the establishment of an efficient emergency communications network for post-disaster situations based on the LTE Device-to-Device ProSe (D2D ProSe) technology and IoT devices. It facilitates fast and efficient service discovery that allows querying heterogeneous IoT devices such as health sensors, wireless cameras, smartwatches, or any other relevant devices or sensors. The goal is to allow rescuers to have access to information produced by various things available during the rescue operation. We take advantage of LTE ProSe to create a distributed D2D broadcast backbone that enables efficient and reliable message dissemination while reducing energy consumption and achieving high coverage. We then add a multipath forwarding mechanism, in which each service type of IoT device is ensured an optimal path for its traffic. Unlike previous works, we fully implemented our solution in the NS3 simulator and relied on realistic models (wireless channels, energy, and mobility) to evaluate its performance compared to previous solutions, which we also implemented on NS3. The obtained results show that our solution achieves significant improvement compared to those proposed in the literature. The entire code used in this project is freely available to the community through GitHub.11https://github.com/iorisam/NS3_ED2D_IoT.

CPDD: Clustering and Probabilistic based Data Dissemination in Vehicular Adhoc Networks

Objectives: To maintain Quality of Service (QOS) for data dissemination, prevent packet loss and high reachability. Methods: To achieve this, CPDD: Clustering and Probabilistic based Data Dissemination in Vehicular Adhoc Networks is proposed. The messages are disseminated between the clusters. The Performance metrics like throughput, jitter, Normalized Routing Load, Routing Overhead and packet loss ratio are analysed using NS2 and the results are compared for the varying number of nodes. Findings: The proposed approach has a low packet drop ratio and end-to-end delay compared to SECADD, SEAD and S1PD. The efficiency of the traffic system and the quality of driving are both improved by data dissemination through VANETs by using CPDD. The goal of an effective clustering method is to reduce the number of clusters while maintaining high communication over the vehicular network. Novelty: Establishing effective communication between two fastmoving vehicles is a major challenge in VANET. The challenge in designing a robust and reliable message dissemination technique is required for VANET safety applications. The results of the proposed model CPDD is compared for different numbers of nodes. The proposed work improves the QOS metrics with the Normalized Routing Load of 1.009%, Routing Overhead of 1.03 bits/sec, throughput of 205.5 bits/sec, end-to-end delay of 0.435 seconds and packet loss ratio of 20.02% for 50 nodes. Keywords: Broadcasting; CPDD; Routing Overhead; Dissemination; Clustering; VANET

A Hybrid Crow Search and Gray Wolf Optimization Algorithm‐based Reliable Non‐Line‐of‐Sight Node Positioning Scheme for Vehicular Ad hoc Networks

SummaryVehicular Ad hoc NETwork (VANET) facilitates ubiquitous connectivity for establishing Vehicle‐to‐Vehicle (V2V) communication and supporting Intelligent Transportation Systems (ITSs). This vehicle communication requires complete coverage within the target range for ensuring reliable message dissemination. High density of vehicles in the intersections introduces challenges due to obstacles such as buildings, foliage, and other moving vehicles, preventing exchange of information about location and message update between vehicles. Non‐Line‐of‐Sight (NLOS) nodes also introduce broadcasting storm problem leading to congestion that prevents emergency messages from reaching the target vehicular nodes. Integration of meta‐heuristic Crow Search Algorithm (CSA) and Gray Wolf Optimization Algorithm (GWOA) minimizes the objective function of NLOS localization problem without the solution being trapped into local optima. In this paper, a Hybrid Crow Search and GWOA‐based NLOS Positioning Scheme (HCSGWOA‐NLOS‐PS) is proposed to handle the issue of broadcast storm and facilitate reliability in emergency message delivery. The proposed HCSGWOA‐NLOS‐PS utilizes the benefits of Time of Arrival (ToA) and geographical information‐based cooperative localization agent for attaining efficient NLOS node positioning in the network. It uses the benefits of CSA and GWOA for positioning the NLOS nodes based on the intelligence derived from the crows' conduit and the social attacking behavior of gray wolves that are ideal for balancing the tradeoff between exploration and exploitation. The simulation results of the proposed HCSGWOA‐NLOS‐PS confirm a mean emergency message delivery of 11.82%, neighborhood awareness of 12.38% with reduced localization error rate of 2.36% and minimized delay of 8.64% when compared to the baseline approaches.

Reliable and efficient data dissemination schemein VANET: a review

Vehicular ad-hoc network (VANET), identified as a mobile ad hoc network MANETs with several added constraints. Basically, in VANETs, the network is established on the fly based on the availability of vehicles on roads and supporting infrastructures along the roads, such as base stations. Vehicles and road-side infrastructures are required to provide communication facilities, particularly when enough vehicles are not available on the roads for effective communication. VANETs are crucial for providing a wide range of safety and non-safety applications to road users. However, the specific fundamental problem in VANET is the challenge of creating effective communication between two fast-moving vehicles. Therefore, message routing is an issue for many safety and non-safety of VANETs applications. The challenge in designing a robust but reliable message dissemination technique is primarily due to the stringent QoS requirements of the VANETs safety applications. This paper investigated various methods and conducted literature on an idea to develop a model for efficient and reliable message dissemination routing techniques in VANET.

A broadcast scheme for vehicle-to-pedestrian safety message dissemination

Ensuring cooperative awareness by periodic message beaconing in vehicular environments is necessary to address pedestrian safety. However, high periodic basic safety message broadcasting in dense vehicular environments makes accessing the communication channel very competitive. Furthermore, high-frequency periodic broadcasting causes fast device energy dissipation which is a key issue for small computing devices used in wireless sensor and mobile communications. Therefore, in order to achieve reliable message dissemination for vehicle-to-pedestrian safety, energy loss minimization mechanisms for pedestrian mobile devices should be developed. This article proposes controlling the number of broadcasts by eliminating periodic safety message broadcasts from pedestrian nodes; these nodes only receive broadcasts from vehicles and then conditionally communicate with the vehicles when safety alerts are raised. When the pedestrian nodes do not receive messages from any vehicle for a specified period, pedestrian no...

Analyzing Resilience of Interest-Based Social Networks Against Node and Link Failures

In typical online social networks, users are linked by symmetric friend relations and can define circles of friends based on shared interests. In this paper, we look at social networks where users form links subject to both friendships and shared interests. Our goal is to understand resilience of these networks in terms of connectivity when both nodes and links are allowed to fail. We derive a zero-one law as well as the asymptotically exact probability result for connectivity under both node and link failures. The results answer the question of how to set the network parameters such that reliable message dissemination can be achieved. We formally prove the results and confirm the results via experiments as well.