Information relay via SMS in small groups

Abstract

Relaying of a message via SMS among members of a small group constitutes an information dissemination process. Forwarding to group members may be assigned or arbitrary, and a model consisting of an algorithm occurring on well-connected networks and small-world networks is proposed to consider these situations. Simulations of the model were run and some well-connected networks with high small-world probability were shown to be robust, with a high percentage of the nodes receiving the message even with failure in forwarding by nodes. Other observations for these networks were low average arrival times for the message, and a decreasing message redundancy with increasing delays in message sending. A well-connected network was chosen for the implementation of the assigned relay in an actual social group, with preliminary trials confirming the network's robustness.