Abstract
Because of energy-constraint, it is an attractive problem to select energy-efficient paths from source nodes to sink for data gathering in wireless ad hoc networks. Cooperative communication is a promising mechanism to reduce transmit energy in such kind of case. One of the fundamental assumptions for cooperative communication is that each node should be unselfish, responsible, and willing to forwarding data he has received. However, in energy-constrained environment, because of limited energy, each node hates participating in data transmission without any incentive and tries to avoid forwarding data (this behavior is selfish). In this paper, a utility function is proposed to stimulate nodes to behave unselfishly. We prove that it is a Nash Equilibrium when nodes work in an unselfish manner. Also, we show that the selection of forwarding nodes and relay nodes for data transmission is a NP-hard problem even when nodes behave unselfishly. A heuristic algorithm (Algorithm for Node Selection Problem, ANSP) is provided to solve this selection problem. We also prove the convergence of this algorithm. The analysis shows that this algorithm can reach the approximate performance ratio of 2⋅(1+α), where α is the maximal ratio of two power consumptions on two adjacent links in the network. The numerical results show that in a 100 node network, if nodes behave unselfishly, they will obtain a better utility, and more energy will be saved. The average saved energy when each node takes a selfish behavior, is 52.5% less than the average when nodes behave in an unselfish manner.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alpcan, T., Basar, T., Sirkant, R., & Altman, E. (2002). CDMA uplink power control as a noncooperative game. Wireless Networks, 3(6), 659–670.
Chen, Y., & Kishore, S. (2007). A game-theoretic analysis of decode-and-forward cooperation in Gaussian channels. In CISS 2007, March.
Goodman, D., & Mandayam, N. (2001). Network assisted power control for wireless data. Mobile Networks and Applications, 6(5), 409–415.
Fudenberg, D., & Tirole, J. (1991). Game theory. Cambridge: MIT Press.
Hassin, R. (1992). Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17(1). doi:10.1287/moor.17.1.36
Huang, J., Han, Z., Chiang, M., & Poor, H. V. (2008). Auction-based resource allocation for multi-relay asynchronous cooperative networks. In ICASSP 2008, April.
Khandani, A. E., Abounadi, J., Modiano, E., & Zheng, L. (2007). Cooperative rouing in static wireless networks. IEEE Transactions on Communications, 55(11), 2185–2192.
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12), 3062–3080.
Li, L., Wen, X. M., & Dong, S. S. (2006). A method based on cross-layer design to solve cooperation problem in wireless ad hoc network. In ICCCAS 2006, June.
Li, Z., & Shen, H. (2009). Analysis of a hybrid reputation management system for mobile ad hoc networks. In ICCCN 2009, August.
Long, C., Chen, T., & Guan, X. (2008). Cooperative amplify and forward in the presence of multiple selfish relays: performance analysis. In CCECE 2008, May.
Marina, N., Arslan, G., & Kavcic, A. (2008). A power allocation game in a four node relay network an upper bound on the worst-case equilibrium efficiency. In ICT 2008, June.
Ng, C. Y., Lok, T. M., & Wong, T. F. (2008). Pricing game for selfish link cooperation. In ISIT 2008, July.
Qian, D., Zhou, C., & Zhang, J. (2005). Cooperation enforcement in ad hoc networks with penalty. In MASS 2005, November.
Sergi, S., Pancaldi, F., & Vitetta, G. M. (2009). A game theory approach to selection diversity in wireless ad-hoc networks. In ICC 2009, June.
Shi, Y., Sharma, S., Hou, Y. T., & Kompella, S. (2008). Optimal relay assignment for cooperative communication. In MobiHoc 2008, June.
Xu, H., Huang, L., Wang, G., Liu, G., & Zhang, Y. (2009). Optimal relay assignment for fairness in wireless cooperative networks. In ICCCN 2009, August.
Yang, J., & Brown, D. R. (2007). Energy efficient relaying games in cooperative wireless transmission systems. In ACSSC 2007, November
Zhang, G., Zhang, H., Zhao, L., Wang, W., & Cong, L. (2009). Fair resource sharing for cooperative relay networks using Nash Bargaining solutions. IEEE Communications Letters 13(6). doi:10.1109/LCOMM.2009.081822
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, Y., Huang, L., Xu, H. et al. An incentive energy-efficient routing for data gathering in wireless cooperative networks. Telecommun Syst 52, 1977–1987 (2013). https://doi.org/10.1007/s11235-011-9478-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-011-9478-4