Generic protocol for network management data collection and dissemination

Vehicular sensor networks (VSNs) have emerged as a new technology, which combines wireless communication offered by vehicular ad hoc NETworks with sensing devices installed in vehicles or in roadsides. VSN creates a huge opportunity to extend the roadside sensor infrastructure of existing traffic control systems. The main issues in VSNs are inherent in the data collection and its dissemination in such a large-scale network, characterized by frequent topology changes and network partitioning. This paper proposes a new multi-hop data collection and dissemination protocol based on data replication approach. The aim is an efficient collection and dissemination of data from a defined geographic area. Differently from other data collection protocols for VSNs, which have for purpose to collect data for traffic control applications or monitoring applications, our proposed protocol called Collaborative Data Collection Protocol (CDCP for VSNs) focuses on collecting data to be used in non-delay tolerant applications, so CDCP aims to collect the requested data within an optimized delay, but also, focuses in making this data accessible for other potential requests. Simulation results show the effectiveness of our proposed protocol.

HashQuery, a Hash-area-based data dissemination protocol, was designed in wireless sensor networks. Using a Hash function which uses time as the key, both mobile sinks and sensors can determine the same Hash area. The sensors can send the information about the events that they monitor to the Hash area and the mobile sinks need only to query that area instead of flooding among the whole network, and thus much energy can be saved. In addition, the location of the Hash area changes over time so as to balance the energy consumption in the whole network. Theoretical analysis shows that the proposed protocol can be energy-efficient and simulation studies further show that when there are 5 sources and 5 sinks in the network, it can save at least 50% energy compared with the existing two-tier data dissemination(TTDD) protocol, especially in large-scale wireless sensor networks.

The popularity of concurrent transmissions (CT) has soared after recent studies have shown their feasibility on the four physical layers specified by BLE 5, hence providing an alternative to the use of IEEE 802.15.4 for the design of reliable and efficient low-power wireless protocols. However, to date, the extent to which physical layer properties affect the performance of CT has not yet been investigated in detail. This article fills this gap and provides an extensive study on the impact of the physical layer on CT-based solutions using IEEE 802.15.4 and BLE 5. We first highlight through simulation how the impact of errors induced by relative carrier frequency offsets on the performance of CT highly depends on the choice of the underlying physical layer. We then confirm these observations experimentally on real hardware and with varying environmental conditions through an analysis of the bit error distribution across received packets, unveiling possible techniques to effectively handle these errors. We further study the performance of CT-based data collection and dissemination protocols in the presence of RF interference on a large-scale testbed, deriving insights on how the employed physical layer affects their dependability.

Data dissemination from multiple sources to mobile sinks is fundamental and challenging in WSN applications due to limited energy supply of sensor nodes and sink mobility. Previous data dissemination protocols either rely on an energy-consuming coordinate system or build an inefficient backbone. In this paper, we propose a hierarchical role-based data dissemination (HRDD) protocol in wireless sensor networks. In HRDD, a small number of sensor nodes are assigned to serve as cluster heads and agents to form the data dissemination backbone and mitigate unnecessary query forwarding. In addition, HRDD designs an efficient data delivery mechanism that provides shorter paths to accelerate data delivery as well as reduce the number of data transmissions. An adaptive backbone maintenance mechanism is also introduced for low-energy cluster heads and agents to reduce their load, thereby prolonging the network lifetime. The experimental results show that HRDD achieves the longer network lifetime, the shorter delay, and the high success ratio compared to the prior work.

One of the major challenges in facing the design of disseminating protocol for Wireless Sensor Networks (WSNs) is to find an energy efficiency way. Recently, several researches have been studied for this issue, and SPMS, that outperforms the well-known protocol SPIN, specially is a representative protocol. Also one of many characters of SPMS is the using of the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path as the shortest path, the maximizing of the network lifetime is impossible, though it reduces the energy consumption. In this paper, we propose a novel data dissemination protocol, called Energy and Distance Aware protocol based on SPIN (EDAS), that guarantees energy-efficient data transmission and maximizes network lifetime. EDAS solves the network lifetime problem by using the residual energy and the efficient distance between nodes to determine a path for data dissemination. The simulation results show that EDAS guarantees energy-efficient transmission and moreover increases the network lifetime by approximately 69% than that of SPMS.KeywordsWireless Sensor NetworksData Dissemination ProtocolEnergy EfficiencyLifetimeSPMS

