Efficient Message Dissemination Research Articles

DIGITAL BOUNCER

Digital Bouncer presents an innovative solution, amalgamating an integrated platform for streamlined mass messaging and e-commerce capabilities. This comprehensive platform empowers users with efficient message dissemination to diverse audiences, comprising two pivotal components: a feature-rich e-commerce website and specialized software for message/email dissemination. The user-friendly website interface facilitates tailored messaging preferences and seamless product purchases. Key features include "Number Harbour," facilitating access to a large volume of numbers pertinent to specific location-based requirements following with dissemination of message according to user preference. Additionally, the integration of Telegram Automator and WhatsApp Automator software enriches communication avenues. Furthermore, the provision of a secure payment gateway enables hassle-free transactions, elevating Digital Bouncer as an all-encompassing solution catering to large-scale communication and e-commerce needs. Index Terms - Integrated Platform, Mass Messaging, E-commerce, User Empowerment, Tailored Messaging, Product Purchases, Number Harbour , Automatic Replies, Telegram Automator, WhatsApp Automator, Payment Gateway, Secure Transactions.

Reliable and Efficient Message Dissemination by Adaptive Relay Selection in Vehicular Networks

Successful message reception of an emergency event is the key objective of emergency message dissemination protocols in vehicular networks. This research paper proposes a new multi-hop data dissemination protocol for relay node selection for emergency events in vehicular networks. The proposed protocol is dynamically adaptive to vehicular density and link quality during the data dissemination process. Thus making it a viable solution for both practical scenarios. The protocol is evaluated by considering different vehicle density and network size. Simulation outputs confirm considerable performance improvements over existing distance-dependent protocols. In urban traffic density scenarios, over 20% improvements are achieved in delay performance to the furthest distance-based protocol with increased reliability and scalability in vehicular networks.

An Energy Efficient Message Dissemination Scheme in Platoon-Based Driving Systems

With the development of the convergence of IT and automotive technology, platoon-based driving systems are getting more attention and how to disseminate messages in the platoon is an important issue. In this paper, to enhance the energy efficiency and traffic throughput (e.g., average velocity) while meeting transmission deadlines, we propose an energy efficient message dissemination scheme (EMDS) in platoon-based driving systems, which also provides proper power control and relay selection. To find out the optimal policy to balance the probability of successful message dissemination and transmission power cost in EMDS, we formulate a Markov decision process (MDP) problem that considers the velocity of the vehicles in the platoon. To evaluate the performance of EMDS, we analyze the outage probability, the average velocity, and the expected power consumption using the discrete-time Markov chain (DTMC) model. Evaluation results demonstrate EMDS with the optimal policy improves the average velocity and the energy efficiency of message dissemination compared with the conventional message dissemination schemes, while reducing the message dissemination failure rate.

Unmanned Aerial Vehicles enabled IoT Platform for Disaster Management

Efficient and reliable systems are required to detect and monitor disasters such as wildfires as well as to notify the people in the disaster-affected areas. Internet of Things (IoT) is the key paradigm that can address the multitude problems related to disaster management. In addition, an unmanned aerial vehicles (UAVs)-enabled IoT platform connected via cellular network can further enhance the robustness of the disaster management system. The UAV-enabled IoT platform is based on three main research areas: (i) ground IoT network; (ii) communication technologies for ground and aerial connectivity; and (iii) data analytics. In this paper, we provide a holistic view of a UAVs-enabled IoT platform which can provide ubiquitous connectivity to both aerial and ground users in challenging environments such as wildfire management. We then highlight key challenges for the design of an efficient and reliable IoT platform. We detail a case study targeting the design of an efficient ground IoT network that can detect and monitor fire and send notifications to people using named data networking (NDN) architecture. The use of NDN architecture in a sensor network for IoT integrates pull-based communication to enable reliable and efficient message dissemination in the network and to notify the users as soon as possible in case of disastrous situations. The results of the case study show the enormous impact on the performance of IoT platform for wildfire management. Lastly, we draw the conclusion and outline future research directions in this field.

Congestion avoidance through fog computing in internet of vehicles

Recently, internet of vehicles (IoVs) is captivating a lot of interest due to a wide range of applications in various domains. These applications rely on up-to-date information of vehicles for provisioning various services. However, frequent message transmissions by a sheer number of vehicles may not only engulf a centralized server but may also cause a severe congestion which is not suitable for ongoing services specially in emergency situations. The aim of this study is to reduce congestion and messaging overhead. This paper presents a fog-assisted congestion avoidance scheme for IoV named energy efficient message dissemination (E2MD). Unlike most of the existing schemes, E2MD capitalizes the merits of fog computing to minimize communication cost and manage services. Each vehicle is required to update their status to a fog server frequently, either directly or through intermediate nodes. In case of an emergency, the fog server will timely inform upcoming traffic to slow down, dispatch rescue teams to provide necessary services, and coordinate patrolling missions to clear the road. Moreover, failure detection and recovery mechanisms are also presented to ensure availability of the fog server. The performance of the proposed scheme is validated through NS 2.35 simulations. Simulation results confirm the performance reign of E2MD compared to contemporary schemes in terms of latency and communication cost.

