Improving Message Delivery Performance in Opportunistic Networks Using a Forced-Stop Diffusion Scheme

Herrera-Tapia, Jorge; Hernández-Orallo, Enrique; Tomás, Andrés E.; Manzoni, Pietro; Calafate, Carlos T.; Cano, Juan-Carlos

doi:10.1007/978-3-319-40509-4_11

Cited by 4 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These error distributions cover a comprehensive set of characteristics of LoRaWAN networks such as frame loss over distance [31], [33], [34], [37], [41], [51]- [53], different uses cases [31], [35], [54]- [57], mobile or stationary devices [33], [46], [49], [50], network capacity [54], and collisions [33], [53]. Frame loss burstiness may be due to channel effects [34], [36], mobility [34], [35], limited coverage [38], [40], [41], [44], or opportunistic coverage [42]- [44]. Event-driven communication may also lead to burst errors, as many devices may try to communicate at the same time during a relatively long time interval [45]- [48].…”

Section: Error Patterns and Ratesmentioning

confidence: 99%

Evaluation of Receiver-Feedback Techniques for Fragmentation Over LPWANs

Aguilar

Vidal

Gómez

2022

IEEE Internet Things J.

View full text Add to dashboard Cite

The Internet Engineering Task Force (IETF) has standardized a new framework for IPv6 support over Low Power Wide Area Networks (LPWANs), called Static Context Header Compression and Fragmentation (SCHC). SCHC includes acknowledgment (ACK)-based mechanisms for reliable fragmented packet transmission. For the latter, SCHC defines a Receiver-Feedback Technique (RFT), called Compressed Bitmap (CB), by which a receiver reports to the sender whether the fragments carrying a packet have been received or not. Such information is carried as ACK payload. Considering the extraordinary frame size and message rate constraints of LPWANs, ACK payload size becomes crucial. In this paper, we compare the performance of CB with that of several alternative RFTs, namely List of Lost Fragments (LLF), List of Deltas (LoD), and Uncompressed Bitmap (UB), where the latter is used as a benchmark. We evaluate the considered RFTs in terms of ACK size, number of Layer 2 (L2) frames needed to carry an ACK, and ACK Time on Air. Our analysis shows that the use of RFTs different from CB offers significant performance improvement in many scenarios. Furthermore, we provide guidance on which RFT should be used for different packet sizes, error rates and error patterns.

show abstract

Section: Error Patterns and Ratesmentioning

confidence: 99%

Evaluation of Receiver-Feedback Techniques for Fragmentation Over LPWANs

Aguilar

Vidal

Gómez

2022

IEEE Internet Things J.

View full text Add to dashboard Cite

show abstract

“…The messages of an opportunistic network are carried by nodes. In the future, nodes move and forward messages to the next hop node when they have transmission conditions [21,22]. The transmission conditions should meet the requirements that nodes contact each other, and the length of contact can complete the correct transmission of messages.…”

Section: System Model Designmentioning

confidence: 99%

Data Transmission and Management Based on Node Communication in Opportunistic Social Networks

Xiao

2020

Symmetry

View full text Add to dashboard Cite

Due to the rapid popularization of various short distance communication mobile devices, the use scenarios of opportunistic networks are increasing day by day. However, in opportunistic networks, because of the complexity of community structure, many methods lack of symmetry between application and theoretical research. Thus, the connection strength between nodes is different, and the degree of message diffusion is different. If the above factors cannot be accurately estimated and analyzed, and effective data forwarding and scheduling strategies cannot be formulated, the delivery ratio will be low, the delay will be relatively high, and the network overhead will be large. In light of improving symmetry problems in opportunistic networks, this paper establishes the message duplicate adaptive allocation and spray routing strategy (MDASRS) algorithm model, measures the connection strength between nodes through social pressure, and estimates the diffusion of current messages in the network through the probability of messages leaving the current node successfully, so as to develop the self-adaptive control replication transmission mode and achieve the effect of reducing the network burden and network overhead. This is done through experiments and comparison of social network algorithms, comparing the MDASRS with Epidemic, Spray and Wait, and EIMST algorithms. The experiment results showed that this method improves the cache utilization of nodes, reduces data transmission delay, and improves the network’s overall efficiency.

show abstract