Opportunistic networks (ON) are particular types of delay-tolerant networks in which users/network entities participate in order to propagate information. Besides the advantages of these networks (e.g. decentralization, independence of communication infrastructure) they raise new problems regarding for example effectiveness, message routing, message delivery, security issues, and trust. In this paper we introduce a formal description of an ON and of optimal communication topologies, for the non-cooperative and cooperative settings. We follow a game theoretic approach and allow users to express properties about how their messages should be handled in the network by means of a logical language (for instance, message privacy may be achieved by requiring that network nodes with internet access should be avoided on the communication path). We determine the complexity of associated verification and synthesis problems of network topologies.
展开▼
