The Community for Technology Leaders
RSS Icon
Issue No.02 - Feb. (2013 vol.12)
pp: 371-385
Khajonpong Akkarajitsakul , Dept. of Electr. & Comput. Eng., Univ. of Manitoba, Winnipeg, MB, Canada
E. Hossain , Dept. of Electr. & Comput. Eng., Univ. of Manitoba, Winnipeg, MB, Canada
Dusit Niyato , Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore
Cooperative packet delivery can improve the data delivery performance in wireless networks by exploiting the mobility of the nodes, especially in networks with intermittent connectivity, high delay and error rates such as wireless mobile delay-tolerant networks (DTNs). For such a network, we study the problem of rational coalition formation among mobile nodes to cooperatively deliver packets to other mobile nodes in a coalition. Such coalitions are formed by mobile nodes which can be either well behaved or misbehaving in the sense that the well-behaved nodes always help each other for packet delivery, while the misbehaving nodes act selfishly and may not help the other nodes. A Bayesian coalitional game model is developed to analyze the behavior of mobile nodes in coalition formation in presence of this uncertainty of node behavior (i.e., type). Given the beliefs about the other mobile nodes' types, each mobile node makes a decision to form a coalition, and thus the coalitions in the network vary dynamically. A solution concept called Nash-stability is considered to find a stable coalitional structure in this coalitional game with incomplete information. We present a distributed algorithm and a discrete-time Markov chain (DTMC) model to find the Nash-stable coalitional structures. We also consider another solution concept, namely, the Bayesian core, which guarantees that no mobile node has an incentive to leave the grand coalition. The Bayesian game model is extended to a dynamic game model for which we propose a method for each mobile node to update its beliefs about other mobile nodes' types when the coalitional game is played repeatedly. The performance evaluation results show that, for this dynamic Bayesian coalitional game, a Nash-stable coalitional structure is obtained in each subgame. Also, the actual payoff of each mobile node is close to that when all the information is completely known. In addition, the payoffs of the mobile nodes will be at least as high as those when they act alone (i.e., the mobile nodes do not form coalitions).
packet radio networks, Bayes methods, cooperative communication, distributed algorithms, game theory, Markov processes, mobility management (mobile radio), Nash stable coalitional structure, dynamic Bayesian coalitional game, coalition-based cooperative packet delivery, wireless network, data delivery performance, node mobility, mobile node, uncertainty handling, incomplete information, distributed algorithm, discrete time Markov chain model, DTMC model, Mobile communication, Games, Bayesian methods, Mobile computing, Base stations, Uncertainty, Delay, grand coalition, Wireless mobile networks, delay-tolerant networks, cooperative packet delivery, coalitional game, Bayesian coalitional game, Nash-stable coalitionlal structure, Bayesian core
Khajonpong Akkarajitsakul, E. Hossain, Dusit Niyato, "Coalition-Based Cooperative Packet Delivery under Uncertainty: A Dynamic Bayesian Coalitional Game", IEEE Transactions on Mobile Computing, vol.12, no. 2, pp. 371-385, Feb. 2013, doi:10.1109/TMC.2011.251
[1] E.P.C. Jones, L. Li, J.K. Schmidtke, and P.A.S. Ward, "Practical Routing in Delay-Tolerant Networks," IEEE Trans. Mobile Computing, vol. 6, no. 8, pp. 943-959, Nov. 2007.
[2] T. Yamada, R. Shinkuma, and T. Takahashi, "Connectivity and Throughput Enhancement by Inter-Vehicle Packet Relay in Road Vehicle Communication Systems," Proc. IEEE GlobeCom, pp. 1-5, Nov./Dec. 2006.
[3] Y. Yamao and K. Minato, "Vehicle-Roadside-Vehicle Relay Communication Network Employing Multiple Frequencies and Routing Function," Proc. Sixth Int'l Symp. Wireless Comm. Systems, pp. 413-417, Sept. 2009.
[4] V.N.G.J. Soares, J.J.P.C. Rodrigues, P.S. Ferreira, and A.M.D. Nogueira, "Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks," Proc. Int'l Conf. Parallel Processing Workshops, pp. 344-349, Sept. 2009.
[5] Z. Han and H.V. Poor, "Coalition Games with Cooperative Transmission: A Cure for the Curse of Boundary Nodes in Selfish Packet-Forwarding Wireless Networks," IEEE Trans. Comm., vol. 57, no. 1, pp. 203-213, Jan. 2009.
[6] W. Saad, Z. Han, A. Hjørungnes, D. Niyato, and E. Hossain, "Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks," IEEE J. Selected Areas in Comm., Special Issue on Vehicular Comm. and Networks, vol. 29, no. 1, pp. 48-60, Jan. 2011.
[7] D. Niyato, P. Wang, W. Saad, and A. Hjørungnes, "Coalition Formation Games for Bandwidth Sharing in Vehicle-to-Roadside Communications," Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '10), pp. 1-5, Apr. 2010.
[8] Y. Li, Y. Jiang, D. Jin, L. Su, L. Zeng, and D. Wu, "Energy-Efficient Optimal Opportunistic Forwarding for Delay-Tolerant Networks," IEEE Trans. Vehicular Technology, vol. 59, no. 9, pp. 4500-4512, Nov. 2010.
[9] I.R. Chen, F. Bao, M. Chang, and J.H. Cho, "Trust Management for Encounter-Based Routing in Delay Tolerant Networks," Proc. IEEE GlobeCom, pp. 1-6, Dec. 2010.
[10] S.C. Nelson, M. Bakht, and R. Kravets, "Encounter-Based Routing in DTNs," Proc. IEEE INFOCOM, pp. 846-854, Apr. 2009.
[11] R. Groenevelt, P. Nain, and G. Koole, "The Message Delay in Mobile Ad Hoc Networks," Performance Evaluation, vol. 62, nos. 1-4, pp. 210-228, Oct. 2005.
[12] T. Spyropoulos, A. Jindal, and K. Psounis, "An Analytical Study of Fundamental Mobility Properties for Encounter-Based Protocols," Int'l J. Autonomous and Adaptive Comm. Systems, vol. 1, no. 1, pp. 4-40, July 2008.
[13] L.M. Feeney and M. Nilsson, "Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment," Proc. IEEE INFOCOM, vol. 3, pp. 1548-1557, 2001.
[14] W. Yu and K.J.R. Liu, "Attack-Resistant Cooperation Stimulation in Autonomous Ad Hoc Networks," IEEE J. Selected Area in Comm., vol. 23, no. 12, pp. 2260-2271, Dec. 2005.
[15] G. Chalkiadakis and C. Boutilier, "Bayesian Reinforcement Learning for Coalition Formation under Uncertainty," Proc. Third Int'l Joint Conf. Autonomous Agents and Multiagent Systems, pp. 1090-1097, July 2004.
[16] G. Chalkiadakis, E. Markakis, and C. Boutilier, "Coalition Formation under Uncertainty: Bargaining Equilibria and the Bayesian Core Stability Concept," Proc. Sixth Int'l Joint Conf. Autonomous Agents and Multiagent Systems, pp. 64:1-64:8, May 2007.
[17] S. Ieong and Y. Shoham, "Bayesian Coalitional Games," Proc. 23rd Nat'l Conf. Artificial Intelligence, 2008.
[18] D. Fudenberg and J. Tirole, Game Theory. MIT, 1991.
[19] A. Bogomonlaia and M. Jackson, "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, vol. 38, pp. 201-230, Jan. 2002.
[20] W. Saad, Z. Han, M. Debbah, A. Hjørungnes, and T. Basar, "Coalitional Game Theory for Communication Networks: A Tutorial," IEEE Signal Processing Magazine, vol. 26, no. 5, pp. 77-97, Sept. 2009.
[21] S.-S. Byun, "A Survey on the Cooperative Game Theoretic Solution Concepts in Wireless Communications," IEEE Comm. Surveys and Tutorials, submitted, 2010.
[22] T. Arnold and U. Schwalbe, "Dynamic Coalition Formation and the Core," J. Economic Behavior and Organization, vol. 49, no. 3, pp. 363-380, Nov. 2002.
[23] B. Peleg and P. Sudhölter, Introduction to the Theory of Cooperative Games. Springer, 2007.
[24] J.S. Milton and J. Arnold, Introduction to Probability and Statistics: Principles and Applications for Engineering and the Computing Sciences. McGraw Hill, 1995.
[25] M. Pourahmadi, Foundations of Time Series Analysis and Prediction Theory. John Wiley & Sons, 2001.
[26] D. Krajzewicz, G. Hertkorn, C. Rössel, and P. Wagner, "SUMO (Simulation of Urban MObility): An Open-Source Traffic Simulation," Proc. Fourth Middle East Symp. Simulation and Modelling (MESM '02), pp. 183-187, Sept. 2002.
[27] Y. Yan, J. Huang, X. Zhong, and J. Wang, "Dynamic Spectrum Negotiation with Asymmetric Information," Proc. Int'l Conf. Game Theory for Networks (GameNets), Apr. 2011.
[28] Y. Yan, J. Huang, X. Zhong, M. Zhao, and J. Wang, "Sequential Bargaining in Cooperative Spectrum Sharing: Incomplete Information with Reputation Effect," Proc. IEEE GlobeCom, pp. 1-6, 2011.
[29] P. Michiardi and R. Molva, "A Game Theoretical Approach to Evaluate Cooperation Enforcement Mechanisms in Mobile Ad Hoc Networks," Proc. Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT '03), pp. 3-5, 2003.
[30] E. Altman, A.A. Kherani, P. Michiardi, and R. Molva, "Noncooperative Forwarding in Ad-Hoc Networks," Proc. 15th IEEE Int'l Symp. Personal, Indoor and Mobile Radio Comm., 2004.
[31] Z. Ji, W. Yu, and K.J.R. Liu, "A Belief Evaluation Framework in Autonomous MANETs under Noisy and Imperfect Observation: Vulnerability Analysis and Cooperation Enforcement," IEEE Trans. Mobile Computing, vol. 9, no. 9, pp. 1242-1254, Sept. 2011.
[32] J. Rutten, M. Kwiatkowska, G. Norman, and D. Parker, Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, P. Panangaden and F. van Breugel, eds., vol. 23, Am. Math. Soc., 2004.
[33] K.S. Trivedi, Probability and Statistics with Reliability, Queueing, and Computer Science Applications. Wiley, 2002.
[34] K.S. Trivedi, M. Malhotra, and R.M. Fricks, "Markov Reward Approach to Performability and Reliability Analysis," Proc. Second Int'l Workshop Modeling, Analysis, and Simulation of Computer and Telecomm. Systems, pp. 7-11, Jan./Feb. 1994.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool