An epidemic model for information diffusion in MANETs

Khelil, Abdelmajid; Becker, Christian; Tian, Junfang; Rothermel, Kurt

doi:10.1145/570758.570768

Cited by 182 publications

(90 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such an ODE, which we have shown results as a fluid limit of a Markov model as N increases, has been commonly used in epidemiology studies, and was first applied to broadcast in mobile ad hoc network in [6], epidemic routing in [10], as a reasonable approximation. We remark that 1) the initial population of infected nodes must scale with N , and 2) the pairwise meeting rate scales as 1/N .…”

Section: The Average Number Of Infected Nodes Then Converges To I(t) mentioning

confidence: 99%

Performance Modeling of Epidemic Routing

Zhang

Neglia

Kurose

et al. 2006

NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

208

377

View full text Add to dashboard Cite

Abstract. In this paper, we develop a rigorous, unified framework based on Ordinary Differential Equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study of Markovian models is quite complex and numerical solution impractical for large networks, the corresponding ODE models yield closed-form expressions for several performance metrics of interest, and a numerical solution complexity that does not increase with the number of nodes. Using this ODE approach, we investigate how resources such as buffer space and power can be traded for faster delivery, illustrating the differences among the various epidemic schemes considered. Finally we consider the effect of buffer management by complementing the forwarding models with Markovian and fluid buffer models.

show abstract

Section: The Average Number Of Infected Nodes Then Converges To I(t) mentioning

confidence: 99%

Performance Modeling of Epidemic Routing

Zhang

Neglia

Kurose

et al. 2006

NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

208

377

View full text Add to dashboard Cite

show abstract

“…Differently from other experiments, in the UMASS DieselNet trace the reported meetings occurred only among nodes participating to the experiment. 6 As a result, the meetings pattern shows a higher regularity, and the EVC distribution is more uniform, if compared with the Intel Exp1 and Intel Exp2 EVC analysis. Correspondingly, to higher values of EVC correspond a higher capability of nodes both to initiate a spreading and to spread an epidemics.…”

Section: Fig 2 T -Tolerant Connectivity Graph For Various Values Ofmentioning

confidence: 92%

“…Keeping track of the movements of all nodes is clearly not feasible, due to the obvious scalability problems related to the amount of control traffic. It is therefore imperative, for such scenarios, to resort to some form of epidemic forwarding [6]. In such protocols, data packets spread in the network like a virus or some other forms of epidemics.…”

Section: Epidemic Spreading In Highly Partitioned Mobile Networkmentioning

confidence: 99%

“…In DTNs the conventional notion of "network" itself needs to be re-thought anew: information can diffuse in the system by means of (i) node mobility: a device conveys information while moving around (ii) opportunistic forwarding: messages are passed from a node to another one when they get in contact. Due to the high dynamism of such scenarios, some epidemic mechanism has to be used to spread information until it reaches the intended destination [6,7,8]. The problem we aim at tackling is to devise distributed mechanisms able to decide whether, upon meeting a given node, it should be used as a forwarder.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Eigenvector Centrality in Highly Partitioned Mobile Networks: Principles and Applications

Carreras¹,

Miorandi²,

Canright

et al. 2007

Advances in Biologically Inspired Information Systems

View full text Add to dashboard Cite

Summary. In this chapter we introduce a model for analyzing the spread of epidemics in a disconnected mobile network. The work is based on an extension, to a dynamic setting, of the eigenvector centrality principle introduced by two of the authors for the case of static networks. The extension builds on a new definition of connectivity matrix for a highly partitioned mobile system, where the connectivity between a pair of nodes is defined as the number of contacts taking place over a finite time window. The connectivity matrix is then used to evaluate the eigenvector centrality of the various nodes. Numerical results from real-world traces are presented and discussed. The applicability of the proposed approach to select on-line message forwarders is also addressed.

show abstract

“…For example, in VANET application areas, Refs. [7] and [16] proposed adaptive protocols for efficient data dissemination from vehicles by considering neighboring vehicular density so that we can avoid the so-called broadcast storm problem. In [1], the authors proposed a method for estimation of vehicular density.…”

Section: Related Workmentioning

confidence: 99%

Protocol Testing and Performance Evaluation for MANETs with Non-uniform Node Density Distribution

Hiromori

Umedu

Yamaguchi

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we focus on Mobile Ad-hoc Networks (MANETs) with non-uniform node density distribution such as Vehicular Ad-hoc Networks (VANETs) and Delay Tolerant Networks (DTNs), and propose a technique for protocol testing and performance evaluation. In such MANETs, node density varies depending on locations and time, and it dynamically changes every moment. In the proposed method, we designate node density distributions and their dynamic variations in a target area. Then, we construct a graph called TestEnvGraph where all node density distributions are treated as its nodes and they are connected by edges whose weights denote differences of two node density distributions. We specify a set of edges to be tested in the graph, formulate a problem for efficiently reproducing all the given node density distributions and their dynamic variations as a rural postman problem, find its solution and use it as the order of reproduction of designated node density distributions and their variations. Protocol testing is carried out by reproducing node density distributions in the derived order. We have designed and developed a method and its tool for mobility generation on MANETs, which can reproduce any designated node density distribution and its dynamic variations in a target area. From our experiments for a VANET protocol, we have shown that our method can give a similar trend in network throughput and packet loss rates compared with realistic trace based protocol testing.

show abstract

An epidemic model for information diffusion in MANETs

Cited by 182 publications

References 14 publications

Performance Modeling of Epidemic Routing

Performance Modeling of Epidemic Routing

Eigenvector Centrality in Highly Partitioned Mobile Networks: Principles and Applications

Protocol Testing and Performance Evaluation for MANETs with Non-uniform Node Density Distribution

Contact Info

Product

Resources

About