Mobility entropy and message routing in community-structured delay tolerant networks
Hideya Ochiai, Hiroshi Esaki · 2008
Many message routing schemes have been proposed in the context of delay tolerant networks (DTN) and intermittently connected mobile networks (ICMN). Those routing schemes are tested on specific environments that involve particular mobility complexity whether they are random-based or sociologically organized. We, in this paper, propose community structured environment (CSE) and mobility entropy to discuss the effect of node mobility complexity on message routing performance. We also propose potential-based entropy adaptive routing (PEAR) that adaptively carries messages over the change of mobility entropy. According to our simulation, PEAR has achieved high delivery rate on wide range of mobility entropy, while link-state routing has worked well only at small entropy scenarios and controlled replication-based routing only at large entropy environments.