Information Dissemination Protocols Research Articles

Green Communication in IoT for Enabling Next-Generation Wireless Systems

Recent developments and the widespread use of IoT-enabled technologies has led to the Research and Development (R&D) efforts in green communication. Traditional dynamic-source routing is one of the well-known protocols that was suggested to solve the information dissemination problem in an IoT environment. However, this protocol suffers from a high level of energy consumption in sensor-enabled device-to-device and device-to-base station communications. As a result, new information dissemination protocols should be developed to overcome the challenge of dynamic-source routing, and other similar protocols regarding green communication. In this context, a new energy-efficient routing protocol (EFRP) is proposed using the hybrid adopted heuristic techniques. In the densely deployed sensor-enabled IoT environment, an optimal information dissemination path for device-to-device and device-to-base station communication was identified using a hybrid genetic algorithm (GA) and the antlion optimization (ALO) algorithms. An objective function is formulated focusing on energy consumption-centric cost minimization. The evaluation results demonstrate that the proposed protocol outperforms the Greedy approach and the DSR protocol in terms of a range of green communication metrics. It was noticed that the number of alive sensor nodes in the experimental network increased by more than 26% compared to the other approaches and lessened energy consumption by about 33%. This leads to a prolonged IoT network lifetime, increased by about 25%. It is evident that the proposed scheme greatly improves the information dissemination efficiency of the IoT network, significantly increasing the network’s throughput.

Social Media Influence, Role, Challenges, and Effect on Medicine

Social media has grown exponentially as an open, social platform for communication and information sharing. By April 2020, there were 3.81 billion active users, fueled by increased internet and mobile phone access. A notable aspect of these platforms is their potential in public health initiatives, reaching large audiences and offering direct messaging capabilities. Social networks often exhibit higher engagement and retention rates than traditional web-based approaches, and their interactive nature may have a more significant impact. Social media has been utilized for healthrelated interventions, public health campaigns, medical education, disease outbreak tracking, and health research. It facilitates cost-effective, two-way communication between healthcare professionals and patients, enhancing current medical practices. However, the use of technologies and eHealth applications presents challenges, including establishing trust, adhering to regulations, and curating optimal content. The emotional content of user-generated information, especially during health crises, raises concerns about misinformation, stigma, and mental health issues such as cyberbullying and depression. The misuse of social media can harm personal relationships and reputations. In medical contexts, it requires careful handling of information accuracy and accessibility. Issues with compliance, trust, and patient privacy have impacted doctor-patient relationships. The development of standard protocols for health information dissemination and understanding personal health data usage in various cultural and social contexts remains a key area for further research and exploration.

Modeling and Evaluation of a Dynamic Channel Selection Framework for Multi-Channel Operation in ITS-G5

Many years ago, it seemed inconceivable that our cars could drive autonomously or communicate with each other to form a self-organizing convoy or platoon. By 2023, however, technological advances have taken us to the point where most of these goals will be achieved. In the time of what was initially known as Day 1, single-channel Intelligent Transport System (ITS) devices fully met the requirements for safe communication. The trends show that with the rapid development and the emergence of new, more robust Vehicle-to-Everything (V2X) applications, which require higher bandwidth (collectively called Day 2), the current single-channel medium access method in the available ITS bands will no longer achieve the desired capacities. The main reason is that Day 2 and beyond V2X information dissemination protocols introduce increasing packet sizes and sending frequencies. To complete a resource-friendly and more efficient operation with Day 2 or other advanced V2X services, ITS standards present the Multi-Channel Operation (MCO) constellation as a potential solution. In the case of MCO, we use two or more channels simultaneously, thus preventing the radio medium from saturating its capacity. However, there are still several pending questions about MCO applicability, practical usage, configuration, and deployment, to name a few. The primary purpose of this article is to present a dynamic channel selection framework design and implementation capable of modeling and simulating advanced multi-channel communication use cases. We used this framework to investigate Channel Busy Ratio (CBR) based dynamic channel switching within the Artery/OMNeT++ simulation environment.

On the Privacy Guarantees of Gossip Protocols in General Networks

