Message Loss Research Articles

Smart Road Traffic Accidents Reduction Strategy Based on Intelligent Transportation Systems (TARS)

Traffic accidents have become an important problem for governments, researchers and vehicle manufacturers over the last few decades. However, accidents are unfortunate and frequently occur on the road and cause death, damage to infrastructure, and health injuries. Therefore, there is a need to develop a protocol to avoid or prevent traffic accidents at the extreme level in order to reduce human loss. The aim of this research is to develop a new protocol, named as the Traffic Accidents Reduction Strategy (TARS), for Vehicular Ad-hoc NETworks (VANETs) to minimize the number of road accidents, decrease the death rate caused by road accidents, and for the successful deployment of the Intelligent Transportation System (ITS). We have run multiple simulations and the results showed that our proposed scheme has outperformed DBSR and POVRP routing protocols in terms of the Message Delivery Ratio (MDR), Message Loss Ratio (MLR), Average Delay, and Basic Safety Message.

Renormalization group theory for percolation in time-varying networks

Motivated by multi-hop communication in unreliable wireless networks, we present a percolation theory for time-varying networks. We develop a renormalization group theory for a prototypical network on a regular grid, where individual links switch stochastically between active and inactive states. The question whether a given source node can communicate with a destination node along paths of active links is equivalent to a percolation problem. Our theory maps the temporal existence of multi-hop paths on an effective two-state Markov process. We show analytically how this Markov process converges towards a memoryless Bernoulli process as the hop distance between source and destination node increases. Our work extends classical percolation theory to the dynamic case and elucidates temporal correlations of message losses. Quantification of temporal correlations has implications for the design of wireless communication and control protocols, e.g. in cyber-physical systems such as self-organized swarms of drones or smart traffic networks.

PCPA: A Practical Certificateless Conditional Privacy Preserving Authentication Scheme for Vehicular Ad Hoc Networks.

Vehicle ad hoc networks (VANETs) is a promising network scenario for greatly improving traffic efficiency and safety, in which smart vehicles can communicate with other vehicles or roadside units. For the availability of VANETs, it is very important to deal with the security and privacy problems for VANETs. In this paper, based on certificateless cryptography and elliptic curve cryptography, we present a certificateless signature with message recovery (CLS-MR), which we believe are of independent interest. Then, a practical certificateless conditional privacy preserving authentication (PCPA) scheme is proposed by incorporating the proposed CLS-MR scheme. Furthermore, the security analysis shows that PCPA satisfies all security and privacy requirements. The evaluation results indicate that PCPA achieves low computation and communication costs because there is no need to use the bilinear pairing and map-to-point hash operations. Moreover, extensive simulations show that PCPA is feasible and achieves prominent performances in terms of message delay and message loss ratio, and thus is more suitable for the deployment and adoption of VANETs.

Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem

The Minimum Cost Hop-and-root Constrained Forest Problem (MCHCFP) is a combinatorial optimization problem that arises in the design of energy efficient wireless sensor networks with mobile sinks. It aims at providing a communication topology that minimizes energy consumption while controlling network latency and message loss due to communication failure. The problem is defined in terms of a mixed graph G=(V,E,A) with set of vertices V (representing the sensor nodes), edges E, arcs A, and parameters K,H∈N, and D∈R+. Each edge has an associated length, and each arc has an associated cost. The MCHCFP aims at finding a rooted spanning forest of (V, A) with minimum total cost. The solution must be hop constrained, in the sense that the path from any leaf to its root in the forest does not have more than H arcs, as well as distance constrained, so that one must be able to find K routes of length at most D, visiting exactly once the chosen roots of the forest. We study four integer programming formulations, two of them are new, the other two come from the literature. The first formulation coming from the literature is a multicommodity flow based model. The second is a Dantzig–Wolfe reformulation of the first. The two new formulations, which are equivalent with respect to their linear programming bounds, arise when the problem is formulated over a layered graph. To evaluate the bounds implied by the formulations other than the network flow model, we develop algorithms based on delayed column and/or row generation. We provide computational experiments showing that the best lower bounds are given by the formulations based on the layered graph. The reformulation coming from the literature provides lower bounds that are very close to those provided by the layered graph formulations, but in significantly less computational time. As it provides the best trade-off between lower bound quality and computational effort, that reformulation is thus chosen as the basis for a branch-and-price algorithm introduced here. Such an algorithm managed to solve instances with up to 60 vertices, a significant improvement over the previous approach in the literature, which systematically solves instances with up to 20 vertices.

