Altruism for Energy Efficiency in Ad Hoc Networks

Tran, Minh Tri; Simon, Vilmos

doi:10.1109/vetecs.2011.5956790

Cited by 3 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assuming that the nodes are acquainted with their geographical coordinates as it is the situation in georouting schemes, we have modified the GPSR [18] georouting protocol for our purpose, creating the Altruistic GPSR (AGPSR). If every node of the network acts altruistically like node A in forwarding data, the overall energy consumption of the network can be reduced as we have shown it with simulation results [1]. The results show that by a certain density of the network, the altruistic behavior can save much energy for the network (more than 16% in fix nodes scenario), but the efficiency of this method decreases, as the network gets more dense.…”

Section: The Altruistic Gpsr Algorithmmentioning

confidence: 72%

See 1 more Smart Citation

Can altruism spare energy in ad hoc networking?

Tran

Simon

2011

Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia

Self Cite

View full text Add to dashboard Cite

The idea of applying behavior forms from biological world in the telecommunications can be beneficial, as these behaviors were developed and selected successfully by natural evolution. In our research, the altruistic behavior of the wireless nodes of ad hoc networks is in focus. The goal is to discover if this behavior form could improve the effectiveness of the communication in t he network. In our previous work, the concept of altruism was presented with the modified GPSR algorithm called the AGPRS algorithm (altruistic GPSR), introducing promising simulation results for AGPRS. In this paper, we tend to give some analysis of function and performance of AGPRS and to present a simple form of controlling altruism, because controlling and stimulating altruism is necessary as there can be malicious nodes inside the network. General TermsAlgorithms, M easurement, Performance KeywordsAltruism, Ad hoc networks, Energy efficiency, OMNeT ++ simulation environment ALTRUISM IN AD HOC NETWORKSAltruism at first is defined as a behavior form in the biological world, Darwin himself has introduced the benefits of this behavior [2]. The effect of altruism on telecommunication networks was discussed in [3], where the authors have modeled the problem, and gave some results based on game and graph theory. Bandwidth or information was considered as resource of the network, so the idea of sharing them were used in networking. In [4] authors showed that in case the nodes in a network share bandwidth, a Nash equilibrium also exists, if their sharing activity is priced properly. When information is considered as a resource, the nodes of the network can also share messages with an altruistic intend. This idea was explored in a paper on the barter algorithm [5]. The authors also showed that in a game where nodes are players and share messages the Nash equilibrium can be reached, and it is not worth to cheat (meaning being selfish). This kind of behavior is not successful only in the natural world on a group level [6], but also in economics, selfish behavior by independent, noncooperative agents will not produce a socially desirable outcome [7]. There could be not just altruistic nodes in an ad hoc network, as there are always malicious ones, which tries to earn more benefit from others or to cutback the overall performance. So altruism should be controlled and stimulated by some schemes, to mitigate the activity of malicious nodes, in this paper we will present such mechanisms. Altruistic behavior is classified in biology into many types [8,9], in our research the reciprocal altruism is observed [10].. The concept of reciprocal altruism is closely related to the Tit-for-Tat strategy in the iterated Prisoner's Dilemma (IPD) from game theory. In their famous computer tournament in which a large number of strategies were pitted against each other in the IPD, Axelrod and Hamilton [11] found that the Tit-for-Tat strategy yielded the highest payoff. Subsequent work in evolutionary game theory, much of it inspired by Axelrod and Hamilton's ideas...

show abstract

Section: The Altruistic Gpsr Algorithmmentioning

confidence: 72%

“…In our previous work, Altruistic GPSR (AGPSR) [1] was presented as a promising method of exploiting the idea of applying altruism to an ad hoc network. In our case, the resource to be shared in an ad hoc network is the energy of the nodes.…”

Section: The Altruistic Gpsr Algorithmmentioning

confidence: 99%

Can altruism spare energy in ad hoc networking?

Tran

Simon

2011

Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [13], two researchers applied energy consumption optimisation to ad hoc networks. They implemented the modified Greedy Perimeter Stateless Routing (GPSR) algorithm to enable altruistic behaviour to device's energy saving energy in ad hoc networks.…”

Section: Literature Survey Of Related Workmentioning

confidence: 99%

Modelling and optimising a new hybrid ad-hoc network cooperation strategy performance using genetic algorithm

Kareem

Mohammed²,

Safaa

2021

Serb J Electr Eng

View full text Add to dashboard Cite

The lifetime of an ad-hoc network depends on a mobile device?s limited battery capacity. In ad-hoc multi-hop communication, source nodes use intermediate nodes as a relay to communicate with remote destinations. As cooperation between nodes is restrained by their battery resources, it might not be in their best interests to always accept relay requests. Therefore, if all nodes decide how much energy to spend for relaying, selfish or non-cooperative nodes reduce cooperation by rejecting to forward packets to others, thereby leading to a dramatic drop in the network?s throughput. Three strategies have been founded to solve this problem: tit-for-tat, live-and-let-live, and selective drop. This research explored a new strategy in ad-hoc cooperation which resulted from the combination of the live-and-let-live and selective drop strategies. This new strategy is based on the suggestion to select fewer hops with a low drop percentage and sufficient power to stay alive after forwarding the data packets towards the destination or other relays at the route path. We used a genetic algorithm (GA) to optimise the cooperative problem. Moreover, the fitness equation of the GA population was designed according to the mixing of the two strategies, which resulted in a new optimized hybrid dynamic-static cooperation.

show abstract