Fast Message Research Articles

Development of message passing-based graph convolutional networks for classifying cancer pathology reports

BackgroundApplying graph convolutional networks (GCN) to the classification of free-form natural language texts leveraged by graph-of-words features (TextGCN) was studied and confirmed to be an effective means of describing complex natural language texts. However, the text classification models based on the TextGCN possess weaknesses in terms of memory consumption and model dissemination and distribution. In this paper, we present a fast message passing network (FastMPN), implementing a GCN with message passing architecture that provides versatility and flexibility by allowing trainable node embedding and edge weights, helping the GCN model find the better solution. We applied the FastMPN model to the task of clinical information extraction from cancer pathology reports, extracting the following six properties: main site, subsite, laterality, histology, behavior, and grade.ResultsWe evaluated the clinical task performance of the FastMPN models in terms of micro- and macro-averaged F1 scores. A comparison was performed with the multi-task convolutional neural network (MT-CNN) model. Results show that the FastMPN model is equivalent to or better than the MT-CNN.ConclusionsOur implementation revealed that our FastMPN model, which is based on the PyTorch platform, can train a large corpus (667,290 training samples) with 202,373 unique words in less than 3 minutes per epoch using one NVIDIA V100 hardware accelerator. Our experiments demonstrated that using this implementation, the clinical task performance scores of information extraction related to tumors from cancer pathology reports were highly competitive.

A FAST Hardware Decoder Optimized for Template Features to Obtain Order Book Data in Low Latency

High-Frequency Trading (HFT) systems require high computational performance for real-time trading and data analysis. FAST protocol, an extension of FIX protocol, is one of the main communication pattern adopted by these systems. This work presents an open source hardware component, implemented in Field-Programmable Gate Array (FPGA), to decode market data messages to produce the necessary commands to construct order books in low latency for the Brasil Bolsa Balcão B3 stock exchange. The proposed hardware component optimized for a B3 template is able to decode messages at average latency of 0.72us and throughput of 1.4M FAST messages per second. The results are from logs of real messages with average size of 85 bytes each.

ViSig

Visual body signals are designated body poses that deliver an application-specific message. Such signals are widely used for fast message communication in sports (signaling by umpires and referees), transportation (naval officers and aircraft marshallers), and construction (signaling by riggers and crane operators), to list a few examples. Automatic interpretation of such signals can help maintaining safer operations in these industries, help in record-keeping for auditing or accident investigation purposes, and function as a score-keeper in sports. When automation of these signals is desired, it is traditionally performed from a viewer's perspective by running computer vision algorithms on camera feeds. However, computer vision based approaches suffer from performance deterioration in scenarios such as lighting variations, occlusions, etc., might face resolution limitations, and can be challenging to install. Our work, ViSig, breaks with tradition by instead deploying on-body sensors for signal interpretation. Our key innovation is the fusion of ultra-wideband (UWB) sensors for capturing on-body distance measurements, inertial sensors (IMU) for capturing orientation of a few body segments, and photodiodes for finger signal recognition, enabling a robust interpretation of signals. By deploying only a small number of sensors, we show that body signals can be interpreted unambiguously in many different settings, including in games of Cricket, Baseball, and Football, and in operational safety use-cases such as crane operations and flag semaphores for maritime navigation, with > 90% accuracy. Overall, we have seen substantial promise in this approach and expect a large body of future follow-on work to start using UWB and IMU fused modalities for the more general human pose estimation problems.

Intelligent Vehicular Communication Using Vulnerability Scoring Based Routing Protocol

Internet of Vehicles (IoV) is an intelligent vehicular technology that allows vehicles to communicate with each other via internet. Communications and the Internet of Things (IoT) enable cutting-edge technologies including such self-driving cars. In the existing systems, there is a maximum communication delay while transmitting the messages. The proposed system uses hybrid Co-operative, Vehicular Communication Management Framework called CAMINO (CA). Further it uses, energy efficient fast message routing protocol with Common Vulnerability Scoring System (CVSS) methodology for improving the communication delay, throughput. It improves security while transmitting the messages through networks. In this research, we present a unique intelligent vehicular infrastructure communication management framework. This framework includes additional stability for both short and long-range mobile communications. It also includes built-in cooperative intelligent transport system (C-ITS) capabilities for experimental verification in real-world contexts. In addition, an energy efficient-fast message distribution routing protocol (EE-FMDRP) has been presented. This combines the benefits between both temporal and direction oriented routing methods. This has been suggested for distributing information from the origin ends to the predetermined objective in a quick, accurate, and effective manner in the event of an emergency. The critical value scale score(CVSS) employ ratings to measure the assault probability in Markov chains. Probabilities of chained transitions allow us to statistically evaluate the integrity of a group of IoV assets. Thus the proposed method helps to enhance the vehicular systems. The CAMINO with energy efficient fast protocol using CVSS (CA- EEFP-CVSS) method outperforms in terms of shortest transmission latency achieves 2.6 sec, highest throughput 11.6%, and lowest energy usage 17% and PDR 95.78%.