Active power reference tracking in electricity distribution grids over non-ideal communication networks

Distribution system operators may in the future control active power of selected consumers and generators in order to achieve a desired grid behavior. For cost efficient deployment, this control application may use existing communication infrastructure with non-ideal properties, i.e. imposing delays and losses. This paper considers a control strategy for this use-case, called Active Power Reference Tracking, and investigates its performance for a realistic grid scenario with non-ideal communication using a Real-Time Co-domain Testbed and extensive simulation experiments. Results from the distributed implementation in the testbed show the effectiveness of the controller and that the considered scenario of the reference tracking application is not significantly affected by delays and losses as originating from PLC communication in good conditions. The subsequent simulation experiments show the resilience of the reference tracking control application to end-to-end message delays up to the order of 3 control periods and to message loss up to approximately 70%.

Performance efficiency of a predictive scheme into publish/subscribe

Nowadays, the importance of mobility into publish/subscribe systems has increased due to the increased number of applications into handheld devices. For offering the best service to mobile subscribers, mobility management is very much necessary. Previous mobility management schemes suffer from an increase in the transfer delay, message loss and network load. In this paper a predictive mobility management scheme has been proposed to overcome these problems. The proposed scheme selects the most probable candidate's brokers for being the caching points. This selection is based on the probabilities of movements higher than the threshold value. The proposed scheme and previous proactive scheme have been compared through set experiments. Performance comparison shows that our approach performs better than previous works in terms of messages loss, network load and transfer delay under distinct factors such as frequency of movements, period of disconnection and publication rate.

Performance efficiency of a predictive scheme into publish/subscribe

Nowadays, the importance of mobility into publish/subscribe systems has increased due to the increased number of applications into handheld devices. For offering the best service to mobile subscribers, mobility management is very much necessary. Previous mobility management schemes suffer from an increase in the transfer delay, message loss and network load. In this paper a predictive mobility management scheme has been proposed to overcome these problems. The proposed scheme selects the most probable candidate's brokers for being the caching points. This selection is based on the probabilities of movements higher than the threshold value. The proposed scheme and previous proactive scheme have been compared through set experiments. Performance comparison shows that our approach performs better than previous works in terms of messages loss, network load and transfer delay under distinct factors such as frequency of movements, period of disconnection and publication rate.

Using fuzzy rules for network behavior identification: application for differentiated services in an Ethernet network

The Quality of Service (QoS) offered by a network is based on criteria such as delay, jitter and message loss. QoS management is crucial to ensure that the network respects the communication constraints defined by the application requirements. The network must dynamically manage QoS according to the evolution of network usage. To control QoS, the network implements mechanisms to schedule and regulate traffic. The main issue is identifying the relationship between these mechanisms and their effects on QoS values. The objective of this paper is to propose a method, based on fuzzy logic, for identifying this relationship and reusing it to dynamically control QoS. This study only focuses on the impact of the Weighted Round Robin (WRR) scheduler on the delay in a switched Ethernet network. The fuzzy controller is implemented in a network simulation tool (Riverbed Modeler) to efficiently manage the delay in the network.

9. Creating Effective Health Promotion Messages: Using Eye Tracking Technology Coupled with Masked Recall to Determine the Effectiveness of Loss and Gain Framed Osteoporosis Advertisements

