An improved DDS publish/subscribe automatic discovery algorithm

Abstract

Publish/subscribe auto-discovery mechanism is the core technology of data distribution service (DDS), which has become a hot research topic in recent years. This existing auto-discovery algorithm, which is based on simple discovery protocol (SDP), has the problems of the participant DATA information artificially limited by the number of retransmissions, retransmission time randomness and higher network data transmission amount. This paper designs a process of automatic discovery of publish/subscribe state machine model and proposes an improved automatic discovery algorithm. The experimental results show that the algorithm can effectively eliminate the limitation and randomness of the resending DATA information packets, as well as reduce the amount of network data transmission.

MAD‐DDS: Memory‐efficient automatic discovery data distribution service for large‐scale distributed control network

“…This is an improvement to [6,7,10,28] where real-time packet-counting techniques of both data packets and the data address information to partake in the discovery phase, hence increasing discovery time. Eventually, more power was consumed [5,9] by both the end nodes and the data centers in the process. (II) Significant reduction of system's memory consumption:…”

“…The DomainParticipants of SDP‐DDS trigger all AD communication end‐nodes to interact among themselves, during the execution operation. These operations are subdivided into single participant discovery protocol (SPDP) and simple end nodes discovery protocol (SEDP) [9]. Since packets from the server's end nodes are inconsequential to the Remote DomainParticipant (RDP) in Figure 1b, as RDP only observes packets from its own topic, then a novel ADP‐based SDP_ETBF to mitigate communication flaws and present better system performance is designed.…”

“…The deployed nodes are proportional to the data error and transmissions. Much to our knowledge, the research limitations in [5][6][7][8][9][10][11] necessitated this work. These were significantly resolved with our proposed memory-efficient automatic discovery (MAD)-DDS model.…”

“…But when larger volumes are performed, network traffic and memory consumption issues remain, albeit recording minimal DDS performance. To improve on the ADP pattern, author [9] presented an ADP for publish‐subscribe state machines where all redundant packet information is eliminated, giving a reduced network load. However, the viability is complex while higher computational analysis was required to keep the publish‐subscribe state in an active status.…”

DCRMRP: distributed cooperative relay-based multihop routing protocol for WiMedia networks

“…The network's valid throughput shows significant degradation at some point because MAC layer needs to work with packet drop, collision, and retransmission when the network capacity is close to maximum limit (Figure 8). By reusing the existing DRP information to some extent the DCRMRP eliminates unnecessary information exchange thereby reduces the complexity (Zhai et al, 2014). In cooperative network, a quantitative analysis says that the energy consumed by different technologies like WiFi, WiMedia, WiMAX-WiFi and WiFi-WiFi under different channel conditions shows up to 80% energy can be saved using WiMedia compared to other technologies (Radwan and Rodriguez, 2012).…”