METHOD TO MANAGE AN OPPORTUNISTIC COMMUNICATION NETWORK

摘要

This relates to message propagation in an opportunistic communication network (100). Nodes of the network each have a ranking (RV) which is compared when the nodes connect, and message is transferred from one node to the other in dependence on the relative values of their respective rankings. The ranking is dependent on a plurality of parameters. One parameter is a social parameter determined by the social contacts of a user associate with a node, for example determined from the contact directory of that person either locally or from a central database such that located on a Face book servicer. Another parameter is the number of physical connections established by a node. The ranking values of connecting nodes is updated when they connect. By combining both parameters, a more efficient forwarding path for messages is obtained.