Tracking Message Spread in Mobile Delay Tolerant Networks

International audienceWe consider a Delay Tolerant Network under two message forwarding schemes – a non-replicative direct deliveryscheme and a replicative epidemic routing scheme. Our objective is to track the degree of spread of a message in the network.Such estimation can be used for on-line control of message dissemination. With a homogeneous mobility model with pairwise i.i.d. exponential inter-meeting times, we rigorously derive the system dynamic and measurement equations for optimal tracking by a Kalman filter. Moreover, we provide a framework for tracking a large class of processes that can be modeled as densitydependent Markov chains. We also apply the same filter with a heterogeneous mobility, where the aggregate inter-meeting times exhibit a power law with exponential tail as in real-world mobility traces, and show that the performance of the filter is comparable to that with homogeneous mobility. Through customized simulations, we demonstrate the trade-offs and provide severalinsightful observations on how the number of observers impacts the filter performance

A Novel Method For Detecting Faulty Nodes In Tolerant Network

Recently proposed arrangements experience the ill effects of long delays in distinguishing and isolating hubs making defective data. This is inadmissible to DTNs where nodes meet only now and then. This proposes a completely gave and fundamentally implementable way to deal with empower each DTN node to quickly perceive whether its sensors are passing on defective information. The dynamical way of the proposed calculation is approximated by some steady time state conditions, whose equality is projected. The closeness of getting away hand hubs, trying to inconvenience the blemished hub affirmation process, is moreover considered

A new analysis of distributed faulty node detection in DTNS

Previously proposed solutions suffer from long delays in identifying and dividing nodes producing faulty data. This is unsuitable to DTNs where nodes meet only rarely. This proposes a completely conveyed and essentially implementable way to deal with enable each DTN node to quickly distinguish whether its sensors are delivering flawed information. The dynamical conduct of the proposed algorithm is approximated by some persistent time state conditions, whose balance is portrayed. The nearness of getting out of hand nodes, attempting to bother the faulty node recognition process, is additionally considered