Citation Context

...e.sA great deal of research has dealt with trust in the realm of distributed systems.sInformation exchange methods have been particularly useful in the formation of adhoc networks. Seredynski et. al. =-=[1]-=- used the concept of an evolving genetic algorithmsto enhance security and trust in a wireless network among multiple nodes relayingsdata packets. Other works have taken a purely game-theoretic approa...

Citation Context

...tation of individual nodes based on the nature ofspast association.sEvolutionary game theory has been popularly used in the study of cooperation inswireless ad hoc networks. In models close to ours, (=-=Seredynski et al., 2007-=-) havesproposed a game based model to examine cooperative evolution between the nodes ofsAPPENDIX A. TRUST ASSESMENT WITH AN APPLICATIONs157sthe network. Their results show that the proposed game base...

Citation Context

...sharing. Agents were permitted to shift their behavioral choices to more effective means through analysis at a fixed interval. The LivingAgent (more on this later) was introduced as a competitive alternative to the Tit-for-Tat strategy, and the former worked well in the constraints provided. However, it still suffered from a need for ‘critical mass’ of the behavior’s presence before it was effective. A great deal of research has dealt with trust in the realm of distributed systems. Information exchange methods have been particularly useful in the formation of adhoc networks. Seredynski et al. [1] used the concept of an evolving genetic algorithm to enhance security and trust in a wireless network among multiple nodes relaying data packets. Other works have taken a purely game-theoretic approach to trust. The work of Cascella [2] performed analysis of an infinitely repeated form of the prisoner’s dilemma with regard to persistent players randomly selected. They found the introduction of a reputation system allowed punishment systems based on discriminating between good and bad reputations succeeded as long as players were sufficiently patient to achieve the results. Other works have at...

Citation Context

...ased cooperation mechanisms presented in [3, 4, 5] exploit the reputation evaluation of the mobile nodes derived from the trust model to decide which of them to punish. Additionally, game theory [9] provides us with a method for analyzing an ad-hoc wireless network where selfish and cooperative mobile nodes coexist. In game theory, the best action for each individual decision maker can be found. The game whose objective goal is to isolate selfish mobile nodes belongs to a repeated noncooperation game, where each mobile node takes selfishness into account. The trust-based approach presented in [10] evaluates mobile nodes’ behavior in terms of a noncooperative game. The packet forward strategy presented in [10] is that each mobile node chooses the action that maximizes its payoff and adjusts the packet forward strategy through the genetic algorithm. However, the genetic J. lnf. Commun. Converg. Eng. 10(2): 141-148, Jun. 2012 Regular Paper A Simple but Efficient Scheme for Reliable Connectivity and High Performance in Ad-hoc Wireless Networks Sungwoo Tak, Member, KIICE School of Computer Science and Engineering, Pusan National University, Busan 609-735, Korea Abstract This paper presents ...

Citation Context

...at all nodes are subject to centralized control [30]. To encourage cooperation from the self-interested nodes in the Nash equilibria, various incentive mechanisms have been proposed in the literature =-=[70, 5, 62]-=-. One promising technique is to establish trust relations among nodes. Most literature works focus on the design of different aspects of the trust schemes, such as trust evaluation, trust information ...