Recently, the privacy guarantees of information dissemination protocols have attracted increasing research interests, among which the gossip protocols assume vital importance in various information exchange applications. In this work, we study the privacy guarantees of gossip protocols in general networks in terms of differential privacy and prediction uncertainty. First, lower bounds of the differential privacy guarantees are derived for gossip protocols in general networks in both synchronous and asynchronous settings. The prediction uncertainty of the source node given a uniform prior is also determined. For the private gossip algorithm, the differential privacy and prediction uncertainty guarantees are derived in closed form. Moreover, considering that these two metrics may be restrictive in some scenarios, the relaxed variants are proposed. It is found that source anonymity is closely related to some key network structure parameters in the general network setting. Then, we investigate information spreading in wireless networks with unreliable communications, and quantify the tradeoff between differential privacy guarantees and information spreading efficiency. Finally, considering that the attacker may not be present at the beginning of the information dissemination process, the scenario of delayed monitoring is studied and the corresponding differential privacy guarantees are evaluated.

Baseline Knowledge, Attitudes, and Practices of Healthcare Practitioners in Rizal Province, Philippines toward Implementing the Universal Newborn Hearing Screening Program

Objective. The study describes the current knowledge, attitudes, and practices of healthcare practitioners in Rizal province regarding the implementation of the universal newborn hearing screening program (UNHSP).Materials and Methods. A descriptive phenomenologic research design through focus group discussions with pediatric and OBGYN consultants in a government hospital, nurses from private primary and secondary hospitals, midwives from private birthing homes, and rural health workers.Results. Attitudes. All participants recognized that they had important roles in implementing the program except the OBGYN consultants as they felt that information about the UNHSP should be provided by pediatricians. Practices. The lack of a screening device, trained personnel, and a referral network were the most common barriers in implementing the program. Knowledge. Most participants lacked specific knowledge about hearing loss and its implications in the UNHSP.Conclusion. Most participants were able to determine the advantages and disadvantages of implementing the UNHSP. However, less than half of the participants admitted to have an established protocol to give access to newborn hearing screening services. Establishment of an information dissemination protocol and materials may be beneficial in the absence of funding for screening devices.

A Knowledge Fusion Approach for Context Awareness in Vehicular Networks

Vehicular ad-hoc networks (VANETs) are a challenging Internet of Things scenario. While research is proposing increasingly sophisticated hardware and software solutions for on-board context detection, probably high-level context information sharing has not been adequately addressed so far. This paper proposes a novel logic-based framework enabling a contextual data management and mining in VANETs. It grounds on a knowledge fusion algorithm based on nonstandard, nonmonotonic inference services in Description Logics, adopting standard Semantic Web languages. Ontology-referred context annotations produced by individual VANET nodes are merged with automatic reconciliation of inconsistencies. An efficient information dissemination protocol complements the proposal. The approach has been implemented in a vehicular network simulator and early experimental results proved its effectiveness and feasibility.

An Opportunistic Dissemination Protocol for VANETs

In this article, we propose an Opportunistic information dissemination protocol by mixing both flooding and an enhanced DHVN (Dissemination protocol for heterogeneous Cooperative Vehicular Network) protocol, allowing them to run opportunistically in a Manhattan plan. Special additional logic is added to the existing version of DHVN protocol in order to efficiently disseminate information in two steps: 1) by adding three tags, Initial Diffusion, Standard DHVN and DHVN Near Intersection; the Initial Diffusion tag is used for the first flooding transmission only and 2) by changing the SNF (Store and Forward) period by making it adaptive depending on the region. Detailed simulation results show that our opportunistic protocol outperforms the DHVN protocol by analyzing its performances using an integrated framework VNS.

Gossip algorithms in quantum networks

Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up – in the best case exponentially – the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication.

Preset delay broadcast: a protocol for fast information dissemination in vehicular ad hoc networks (VANETs)

