An efficient DDS node discovery scheme for naval combat system

A node discovery scheme is required to establish communication through discovery of matched endpoints. Data distribution service (DDS) uses simple discovery protocol (SDP) as its node discovery scheme. SDP works by sending each endpoint information to all participants that produce high network traff...

Full description

Saved in:
Bibliographic Details
Main Authors: Khaefi, Muhammad Rizal, Jin-Yong Im, Dong-Seong Kim
Format: Conference Proceeding
Language:English
Subjects:
Bloom Filters
Data Distribution Service
Discovery
Distributed System
Handheld computers
Matched filters
Middleware
Naval Combat System
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A node discovery scheme is required to establish communication through discovery of matched endpoints. Data distribution service (DDS) uses simple discovery protocol (SDP) as its node discovery scheme. SDP works by sending each endpoint information to all participants that produce high network traffic in naval combat systems (NCS). Moreover, NCS might suffers instability not only from technical problems but also enemy forces attack. A node discovery scheme based on Parallel Dynamic Bloom filters (PDBF) called SDP-ParallelDBF is proposed to improve DDS scalability by reducing the number of sent and stored messages in the network. Proposed scheme reduces unnecessary delay time spent restructuring Bloom filters, especially in unstable network environments. Furthermore, SDP-ParallelDBF offers computation speed-up through parallelization approach to provide additional delay time reduction. Simulation results show that proposed scheme reduces the delay time, number of messages, and messages size in the network while maintain false negative error free on unstable NCS.
ISSN:1946-0740
1946-0759
DOI:10.1109/ETFA.2015.7301426