Message Delivery Performance Research Articles

Analysis of IEEE 802.11p-Based Intra-Platoon Message Broadcast Delay in a Platoon of Vehicles

For platooning applications, vehicles in a platoon require timely and reliable delivery of road-safety information in order to maintain the stable operation of the platoon. Intra-platoon message broadcast delay (InPB-delay) is a critical metric that is used to measure the message delivery performance in a platoon of vehicles, where a V2V multi-hop broadcast mode is used for message delivery. In this paper, we study the modeling and analyses of the InPB-delay for a platoon of connected and automated vehicles (CAVs), which employs an IEEE 802.11p EDCA mechanism for channel access. A 2-D Markov chain model is first built to describe a backoff procedure of a platoon broadcasting node, which takes into account the four access categories of different priorities in the EDCA mechanism. Based on the Markov model, a theoretical performance model is further derived to investigate the impacts of major system parameters on the InPB-delay, taking into account the effects of both platoon vehicles and non-platoon vehicles. The derived performance model is validated through simulation results and the impacts of major system parameters are investigated through numerical results. The InPB-delay model can be used to provide reference values for system parameter settings in order to ensure the stable operation of a platoon.

DisastDrone: A Disaster Aware Consumer Internet of Drone Things System in Ultra-Low Latent 6G Network

Internet of Things application in disaster responses and management is a predominant research domain. The introduction of the consumer drones, flying ad-hoc networks, low latency 5G, and beyond 5G produce significant acceleration of this research. The work proposed the implementation of the Consumer Internet of Drone Things (CIoDT) framework for emergency message transfer among smart grid systems and other power sources and enables stable network connectivity in a disaster scenario. A real-life mobility model has been engineered, and the edge-enabled opportunistic MQTT message transfer mechanism is implemented. Also, a dedicated network slice is devised to examine routing performance. A real-life prototype test-bed emulator has been designed to evaluate mobility, message delivery, and flight attitude performance. The results show a message delivery probability of nearly 0.99 in Quality of Service 2(QoS2), and 1.19 seconds of end-to-end latency in Quality of Service level 1(QoS1). An experiment also shows a 94% of coverage ratio in a network slice for QoS2, 84% of bandwidth utilization per network slice, and a minimum of 100ms latency per network slice. The proposed system is highly suitable for mass production of light weight drone network for disaster management.

Implementation of Group-Based Human Movement Model in Opportunistic Network

As an instance of a distributed computing system, opportunistic networks facilitate message dissemination in a store-carry-forward manner. In this setting, the mobile devices are communicating in opportunistic contacts as they move across the network areas. However, the movement of these mobile devices is exclusively reliant on the mobility of their human owner, thereby limiting the likelihood of contact. The current state of the art typically simulates human movement based on randomness, which is unsuitable for representing how people move in groups. Therefore, this paper proposes an implementation of a group-based human mobility model to simulate device-to-device communication in opportunistic networks. In this model, individuals are able to move as a set within a group and have the ability to join and leave the group dynamically We built the model in BonnMotion and subsequently implemented it in an opportunistic environment simulator, ONE Simulator. To evaluate the proposed model, we compared them to the random-based model as a benchmark. Subsequently, we assess the impact of the movement model on two major areas of network performance: message delivery performance and resource utilization, such as nodes’ energy consumption. We are concerned about these aspects since the mobile agents have limited resources yet are expected to achieve a high rate of message delivery as well. The simulation results show that our model outperformed the random-based model in terms of the number of successfully delivered messages and average delay. However, the number of message replications and the energy consumption is fairly higher than those of the benchmarks.

Implementasi Enkripsi dan Otentikasi Transmisi Data ZeroMQ Menggunakan Advanced Encryption Standard

Communication via sockets is used to transmit information between applications or between processes over network or locally. ZeroMQ is a library for sending messages using sockets that are quite well known. Talking about sending data, message security is an important part that needs to be taken into account, especially when sending data over a network. ZeroMQ sends messages openly without securing the messages sent. This is evidenced by research which states that ZeroMQ does not have a security layer for sending messages over the network and direct observation of message packets using the wireshark application. Therefore, this study creates a method of securing and authenticating message delivery using AES (Advanced Encryption Standard) CBC (Cipher Block Chaining) mode combined with an authentication method. The AES CBC mode was chosen because it is faster than other methods and has strong encryption. This encryption and authentication are used so that the sender and recipient of the message are both valid senders and recipients so that no message changes during message delivery and messages can only be opened by the message recipient and the sender of the message. Tests are conducted to measure the effect of encryption and authentication on message delivery performance. Based on the tests conducted, there is an increase of 7% from normal delivery speed and the potential for messages is not up to 0.3% - 1.5%.