Vehicular ad hoc networks (VANETs) have been proposed in order to assist the driver on the road. There are multiple applications where VANETs are needed, for example, proposing routes to reach a given destination, cooperating for traffic management, or preventing the driver of dangers on the road. In this paper, we focus on message broadcast for driver safety. Such broadcasting must be fast and reliable such that all the vehicles in a certain area receive the message as fast as possible. There are several proposals in the literature of broadcast protocols for critical messages in VANETs. In order to get a wide view of the different techniques to broadcast a message, we evaluate a set of protocols representing one or more broadcast techniques. Moreover, we propose PDB, a preset delay broadcast protocol with a fixed delay for vehicles attempting to retransmit a warning message, which provides a fast and reliable dissemination. We show that by adequately setting the waiting time for the relay candidates, we can significantly reduce the delay to cover a given area, while at the same time preserving a good reliability. Moreover, we model different techniques to broadcast an emergency packet in a VANET such as count-based, geographical, distance-based, and opportunistic, and thus we implement a subset of state-of-the-art protocols that implement one or more of those techniques. Finally, our research shows that stopping beacon transmissions when a warning message is detected does not provide a significant performance improvement. Nonetheless, by allowing a continuous channel access, we prove that the performance of any protocol might be greatly increased.

A Driver Safety Information Broadcast Protocol for VANET

Due to the highly mobile nature of VANET, especially on highways, a reliable and fast penetration of emergency messages is required so that in-time decisions can be performed. A broadcast routing protocol can perform flooding in sparse network but it will suffer from high control overhead, higher delay and lower packet delivery ratio in dense environment. Since, a significant number of VANET messages including neighbour discovery, safety, destination discovery, location and service advertisements is broadcast therefore, the area of broadcast routing is important and needs careful design considerations. In this article, we propose ZoomOut Broadcast Routing Protocol for driver safety information dissemination in VANET. In ZBRP, 1-hop neighbour discovery messages are used in an intelligent way based on the speed and inter-vehicle distance of 1-hop neighbours to select a front and a behind vehicle. A neighbour from the front area is called front relative while the neighbour from behind area is called behind relative. During the processing of multi-hop safety messages, only a front or a behind relative rebroadcasts a safety message whereas nonrelatives drop it. ZBRP is compared with G-AODV, PGB and DV-CAST through ns-2 simulations. The results show that overall ZBRP performs better than the stated protocols. Keywords—Information dissemination; CAM; DENM; Intelligent beaconing; Intelligent transportation system; Broadcast suppression;

Information-centric dissemination protocol for safety information in vehicular ad-hoc networks

In vehicular networks, efficient safety information dissemination is a crucial issue. Unique characteristics of such an environment like highly mobility, fast topology changing, short-lived and intermittent connectivity pose challenges for safety information dissemination. Although IEEE 802.11p is standardized as an amendment to the IEEE 802.11 for connection-based wireless communication in vehicular environments (WAVE), it is still an open topic and a challenge to efficiently handle high mobility, intermittent connectivity, and spontaneous characteristics of vehicles on the roadway during wireless communication. This paper exploits information centric networking approach to design an efficient information dissemination protocol for such a challenging environment. The protocol is designed for both communication schemes in vehicular networks including vehicles-to-vehicles and vehicle-to-road. By focusing on information object itself, instead of end-to-end connection, the proposed mechanism supports fast and efficient data dissemination among multiple content consumers and multiple content providers, removing dependence on end-to-end connection between two nodes, thus improve the overall network performance. Through experimental results over different scenarios, we show that the proposed protocol achieves a significant improvement in term of the network performance compared to the conventional approach (WAVE).

Estimating user interaction strength in distributed online networks

SummaryUser interactions are indispensable for any online network to thrive, especially for BitTorrent‐like and Web real‐time communication‐based distributed online networks that rely on users' collective contributions instead of the help of central servers. User interactions provide fine‐grained information for many applications, such as security enhancement and cooperation promotion. To date, several schemes for estimating user interaction strength in centralized online networks have been proposed. In contrast, we present design, deployment, and analysis of UISE for user interaction strength estimation in distributed online networks. Among the strong points of UISE is that it captures both direct and indirect user interactions, and that it scales with only partial information dissemination. We apply UISE to devise the first distributed scheme for online time estimation and we implement it into Tribler, a distributed online network for media and social applications like file sharing, streaming, and voting. We demonstrate the accuracy and the scalability of UISE with different information dissemination protocols and user behaviors using simulations, emulations, and a real‐world deployment. Copyright © 2015 John Wiley & Sons, Ltd.

