• Journal of information and communication convergence engineering
• /
• v.10 no.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)
• /
• v.13 no.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)
• /
• v.13 no.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
• /
• v.34 no.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.

• Journal of Sasang Constitutional Medicine
• /
• v.22 no.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 (命).

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.65-75
• /
• 2009

A Vehicular Ad-Hoc Network (VANET) is a form of Mobile ad-hoc network, to provide temporary communications among nearby vehicles. Mobile node of VANET consumes energy and resource with participating in the member of network. Some node tends to have a selfishness to place one's own profits above cooperation with others. As result of selfish node, it reduces data accessibility and the efficiency of networks. In this paper, we propose noble method, Friendship-VaR that excludes selfish nodes from a group of VANET. Friendship-VaR enables to improve data accessibility by eliminating selfish nodes and sharing data among reliable nodes. Friendship-VaR determines selfishness of nodes by simple data exchange. The experiments shows proposed method outperform existing method in terms of data accessibility.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.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.

• Honam Mathematical Journal
• /
• v.35 no.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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.7
• /
• pp.1-8
• /
• 2011

Vehicular Ad-hoc Network (VANET) is a special form of Mobile Ad-hoc Network designed to provide communications among nearby vehicles without communications infrastructure. Some characteristics in VANET environment such as high mobility, dynamic topology and selfishness of nodes can cause degradation of network quality. In this paper, we propose an adaptive incentive/topology control scheme to improve network quality in VANET by stimulating real time data forwarding and reporting changes of network topology. In the proposed scheme, an incentive suggested by the source node is updated in real time simultaneously with data transmission to stimulate real time data forwarding. In addition, when the order of the nodes in the path is changed, nodes which report the changes of network topology will get an additional incentive. By computer simulation, it is shown that the proposed incentive/topology control scheme outperforms the conventional schemes with respect to data delivery time and data delivery ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.