Dynamic Social Grouping in Wireless Sensor Networks

When Sensor Nodes are moving based on social patterns, such as wildlife tracking, algorithms which detect and use these patterns can be used to improve routing efficiency. The Dynamic Social Grouping algorithm is designed to form a series of social groups which accurately indicate a node’s regular contact patterns while dynamically shifting to represent changes to the social environment.With the social groups formed, a probabilistic routing schema is used to effectively identify which social groups have consistent contact with the base station, and route accordingly. The algorithm can be implemented dynamically, in the sense that the nodes initially have no awareness of their environment, and works to reduce overhead and message traffic while maintaining high delivery ratio.

Researcher

Roy Cabaniss

Advisor

Dr. Sanjay Madria