Finding a robust configuration for the AEDB information dissemination protocol for mobile ad hoc networks

The Adaptive Enhanced Distance Based Broadcasting Protocol, AEDB hereinafter, is an advanced adaptive protocol for information dissemination in mobile ad hoc networks (MANETs). It is based on the Distance Based broadcasting protocol, and it acts differently according to local information to minimize the energy and network use, while maximizing the coverage of the broadcasting process. As most of the existing communication protocols, AEDB relies on different thresholds for adapting its behavior to the environment. We propose in this work to look for configurations that induce a stable performance of the protocol in different networks by automatically fine tuning these thresholds thanks to the use of cooperative coevolutionary multi-objective evolutionary algorithms. Finding robust solutions for this problem is important because MANETs have a highly unpredictable and dynamic topology, features that have a strong influence on the performance of the protocol. Consequently, robust solutions that show a good performance under any circumstances are required. In this work, we define different fitness functions that measure robustness of solutions for better guiding the algorithm towards more robust solutions. They are: median, constrained, worst coverage, and worst hypervolume. Results show, that the two worst-case approaches perform better, not only in case of robustness but also in terms of accuracy of the reported AEDB configurations on a large set of networks.

Efficient code dissemination in wireless sensor networks

Given the dynamic nature of the mission of a wireless sensor network (WSN), and of the environment in which it is usually deployed, network reprogramming is an important activity that enables the WSN to adapt to the mission and/or environment. One important component of a reprogramming protocol is the code dissemination and maintenance, during which a new code is propagated to relevant WSN nodes. Several dissemination protocols have been proposed, each with a specific objective in mind. Protocols such as Trickle minimize dissemination latency by periodically broadcasting advertisement messages at the expense of energy consumption, while protocols, e.g., Varuna, reduce the energy usage by broadcasting advertisement only when needed. In certain type of WSNs, such as event-based WSNs, Varuna has high code dissemination latency, while the energy consumption of Trickle does not improve in such WSNs. Further, the efficiency of Varuna drops drastically in the presence of asymmetric links. In this paper, we propose a new code dissemination protocol, called Triva, for event-based WSNs, by leveraging the properties of Trickle and Varuna. Our simulation and experimental results show that, for event-based WSNs, Triva outperforms Trickle and Varuna in terms of energy consumption and code dissemination latency respectively. Triva also outperforms Trickle and Varuna when there are unidirectional links in the network. We also show that Triva provides excellent results during bursty traffic in event-based WSNs. Triva is the first information dissemination protocol for event-based WSNs and that tolerates asymmetric links.

An Enhanced Vehicular Information Dissemination Based on Back-Off Time Mechanism

Information dissemination in inter-vehicle communication is a main way to propagate and obtain the communicating messages among vehicles and infrastructures of road networks in vehicular ad-hoc network (VANET). However, a well-designed protocol for information dissemination would probably provide the higher performance of information dissemination in VANET. In this paper, we propose the improved information dissemination schemes for multi-hop broadcasting in VANET. Our proposed scheme will select a better message forwarder to forward the messages to its neighboring vehicles according to the back-off time for reducing the waiting time in the directional broadcasting. It will also adopt the road-side unit to keep the disseminated message at the intersection of the roads for waiting to disseminate the messages when the vehicle is crossing the intersection which may probably act as a message forwarder to forward the disseminated messages to the intersectional direction. In our simulation, the result indicates that our proposed scheme can efficiently disseminate the messages under the consideration of back-off time in VANET.

Infotainment services based on push-mode dissemination in an integrated VANET and 3G architecture