Intelligent Authentication and Message Forwarding in VANET

Vehicle ad hoc networks face the challenging issue of vehicle communication and its security. So, these issues become key research topics for global VANET researchers. Researcher's current solutions mostly focus on either of the problems but currently they are now heading towards finding satisfactory solutions for both of the above-mentioned problems. VANET networks should be robust and strongly dependent on their communication rapidness, message authentication, priority messaging, and security. Here, the authors discuss four VANET issues: authentication delays, fake messages, priority-based messaging, and VANET security, with respective solutions. This article presents an enhanced ECC-based algorithm to minimize authentication delays and provide secure VANET. Result analysis shows that the algorithm is effective in reducing the authentication delays and improves communication rapidness, improves the security model operation to detect Sybil and reply attack, and promotes intelligent message forwarding to block fake messages and increases message delivery performance.

해사 클라우드 환경에서 MRN기반의 해사 엔터티 식별체계 설계 및 아이디기반의 메시지 전달 성능 분석

국제해사기구인 IMO에서는 인적과실에 의한 해양사고를 예방할 목적으로 e-내비게이션(e-Navigation) 도입을 결정하였다. 현재 e-내비게이션 서비스를 위한 통신 인프라로서 해사 클라우드가 개발되고 있다. 본 논문에서는 사용자와 선박 등 해사 엔터티를 한국에서 독립적으로 등록하고 관리하고자 할 때 요구되는 해사 엔터티의 식별 체계를 제안한다. 또한 본 논문에서는 시뮬레이션을 통하여 해사 클라우드에서 정의된 MMS 서버 기반의 통신방식과 기존 해양 통신방식을 메시지 전달 성능 관점에서 평가한다.

Architecture for Mobile Cloud Computing via Middle-Ware Technologies

Mobile devices are playing a vital role in information processing systems in day to day life. Current trend suggests that smart phones are going to be the first-most computing devices which many people will carry with them for maximum time everywhere. However, smart phones are still lacking behind the essential resources. This demands the need for Mobile Cloud Computing, where the key elements of data storage and data processing are carried outside the mobile devices. So this provides flexibility to mobile users as, the application and the data stored remotely can be accessed on-the-fly with high speed networks. Variation among the mobile network on basis of elements such as, bandwidth, unstable network and its uncertain availability are barriers for Quality Of Services in the performance. Thus the solution is to connect the mobile devices heterogeneously where they work collaboratively as resource providers. Our mechanism suggest for “Mobile to Hub to Cloud” model which can tackles the network disparity problem. A scenario gives the perfect example for the need of such model, mobile users in areas with infrastructure where the costs of accessing the network is too high, such as traveler who doesn’t wished to pay high roaming charges. Thus the suggested model can evaluate the following options: storing data in mobile hubs and improving the message delivery performance. So as in our example, traveler now can push the data onto the mobile buffers or hubs which in turn will send it to the cloud server.

Evaluating the impact of network loads and message size on mobile opportunistic networks in challenged environments

The use of mobile opportunistic networks may help users to gain access to an available network connection for communication in challenged environments. For instance, areas that lack an available infrastructure for communication (e.g., rural or sparse areas) or areas with an infrastructure where the network connection is not as accessible (e.g., restricted/full of interference access networks or a high cost roaming zone). In this paper, we observe how the overall network performs with the changes of network load (e.g., number of messages) along with the long-sized messages in such environments. With real-world trace-driven simulations, we compare and contrast the impact of the message generation rates and the message size in different opportunistic routing protocols in a challenged environment to see this performance impact. Our experimental results show that in such environments, mobile opportunistic networks improve the overall message delivery performance using user's interactions and social collaborations even with higher message generation rates and increased message sizes.

On Trajectory-Based I2V Group Message Delivery Over Vehicular Ad-Hoc Networks