An Efficient Message Dissemination Scheme for Minimizing Delivery Delay in Delay Tolerant Networks

Delay tolerant networks (DTNs) are a kind of sparse and highly mobile wireless networks, where no stable connectivity guarantee can be assumed. Most DTN users have several points of interest (PoIs), and they enjoy disseminating messages to the other users of the same PoI through WiFi. In DTNs, some time-sensitive messages (disaster warnings, search notices, etc.) need to be rapidly propagated among specific users or areas. Therefore, finding a path from the source to the destination with the shortest delay is the key problem. Taking the dissemination cost into consideration, we propose an efficient message dissemination strategy for minimizing delivery delay (MDMD) in DTNs, which first defines the user’s activeness according to the transiting habit among different PoIs. Furthermore, depending on the activeness, an optimal user in each PoI is selected to constitute the path with the shortest delay. Finally, the MDMD with inactive state (on the way between PoIs) is further proposed to enhance the applicability. Simulation results show that, compared with other dissemination strategies, MDMD achieves the lowest average delay, and the comparable average hopcounts, on the premise that the delivery ratio is guaranteed to be 100% by the sufficient simulation time.

Cloud-Assisted Safety Message Dissemination in VANET–Cellular Heterogeneous Wireless Network

In vehicular ad hoc networks (VANETs), efficient message dissemination is critical to road safety and traffic efficiency. Since many VANET-based schemes suffer from high transmission delay and data redundancy, the integrated VANET–cellular heterogeneous network has been proposed recently and attracted significant attention. However, most existing studies focus on selecting suitable gateways to deliver safety message from the source vehicle to a remote server, whereas rapid safety message dissemination from the remote server to a targeted area has not been well studied. In this paper, we propose a framework for rapid message dissemination that combines the advantages of diverse communication and cloud computing technologies. Specifically, we propose a novel Cloud-assisted Message Downlink dissemination Scheme (CMDS), with which the safety messages in the cloud server are first delivered to the suitable mobile gateways on relevant roads with the help of cloud computing (where gateways are buses with both cellular and VANET interfaces), and then being disseminated among neighboring vehicles via vehicle-to-vehicle (V2V) communication. To evaluate the proposed scheme, we mathematically analyze its performance and conduct extensive simulation experiments. Numerical results confirm the efficiency of CMDS in various urban scenarios.

SEMD: Secure and efficient message dissemination with policy enforcement in VANET

Vehicular ad hoc network (VANET) is an increasing important paradigm, which not only provides safety enhancement but also improves roadway system efficiency. However, the security issues of data confidentiality, and access control over transmitted messages in VANET have remained to be solved. In this paper, we propose a secure and efficient message dissemination scheme (SEMD) with policy enforcement in VANET, and construct an outsourcing decryption of ciphertext-policy attribute-based encryption (CP-ABE) to provide differentiated access control services, which makes the vehicles delegate most of the decryption computation to nearest roadside unit (RSU). Performance evaluation demonstrates its efficiency in terms of computational complexity, space complexity, and decryption time. Security proof shows that it is secure against replayable choosen-ciphertext attacks (RCCA) in the standard model.

A graph structure approach to improving message dissemination in vehicular networks

Efficient message dissemination in vehicular ad-hoc networks (VANETs) is crucial for supporting communication among vehicles and also between users and the Internet, with minimal delay and overhead but maximum reachability. To improve the message dissemination in these networks, we show the need to study the graph-theoretic properties of VANETs, since they neither follow the small-world nor the scale-free network characteristics often found in large self-organized networks. We consider three fundamental properties: connectivity, node degree, and clustering coefficient. For each property, we develop and validate analytical models for both the urban and highway scenarios, building an extensive graph structure perspective on VANETs. With this, we see how connectivity changes with network density, that VANETs exhibit truncated Gaussian node degree distributions, and that network clustering coefficients do not depend on the network’s size or density. We then show how these results can be used to generate individual behavior favorable to the whole network using local information. The usefulness of this new approach is demonstrated by proposing new mechanisms to enhance the urban vehicular broadcasting protocol UV-CAST. Our results show that these new mechanisms lead to excellent performance while reducing the overhead in the UV-CAST protocol.

Location Aware Data Aggregation for Efficient Message Dissemination in Vehicular Ad Hoc Networks

An intelligent location-aware data aggregation mechanism for real-time observation, estimation, and efficient dissemination of any kind of traffic information in vehicular ad hoc networks (VANETs) is presented in this paper. The mechanism introduces a location awareness algorithm, enabling spatiotemporal database indexing and providing the location context of the messages without the use of advanced positioning systems such as satellite navigation and digital maps. Intelligent passive clustering and adaptive broadcasting are used to minimize the number of messages exchanged, packet collisions, and network load. The incoming messages are fused by a Kalman filter, allowing the description of the traffic-related information as a system characterized by as many variables as needed, depending on the application design. The scheme allows the comparison of aggregates and single observations, which enables their merging and better overall accuracy. Old information in aggregates is removed by real-time database refreshing, thus leaving only newer relevant information for the driver to make real-time decisions in traffic. The mechanism is generic and can be used for any kind of VANET information. It is evaluated by extensive simulations to show the efficiency and accuracy.