Given the bandwidth assignment for dedicated short range communications for use in vehicular ad-hoc network (VANET) and the expected introduction of equipment in the next few years, we elaborate on how VANET can support infotainment services. We define an architectural model for the integration of VANETs and cellular networks, according to a push mode paradigm where VANETs are used primarily to disseminate service announcements and general interest messages. Cooperation with cellular network is addressed by comparing architecture alternatives. A set of information dissemination protocols for VANETs is compared via simulations on a real urban map. Some results from a lab testbed based on IEEE 802.11p boards are presented along with an application developed for Android operating system to demonstrate the concept of the paper.

VANET Broadcast Protocol Based on Fuzzy Logic and Lightweight Retransmission Mechanism

Vehicular ad hoc networks have been attracting the interest of both academic and industrial communities on account of their potential role in Intelligent Transportation Systems (ITS). However, due to vehicle movement and fading in wireless communications, providing a reliable and efficient multi-hop broadcast service in vehicular ad hoc networks is still an open research topic. In this paper, we propose FUZZBR (FUZZy BRoadcast), a fuzzy logic based multi-hop broadcast protocol for information dissemination in vehicular ad hoc networks. FUZZBR has low message overhead since it uses only a subset of neighbor nodes to relay data messages. In the relay node selection, FUZZBR jointly considers multiple metrics of inter-vehicle distance, node mobility and signal strength by employing the fuzzy logic. FUZZBR also uses a lightweight retransmission mechanism to retransmit a packet when a relay fails. We use computer simulations to evaluate the performance of FUZZBR.

Worst-case latency of broadcast in intermittently connected networks

Worst-case latency is an important characteristic of information dissemination protocols. However, in sparse mobile ad hoc networks where end-to-end connectivity cannot be achieved and store-carry-forward algorithms are needed, such worst-case analyses have not been possible to perform on real mobility traces due to lack of suitable models. We propose a new metric called delay expansion that reflects connectivity and reachability properties of intermittently connected networks. Using the delay expansion, we show how bounds on worst-case latency can be derived for a general class of broadcast protocols and a wide range of real mobility patterns. The paper includes theoretical results that show how worst-case latency can be related with delay expansion for a given mobility scenario, as well as simulations to validate the theoretical model.

A Trust Based Sensor Protocol for Information Dissemination in a Point to Point Media

securing the information dissemination is an important issue in wireless sensor network. Previously, there is no available work on the integrated design of trust model and SPIN-PP protocol (sensor Protocols for Information via Negotiation) for information dissemination in wireless sensor networks. In this paper, to improve the quality of this a trust based sensor protocol for information dissemination in a point to point media is proposed. Here, first find out trust values of all the nodes by the trust model. In the existing trust models each node’s trust table contains trust value of all its neighbors. But in this proposed solution each node’s trust table contain only its own value. So there is no need for broadcasting the trust values of all the nodes. This will reduce the transmission overhead over the network. Then SPIN-PP is used for information dissemination over the network. Here the information can be send to the nodes with trust value higher than or equal to the threshold.

Dynamic grid load sharing with adaptive dissemination protocols

Scheduling in large scale dynamic grids comprising eclectic collections of resources is increasingly difficult. Autonomous resource neighborhoods may wish to determine the level of grid offered load that they can or will accept; different sites may wish to attract different amounts of load, to satisfy some desired property within a grid economy. This changes the traditional notion of load sharing, which generally assumes that the desired equilibrium should be an equal distribution of load across all participating machines, because they are under the jurisdiction of a single site, and therefore more likely to implement one common policy. In large-scale grids, nodes and neighborhoods should instead get a portion of the load that best matches their local policies for supporting and admitting grid jobs. This article describes information dissemination protocols that can distribute load in this way, without using load rebalancing through job migration, which is more difficult and costly in large-scale heterogeneous grids. Essentially, nodes adjust their advertising rates and aggressiveness to influence where jobs get scheduled. We report experimental results with example resource configurations in which each resource neighborhood determines its ideal grid load and disseminates accordingly. In turn, each neighborhood attracts the requisite amount of resource requests from the grid. Moreover, performance does not degrade: overall query satisfaction rates are within 9% of both adaptive dissemination protocols that use static adaptation policies, and static dissemination protocols that may be custom-tailored to specific resource and load distributions.