An energy-efficient proactive routing scheme for MANET: Game theoretical approach of forwarding with selfish nodes

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In Mobile Ad-hoc Networks, nodes exchange packets with each other using intermediate nodes as relays. Since nodes in MANETs are battery powered, energy conservation is a crucial issue. Accepting relay all request may not be in the best interest of a node. But if many nodes prefer not to consume energy in relaying packets on behalf of others, the overall performance of routing in network will be influenced. In this paper we address the energy-efficient routing problem in MANETs with selfish nodes. We modeled this problem as a game-theoretic constraint optimization; we defined the utility of each node as a weighted difference between a performance metric and some transmission costs. A motivate mechanism is proposed in order to induce nodes to forwarding cooperation. Each node independently implements the optimal equilibrium strategy under the given constraints. Simulation results by NS3 simulator show that our proposed approach can improve system performance in network lifetime and packet delivery ratio.

Author supplied keywords

Cite

CITATION STYLE

APA

Sahnoun, A., Habbani, A., & El Abbadi, J. (2017). An energy-efficient proactive routing scheme for MANET: Game theoretical approach of forwarding with selfish nodes. International Journal of Electronics and Telecommunications, 63(4), 399–404. https://doi.org/10.1515/eletel-2017-0055

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free