In the literature, future vehicle trajectories have been exploited to improve the performance of challenging infrastructure-to-vehicle (I2V) group message delivery over vehicular ad-hoc networks (VANETs). The existing trajectory-based I2V group message delivery protocols typically consist of two phases. Based on the reported vehicle trajectories, phase one identifies an appropriate rendezvous point of the group message and each of the member vehicles. Then, phase two composes a multicast tree to deliver the message to these selected rendezvous points. The message is kept at the rendezvous points for later last-hop delivery when the member vehicles pass through. However, separately handling the rendezvous point selection and the multicast tree construction may significantly restrict the overall message delivery performance. This paper designs a novel trajectory-based I2V group message delivery protocol, i.e., eTGMD, for delay-tolerant vehicular applications. eTGMD iteratively selects a promising rendezvous point and extends the current multicast tree to cover the selected rendezvous point. Our specific contributions include the following: 1) We prove the trajectory-based I2V group message delivery problem's NP-hardness, 2) we theoretically analyze the worst-case performance bound and time complexity of eTGMD, and 3) we conduct extensive simulation experiments to evaluate eTGMD's message delivery performance.

Transmission Policies for Multi-Segment Short Messages

The performance of single-segment short messaging service (SMS) (i.e., the message sizes are smaller than 140 octets) has been intensively investigated. On the other hand, multisegment messages (with sizes larger than 140 octets) are seldom evaluated in the literature. This paper proposes analytical models to study two transmission policies for multisegment short messages. We show how to improve the performance of multisegment short message delivery by selecting appropriate transmission parameters: the retransmission interval and the maximum number of transmissions. The proposed models are validated by measured data collected from the largest telecom operator in Taiwan over a period of six months. We provide useful guidelines to configure parameters for SMS transmission policy. Numerical examples showed that the performance can be improved by over 20% in terms of successful delivery ratio.

Packet Fragmentation and Reassembly in Molecular Communication.

This paper describes packet fragmentation and reassembly to achieve reliable molecular communication among bionanomachines. In the molecular communication described in this paper, a sender bionanomachine performs packet fragmentation, dividing a large molecular message into smaller pieces and embedding into smaller molecular packets, so that molecular packets have higher diffusivity to reach the receiver bionanomachine. The receiver bionanomachine then performs packet reassembly to retrieve the original molecular message from a set of molecular packets that it receives. To examine the effect of packet fragmentation and reassembly, we develop analytical models and conduct numerical experiments. Numerical results show that packet fragmentation and reassembly can improve the message delivery performance. Numerical results also indicate that packet fragmentation and reassembly may degrade the performance in the presence of drift in the environment.

An Adaptive Trajectory-Based Group Message Delivery Protocol with Detour Support for Vehicular Networks

To realise I2V group message delivery, some previously proposed protocols utilise the future trajectories of vehicles to deploy message delivery routes. However, we have noticed that none of these protocols consider that the destination vehicles may take unexpected detours, resulting in these vehicles no longer passing the rendezvous points. Thus, the detoured vehicles miss the messages stored on the rendezvous points. To address this issue, this paper designs tc-eTGMD, which aims to redeploy only the routes for the detour vehicles when the detour events happen. Moreover, this scheme can guarantee the reaction time and can offload the traffic while handling the detour events. The specific contributions of this paper are as follows: (1) we formally formulate the trajectory-based I2V group message delivery with the detour events problem; (2) we give a detailed design of tc-eTGMD protocol and (3) we conduct extensive simulation experiments to evaluate tc-eTGMD's message delivery performance.

A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks

