Optimising message broadcasting in opportunistic networks

Abstract

Message Broadcasting in Opportunistic Networks is based on the opportunity of establishing contacts among mobiles nodes for message exchange. Nevertheless, as the amount of information transmitted in a contact is limited by the transmission speed and the contact duration, large messages are less likely to be exchanged, and thus their diffusion is severely limited. Furthermore, these failed transmissions can also lead to an important waste of network resources, since the message transmission is aborted when the contact ends and the message needs to be transmitted again in the next contact. Therefore, in this paper we study the impact that contact duration has on the broadcast of messages, showing that splitting a large message into smaller parts can improve its diffusion. Based on this idea, we propose an extension of the epidemic protocol called Xpread. The efficiency of this protocol mainly depends on how the original message is partitioned. Thus, in order to evaluate the impact and the efficiency of the partition scheme, we have developed an analytical model based on Population Processes, showing that a fixed size partition is the best option, while also providing a simple expression to obtain the optimal size. The Xpread has been evaluated exhaustively using four different mobiles traces, comprising both pedestrian and vehicular scenarios. The results show that the diffusion of large messages is improved up to four times with a slight reduction in the delivery time and overhead, minimising also message forwarding failures.

A trustable architecture over blockchain to facilitate maritime administration for MASS systems

“…In this section, the behaviors of a number of MASS nodes are simulated and examined. The motions of these nodes constitute an opportunistic network [73], where encounters or departures among the MASS nodes occur continuously and randomly, so that the formation of the network are constantly on the change. For two specific MASS nodes, an encounter may lead to the updating of PriBoT.…”

Activity-based routing algorithm in opportunistic mobile social networks

“…Similar to the solving process of the delivery probability in section ''Message forwarding strategy with same activities,'' we can get the solution of the indirect delivery probability, as shown in formulas ( 12) and ( 13). If l T and l P are not the same link, the indirect delivery probability can be calculated as formula (12), where N l PT = ½T l P i, j ð Þ=T l T i, j ð Þ represents the number of l T when l P does not occur, N l T = ½TTL r =T l T (i, j) represents the number of l T in TTL r , and N l P = ½TTL r =T l P (i, j) represents the number of l P in TTL r .…”

“…Typical algorithms include Epidemic, 9 Spray and Wait, 10 and Spray and Focus. 11 Based on the Epidemic algorithm, Chancay-Garcı´a et al 12 considered that the amount of transmitted information is limited by the transmission speed and contact time and proposed an epidemic extension protocol called Xpread. Similarly, on the basis of the Epidemic algorithm, Chunyue et al 13 proposed an asynchronous sleep mechanism that allows nodes to determine whether to enter the sleep state based on their own energy status, real-time status, and other information.…”

Artificial Intelligence based rule base fire engine testing model for congestion handling in opportunistic networks

“…The implemented artificial intelligence rule-based fire engine calculated buffer occupancy (BO) using equation 1, less congested node (LCN) using equation 2, average congested node (ACN) using equation (3) and high congested node (HCN) using equation 4Buffer occupancy (BO) = Accured Buffer Size Total buffer Size 3100…”

“…2 In such networks, nodes exchange data using store carry and forward mechanics whenever they came in range of another device that is why it is called opportunistic networks. 3 Due to limited storage capacity of handheld devices in 4G or 5G networks by the end user, only limited amount of data can be transferred. Nodes in 5G networks are, therefore, difficult to implement peer-to-peer communication for data exchange, so a new emerging type of communication via identifying suitable relay node as custodian node using store and forward mechanism is identified for bundle exchange between peers when a best opportunity is found in terms of storage and connectivity.…”