Social group detection based routing in Delay Tolerant Networks

摘要

When implementing Mobile Ad Hoc Networks, a key characteristic of the network is the mobility pattern of the nodes. Based on the application, nodes can follow semi-predictable patterns, such as the routes followed by Vehicular Ad Hoc Networks, or the more strict schedules followed by aerial reconnaissance. Optimal routing schemes tend to take advantage of information regarding these patterns. In social environments, such as wildlife tracking or sending messages between humans, the devices and/or users will follow regular contact habits, tending to encounter social groups in which they participate. By identifying these groups, the patterns are used to optimize routing through a social environment. Dynamic Social Grouping (DSG), used to route messages strictly from a node to a basestation, is ideal for gathering sensor data and updating a shared data cache. In contrast, Dynamic Social Grouping-Node to Node (DSG-N2) is used to route messages between nodes, generally conventional communications. Both of these algorithms can be implemented ad null, meaning the devices initially have no information about their environment, and they work to reduce bandwith and delivery time while maintaining a high delivery ratio. In addition to presenting these two routing schemas, this article compares and contrasts two methods for estimating nodes’ delivery probabilities. The Contact Based Probability is based on encounters with other nodes, and the Performance Based Probability is based on the behavior of previous messages. The probability estimates were then validated with the Oracle analysis, which is based on knowledge of future events. This analysis indicated that DSG-N2 probability estimates are comparable to the ideal.