Delay-tolerant networks (DTNs) can tolerate disruption on end-to-end paths by taking advantage of temporal links emerging between nodes as nodes move in the network. Intermediate nodes store messages before forwarding opportunities become available. A series of encounters (i.e., coming within mutual transmission range) among different nodes will eventually deliver the message to the desired destination. The message delivery performance in a DTN (such as delivery ratio and end-to-end delay) highly depends on the time elapsed between encounters and the time two nodes remain in each others communication range once a contact is established. As messages are forwarded opportunistically among nodes, it is important to have sufficient contact opportunities in the network for faster, more reliable delivery of messages. We propose a simple yet efficient method for improving the performance of a DTN by increasing the contact duration of encountered nodes (i.e., mobile devices). Our proposed sticky transfer framework and protocol enable nodes in DTNs to collect neighbors’ information, evaluate their movement patterns and amounts of data to transfer in order to make decisions of whether to “stick” with a neighbor to complete the necessary data transfers. The sticky transfer framework can be combined with any DTN routing protocol to improve its performance. We evaluate ourframework through simulations and measure several network performance metrics. Simulation results show that the proposed framework can improve the message delivery ratio, end-to-end delay, overhead ratio, buffer occupancy, number of disrupted message transmissions and so on. It can be well adopted for challenged scenarios where larger messages sizes need to be delivered with application deadline constraints. Furthermore, performance of the DTN improved (upto 43%) at higher node densities and (up to 49%) under increased mobility conditions.

Association of Volunteer Communication Mobilizers’ Polio-Related Knowledge and Job-Related Characteristics With Health Message Delivery Performance in Kano District of Nigeria

Volunteer communication mobilizers (VCMs) were deployed in Nigeria to increase community awareness for polio vaccination. To understand whether VCMs’ knowledge and job-related characteristics were associated with performance, we conducted a cross-sectional survey in the Nassarawa and Ungogo Local Governance Areas (LGAs). We asked VCMs about the consequences of polio, preventive strategies, and health communication messages to assess knowledge. We considered VCMs’ performance satisfactory if they delivered more messages during their last visit, and knew the number of <5 children and neonates in their settlement. We used t-tests to compare continuous and chi-square tests for categorical variables, and ran linear and ordinal logistic regression to understand if knowledge and job-related characteristics were associated with performance. Of the VCMs, 69% (118/170) were enrolled from Ungogo. We found that 63% of VCMs in Nassarawa had appropriate levels of knowledge about health education messages, compared to 2...

New Causally Ordered Delivery Protocol Using Information of Immediate Predecessor Messages between Brokers and Subscribers

In most large-scale distributed applications, publish/subscribe (P/S) systems allow a decoupling between senders and receivers to interact with publishers and subscribers. Recently, in these areas, there has been increasing emphasis in managing end-to-end message delivery performance and message order-based consistency, which have been addressed in distributed collaborative applications. Especially, a causally ordered delivery consistency is more useful for these applications in which a large number of processes request collaboratively and interactively. In P/S systems of wireless sensor networks (WSNs), data fusion, the process of correlating individual sensor readings into high-level sensing results, depends on a causally ordered delivery. And gossip protocols based on P/S systems are becoming one of the promising solutions for addressing P/S scalability problems and very useful for the applications with a mixture of diverse message order consistencies. In this paper, we present two versions of causally ordered delivery protocols based on P/S systems using gossip protocols. The one is that only the predecessors immediately before the multicast message are disseminated from brokers to subscribers. And the other, specifically for P/S systems of WSNs, is that the timestamps that represent the gossip round in which the immediate predecessors are generated are disseminated from brokers to subscribers. The features of these two versions might be highly scalable and suitable for the area of the applications requiring only the minimum causal information with flexible consistency.

An Empirical Study of Communication Infrastructures Towards the Smart Grid: Design, Implementation, and Evaluation

The smart grid features ubiquitous interconnections of power equipments to enable two-way flows of electricity and information for various intelligent power management applications, such as accurate relay protection and timely demand response. To fulfill such pervasive equipment interconnects, a full-fledged communication infrastructure is of great importance in the smart grid. There have been extensive works on disparate layouts of communication infrastructures in the smart grid by surveying feasible wired or wireless communication technologies, such as power line communications and cellular networks. Nevertheless, towards an operable, cost-efficient and backward-compatible communication solution, more comprehensive and practical understandings are still urgently needed regarding communication requirements, applicable protocols, and system performance. Through such comprehensive understandings, we are prone to answer a fundamental question, how to design, implement and integrate communication infrastructures with power systems. In this paper, we address this issue in a case study of a smart grid demonstration project, the Future Renewable Electric Energy Delivery and Management (FREEDM) systems. By investigating communication scenarios, we first clarify communication requirements implied in FREEDM use cases. Then, we adopt a predominant protocol framework, Distributed Network Protocol 3.0 over TCP/IP (DNP3 over TCP/IP), to practically establish connections between electric devices for data exchanges in a small-scale FREEDM system setting, Green Hub. Within the real-setting testbed, we measure the message delivery performance of the DNP3-based communication infrastructure. Our results reveal that diverse timing requirements of message deliveries are arguably primary concerns in a way that dominates viabilities of protocols or schemes in the communication infrastructure of the smart grid. Accordingly, although DNP3 over TCP/IP is widely considered as a smart grid communication solution, it cannot satisfy communication requirements in some time-critical scenarios, such as relay protections, which claim a further optimization on the protocol efficiency of DNP3.