Osteoporosis is a debilitating disease which afflicts over 25 percent of Canadian women over the age of 50, and can lead to serious fractures.(Osteoporosis Canada, 2009) What is the most startling about this disease is that osteoporosis is largely preventable by taking calcium and vitamin D supplements and enjoying a healthy, active lifestyle. The challenge then, is to figure out ways to effectively communicate prevention related health messages. By framing messages either by naming or showing the consequences (loss framed) naming or showing the benefits (gain framed) or simply stating the facts (neutral framed), message framing can be a persuasive communication tool to affect changes in behaviour (Pelletier & Sharp, 2008) Using eye tracking technology‐ which is a device used to measure a participant’s attention to advertisements ‐ data will be collected to monitor the number of eye fixations, and the dwell time, or total amount of time looking at a particular advertisement. This information will be used to determine what types of messages (loss, gain, or neutral framed) garner more audience attention. The eye tracking data will be coupled with an exercise after the eye tracking experiment where participants are asked to recall what was written in the health advertisement messages. This exercise will provide information on whether loss, gain or neutral framed messages were more effective for audience recollection, which is significant because the messages recalled more easily are more likely to change perceptions, attitudes and behaviours.

End-to-End Delay Model for Train Messaging over Public Land Mobile Networks

Modern train control systems rely on a dedicated radio network for train to ground communications. A number of possible alternatives have been analysed to adopt the European Rail Traffic Management System/European Train Control System (ERTMS/ETCS) control system on local/regional lines to improve transport capacity. Among them, a communication system based on public networks (cellular&satellite) provides an interesting, effective and alternative solution to proprietary and expensive radio networks. To analyse performance of this solution, it is necessary to model the end-to-end delay and message loss to fully characterize the message transfer process from train to ground and vice versa. Starting from the results of a railway test campaign over a 300 km railway line for a cumulative 12,000 traveled km in 21 days, in this paper, we derive a statistical model for the end-to-end delay required for delivering messages. In particular, we propose a two states model allowing for reproducing the main behavioral characteristics of the end-to-end delay as observed experimentally. Model formulation has been derived after deep analysis of the recorded experimental data. When it is applied to model a realistic scenario, it allows for explicitly accounting for radio coverage characteristics, the received power level, the handover points along the line and for the serving radio technology. As an example, the proposed model is used to generate the end-to-end delay profile in a realistic scenario.

EAAP: Efficient Anonymous Authentication With Conditional Privacy-Preserving Scheme for Vehicular Ad Hoc Networks

Providing an efficient anonymous authentication scheme in vehicular ad hoc networks (VANETs) with low computational cost is a challenging issue. Even though, there are some existing schemes to provide anonymous authentication, the existing schemes suffer from high computational cost in the certificate and the signature verification process, which leads to high message loss. Therefore, they fail to meet the necessity of verifying hundreds of messages per second in VANETs. In our scheme, we propose an efficient anonymous authentication scheme to avoid malicious vehicles entering into the VANET. In addition, the proposed scheme offers a conditional tracking mechanism to trace the vehicles or roadside units that abuse the VANET. As a result, our scheme revokes the privacy of misbehaving vehicles to provide conditional privacy in a computationally efficient way through which the VANET entities will be anonymous to each other until they are revoked from the VANET system. Moreover, the proposed scheme is implemented and the performance analysis shows that our scheme is computationally efficient with respect to the certificate and the signature verification process by keeping conditional privacy in VANETs.

Genetic algorithm based fault tolerant clustering in wireless sensor network

In wireless sensor network (WSN), during fault detection and recovery, average energy loss, and message loss occurs including the link failure. Also, the number of faulty nodes and the traffic overhead is increased with the size of WSN. In order to overcome this issue, in this study, a cluster-based fault tolerance technique using genetic algorithm is proposed. Here the network is clustered according to energy-efficient distance-based clustering algorithm. For each cluster head, a set of backup nodes are selected using genetic algorithm based on the sponsored coverage and residual energy parameters. This helps in detecting the faults occurring in cluster members and cluster heads. Simulation results show that the proposed technique minimises the energy loss and overhead.

Impact of Message Losses on Push-Sum Protocol in Chosen Topologies

In this paper, we examine the natural robustness of the push-sum protocol to message losses in a tree, a star, a mesh, a ring and a link topology. We experimentally verify the impact of this failure on the character of the estimations, the deviation of the final estimation from the real value and the impact on the change of the convergence rate.

