Performance evaluation of routing protocols in opportunistic networks

Abstract

We focus on a deterministic opportunistic network in which the mobility of the nodes is exploited to carry the information and the contact times between nodes are known in advance or can be predicted. We consider specifically two classes of traces collected in real life: public transportation system and human mobility. Our contribution mainly consists of two-folds: on one hand, we have exploited several real-life mobility traces, trying to understand the pattern of the mobility and the interaction; on the other hand, we have evaluated the trace-driven performance of previously proposed almost-optimal routing algorithm MC-DHCD, in terms of delay and throughput. We believe that our work, even though based on some simplified assumptions, will help the researchers to better design the routing protocol in an opportunistic network environment, to support QoS in terms of both delay and throughput.