Name
Abstract | ||
|---|---|---|
Algorithms and protocols for opportunistic, delay tolerant and wireless ad-hoc networks are designed and validated by simulating the people interactions induced by the nodes mobility. There are cases in which we are interested in simulating just the first interaction between a pair of nodes, for instance to assess the performance of a discovery or epidemic routing protocol. In this cases nodes rapidly extinguish their utility hence it is not convenient to simulate these scenarios using a fixed amount of nodes. Thus we present a novel simulation methodology that introduces the \"open environment\" where nodes enter, can interact through meeting with other nodes and then exit, keeping the focus on the environment rather than on what happen before and after the nodes stay in the interesting area. The proposed approach uses the statistical distribution extracted from the real traces to reproduce directly the human interaction pattern without going through the traditional random way point approach. Meetings are simulated by a time-varying graph that holds the state of the interactions in the environment, while adapting to the statistics of single node to its history. We show that even in a simple scenario, the epidemic infection, Markov memory-less models have been fairly far from the interaction scenarios that the method reproduces. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/WETICE.2014.64 | WETICE Conference |
Keywords | Field | DocType |
Markov processes,ad hoc networks,delay tolerant networks,graph theory,routing protocols,statistical distributions,Markov memory-less models,delay tolerant networks,discovery protocol,dynamic open environment,epidemic infection,epidemic routing protocol,first meetings statistics simulation,nodes mobility,opportunistic networks,simulation methodology,statistical distribution,time-varying graph,wireless ad-hoc networks,delay tolerant network,environment,epidemic routing,mobility models,opportunistic network,simulation | Wireless,Markov process,Delay-tolerant networking,Computer science,Markov chain,Mobility model,Computer network,Distributed algorithm,Probability distribution,Statistics,Routing protocol,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.35 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lorenzo Bracciale | 1 | 68 | 11.88 |
| Pierpaolo Loreti | 2 | 93 | 18.75 |
| Giuseppe Bianchi | 3 | 1009 | 84.46 |