ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

Modeling and Stimulating Node Cooperation in Wireless Ad Hoc Networks

  • Arghavani, Abbas (Department of Information Technology, Applied Science and Technology University) ;
  • Arghavani, Mahdi (Department of Information Technology, Applied Science and Technology University) ;
  • Sargazi, Abolfazl (Department of Computer Engineering and Information Technology, QIAU) ;
  • Ahmadi, Mahmood (Faculty of Computer Engineering Department, Razi University)
  • Received : 2013.12.18
  • Accepted : 2014.05.28
  • Published : 2015.02.01
Download PDF
⟨ Previous Next ⟩

Abstract

In wireless networks, cooperation is necessary for many protocols, such as routing, clock synchronization, and security. It is known that cooperator nodes suffer greatly from problems such as increasing energy consumption. Therefore, rational nodes have no incentive to cooperatively forward traffic for others. A rational node is different from a malicious node. It is a node that makes the best decision in each state (cooperate or non-cooperate). In this paper, game theory is used to analyze the cooperation between nodes. An evolutionary game has been investigated using two nodes, and their strategies have been compared to find the best one. Subsequently, two approaches, one based on a genetic algorithm (GA) and the other on learning automata (LA), are presented to incite nodes for cooperating in a noisy environment. As you will see later, the GA strategy is able to disable the effect of noise by using a big enough chromosome; however, it cannot persuade nodes to cooperate in a noisefree environment. Unlike the GA strategy, the LA strategy shows good results in a noise-free environment because it has good agreement in cooperation-based strategies in both types of environment (noise-free and noisy).

Keywords

