The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2013 vol.12)
pp: 840-854
Khajonpong Akkarajitsakul , University of Manitoba, Winnipeg
Ekram Hossain , University of Manitoba, Winnipeg
Dusit Niyato , Nanyang Technological University, Singapore
ABSTRACT
We consider the problem of cooperative packet delivery to mobile nodes in a hybrid wireless mobile network, where both infrastructure-based and infrastructure-less (i.e., ad hoc mode or peer-to-peer mode) communications are used. We propose a solution based on a coalition formation among mobile nodes to cooperatively deliver packets among these mobile nodes in the same coalition. A coalitional game is developed to analyze the behavior of the rational mobile nodes for cooperative packet delivery. A group of mobile nodes makes a decision to join or to leave a coalition based on their individual payoffs. The individual payoff of each mobile node is a function of the average delivery delay for packets transmitted to the mobile node from a base station and the cost incurred by this mobile node for relaying packets to other mobile nodes. To find the payoff of each mobile node, a Markov chain model is formulated and the expected cost and packet delivery delay are obtained when the mobile node is in a coalition. Since both the expected cost and packet delivery delay depend on the probability that each mobile node will help other mobile nodes in the same coalition to forward packets to the destination mobile node in the same coalition, a bargaining game is used to find the optimal helping probabilities. After the payoff of each mobile node is obtained, we find the solutions of the coalitional game which are the stable coalitions. A distributed algorithm is presented to obtain the stable coalitions and a Markov-chain-based analysis is used to evaluate the stable coalitional structures obtained from the distributed algorithm. Performance evaluation results show that when the stable coalitions are formed, the mobile nodes achieve a nonzero payoff (i.e., utility is higher than the cost). With a coalition formation, the mobile nodes achieve higher payoff than that when each mobile node acts alone.
INDEX TERMS
Mobile communication, Games, Mobile computing, Delay, Base stations, Peer to peer computing, Social network services, carry-and-forward-based data delivery, Hybrid wireless network, social network analysis, cooperative packet delivery, coalitional game, bargaining game
CITATION
Khajonpong Akkarajitsakul, Ekram Hossain, Dusit Niyato, "Cooperative Packet Delivery in Hybrid Wireless Mobile Networks: A Coalitional Game Approach", IEEE Transactions on Mobile Computing, vol.12, no. 5, pp. 840-854, May 2013, doi:10.1109/TMC.2012.46
REFERENCES
[1] H.J. Reumerman, M. Roggero, and M. Ruffini, “The Application-Based Clustering Concept and Requirements for Inter-Vehicle Networks,” IEEE Comm. Magazine, vol. 43, no. 4, pp. 108-113, Apr. 2005.
[2] T. Yamada, R. Shinkuma, and T. Takahashi, “Connectivity and Throughput Enhancement by Inter-Vehicle Packet Relay in Road Vehicle Comm. Systems,” Proc. IEEE Global Telecomm. Conf., 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] H. Su and X. Zhang, “Clustering-Based Multichannel MAC Protocols for QoS Provisionings over Vehicular Ad Hoc Networks,” IEEE Trans. Vehicular Technology, vol. 56, no. 6, pp. 3309-3323, Nov. 2007.
[5] 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.
[6] 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), pp. 1-5, Apr. 2010.
[7] 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., vol. 29, no. 1, pp. 48-60, Jan. 2011.
[8] W. Gao, Q. Li, B. Zhao, and G. Cao, “Multicasting in Delay Tolerant Networks: A Social Network Perspective,” Proc. ACM MobiHoc, pp. 299-308, May 2009.
[9] E. Daly and M. Haahr, “Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs,” Proc. ACM MobiHoc, pp. 32-40, Sept. 2007.
[10] S. Pai, T. Roosta, S. Wicker, and S. Sastry, “Using Social Network Theory Towards Development of Wireless Ad Hoc Network Trust,” Proc. 21st Int'l Conf. Advanced Information Networking and Applications Workshops, pp. 443-450, May 2007.
[11] S.-L. Hew and L. White, “Cooperative Resource Allocation Games in Shared Networks: Symmetric and Asymmetric Fair Bargaining Models,” IEEE Trans. Wireless Comm., vol. 7, no. 11, pp. 4166-4175, Nov. 2008.
[12] B. Shrestha, D. Niyato, Z. Han, and E. Hossain, “Wireless Access in Vehicular Environments Using Bittorrent and Bargaining,” Proc. IEEE Global Telecomm. Conf. (GlobeCom '08), pp. 1-5, Nov./Dec. 2008.
[13] S.C. Nelson, M. Bakht, and R. Kravets, “Encounter-Based Routing in DTNs,” Proc. IEEE INFOCOM, pp. 846-854, Apr. 2009.
[14] 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.
[15] W. Gao and G. Cao, “On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks,” Proc. IEEE 18th Int'l Conf. Network Protocols (ICNP), pp. 193-202, Oct. 2010.
[16] Z. Xinjuan and X. Bo, “A Traffic Resource Diffusion Scheme in Vehicular Networks,” Proc. Int'l Forum on Information Technology and Applications, pp. 318-321, May 2009.
[17] R. Groenevelt, P. Nain, and G. Koole, “The Message Delay in Mobile Ad Hoc Networks,” Elsevier J. Performance Evaluation, vol. 62, nos. 1-4, pp. 210-228, Oct. 2005.
[18] I.R. Chen, F. Bao, M. Chang, and J.H. Cho, “Trust Management for Encounter-Based Routing in Delay Tolerant Networks,” Proc. IEEE Global Telecomm. Conf. (GlobeCom), pp. 1-6, Dec. 2010.
[19] D. Li, Y. Xu, X. Wang, and M. Guizani, “Coalitional Game Theoretic Approach for Secondary Spectrum Access in Cooperative Cognitive Radio Networks,” IEEE Trans. Wireless Comm., vol. 10, no. 3, pp. 844-856, Mar. 2011.
[20] K. Makino and T. Uno, “New Algorithms for Enumerating All Maximal Cliques,” Algorithm Theory: SWAT, vol. 3111, pp. 260-272, 2004.
[21] 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, American Mathematical Society, 2004.
[22] K.S. Trivedi, Probability and Statistics with Reliability, Queueing, and Computer Science Applications. Wiley, 2002.
[23] 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.
[24] E.K.P. Chong and S.H. Zak, An Introduction to Optimization. Wiley-Interscience, July 2001.
[25] K.R. Apt and A. Witzel, “A Generic Approach to Coalition Formation,” Proc. First Int'l Workshop Computational Social Choice (COMSOC), pp. 21-34, Dec. 2006.
[26] 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.
[27] S.-S. Byun, “A Survey on the Cooperative Game Theoretic Solution Concepts in Wireless Communications,” IEEE Comm. Surveys and Tutorials, 2010.
[28] B. Peleg and P. Sudhölter, Introduction to the Theory of Cooperative Games. Springer, 2007.
[29] E. Tomitaa, A. Tanakaa, and H. Takahashi, “The Worst-Case Time Complexity for Generating All Maximal Cliques and Computational Experiments,” Theoretical Computer Science, vol. 363, no. 1, pp. 28-42, Oct. 2006.
[30] 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.
[31] 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.
[32] R. Lu, X. Lin, and X. Shen, “SPRING: A Social-Based Privacy-Preserving Packet Forwarding Protocol for Vehicular Delay Tolerant Networks,” Proc. IEEE INFOCOM, pp. 1-9, May 2010.
[33] Q. Li, S. Zhu, and G. Cao, “Routing in Socially Selfish Delay Tolerant Networks,” Proc. IEEE INFOCOM, Mar. 2010.
[34] P. Hui, E. Yoneki, S.Y. Chan, and J. Crowcroft, “Distributed Community Detection in Delay Tolerant Networks,” Proc. ACM/IEEE Int'l Workshop Mobility in the Evolving Internet Architecture (MobiArch), Aug. 2007.
[35] D. Niyato and P. Wang, “Optimization of the Mobile Router and Traffic Sources in Vehicular Delay-Tolerant Networks,” IEEE Trans. Vehicular Technology, vol. 58, no. 9, pp. 5095-5104, Nov. 2009.
[36] T.D.C. Little and A. Agarwal, “An Information Propagation Scheme for VANETs,” Proc. IEEE Intelligent Transportation Systems, pp. 155-160, Sept. 2005.
[37] O. Brickley, C. Shen, M. Klepal, A. Tabatabaei, and D. Pesch, “A Data Dissemination Strategy for Cooperative Vehicular Systems,” Proc. IEEE 65th Vehicular Technology Conf. (VTC '07), pp. 2501-2505, Apr. 2007.
[38] S. Bai, Z. Huang, D. Kwak, S. Lee, H. Oh, and J. Jung, “Vehicular Multi-Hop Broadcasting Protocol for Safety Message Dissemination in VANETs,” Proc. IEEE 70th Vehicular Technology Conf. (VTC '09), pp. 1-5, Sept. 2009.
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool