• Journal of information and communication convergence engineering
• /
• 제10권4호
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.152-171
• /
• 2019

In opportunistic networks, nodes may appear some selfishness while transmitting the message, however, most of the existing research works consider the individual selfishness or social selfishness respectively, and these two types of selfishness may coexist in opportunistic networks. In this paper, we propose an Incentive Aware Routing based on Game Theory for selfish OPPNETs, named IAR-GT, which uses Rubinstein-Stahl bargaining game model to incentivize selfish nodes cooperation in data forwarding. IAR-GT scheme not only considers the resources of nodes, but also uses a new method to calculate the social ties between them. Trace-driven simulations show that our incentive aware routing scheme achieves better performances than comparing schemes under two types of selfishness coexistence environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1481-1501
• /
• 2019

In opportunistic network, the behavior of a node is autonomous and has social attributes such as selfishness.If a node wants to forward information to another node, it is bound to be limited by the node's own resources such as cache, power, and energy.Therefore, in the process of communication, some nodes do not help to forward information of other nodes because of their selfish behavior. This will lead to the inability to complete cooperation, greatly reduce the success rate of message transmission, increase network delay, and affect the overall network performance. This article proposes a hybrid incentive mechanism (Mim) based on the Reputation mechanism and the Credit mechanism.The selfishness model, energy model (The energy in the article exists in the form of electricity) and transaction model constitute our Mim mechanism. The Mim classifies the selfishness of nodes and constantly pay attention to changes in node energy, and manage the wealth of both sides of the node by introducing the Central Money Management Center. By calculating the selfishness of the node, the currency trading model is used to differentiate pricing of the node's services. Simulation results show that by using the Mim, the information delivery rate in the network and the fairness of node transactions are improved. At the same time, it also greatly increases the average life of the network.

• Journal of Preventive Medicine and Public Health
• /
• 제34권1호
• /
• pp.73-79
• /
• 2001

Objectives : To examine predictors of successful control for selfishness, dishonesty, resentment, and fear(SDRF) among Korean Alcoholics Anonymous(AA) members. Methods : This study was a cross-sectional study. The study group included members from 18 different AA groups which were enrolled in the Korean AA Association in 1998. 207 Out of 300 self administered questionnaires were completed by AA members (response rate 69.0%). Alcoholics who attended AA meetings were divided into two groups according to their self reported level of success in SDRF control; one with very successful experience after AA participation and the other with little or no success. In this study, the general characteristics, AA activities, relapse experience, and degree of effort exerted for SDRF control were compared between two groups. In order to study predictors of successful SDRF control after joining AA, 4 logistic regression analyses were performed for each of the 4 SDRF indices. Results : The proportion of those reporting a 'very successful' experience was 19.9% for selfishness, 20.7% for dishonesty, 25.5% for resentment, and 24.7% for fear. After control for the effect of general characteristics, the practice of the 12th step(taking alcoholics to an AA meeting after conveying messages) was found to be a significant predictor for the successful control of both selfishness(OR=6.04) and the dishonesty(OR=7.77). And individuals making every effort for SDRF control showed more successful control of selfishness(OR=4.10), dishonesty(OR=4.01, and fear(OR=34.89). Conclusions : Bivariate and multivariate analyses demonstrated that especially practicing the 12th step and making every effort themselves, may help alcoholics to control SDRF successfully after joining AA.

• 사상체질의학회지
• /
• 제22권2호
• /
• pp.1-15
• /
• 2010

1. Objectives: This research aims to study the general overview of the theories on the covetous desire and the relevant theories on cultivation mentioned in "Donguisusebowon (東醫壽世保元): Theories on Nature and Conduct (性命論)". 2. Methods: The theories concerning the covetous desire introduced in Dong-Mu's manuscripts, including "Gyukchigo 格致藁)", "Yougocho (遺稿抄)", "Dongmuyougo (東武遺稿)" and "Jaejungsinpyun (濟衆新編)", were comprehensively reviewed. Furthermore, the significance of the theories on the covetous desire and the relevant theories on self-cultivation were studied within the context of "Donguisusebowon(東醫壽世保元): Theories on Nature and Conduct (性命論)". 3. Results and Conclusions: 1) Among the four covetous desires (selfishness (私心), indiscretion (放心), indolence(逸心), acquisitiveness (慾心)), selfishness and acquisitiveness are the interpersonal components that deal with the relationship between individuals, whereas indiscretion and indolence are the intra-personal or self-concerned components that deal with the internal desires within the individual. 2) In the early concepts on the quaternity explaining the perspective on the human being as introduced in Dongmu's earlier manuscripts, the four covetous desires are thought of as the most important etiological components, that are also intimately related to the theories of self-cultivation. 3) Among the concepts introduced in "Donguisusebowon (東醫壽世保元): Theories on Nature and Conduct (性命論)", viciousness (邪心) and negligence (怠心) are primary, intra-personal (self-concerned) desires that are henceforth matched to indiscretion and indolence, respectively, while selfishness (arrogance, assertiveness, indiscrimination and exaggeration (驕矜伐夸)) and acquisitiveness (violation, extravagance, slothfulness and stealthiness(奪侈懶竊)) are secondary, interpersonal desires. 4) 'Preserving the mind (存其心)' and 'rectifying the body (修其身)' are Methods of overcoming viciousness (indiscretion) and negligence (indolence), the intrapersonal desires, while 'nurturing the nature (養其性)' and 'propping the course (立其命)' are Methods of eliminating selfishness and acquisitiveness, the interpersonal desires, which ultimately each leads to the completion of Nature (性) and Conduct/Course (命).

