Routing Design and Analysis of Place Based Opportunistic Networks

Opportunistic networks, as a key enabling technology for pervasive computing, have attracted enormous attentions from researchers recently. In this paper, we focus on designing and analyzing routing schemes in our new place-based opportunistic networks, in which data exchanges only take place at different public places. Basically, routing schemes determine how data travel from source to destination in a network. Under the new placed-based opportunistic network scenario, firstly we present two routing schemes: one leverages the population history information and ranks different next-hop place candidates by popularity indicator, and the other one takes advantage of the congestion history information to control data transfer rate to a place and also balance the rates among all the flows to that place. Secondly, experiments are conducted to observe the performance of the proposed routing schemes and classic routing schemes on new place-based opportunistic networks. In the end, we analyze how various information could effect the performance of routing schemes in this new place-based opportunistic network scenario.