Opportunistic routing through conjugation in bacteria communication nanonetwork

As the field of molecular communication continues to grow, numerous solutions have been proposed to enable communication between nanomachines. Amongst these solutions, bacteria communication nanonetworks has been proposed as a promising approach for molecular communication. This is driven by a number of attractive properties found in bacteria, which includes biased motility toward the destination through chemotaxis process, as well as the ability of bacteria to transfer genetic information between each other using conjugation. Bacterial conjugation is a major mechanism for Lateral Gene Transfer (LGT) that enables information transfer among bacteria. In this paper, we propose an opportunistic routing process in bacteria communication network using these two properties. The paper presents the simulation work to analyze the performance of message delivery for three different topology shapes, which includes grid, hexagon, and T-shape topologies. The aim of simulating on different shape topologies is to determine the impact that conjugation will have to improve message delivery. In all topologies, the use of conjugation helped improve the reliability of message delivery to the destination point. The paper will analyze various commonly used metrics used in communication networks, such as the average delay, the number of messages, as well as the distribution of messages and their originating node. The conjugation process is most beneficial in complexed shaped topologies, where the directionality from the source to the destination is a number of hops apart, as represented in the T-shape topology.

Secure Network Coding in DTNs

The application of network coding can significantly improve the performance of message delivery in delay tolerant networks, assuming all participants behave honestly. However, if some nodes of the network are compromised, the adversary can launch pollution attack and this way can destroy large amount of data with small effort. Current solutions against pollution attack require public key infrastructure, that is often not available in mobile ad-hoc networks. Our proposal allows packets to verify each other, hence an intermediate node can decide whether these packets can be encoded together without authenticating the source.

Opportunistic Data Collection in Sparse Wireless Sensor Networks

Opportunistic wireless sensor networks (WSNs) have recently been proposed as solutions for many remote monitoring problems. Many such problems, including environmental monitoring, involve large deployment scenarios with lower-than-average node density, as well as a long time scale and limited budgets. Traditional approaches designed for conventional situations, and thus not optimized for these scenarios, entail unnecessary complexity and larger costs. This paper discusses the issues related with the design and test of opportunistic architectures, and presents one possible solution—CHARON (Convergent Hybrid-replication Approach to Routing in Opportunistic Networks). Both algorithm-specific and comparative simulation results are presented, as well as real-world tests using a reference implementation. A comprehensive experimental setup was also used to seek a full characterization of the devised opportunistic approach including the derivation of a simple analytical model that is able to accurately predict the opportunistic message delivery performance in the used test bed.

Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm

We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronization error in the design of the sleep/wake scheduling algorithm. In our previous work, we studied sleep/wake scheduling for single hop communication, e.g., intra-cluster communication between a cluster head and cluster members. We showed that there is an inherent trade-off between energy consumption and message delivery performance (defined as the message capture probability). We proposed an optimal sleep/wake scheduling algorithm, which satisfies a given message capture probability threshold with minimum energy consumption. In this work, we consider multi-hop communication. We remove the previous assumption that the capture probability threshold is already given, and study how to decide the per-hop capture probability thresholds to meet the Quality of Services (QoS) requirements of the application. In many sensor network applications, the QoS is decided by the amount of data delivered to the base station(s), i.e., the multi-hop delivery performance. We formulate an optimization problem to set the capture probability threshold at each hop such that the network lifetime is maximized, while the multi-hop delivery performance is guaranteed. The problem turns out to be non-convex and hence cannot be efficiently solved using standard methods. By investigating the unique structure of the problem and using approximation techniques, we obtain a solution that provably achieves at least 0.73 of the optimal performance. Our solution is extremely simple to implement.