A social-relation-based game model for distributed clustering in cooperative wireless networks
Pages 414 - 423
Abstract
In this paper, a novel framework for cluster detection in co-operative wireless networks is proposed. This framework is modeled by a dynamic game with incomplete information, in which each player in the game aspires to improve its position in the network by forming cooperative groups. Instead of static systems, the attention we paid in this paper is highly dynamic networks, where the users' high mobility brings a huge challenge in clustering. In order to mitigate that impact, this paper is from the perspective of social relations to clustering, extracting users' social nature from their mobile patterns and designing distributed cluster strategy based on game model. The introduction of social nature with generally long-term characteristics makes clustering framework more predictive and stable. Simulations on real-world networks show that the proposed approach performs well in clustering in cooperative wireless networks.
References
[1]
Dennis Baker and Anthony Ephremides. 1981. The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on communications 29, 11 (1981), 1694--1701.
[2]
Ching-Chuan Chiang, Mario Gerla, and Lixia Zhang. 1998. Forwarding group multicast protocol (FGMP) for multihop, mobile wireless networks. Cluster Computing 1, 2 (1998), 187--196.
[3]
Nathan Eagle, Alex Sandy Pentland, and David Lazer. 2009. Inferring friendship network structure by using mobile phone data. Proceedings of the national academy of sciences 106, 36 (2009), 15274--15278.
[4]
Mario Gerla and Jack Tzu-Chieh Tsai. 1995. Multicluster, mobile, multimedia radio network. Wireless networks 1, 3 (1995), 255--265.
[5]
Marta C Gonzalez, Cesar A Hidalgo, and Albert-Laszlo Barabasi. 2008. Understanding individual human mobility patterns. nature 453, 7196 (2008), 779.
[6]
Darij Grinberg. 2008. Generalizations of Popoviciu's inequality. arXiv e-prints, Article arXiv:0803.2958 (Mar 2008), arXiv:0803.2958 pages. arXiv:math.FA/0803.2958
[7]
Pan Hui, Augustin Chaintreau, James Scott, Richard Gass, Jon Crowcroft, and Christophe Diot. 2005. Pocket switched networks and human mobility in conference environments. In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. ACM, 244--251.
[8]
Thomas Karagiannis, Jean-Yves Le Boudec, and Milan Vojnovic. 2010. Power law and exponential decay of intercontact times between mobile devices. IEEE Transactions on Mobile Computing 9, 10 (2010), 1377--1390.
[9]
Hanh Le, Doan Hoang, and Ravi Poliah. 2008. S-Web: An efficient and self-organizing wireless sensor network model. In International Conference on Network-Based Information Systems. Springer, 179--188.
[10]
Feng Li and Jie Wu. 2009. LocalCom: a community-based epidemic forwarding scheme in disruption-tolerant networks. In 2009 6th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks. IEEE, 1--9.
[11]
Fei Li, Shile Zhang, Xin Wang, Xiangyang Xue, and Hong Shen. 2004. Vote-based clustering algorithm in mobile ad hoc networks. In International Conference on Information Networking. Springer, 13--23.
[12]
Raphael Massin, Christophe J Le Martret, and Philippe Ciblat. 2017. A coalition formation game for distributed node clustering in mobile ad hoc networks. IEEE Transactions on Wireless Communications 16, 6 (2017), 3940--3952.
[13]
Marvin McNett and Geoffrey M Voelker. 2005. Access and mobility of wireless PDA users. ACM SIGMOBILE Mobile Computing and Communications Review 9, 2 (2005), 40--55.
[14]
Omer Narmanlioglu and Engin Zeydan. 2018. Mobility-aware cell clustering mechanism for self-organizing networks. IEEE Access 6 (2018), 65405--65417.
[15]
Victor Sucasas, Ayman Radwan, Hugo Marques, Jonathan Rodriguez, Seiamak Vahid, and Rahim Tafazolli. 2016. A survey on clustering techniques for cooperative wireless networks. Ad Hoc Networks 47 (2016), 53--81.
[16]
Xiaofei Wang, Yuhua Zhang, Victor CM Leung, Nadra Guizani, and Tianpeng Jiang. 2018. D2D big data: Content deliveries over wireless device-to-device sharing in large-scale mobile networks. IEEE Wireless Communications 25, 1 (2018), 32--38.
[17]
Zhigang Wang, Lichuan Liu, MengChu Zhou, and Nirwan Ansari. 2008. A position-based clustering technique for ad hoc intervehicle communication. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) 38, 2 (2008), 201--208.
[18]
Huan Zhou, Victor CM Leung, Chunsheng Zhu, Shouzhi Xu, and Jialu Fan. 2017. Predicting temporal social contact patterns for data forwarding in opportunistic mobile networks. IEEE Transactions on Vehicular Technology 66, 11 (2017), 10372--10383.
Index Terms
- A social-relation-based game model for distributed clustering in cooperative wireless networks
Recommendations
Performance of asynchronous two-relay two-hop wireless cooperative networks
In wireless cooperative networks, the asynchronism between the relays can be a source of diversity which is similar in its essence to the multipath diversity of frequency selective channels. In this context, an asynchronous two-relay cooperative ...
Diversity‐multiplexing tradeoff analysis in cooperative wireless networks with a multiple‐antenna relay
Multiple antennas can be used for increasing the amount of diversity or number of degrees of freedom in wireless communication systems. In this study, the authors consider a wireless half‐duplex relay network consisting of one source–destination pair each ...
Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory
We propose a new approach to clustering. Our idea is to map cluster formation to coalition formation in cooperative games, and to use the Shapley value of the patterns to identify clusters and cluster representatives. We show that the underlying game is ...
Comments
Information & Contributors
Information
Published In
Copyright © 2019 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 03 February 2020
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Integrated System Architecture and Network Security Technology
Conference
MobiQuitous
Acceptance Rates
Overall Acceptance Rate 26 of 87 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 96Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in