References

  1. J.N. Laneman and G.W. Wornell, "Distributed Space-Time- Coded Protocols for Exploiting Cooperative Diversity in Wireless Networks," IEEE Trans. Inf. Theory, vol. 49, no. 10, Oct. 2003, pp. 2415-2425. https://doi.org/10.1109/TIT.2003.817829
  2. R.U. Nabar, H. Bolcskei, and F.W. Kneubuhler, "Fading Relay Channels: Performance Limits and Space-Time Signal Design," IEEE J. Sel. Areas Commun., vol. 22, no. 6, Aug. 2004, pp. 1099-1109. https://doi.org/10.1109/JSAC.2004.830922
  3. I.E. Telatar, "Capacity of Multi-antenna Gaussian Channels," European Trans. Telecommun., vol. 10, no. 6, Nov.-Dec. 1999, pp. 585-595. https://doi.org/10.1002/ett.4460100604
  4. M. Godavarti, "Multiple Antennas in Wireless Communications: Array Signal Processing and Channel Capacity," Ph.D. dissertation, Department of Electrical Engineering and Computer Science, University of Michigan, MI, USA, 2001.
  5. A. Narula, M.D. Trott, and G.W. Wornell, "Performance Limits of Coded Diversity Methods for Transmitter Antenna Arrays," IEEE Trans. Inf. Theory, vol. 45, no. 7, Nov. 1999, pp. 2418-2433. https://doi.org/10.1109/18.796381
  6. J.G. Proakis, "Digital Communications," New York, NY, USA: McGraw-Hill, 1995.
  7. A. Sendonaris, E. Erkip, and B. Aazhang, "User Cooperation Diversity-Part I: System Description," IEEE Trans. Commun., vol. 51, no. 11, Nov. 2003, pp. 1927-1938. https://doi.org/10.1109/TCOMM.2003.818096
  8. A. Sendonaris, E. Erkip, and B. Aazhang, "User Cooperation Diversity-Part II: Implementation Aspects and Performance Analysis," IEEE Trans. Commun., vol. 51, no. 11, Nov. 2003, pp. 1939-1948. https://doi.org/10.1109/TCOMM.2003.819238
  9. A. Nosratinia, T.E. Hunter, and A. Hedayat, "Cooperative Communication in Wireless Networks," IEEE Commun. Mag., vol. 42, no. 10, Oct. 2004, pp. 74-80. https://doi.org/10.1109/MCOM.2004.1341264
  10. V. Srinivasan et al., "Cooperation in Wireless Ad Hoc Networks," Proc. IEEE INFOCOM, San Francisco, CA, USA, vol. 2, Mar. 30-Apr. 3, 2003, pp. 808-817.
  11. X. Huang, H. Zhai, and Y. Fang, "Robust Cooperative Routing Protocol in Mobile Wireless Sensor Networks," IEEE Trans. Wireless Commun., vol. 7, no. 12, Dec. 2008, pp. 5278-5285. https://doi.org/10.1109/T-WC.2008.060680
  12. J.W. Yoo and K.H. Park, "A Cooperative Clustering Protocol for Energy Saving of Mobile Devices with WLAN and Bluetooth Interfaces," IEEE Trans. Mobile Comput., vol. 10, no. 4, Apr. 2011, pp. 491-504. https://doi.org/10.1109/TMC.2010.161
  13. F. Chiti et al., "Cooperative Localization Protocols for Wireless Sensor Networks," Proc. IEEE GLOBECOM, Washington, DC, USA, Nov. 26-30, 2007, pp. 1048-1052.
  14. L. Yan and S. Hailes, "Cooperative Packet Relaying Model for Wireless Ad-hoc Networks," Proc. ACM. FOWANC, Hong Kong, China, May 27-30, 2008, pp. 93-100.
  15. J. Hu, "Cooperation in Mobile Ad-Hoc Networks," Tech. report, Computer Science Department, Florida State University, FL, USA, 2005.
  16. L. Buttyan and J.-P. Hubaux, "Enforce Service Availability in Mobile Ad-hoc WANs," Proc. MobiHoc, Boston, MA, USA, Aug. 6-11, 2000, pp. 87-96.
  17. J.-P. hubaux et al., "The Terminode Project: Towards Mobile Adhoc WANs" IEEE Int. Workshop Mobile Multimedia Commun., San Diego, CA, USA, Nov. 15-17, 1999, pp. 124-128.
  18. S. Buchegger and J. Boudec, "Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes Fairness in Dynamic Ad-hoc Networks," Proc. ACM. Int. Symp. MobiHoc, Lausanne, Switzerland, June 9-11, 2002, pp. 226-236.
  19. S. Zhong, J. Chen, and Y.R. Yang, "Sprite: A Simple, Cheat Proof, Credit-Based System for Mobile Ad-hoc Networks," Proc. IEEE INFOCOM, San Francisco, CA, USA, vol. 3, Mar. 30-Apr. 3, 2003, pp. 1987-1997.
  20. P. Michiardi and R.K. Molva, "Core: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad-hoc Networks," Int. Federation Inf. Process., Portoroz, Slovenia, vol. 100, Sept. 26-27, 2002, pp. 107-121.
  21. S. Bansal and M. Baker, "Observation-Based Cooperation Enforcement in Ad-hoc Networks," Technical Paper, July 2003.
  22. L. Buttyan and J.-P. Hubaux, "Stimulating Cooperation in Self- Organizing Mobile Ad-hoc Networks," J. Mobile Netw. Appl., vol. 8, no. 5, Oct. 2003, pp. 579-592. https://doi.org/10.1023/A:1025146013151
  23. L. Buttyan and J.-P. Hubaux, "Nuglets: A Virtual Currency to Stimulate Cooperation in Self-Organized Mobile Ad-hoc Networks," Swiss Federal Institute Technol., Lausanne, Switzerland, DSC/2001/001, Jan. 2001.
  24. R. Axelrod and W.D. Hamilton, "The Evolution of Cooperation," New York, NY, USA: Basic Books, 1984, pp. 390-396.
  25. L. Yan, "Cooperative Packet Relaying in Wireless Multi-hop Networks," Proc. Int. Conf. WAINA, Bradford, UK, May 26-29, 2009, pp. 345-350.
  26. J.N. Webb, "Game Theory: Decisions Interaction and Evolution," 1st ed., New York, NY, USA: Springer, 2006, pp. 118-132.
  27. Z. Fang and B. Bensaou, "Fair Bandwidth Sharing Algorithms Based on Game Theory Frameworks for Wireless Ad-hoc Networks," IEEE INFOCOM, Hong Kong, China, vol. 2, Mar. 7-11, 2004, pp. 1284-1295.
  28. V. Srivastava et al., "Using Game Theory to Analyze Wireless Ad-hoc Networks," IEEE Commun. Surveys Tutorials, vol. 7, no. 4, Dec. 2005. pp. 46-56.
  29. L.A. DaSilva and V. Srivastava, "Node Participation in Ad-hoc and Peer-to-Peer Networks: A Game-Theoretic Formulation," Workshop Games Emergent Behavior Distrib. Comput. Environments, Birmingham, UK, Sept. 18, 2004.
  30. L. Anderegg and S. Eidenbenz, "Ad-hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad-hoc Networks with Selfish Agents," Proc. MobiCom, San Diego, CA, USA, Sept. 14-19, 2003, pp. 245-259.
  31. S. Zhong et al., "On Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad-hoc Networks: An Integrated Approach Using Game Theoretical and Cryptographic Techniques," Proc. ACM Int. Conf. MobiCom, Cologne, Germany, Aug. 28-Sept. 2, 2005, pp. 117-131.
  32. W. Wang et al., "OURS: Optimal Unicast Routing Systems in Non-cooperative Wireless Networks," Proc. Annu. Int. Conf. MobiCom, Los Angeles, CA, USA, Sept. 24-29, 2006, pp. 402-413.
  33. J.F. Nash, "Equilibrium Points in N-person Games," J. PNAS, vol. 36, no. 1, 1950, pp. 48-49. https://doi.org/10.1073/pnas.36.1.48
  34. D.B. Neill, "Optimality under Noise: Higher Memory Strategies for the Alternating Prisoner's Dilemma," J. Theoretical Biol., vol. 211, no. 2, July 2001, pp. 159-180. https://doi.org/10.1006/jtbi.2001.2337
  35. X. Yao and P.J. Darwen, "An Experimental Study of N-person Iterated Prisoner's Dilemma Games," Workshop Evolutionary Comput., Melbourne, Australia, vol. 956, no. 1, June 1995, pp. 90-108.
  36. S.N. Sivanandam and S.N. Deepa, "Introduction to Genetic Algorithms," Berlin, Germany: Springer, 2007, pp. 145-201.
  37. M. Mitchell, "An Introduction to Genetic Algorithms (Complex Adaptive Systems)," 3rd ed., MA, USA: Bradford Book, MIT Press, 1998, pp. 134-167.
  38. J. Wu and R. Axelrod, "How to Cope with Noise in the Iterated Prisoner's Dilemma," J. Conflict Resolution, vol. 39, no. 1, Mar. 1995, pp. 183-189. https://doi.org/10.1177/0022002795039001008
  39. K.S. Narendra and M.A.L Thathachar, "Learning Automata: An Introduction," NJ, USA: Prentice-Hall, 1989.

Cited by

  1. Imposing Packet Relaying for Mobile Adhoc Networks Using Genetic Algorithm vol.10, pp.None, 2020, https://doi.org/10.2174/2210327910666200320090234