Assessment of Entrepreneurship Education as a Strategy for Poverty Alleviation among Business Education Graduates of Universities in South-South Nigeria

This study assessed entrepreneurship education as a strategy for poverty alleviation among business education graduates from universities in South-South Nigeria. Three research questions and three null hypotheses guided the study. The study adopted the descriptive survey research design. The target population for this study comprised of 200 business education graduates in Federal/State Universities in South-South Nigeria. The entire population was used for the study, since the population is manageable. Hence there was no sampling. The instrument that was used to collect data in this study was a questionnaire. The face and content validities of the questionnaire were determined by the researcher’s supervisor and two other experts in Business Education Department. Cronbach alpha reliability index was used to determine the internal consistency of the items in the instrument. The data obtained were analysed using descriptive and inferential statistics. Mean and standard deviation were utilized to answer the research questions while independent samples t-tests were employed to test the hypotheses at a significance level of 0.05. The findings of the study revealed that on average, undergraduate students possess high ability in the utilization of ICT skills; that on average, business education graduates possess high ability in the utilization of management skills; that on the average, business education graduates possess high ability in the utilization of marketing skills. The study also revealed that there is no significant difference between male and female business education graduates in the mean ratings of their possessed competencies in marketing. The study recommended that educational institutions should provide additional education and training for undergraduate in ICT so that they can possess high ability on how to create website, identify and open spreadsheet in another location, send and receive fast messages.

A feasibility study of using Manufacturing Message Specification report gateway model for IEC61850 inter-substation type-1 messaging over Wide Area Network

This paper presents a feasibility study of using TCP-based MMS report gateway model for transmitting type-1 messages over WAN. In IEC61850-90-5:2012, the Standard suggests to use UDP-based R-GOOSE for exchanging the type-1 messages, i.e. trip signals and other fast messages defined in the Standard, over WAN. However, due to the cyclic retransmission inherited from GOOSE, R-GOOSE messages are repeatedly sent to the network and thus pose unnecessary traffic to the WAN. With the proposed model, unnecessary re-transmissions can be eliminated. It can preserve bandwidth for more IEDs being imposed on the existing smart grid. To achieve this task, two IEC61850-based gateways for translating GOOSE Messages to and from the MMS report over WAN have been modeled and implemented. The authors then make use of an HLA-complied co-simulation platform to simulate a distance protection scenario through the gateways to investigate the communication latency with different links speed and utilization rate of WAN. Simulated results show that the proposed MMS report gateway model works well for different WAN link speed from DS3 to 1000BaseX. Simulation results further indicate that introducing QoS control to the WAN routers is an effective method to warrant the latency for satisfying the IEC61850 standard requirement. The result from this feasibility study reveals that the TCP-based MMS report gateway model indeed can be used as an extended feature for transmitting type-1 messages between substations over WAN. Furthermore, this method is suitable for connecting more IEC61850-based DER to the existing smart grid involving WAN.

An RDMA-enabled In-memory Computing Platform for R-tree on Clusters

R-tree is a foundational data structure used in spatial databases and scientific databases. With the advancement of networks and computer architectures, in-memory data processing for R-tree in distributed systems has become a common platform. We have observed new performance challenges to process R-tree as the amount of multidimensional datasets become increasingly high. Specifically, an R-tree server can be heavily overloaded while the network and client CPU are lightly loaded, and vice versa. In this article, we present the design and implementation of Catfish, an RDMA-enabled R-tree for low latency and high throughput by adaptively utilizing the available network bandwidth and computing resources to balance the workloads between clients and servers. We design and implement two basic mechanisms of using RDMA for a client-server R-tree data processing system. First, in the fast messaging design, we use RDMA writes to send R-tree requests to the server and let server threads process R-tree requests to achieve low query latency. Second, in the RDMA offloading design, we use RDMA reads to offload tree traversal from the server to the client, which rescues the server as it is overloaded. We further develop an adaptive scheme to effectively switch an R-tree search between fast messaging and RDMA offloading, maximizing the overall performance. Our experiments show that the adaptive solution of Catfish on InfiniBand significantly outperforms R-tree that uses only fast messaging or only RDMA offloading in both latency and throughput. Catfish can also deliver up to one order of magnitude performance over the traditional schemes using TCP/IP on 1 and 40 Gbps Ethernet. We make a strong case to use RDMA to effectively balance workloads in distributed systems for low latency and high throughput.