In intelligent transportation systems, wireless connected vehicles moving in platoons can improve roads' throughput. For managing driving status of the platoon, a lead vehicle transmits driving information to following autonomous vehicles by using multi-hop data dissemination. We study a novel data dissemination protocol which investigates a chain-based transmit rate control to reduce data dissemination latency. The optimal resource allocation algorithm is formulated to minimize the total dissemination latency of the platoon under guaranteed bit error rates, and can be judiciously reformulated and solved using standard optimization techniques. A novel dynamic programming algorithm is presented to solve the platooning resource allocation optimization, which uses backward induction to significantly reduce the resource allocation complexity. In addition, we interpret the vehicular platoon as one-dimensional Markov chain, and derive a closed form of dissemination latency. Simulations are carried out to evaluate the performance of the proposed dynamic programming algorithm. The numerical results show that our algorithm achieves optimal solutions with cutting off the complexity by orders of magnitude, while improving dissemination rate in the vehicular platoon.

\n Distribution of data in mobile ad hoc networks is challenged when\n the mobility of nodes leads to frequent topology changes. Existing\n approaches so far address either the network partitioning problem or\n are capable of handling large amounts of data, but not both at the\n same time. In this paper a novel approach is presented which is\n based on a negotiation scheme enhanced by an adaptive repetition\n strategy. Different strategies for the selection of repeated data\n are presented and evaluated. Simulation results show a reduction of\n data transfer volume compared to hyper-flooding by 30 to 40% even in\n the presence of frequent network partitions.\n

A directional data dissemination protocol for vehicular environments

Wireless sensor network-based (WSN-based) applications need an efficient and reliable data dissemination service to facilitate maintenance, management and data distribution tasks. As WSNs nowadays are becoming pervasive and data intensive, bulk data dissemination protocols have been extensively studied recently. This paper provides a comprehensive survey of the state-of-the-art bulk data dissemination protocols. The large number of papers available in the literature propose various techniques to optimize the dissemination protocols. Different from the existing survey works which separately explores the building blocks of dissemination, our work categorizes the literature according to the optimization purposes: Reliability, Scalability and Transmission/Energy efficiency. By summarizing and reviewing the key insights and techniques, we further discuss on the future directions for each category. Our survey helps unveil three key findings for future direction: (1) The recent advances in wireless communications (e.g., study on cross-technology interference, error estimating codes, constructive interference, capture effect) can be potentially exploited to support further optimization on the reliability and energy efficiency of dissemination protocols; (2) Dissemination in multi-channel, multi-task and opportunistic networks requires more efforts to fully exploit the spatial-temporal network resources to enhance the data propagation; (3) Since many designs incur changes on MAC layer protocols, the co-existence of dissemination with other network protocols is another problem left to be addressed.

Enterprise Linux environments continue to expand in scale and heterogeneity, increasing the complexity of maintaining consistent patch levels and configuration compliance across thousands of systems. Although centralized lifecycle management platforms such as Red Hat Satellite provide foundational capabilities for system provisioning, patching, and configuration management, they lack an explicit governance model that enforces policy-driven compliance at enterprise scale. This paper presents a policy-driven architecture for enterprise patch and configuration governance built on Red Hat Satellite. The proposed architecture introduces a formal governance layer that defines compliance policies, enforcement rules, and remediation workflows independent of underlying operational tooling. Patch and configuration states are continuously evaluated against defined policies, enabling automated enforcement, exception handling, and compliance reporting. The architecture integrates Red Hat Satellite with automation frameworks to establish closed-loop governance across system lifecycle operations. A controlled experimental evaluation using a representative enterprise-scale Linux environment demonstrates improvements in compliance consistency, reduction in configuration drift, and faster convergence to desired system states compared to traditional operational approaches. The results indicate that separating governance logic from operational tooling provides a scalable and reproducible approach to enterprise patch and configuration management.

Wireless Sensor Networks (WSNs) are popular in smart homes to implement context-aware and intelligent services. Due to fixing bugs and adding new functions, the software on sensor nodes needs to be updated depending on efficient bulk data dissemination. Existing page transfer of data dissemination protocols employ pipelining technique to achieve spatial multiplexing. The conventional pipelining inefficiency, however, becomes a bottleneck in terms of dissemination delay and communication overhead. In this paper, we propose SAPM, a novel Self-Adjusting Pipelining Mechanism for efficient bulk data dissemination. By considering the impact of link correlation, detecting accumulated pages in sensor nodes, and carefully selecting the number of pages to request, SAPM shortens the dissemination delay effectively and reduces communication overhead to improve current bulk data dissemination protocols' performance. Our evaluation results on test bed experiments and extensive simulations show that SAPM reduces the completion time of state-of-the-art bulk data dissemination protocols by 27.8% on average compared to naive solution and the number of transmissions by 17.4% on average under high link correlation while having a low memory overhead.