Computationally efficient privacy preserving anonymous mutual and batch authentication schemes for vehicular ad hoc networks

In the near future, it is envisioned that vehicular Ad hoc networks (VANETs) will be making use of long-distance communication techniques, such as cellular networks and Worldwide Interoperability for Microwave Access (WiMAX), to get instant Internet access for making the communication between vehicles and fixed road side infrastructure. Moreover, VANETs will also make use of short-distance communication methods, such as Dedicated Short-Range Communications (DSRC) and Wireless Fidelity (Wi-Fi) to perform short range communication between vehicles in an ad hoc manner. This Internet connection can provide facility to other vehicles to send traffic related messages, collisions, infotainment messages other useful safety alerts. In such a scenario, providing authentication between vehicle to infrastructure and vehicle to vehicle is a challenging task. In order to provide this facility, in this paper, we propose a computationally efficient privacy preserving anonymous authentication scheme based on the use of anonymous certificates and signatures for VANETs in making them an important component of Internet of Things (IoT) and the development of smart cities. Even though there are several existing schemes available to provide such anonymous authentication based on anonymous certificates and signatures in VANETs, the existing schemes suffer from high computational cost in the certificate revocation list (CRL) checking process and in the certificate and the signature verification process. Therefore, it is not possible to verify a large number of messages in a particular period in VANETs which would lead to increased message loss. Hence, we use a computationally efficient anonymous mutual authentication scheme to validate the message source as well as to verify the integrity of messages along with a conditional tracking mechanism to trace the real identity of misbehaving vehicles and revoke them from VANET in the case of dispute. In this paper, we also introduce an efficient anonymous batch authentication protocol to be used in IoT for Road Side Units (RSUs) to authenticate multiple vehicles simultaneously rather than one after the other such that the total authentication time can be dramatically reduced. This proposed scheme is implemented and the performance analysis shows that our scheme is more efficient in terms of certificate and signature verification cost, while preserving conditional privacy in VANETs.

Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution

Flow-Updating (FU) is a fault-tolerant technique that has proved to be efficient in practice for the distributed computation of aggregate functions in communication networks where individual processors do not have access to global information. Previous distributed aggregation protocols, based on repeated sharing of input values (or mass) among processors, sometimes called Mass-Distribution (MD) protocols, are not resilient to communication failures (or message loss) because such failures yield a loss of mass. In this paper, we present a protocol which we call Mass-Distribution with Flow-Updating (MDFU). We obtain MDFU by applying FU techniques to classic MD. We analyze the convergence time of MDFU showing that stochastic message loss produces low overhead. This is the first convergence proof of an FU-based algorithm. We evaluate MDFU experimentally, comparing it with previous MD and FU protocols, and verifying the behavior predicted by the analysis. Finally, given that MDFU incurs a fixed deviation proportional to the message-loss rate, we adjust the accuracy of MDFU heuristically in a new protocol called MDFU with Linear Prediction (MDFU-LP). The evaluation shows that both MDFU and MDFU-LP behave very well in practice, even under high rates of message loss and even changing the input values dynamically.

An Effective (FD-E-TOHIP) Fault Detection Enabled E-TOHIP for Mobile Ad-Hoc Networks

Objectives: Security is a challenging issue in mobile ad-hoc networks (MANET). The main objective is to implement FD-ETOHIP Fault Detection Mechanism (FDM) on Enhanced Topology-Hiding Multipath Routing Protocol (E-TOHIP) in mobile ad-hoc networks (MANETs). Methods/Statistical Analysis: E-TOHIP do not permit packets to hold routing information. Once a route is recognized, E-TOHIP will publicize a set having the nodes that have been positioned on routes, which prevents a node from being located on another route. It also establishes multiple node-disjoint routes and excludes unreliable routes before transmitting packets. Findings: With the help of FDM faults in the network can be easily identified. Message loss due to node permanent fault and message loss due to data transmission are the types of faults that occur here. If the node is considered to be a everlasting fault, then the messages at the node location will get lost and it won’t work until a re-establishment is done. The message loss during data transmission occurs due to three kinds of faults namely message redirection, topology change and buffer overflow. Applications/Improvements: Along with FDM, various attack implementation is also done in order to test the efficiency of E-TOHIP protocol.