Survey on Broadcast Algorithms for Mobile Ad Hoc Networks

Networking at any time and any place paves the way for a large number of possible applications in ad hoc networks, from disaster relief in remote areas to network extension. Thus, for the past decades, many works have been proposed trying to make ad hoc networks a reality. The importance of broadcasting in networking and the broadcast nature of the wireless medium have encouraged researchers to join their efforts on designing efficient dissemination algorithms for Mobile Ad Hoc Networks (MANETs). The many different challenges that MANETs face, such as limited network resources, network partitions, or energy restrictions, gave rise to many different approaches to overcome one or more of those problems. Therefore, literature reveals a huge variety of techniques that have been proposed for efficient message dissemination. In this article, we make an in-depth review of the existing state-of-the-art techniques, as well as propose a new taxonomy that provides a global overview of the most relevant existing algorithms.

RTAD: A real-time adaptive dissemination system for VANETs

Efficient message dissemination is of utmost importance to propel the development of useful services and applications in Vehicular ad hoc Networks (VANETs). In this paper, we propose a novel adaptive system that allows each vehicle to automatically adopt the most suitable dissemination scheme in order to fit the warning message delivery policy to each specific situation. Our mechanism uses as input parameters the vehicular density and the topological characteristics of the environment where the vehicles are located, in order to decide which dissemination scheme to use. We compare our proposal with respect to two static dissemination schemes (eMDR and NJL), and three adaptive dissemination systems (UV-CAST, FDPD, and DV-CAST). Simulation results demonstrate that our approach significantly improves upon these solutions, being able to support more efficient warning message dissemination in all situations ranging from low densities with complex maps, to high densities in simple scenarios. In particular, RTAD improves existing approaches in terms of percentage of vehicles informed, while significantly reducing the number of messages sent, thus mitigating broadcast storms.

An Efficient Message Dissemination Technique in Platooning Applications

Autonomous driving in road trains, a.k.a. platooning, may reduce fuel consumption considerably if the inter-vehicle distances are kept short. However, to do this, the intra-platoon communication must not only be reliable but also able to meet strict deadlines. While time-triggered messages are the foundation of most distributed control applications, platooning is likely to also require dissemination of event-driven messages. While much research work has focused on minimizing the age of periodic messages, state-of-the-art for disseminating event-driven messages is to let all nodes repeat all messages and focus on mitigating broadcast storms. We derive an efficient message dissemination scheme based on relay selection which minimizes the probability of error at the intended receiver(s) for both unicast and broadcast, without degrading the performance of co-existing time-triggered messages. We present a full analysis of the resulting error probability and delay, when relayers, selected by our algorithm, are used to disseminate messages within a platoon. Numerical results indicate that the proposed relaying policy significantly enhances the reliability for a given delay.

Scaling Up Publish/Subscribe Overlays Using Interest Correlation for Link Sharing

Topic-based publish/subscribe is at the core of many distributed systems, ranging from application integration middleware to news dissemination. Therefore, much research was dedicated to publish/subscribe architectures and protocols, and in particular to the design of overlay networks for decentralized topic-based routing and efficient message dissemination. Nonetheless, existing systems fail to take full advantage of shared interests when disseminating information, hence suffering from high maintenance and traffic costs, or construct overlays that cope poorly with the scale and dynamism of large networks. In this paper, we present StaN, a decentralized protocol that optimizes the properties of gossip-based overlay networks for topic-based publish/subscribe by sharing a large number of physical connections without disrupting its logical properties. StaN relies only on local knowledge and operates by leveraging common interests among participants to improve global resource usage and promote topic and event scalability. The experimental evaluation under two real workloads, both via a real deployment and through simulation, shows that StaN provides an attractive infrastructure for scalable topic-based publish/subscribe.

PercolationNET: A multi-tree P2P overlay network supporting high coverage search

Flooding with a time-to-live constraint is a popular algorithm in unstructured peer-to-peer (P2P) networks. However, blind flooding may cause a large amount of network traffic. Moreover, it cannot guarantee acquiring all required data objects, especially for rare ones. To mitigate these problems, this paper proposes PercolationNET, a multi-tree sub-overlay, which is built on top of an existing P2P overlay (named original overlay). PercolationNET organises peers in a tree-based structure which facilitates reliable and efficient message dissemination for search. The search process is divided into two stages. A query message is first propagated on the original overlay, and then broadcast along the sub-overlay PercolationNET. PercolationNET combines the advantages of fast coverage speed in flooding-based scheme and low traffic cost in tree-based scheme. The experimental results of PercolationNET compared with FloodNet confirm the superiority of PercolationNET in achieving faster coverage speed and lower message cost.