This paper studies on delivery-guaranteed and effective data dissemination for mobile sink groups in wireless sensor networks. A mobile sink group denotes a set of tightly coupled mobile sinks for team collaborations such as a team of firefighters and a group of solders. The mobile sinks have a group movement feature. They thus randomly move in personal spaces as well as collectively move together as a single entity. To support such group mobility, previous studies provide circle-based protocols determining successive circular areas of a group continuously moving, and then propagate data in the areas by flooding. However, since a group is still moving during decision of each circle, they may cause asynchrony between circles and actual group positions. Eventually, it could harm reachability and energy-efficiency. We therefore propose a novel data dissemination protocol using motion properties of a mobile sink group: slowly varying and streamlike movement. By the slowly varying constraint, the protocol predictively and effectively delivers data to a group through a band of sensor nodes located in front of the streamlike trajectory of the group.

With the growth of large urban centers, some problems arise and solutions must be sought to contain them. In this context, traffic congestion is one such problem, where road infrastructure does not follow the high growth in the number of vehicles. Traffic Management Systems (TMS) arise to mitigate traffic-related problems, with automatic detection of slow roadways and vehicle rerouting to avoid such routes. Such applications are supported by the Vehicular Ad hoc NETworks (VANETs), where traffic information are disseminated between the vehicles or central server, and thus the better decisions about traffic management can be made. However, the data dissemination in VANETs is a challenging task, due to the short-range communication and high node mobility. Thus, this paper introduces a protocol for Data Dissemination based on Metrics of Complex Networks, called CRONOS. It provides data dissemination of traffic data with low overhead and high coverage. Simulation results show that CRONOS reduced the number of transmissions by 95%, the congestion time by 48.95%, and travel time by 18.11% for a TMS application.

In this paper, we propose a data dissemination protocol for asynchronous duty-cycling wireless sensor networks. In an asynchronous duty-cycling network, each node independently selects its wake-up time. In this environment, data dissemination becomes energy consuming, because broadcasting a packet does reach all neighbors but only the neighbors that are awake at the time. A node can forward its packet to all neighbors by continuously transmitting the packet for a whole wake-up interval, but it leads to high energy consumption and high dissemination delay. The idea proposed in this paper is to use opportunistic forwarding, where each node forwards the packet to a neighbor that wakes up early and receives the packet. Each node forwards the packet, as long as there is a neighboring node that has not received the packet yet. The main benefit of this opportunistic forwarding-based dissemination is that every time a packet is disseminated, it may take a different path to reach the nodes. At the beginning of dissemination, a sender needs to transmit for a very short duration of time because there are plenty of neighboring nodes to receive the packet. As more nodes receive the packet, the transmit duration of the sender becomes longer, thus consuming more energy. Since the order of dissemination is different every time, energy consumption is naturally balanced among the nodes, without explicit measures. Through extensive simulations, we show that the proposed protocol achieves longer network lifetime and shorter dissemination delay compared to other dissemination protocols in various network environments.

In complex marine environments, underwater sensor nodes exhibit continuous random drift driven by ocean currents, characterized by spatiotemporal correlations. This poses severe challenges, such as link interruptions and scheduling conflicts, for traditional AUV data collection protocols that assume static nodes or simple mobility models. To overcome the performance degradation caused by position uncertainty, this paper proposes a Robust Data Collection and Adaptive Scheduling MAC protocol (RDTAS-MAC). The protocol innovatively constructs a node drift model based on the Ornstein-Uhlenbeck (OU) process, which not only captures the mean-reverting characteristics of perturbations but also provides accurate prior distributions for subsequent state prediction. On this basis, the selection of the AUV's hovering position is modeled as a chance-constrained programming problem. A two-stage Monte Carlo search algorithm is designed to maximize the expected data collection utility while strictly guaranteeing probabilistic connectivity. Furthermore, addressing the random jitter in propagation delay, an uncertainty-aware scheduling mechanism is proposed. By dynamically mapping the error covariance of position estimates to time-domain guard intervals, collision-free parallel data transmission is achieved. Experimental results verify that the RDTAS-MAC protocol significantly improves throughput and reduces packet loss rates in strong perturbation scenarios. This study validates the necessity of incorporating physical layer position uncertainty into MAC layer design, providing a highly reliable solution for dynamic underwater acoustic networks.