Robustness, Stability, and Gains of Utility Maximization Algorithms for Mobile Ad Hoc Networks

Cross-layer designs (CLDs) have the potential to better utilize network resources than a traditional layered protocol architecture, providing better communication services to end-users. This is particularly relevant in MANETs, which are characterized by a scarcity of network resources, in particular bandwidth. While many papers have demonstrated the potential performance benefit that CLDs can provide, their evaluation is often done under idealized scenarios, such as instantaneous message transmission times, complete topology knowledge, and/or zero message loss rates. Nodes in real MANETs do typically experience message losses, message delays, and have at best a partial and most likely inaccurate knowledge of the dynamic network topology. Our work focuses on realistic evaluations of a specific CLD approach. We propose a robust and stable version of a network utility maximization algorithm that optimizes the medium access probabilities at the MAC layer jointly with the end-to-end sessions rates at the transport layer. We report on stability tests with different link failure scenarios in case of synchronous and asynchronous message updates, convergence speed, and link utilizations. The results show that the algorithm converges even with a very high rate of link transmission failures and can tolerate asynchronous parameters updates. The CLD fully utilizes the link capacities and provides a network capacity gain of up to 250 %. The proposed modified CLD approach is therefore both beneficial and practical for real MANETs.

Propagation Delay and Loss Analysis for Bacteria-Based Nanocommunications.

Flagellated bacteria have been suggested as one of the means to deliver information at nanoscales due to their ability to store massive amounts of data in their DNA strands and their mobility properties. In this paper, the propagation delay and message loss rates are mathematically derived for bacterial nanocommunications. The mobility pattern of the flagellated bacteria is investigated and a stochastic model of the bacteria mobility is developed. The proposed model is then used to derive the performance metrics of interest such as the link reliability as well as the propagation delay distribution for the case where N bacteria are used to deliver the messages between two nanomachines. Our solution reveals that at communication distances inherent for bacteria-based nanonetworks (1 ~ 10mm) reliable links can be established using just few hundreds of bacteria. The presented approach provides the so-far missing analytical building block for performance analysis of prospective bacteria-based nanonetworks.

Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network.

Publish/subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Publish/subscribe supports the flexible development of large-scale, event-driven and ubiquitous systems. Publish/subscribe is prevalent in a number of application domains such as social networking, distributed business processes and real-time mission-critical systems. Many publish/subscribe applications are sensitive to message loss and violation of privacy. To overcome such issues, we propose a novel method of using secret sharing and replication techniques. This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks. We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance. Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users.

PERFORMANCE EVALUATION OF FLYING WIRELESS NETWORK WITH VANET ROUTING PROTOCOL

The growing amount of vehicles on roadway is the key motivating the establishing of the road safety with comfort and undisturbed traffic flowing. Vehicular adhoc network is a trending wireless methodology that enable an unwired connection between the automobiles to have a highly secured driving with comfort. The vehicles connected wirelessly communicates with its nearby vehicle with the help of an on road circuitry and the mobile circuitry inside the automobile, sharing information either as caution preventing from unwanted fatalities or a guidance in travel. These automobile networks are crafted using the vehicles as their motile nodes and are instantaneously framed on the availability of the automobiles without the support of the ground stations may also be noted as flying wireless network due to their high motility. The conveyance between the vehicles is subjected to two strides. As a conveyance between automobile to automobile and the automobile to ground station. These wireless communication are to be pillared by the proper entrenchment of the message path to evade the unnecessary incidents. The prevailing methods of finding the path and to have formal delivery, suffers loss either by delaying incurred or the high bandwidth usage or reduced network life span with message losses. The proposed provides a well-engineered methodology to have enhanced reliable information sharing ensuring an infallible functioning with minimized delay, extended network lifespan, and an unfailing handing over to avoid the information losses provided with the optimized road safety and comfort. The proposed system is evaluated on the grounds of delay, network lifespan, and packet delivery ratio to confirm its well-ordered functioning when compared to the existing methods.