Contact avoidance routing in delay tolerant networks

Tomoya, Osuki; Sakai, Kazuya; Fukumoto, Satoshi

doi:10.1109/infocom.2017.8057110

Cited by 14 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Equation (22) suggests that a larger N e or a smaller  leads to a larger theft ratio of data messages. Note that the value of  is also related to the required delivery ratio , as depicted in (16).…”

Section: Expected Theft Ratiomentioning

confidence: 99%

See 1 more Smart Citation

Message piece dissemination approach for opportunistic underwater sensor network invaded by underwater spy‐robots

Liu

Zhang

et al. 2021

Softw Pract Exp

View full text Add to dashboard Cite

Opportunistic underwater sensor network (OUSN) is deployed for various underwater applications, such as underwater creatures tracking and tactical surveillance. Particularly, the OUSN in military applications may be invaded by some underwater spy-robots termed eavesdroppers. The eavesdroppers could move around some OUSN nodes and eavesdrop on their communication channels silently, and these eavesdropping actions are difficult to be perceived by OUSN nodes. To reduce the theft ratio of data messages and guarantee the required delivery ratio of data messages, we conceive the idea that each data message is encoded into several message pieces, and then the message pieces are disseminated to sink node individually. Besides, a lightweight encryption method is adopted to encrypt the message pieces before the dissemination. Such mechanism can protect the data messages from being stolen by eavesdroppers effectively. In this article, we propose a message piece dissemination approach (MPDA) for the OUSN invaded by some underwater spy-robots. In MPDA, OUSN nodes disseminate the held message pieces to some selected neighboring nodes at each time slot, and a data message is considered to be delivered when all pieces of this data message have been delivered to the sink node. Extensive simulations and comparisons demonstrate the preferable performance of MPDA, that is, MPDA can reduce the theft ratio of data messages and guarantee the required delivery ratio of data messages.

show abstract

Section: Expected Theft Ratiomentioning

confidence: 99%

“…The number of message pieces  is calculated by (16), and some numerical results are given in Figure 7.…”

Section: Impacts Of mentioning

confidence: 99%

Message piece dissemination approach for opportunistic underwater sensor network invaded by underwater spy‐robots

Liu

Zhang

et al. 2021

Softw Pract Exp

View full text Add to dashboard Cite

show abstract

“…[49] uses a system of partial differential equations to study an opportunistic content update system. [24], [50], and [51] apply Markov chains to model restricted epidemic routing schemes, spray and wait scheme, and contact avoidance routing, respectively. Furthermore, epidemic routing was studied in [27], [52], and [53].…”

Section: Related Workmentioning

confidence: 99%

“…We also propose four ODE models for epidemic routing in non-sparse DTNs. The main difference of our approach with previous approaches [22], [23], [24], [27], [30], [43], [44], [45], [46], [47], [49], [50], [51], [52] is that we target non-sparse networks in this paper while the aforementioned approaches study sparse networks wherein large clusters of nodes do not exist. In [27], dense network refers to a contact network wherein each pair of nodes meet with non-zero probability.…”

Section: Comparisonmentioning

confidence: 99%

On the Performance Analysis of Epidemic Routing in Non-Sparse Delay Tolerant Networks

Rashidi¹,

Towsley²,

Mohseni-Kabir³

et al. 2020

Preprint

View full text Add to dashboard Cite

We study the behavior of epidemic routing in a delay tolerant network as a function of node density. Focusing on the probability of successful delivery to a destination within a deadline (PS), we show that PS experiences a phase transition as node density increases. Specifically, we prove that PS exhibits a phase transition when nodes are placed according to a Poisson process and allowed to move according to independent and identical processes with limited speed. We then propose four fluid models to evaluate the performance of epidemic routing in non-sparse networks. A model is proposed for supercritical networks based on approximation of the infection rate as a function of time. Other models are based on the approximation of the pairwise infection rate. Two of them, one for subcritical networks and another for supercritical networks, use the pairwise infection rate as a function of the number of infected nodes. The other model uses pairwise infection rate as a function of time, and can be applied for both subcritical and supercritical networks achieving good accuracy. The model for subcritical networks is accurate when density is not close to the percolation critical density. Moreover, the models that target only supercritical regime are accurate.

show abstract

“…More recently, security‐based solutions [15, 16], incentive‐based solutions [17, 18], and solutions that consider energy consumption [19, 20] and context awareness [21] are also proposed to facilitate data forwarding in mobile social networks. These innovative solutions on mobile opportunistic networks are summarised in Table 3.…”

Section: Related Workmentioning

confidence: 99%

On‐demand data forwarding in mobile opportunistic networks: backbone‐based approach

Zhang

Luo

2019

IET Communications

View full text Add to dashboard Cite

Contact avoidance routing in delay tolerant networks

Cited by 14 publications

References 21 publications

Message piece dissemination approach for opportunistic underwater sensor network invaded by underwater spy‐robots

Message piece dissemination approach for opportunistic underwater sensor network invaded by underwater spy‐robots

On the Performance Analysis of Epidemic Routing in Non-Sparse Delay Tolerant Networks

On‐demand data forwarding in mobile opportunistic networks: backbone‐based approach

Contact Info

Product

Resources

About