DSG-N2: A group-based social routing algorithm
Roy A. Cabaniss, James M. Bridges, Andrew Wilson, Sanjay Madria · 2011
Devices in a mobile ad-hoc environment can follow different movement patterns based on the application environment. Some environments, such as mass transit systems, follow regular and predictable patterns. Others, such as an aerial monitoring network, generally follow random paths. Optimal routing schemes tend to take advantage of information regarding movement patterns available in social interaction domains. In a social environment like wildlife tracking or monitoring socio-human interactions, the devices and/or users will follow regular contact habits, tending to encounter social groups in which they participate. In this paper, by dynamically identifying these groups, the patterns are used to speed routing through a social environment. When social groups are formed, a probability based scheme is used to route messages to devices efficiently. This algorithm can be implemented ad null, meaning the devices have no information of their environment, and works to reduce overhead, message traffic, and delivery time while maintaining a high delivery ratio.