Benchmarking and Comparison of Two Open-source RTOSs for Embedded Systems Based on ARM Cortex-M4 MCU

Objective: To evaluate the performance of two open-source real-time operating systems (RTOSs), Keil RTX5 and FreeRTOS. Besides, a comparison between them has been also established based on four timing metrics: task switching time, pre-emption time, semaphore shuffling time, and inter-task messaging latency. All the tests have been performed on an STM32F429 discovery board based on Cortex-M4 MCUs. Methods: To measure the timing metrics, the ARM cycle counter register implemented in the DWT unit was used. Findings: The DWT cycle counter allows us to capture the number of cycles that occurred in the execution of a part of the code. Therefore, the time measurements of the metrics selected show that FreeRTOS has good performance with the lowest value of switching time, preemption time, and semaphore shuffling time. Instead, Keil RTX5 has fast message passing. Novelty: The study provides an evaluation and comparison of the latest version of the most used open-source RTOSs, Keil RTX5 and FreeRTOS v10.2.0. Furthermore, the timing metrics have been measured accurately with the ARM cycle counter register without using any other hardware or GPIO pin that may disturb the measurement. The comparison is based on four critical timing metrics that affect mostly the performance of any RTOS and define their time capability. Finally, the tests have been made on a low-power ARM MCU. Keywords: realtime operation system; embedded system; FreeRTOS; Keil RTX5; benchmarking metric; ARM MCU

Low Delay and Seamless Connectivity-based Message Propagation Mechanism for VANET of VCPS

Through Vehicular Ad-hoc Networks (VANET), Vehicle-to-Everything (V2X) contributes information communications for the cooperative driving in Vehicle Cyber Physical Systems (VCPS) at a traffic intersection vicinity. But the message propagation is often unreliable and slow due to the rapid change in network topologies and the high velocities or long distances among inter-vehicular in VANET. In order to achieve a reliable and fast message propagation for the cooperative driving in VANET, this study develops Seamless Connectivity-based Message Propagation Mechanism (SC-MPM), it is an opportunistic choice mode in VANET. This proposed mechanism can offer the seamless connectivity-based switchover procedure with a low-delay data optimization in V2X communications. The experimental analyses show that SC-MPM can recline message redundancy, increase message propagation velocity, and enhance data transmission reliability and validity in different traffic densities.

VCom: Secure and Efficient Vehicle-to-Vehicle Message Communication Protocol