• 한국ITS학회 논문지
• /
• 제8권1호
• /
• pp.65-75
• /
• 2009

차량 애드 혹 네트웍 (VANET)은 모바일 애드혹 네트워크의 일종으로써 차량 간의 임시적인 통신을 가능케 한다. VANET의 모바일 노드는 네트웍의 일원으로 참여하면서 에너지와 자원을 사용한다. 몇몇의 노드는 다른 노드와 협력하는 대신에 자신의 이득만을 취하려고 하는 이기성을 가지고 있다. 이러한 이기성을 가진 노드들로 인해 데이터 접근성과 네트웍의 효율성이 감소하게 된다. 이 논문에서는 새로운 기법인 VANET 그룹에서 이기성을 갖고있는 노드를 제거하는 Friendship-VaR을 제안한다. Friendship-VaR은 이기성을 갖고있는 노드를 제거하고 믿을 수 있는 노드들간에 데이터 공유를 가능케 한다. Friendship-VaR는 간단한 데이터 교환을 통해 노드의 이기성 여부를 결정한다. 실험 결과는 제안한 기법이 기존의 기법에 비해 데이터 접근성이 좋아짐을 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5927-5942
• /
• 2017

Many real networks exhibit overlapping community structures. Recent studies have been performed that analyze the impact of overlapping community structure on information propagation, but few of them concerned with individual behaviors. From this point of view, we propose a Markov process model to evaluate the performance of information propagation in social networks with overlapping community structures. In addition, many individual social behaviors are combined in the model. For example, individuals may exhibit selfish behaviors, such as individual and social selfishness, and people may discard the information after they have used it. The accuracy of the model is verified by simulation. Furthermore, the numerical results show that both overlapping community structure of the network and individual behaviors have a significant impact on the outbreak size and propagation speed of the information. Additionally, the overlapping community structure of the social network can reduce the impact of selfishness on information propagation.

• 호남수학학술지
• /
• 제35권2호
• /
• pp.225-234
• /
• 2013

Many studies of experimental economics have produced outcomes which contradict the predictions of Nash equilibrium, which relies heavily upon the premise of selfishness of an individual. In the games involving contexts of social conflicts represented by the prisoners' dilemma game, the experiments yields outcomes quite different from what are predicted by the conventional wisdom. In order to fill this gap between the conventional Nash Equilibrium and experimental outcomes, non-selfish (or other-regarding) motives of human behavior are introduced and then a new equilibrium concept, RAE-equilibrium is developed. It is also proved that an RAE-equilibrium exists under quite general conditions. Then it is applied to the prisoners' dilemma game that some of the experimental outcomes can be explained.

• 대한전자공학회논문지TC
• /
• 제48권7호
• /
• pp.1-8
• /
• 2011

Vehicular Ad-hoc Network (VANET)은 기반시설의 도움 없이 차량 간의 무선통신을 통하여 실시간으로 항상 접속 가능한 네트워크이다. 그러나 VANET 환경을 구성하는 노드들의 잦은 토폴로지 변화, 패킷을 다른 노드로 포워딩 해주지 않는 selfishness 등의 특징은 VANET의 성능을 저하시키는 요인이 될 수 있다. 이러한 네트워크 성능 저하를 개선시키기 위한 기존의 인센티브 시스템에 관한 연구들은 고정 된 값의 인센티브를 제시하거나, 값이 변화하는 인센티브를 제시하더라도 인센티브 조정 과정이 데이터 전송과 동시에 진행되지 않는다. 따라서 selfish 노드들의 데이터 포워딩을 실시간으로 진작시키는데 한계가 있으며, VANET 환경에서의 잦은 토폴로지 변화에 대한 고려가 부족하였다. 본 논문은 노드의 데이터 포워딩을 실시간으로 진작시키기 위하여 데이터 전송 중에 인센티브 값을 실시간으로 조정하여 제시하는 인센티브 구조를 제안한다. 또 경로 설정 단계에서 결정된 초기 경로 내의 노드 순서가 데이터 전송 중에 바뀐 경우, 경로재설정을 요청한 중간노드는 그 요청이 반영되어 경로가 수정되면 인센티브를 받을 수 있도록 알고리즘을 구성하였다. 시뮬레이션을 통하여, 제안하는 인센티브 구조를 사용하면 데이터의 delivery time 및 delivery ratio 측면에서 기존의 알고리즘 대비 우수한 성능을 가짐을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5322-5342
• /
• 2016

In vehicle-to-vehicle (V2V) networks, where selfishness degrades node activity, countermeasures for collaboration enforcement must be provided to enable application of a sage and efficient network environment. Because vehicular networks feature both high mobility and various topologies, selfish behavior judgment and establishment of a stable routing protocol become intensely challenging. In this paper, a two-phase-based generous cooperative routing protocol (called GEC) is presented for V2V networks to provide resistance to selfishness. To detect selfish behaving vehicles, a packet forwarding watchdog and an average connection rate based on the multipath weight method are used, where evidence is gathered from different watchdogs. Then, multihop relay decisions are made using a generous cooperative algorithm based on game theory. Finally, through buffering of the multiple end-to-end paths and judicious choice of optimal cooperative routes, route maintenance phase is capable of dealing with congestion and rapidly exchanging traffic. Specifically, it is proved that the GEC is theoretically subgame perfect. Simulation results show that for V2V networks with inherently selfish nodes, the proposed method isolates uncooperative vehicles and is capable of accommodating both the mobility and congestion circumstances by facilitating information dissemination and reducing end-to-end delay.