In Opportunistic Networks the majority of communicationmechanismsmake use of relay nodes for delivering the messages. Any possible unwillingness of the relay nodes to cooperate, can affect gravely the performance of routing protocols and message dissemination techniques. In this paper we propose a framework for analysing cases where the level of cooperation, or the selfishness of nodes, is rela...

Most of the protocols and algorithms used in MANET, are assuming that all mobile nodes cooperate fully with the functionalities of the network. But some nodes are cooperate partially or not at all cooperating. Network performance and data accessibility, accessing time, query delay are affected by these selfish nodes. The discussion of this paper is about, representing a Replica server which sol...

Countermeasures for node misbehavior and selfishness are mandatory requirements in MANET. Selfishness that causes lack of node activity cannot be solved by classical security means that aim at verifying the correctness and integrity of an operation. We suggest a generic mechanism based on reputation to enforce cooperation among the nodes of a MANET to prevent selfish behavior. Each network enti...

In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Problem (MOSP). Each organization provides both resources and jobs and follows its own objectives. We are interested in the best way to minimize the makespan on the entire platform when the organizations behave in a selfish way. We ...

In this paper, we study the throughput capacity of wireless networks considering the selfish feature of interaction between nodes. In our proposed network model, each node has a probability of cooperating to relay transmission. According to the extent of selfishness, we, by the application of percolation theory, construct a series of highways crossing the network. The transmission strategy is t...