Vehicles are especially capable of exchanging pertinent information with nearby vehicles. However, there are multiple challenges like secure data exchange, fast message transmission, dynamic topology, and user data protection while transmitting relevant information between moving vehicles on the road. Therefore, researchers suggested different vehicle-to-vehicle (V2V) message communication and verification mechanisms, but they are vulnerable to crucial security attacks. Furthermore, the existing V2V communication schemes relatively require high operational costs for the implementation, taking more time and computational resources for road safety and traffic data exchanges. In this article, we propose a secure and efficient V2V message communication protocol (named as <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">VCom</i> ) for vehicle users using a low-cost function (i.e., SHA-256) while preserving user anonymity. The security proof and analysis are discussed for the VCom to confirm its security and user privacy strengths against different security attributes and attacks. The test-bed implementation results show that the VCom is comparatively efficient in the computational cost, communication overhead, storage cost, and energy consumption.

Distance-Based Resource Allocation for Vehicle-to-Pedestrian Safety Communication

Cellular Vehicle to Everything (V2X) has redefined the vehicular communication architecture as something that needs an ultra-reliable link, high capacity, and fast message delivery in vehicular networks. The V2X scenarios are broadly categorized as Vehicle to Vehicle (V2V), Vehicle to Infrastructure (V2I), Vehicle to Pedestrians (V2P), and Vehicle to Network (V2N). Vulnerable pedestrians belong to the V2P category and hence require an ultra-reliable link and a fast message delivery in case the moving vehicle is in the close proximity of the pedestrian. However, congestion in the network calls for an optimized resource allocation that would allow a fast and secure connection between a vehicle and the pedestrian. In this paper, we have proposed a distance-based resource allocation that classifies the pedestrians in different categories, performs a one-to-many weighted bipartite matching, and finally a reinforcement learning based power allocation.

Batch-Assisted Verification Scheme for Reducing Message Verification Delay of the Vehicular Ad Hoc Networks

In terms of preventing traffic accidents, improving traffic efficiency and ensuring personal safety, the research on vehicular ad hoc networks (VANETs) is of great significance. Message authentication is an important security foundation for VANETs. With the rapid growth of the number of access terminals, the existing computing power of the VANETs will not be able to meet the fast message verification service load of large-scale dynamic networks. This article proposes a novel distributed collaborative authentication method. By selecting a reasonable number of assistance verification terminals in the VANETs system and cooperating with the roadside unit (RSU) to jointly undertake the task of network message verification, the purpose is to reduce the verification delay and achieve fast message verification. The simulation results show that in a large-scale connected vehicle with a large number of system terminals, the system message verification delay of our scheme is shortened to one tenth of the centralized verification system message verification delay.

LKM-AMI: A Lightweight Key Management Scheme for Secure two Way Communications between Smart Meters and HAN Devices of AMI System in Smart Grid

Smart Grid (SG) is a modernized power grid. Nowadays changing the power grid system into a smart grid is revolution and evolution. Owing to the widespread use of wireless communication technologies in Advanced Metering Infrastructure (AMI) of SG, security is one of the most significant and challenging problem. A specific feature of AMI systems is that it requires hybrid transmission modes of data which includes unicast, multicast and broadcast communication modes. Moreover, Smart Meters (SMs) and smart home appliances may have limited computing and storage capability and only authorized Home Area Network (HAN) appliances may communicate with SMs. Various key management systems have been presented to address these issues. However, performance and /or security issues are still exist in most of them. To meet these distinctive requirements and ensure confidentiality during communications in HAN of AMI, secure and robust key management scheme is required. This paper proposes a key management scheme tailored for HAN with significantly lower rekeying overhead and enhanced robustness which allows the SM and HAN devices to share a session key between them. In our scheme, when any smart device joins/leaves the system, there is no need to update the keys of existing devices. As a result, the rekeying cost is decreased to $$ \mathcal{O}(1) $$ . Compared with existing key management schemes, the proposed scheme achieves fast key distribution and message transmission between SM and the HAN devices while ensuring the privacy. The results illustrate that our scheme can outperform the related schemes in terms of rekeying cost while ensuring privacy protection.

Fast Message Broadcasting in Vehicular Networks: Model Analysis and Performance Evaluation

The pervasive use of technology in the urban environment requires evolved algorithms able to deliver messages across vehicular ad-hoc networks (VANETs). These networks could be exploited to run a vast plethora of applications, including critical ones such as emergency message distribution. The state-of-the-art broadcasting solutions are based on providing vehicles with different probabilities of forwarding the message in order to reduce message collisions and the number of hops to cover a certain area of interest. In this article, we examine a class of these propagation algorithms, discussing their model analysis and performance evaluation. Furthermore, we propose a possible algorithm’s extension introducing a dynamic setting of parameters according to the vehicular network’s conditions.

RETRACTED ARTICLE: EE-FMDRP: energy efficient-fast message distribution routing protocol for vehicular ad-hoc networks

Vehicular ad-hoc network (VANET) is a promising communication framework that provides connectivity between vehicles via vehicle-to-RSU (road side unit), inter-RSU and inter-vehicle communications and is features by high dynamic topological formation of nodes in the network. In VANET, the message distribution delay and reliable communication are the significant factors in case of emergency based communications. The main contribution of this paper relies on reducing message distribution delay with minimal communication overhead. Moreover, energy efficient-fast message distribution routing protocol (EE-FMDRP) has been proposed with the collaborative features of both time and direction oriented routing models. It has been proposed for broadcasting messages in case of emergencies from the source end to the defined target in fast, reliable and efficient manner. For that, bi-directional evaluation model for moving vehicles and message delivery time derivation model has been framed. This helps in performing fast message broadcasting in emergency cases with maximal throughput and reduced delay. Also, the EE-FMDRP offers consistent and efficient route between source vehicle and the destination with optimal intermediates and reduced complexities. Further, the protocol takes less message distribution time by selecting optimal intermediates, thereby providing energy efficiency and minimized network overhead. For evaluation, NS-2 simulation tool is used and the results prove that the proposed model achieves improved results than the compared existing protocols.

Using High-Bandwidth Networks Efficiently for Fast Graph Computation

Nowadays, high-bandwidth networks are more easily accessible than ever before. However, existing distributed graph-processing frameworks, such as GPS, fail to efficiently utilize the additional bandwidth capacity in these networks for higher performance, due to their inefficient computation and communication models, leading to very long waiting times experienced by users for the graph-computing results. The root cause lies in the fact that the computation and communication models of these frameworks generate, send and receive messages so slowly that only a small fraction of the available network bandwidth is utilized. In this paper, we propose a high-performance distributed graph-processing framework, called BlitzG, to address this problem. This framework fully exploits the available network bandwidth capacity for fast graph processing. Our approach aims at significant reduction in (i) the computation workload of each vertex for fast message generation by using a new slimmed-down vertex-centric computation model and (ii) the average message overhead for fast message delivery by designing a light-weight message-centric communication model. Evaluation on a 40Gbps Ethernet, driven by real-world graph datasets, shows that BlitzG outperforms GPS by up to 27x with an average of 20.7x.

Coded Caching in Fog-RAN: $b$ -Matching Approach

Fog radio access network (Fog-RAN), which pushes the caching and computing capabilities to the network edge, is capable of efficiently delivering contents to users by using carefully designed caching placement and content replacement algorithms. In this paper, the transmission scheme design and coding parameter optimization will be considered for coded caching in Fog-RAN, where the reliability of content delivery, i.e., content outage probability, is used as the performance metric. The problem will be formulated as a complicated multi-objective probabilistic combinatorial optimization. A novel maximum b-matching approach will then be proposed to obtain the Pareto optimal solution with fairness constraint. Based on the fast message passing approach, a distributed algorithm with a low memory usage of O(M + N) is also proposed, where M is the number of users and N is the number of Fog-APs. Although it is usually very difficult to derive the closed-form formulas for the optimal solution, the approximation formulas of the content outage probability will also be obtained as a function of coding parameters. The asymptotic optimal coding parameters can then be obtained by defining and deriving the outage exponent region (OER) and diversity-multiplexing region (DMR). Simulation results will illustrate the accuracy of the theoretical derivations, and verify the outage performance of the proposed approach. Therefore, this paper not only proposes a practical distributed Fog-AP selection algorithm for coded caching, but also provides a systematic way to evaluate and optimize the performance of Fog-RANs.

Subject Review: SMS Encryption for Android Mobile using the Encryption Algorithm

Nowadays, SMS or messaging is a very common way of communication. So, it differs from the apps and instant messaging available but SMS is still one of the broad communication methods as it does not require internet connection and sending inexpensive, fast and modest SMS messages. When confidential information is replaced by SMS, it is difficult to protect information from secure SMS and ensure that the message is sent only by approved senders. This research reviews and describes several methods used to encrypt SMS massage on android based on the encryption algorithm and compare these methods.

A Relay-Node Selection on Curve Road in Vehicular Networks

In vehicular networks, the selection of the relay-node determines the message dissemination through the vehicle-to-vehicle communication. However, the irregular shape of the curve road makes it difficult to design and analyze the relay-node selection on the curve road. In this paper, a relay-node selection on the curve road is first proposed, which aims to fast message delivery and complete coverage of the curve road, namely the complete relay-node selection. Additionally, after defining a metric of the curving rate, the models are constructed to analyze the performances of our proposal in terms of the message dissemination speed and the packet delivery rate. Simulations on a realistic mountain road are conducted. Moreover, the up-to-date relay-node selection methods are adapted to suit the scenario of the curve road for the comparison. The results of the simulations prove the validation of the analytic models and the significant performances of our proposal. The attractive benefits include not only the stable performance against the vehicle density in terms of the message dissemination speed and the packet delivery rate but also the improvements of at least 16.20% gain compared with these adapted methods in terms of the message dissemination speed as well as the packet delivery rate of more than 99.7%.

Efficient modeling of network flooding performance with proactive retransmissions in mobile ad hoc networks

Network flooding is the key mechanism designed to reach mobile nodes and disseminate the information in MANETs. Increasing the number of floods is a good way to improve coverage, namely, the fraction of nodes that receive the flooding message. However, this also will increase the overhead and hence the interference. In this paper, we used two different methods of refloods/retransmissions; originator-based retransmissions, where the originator of a message will retransmit the same message, and relay-based retransmissions, where each relay that has received the message will retransmit the same message. To compare two retransmission methods, we modeled the relationships of the coverage, overhead, and interference over the various flooding methods such as classic flooding method and several relay-set reduced flooding methods. Our analytic methods and numerical simulations made it possible to evaluate a wide range of scenarios (3,500,000 scenarios) with much less computational effort. In addition to analytic methods and numerical simulations, packet level simulations were performed to justify the results obtained from our efficient performance models. Furthermore, we investigated the impact of proactive retransmissions on the overhead and coverage as a function of message generation rate. When sequentially considering one transmission, originator-based optimal retransmission, and relay-based optimal retransmission, CF coverage becomes lower and lower than efficient flooding methods at the higher node density and faster message generation rate.