PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

An Energy-Efficient Proactive Routing Scheme for MANET : Game Theoretical Approach of Forwarding with Selfish Nodes

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
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 energyefficient 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.
Słowa kluczowe
Twórcy
autor
  • LEC Laboratory, EMI, Mohammed V University, Rabat, Morocco
autor
  • SIME Laboratory, ENSIAS, Mohammed V University, Rabat, Morocco
autor
  • LEC Laboratory, EMI, Mohammed V University, Rabat, Morocco
Bibliografia
  • [1] C. E. Perkins and P. Bhagwat, “ Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers”, In Proceedings of the SIGCOMM ’94 Conference on Communications Architectures, Protocols and Applications, 1994, pp. 234–244.
  • [2] T. Clausen and P. Jacquet “Optimized Link State Routing Protocol (OLSR).” RFC 3626, IETF Network Working Group, October 2003.
  • [3] C. E. Perkins and E. M. Royer, “Ad Hoc On-demand Distance Vector Routing,” In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 90-100.
  • [4] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad-Hoc Ad hoc Networks", Mobile Computing, 1996, pp. 153-181.
  • [5] K. Chen and K. Nahrstedt, “iPass: An Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in Manets,” Proc. 24th IEEE Int’l Conf. Distributed Computing Systems (ICDCS’04), 2004.
  • [6] S. Zhong, Y.R. Yang, and J. Chen, “Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-hoc Networks,”Proc. IEEE INFOCOM, pp. 1987-1997, 2003.
  • [7] Fudenberg D., Tirole J., “Game theory. MIT Press, Cambridge,” 1991.
  • [8] Jung S., Hundewale N., Zelikovsky A., “Energy efficiency of load balancing in MANET routing protocols,” Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN’05), p 476–483, 2005.
  • [9] Feeney L.M., “An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks,” Mobile Netw Appl 6:239–249, 2001.
  • [10] Khouzani M.H.R., Eshghi S., Sarkar S., Shroff N.B., Venkatesh S.S., “Optimal energy-aware epidemic routing in DTNs,” Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’12), p 175–182, 2012.
  • [11] Manam V.K.C., Mahendran V., Murthy C.S.R., “Performance modeling of DTN routing with heterogeneous and selfish nodes,” Wirel Netw 20(1):25–40, 2014.
  • [12] Wang Y., Singhal M., “On improving the efficiency of truthful routing in MANETs with selfish nodes,” Pervasive Mob Comput 3(2007):537–559, 2007.
  • [13] S. Marti, T. J. Giuli, K. Lai, and M. Baker, “Mitigating routing misbehaviour in mobile ad hoc networks,” in Proc. ACM/IEEE Annual International Conference on Mobile Computing and Networking (Mobicom), pp. 255-265, Boston, MA, Aug. 2000.
  • [14] S. Buchegger and J.-Y. Le Boudec, “Performance analysis of the CONFIDANT protocol (cooperation ofnodes: fairness in dynamic ad-hoc networks),” in Proc. ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 80-91, Lausannae, Switzerland, June 2002.
  • [15] P. Michiardi and R. Molva, “A game theoretical approach to evaluate cooperation enforcement mechanisms in mobile ad hoc networks,” in Proc. IEEE/ACM International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), Sophi Antipolis, France, Mar. 2003.
  • [16] E. Altman, A. A. Kherani, P. Michiardi, and R. Molva, “Non-cooperative forwarding in ad hoc networks,” in Proc. International Conferences on Networking, vol. 3462, Waterloo, Canada, May 2005.
  • [17] M. Felegyhazi, J. P. Hubaux, and L. Buttyan, “Nash equilibria of packet forwarding strategies in wireless ad hoc networks,” IEEE Trans. Mobile Computing, vol. 5, no. 5, p. 463-476, Apr. 2006.
  • [18] V. Srinivasan, P. Nuggehalli, C. F. Chiasserini, and R. R. Rao, “Cooperation in wireless ad hoc networks,” in Proc. Annual IEEE Conference on Computer Communications (INFOCOM), San Francisco, CA, Mar. 2003.
  • [19] Srinivasan V., Nuggehalli P., Chiasserini F., Rao R.R. “Cooperation in wireless adhoc networks,” Proc INFOCOM 2003(2):808–817, 2003.
  • [20] Naserian M., Tepe K., “Dynamic probabilistic forwarding in wireless ad hoc networks based on game theory,” 2014 I.E. Vehicular Technology Conference (VTC Spring), 1–5, 2014.
  • [21] Zhu H., Dusit N., Walid S., Tamer B., Are H., “Game Theory in Wireless and Communication Networks Theory, Models, and Applications,” 2011.
Uwagi
PL
Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-12187868-79d6-471a-8fd8-2e52168840b4
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.