A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks
The frequent movement of nodes in cognitive radio mobile ad hoc networks (CRAHNs) causes challenges in scalability, stability, channel sensing and channel access problems that can be solved by using clustering technique. Game theory is a feasible approach to solve such problems by casting clustering...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9154377/ |
| _version_ | 1818874235003600896 |
|---|---|
| author | Thong Nhat Tran Toan-Van Nguyen Kyusung Shim Beongku An |
| author_facet | Thong Nhat Tran Toan-Van Nguyen Kyusung Shim Beongku An |
| author_sort | Thong Nhat Tran |
| collection | DOAJ |
| description | The frequent movement of nodes in cognitive radio mobile ad hoc networks (CRAHNs) causes challenges in scalability, stability, channel sensing and channel access problems that can be solved by using clustering technique. Game theory is a feasible approach to solve such problems by casting clustering problems as distributed optimization problems. The main contributions of this article are as follows. Firstly, we propose a minimum connected weighted inner edge spanning tree (MWIEST) game to find an approximate solution of a MWIEST problem in CRAHNs. In this game, a link-weight function of each link is designed based on a combination of link-stability and link-connectivity ratio functions. Secondly, we prove that the MWIEST game is an exact potential game that exists at least one Nash equilibrium (NE) point which is an approximate solution of the MWIEST problem. Besides, we also prove that best responses (BRs) of the game converge to a NE in finite iterations. Thirdly, based on the MWIEST game, we propose four algorithms including the node information exchange (NIE), the best response selection (BRS), the intermediate nodes selection (INS) and the forming cluster (FC). Specifically, the algorithms NIE, BRS and INS provide a set of intermediate nodes (SetIN) which supports the FC algorithm to form clusters. Finally, we propose the game theory based clustering (GBC) protocol which is combination of the FC algorithm and the proposed cluster maintenance algorithm to construct high stable clusters supporting multicast routing in CRAHNs. Moreover, each obtained cluster includes most members having the same receiving channel which avoids the affected regions of licensed channels. For the performance evaluation, we implement the GBC protocol in OMNET++ platform to demonstrate its performance improvement over the state-of-the-art protocols in terms of network stability and control overheads. |
| first_indexed | 2024-12-19T13:07:22Z |
| format | Article |
| id | doaj.art-47b2aac7bd454c5496b9141aae54592c |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-19T13:07:22Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-47b2aac7bd454c5496b9141aae54592c2022-12-21T20:20:01ZengIEEEIEEE Access2169-35362020-01-01814131014133010.1109/ACCESS.2020.30136449154377A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc NetworksThong Nhat Tran0https://orcid.org/0000-0002-6474-9681Toan-Van Nguyen1https://orcid.org/0000-0002-1968-8170Kyusung Shim2https://orcid.org/0000-0003-4851-0811Beongku An3https://orcid.org/0000-0002-0587-3754Department of Electronics and Computer Engineering, Graduate School, Hongik University, Sejong, South KoreaDepartment of Electronics and Computer Engineering, Graduate School, Hongik University, Sejong, South KoreaDepartment of Electronics and Computer Engineering, Graduate School, Hongik University, Sejong, South KoreaDepartment of Software and Communications Engineering, Hongik University, Sejong, South KoreaThe frequent movement of nodes in cognitive radio mobile ad hoc networks (CRAHNs) causes challenges in scalability, stability, channel sensing and channel access problems that can be solved by using clustering technique. Game theory is a feasible approach to solve such problems by casting clustering problems as distributed optimization problems. The main contributions of this article are as follows. Firstly, we propose a minimum connected weighted inner edge spanning tree (MWIEST) game to find an approximate solution of a MWIEST problem in CRAHNs. In this game, a link-weight function of each link is designed based on a combination of link-stability and link-connectivity ratio functions. Secondly, we prove that the MWIEST game is an exact potential game that exists at least one Nash equilibrium (NE) point which is an approximate solution of the MWIEST problem. Besides, we also prove that best responses (BRs) of the game converge to a NE in finite iterations. Thirdly, based on the MWIEST game, we propose four algorithms including the node information exchange (NIE), the best response selection (BRS), the intermediate nodes selection (INS) and the forming cluster (FC). Specifically, the algorithms NIE, BRS and INS provide a set of intermediate nodes (SetIN) which supports the FC algorithm to form clusters. Finally, we propose the game theory based clustering (GBC) protocol which is combination of the FC algorithm and the proposed cluster maintenance algorithm to construct high stable clusters supporting multicast routing in CRAHNs. Moreover, each obtained cluster includes most members having the same receiving channel which avoids the affected regions of licensed channels. For the performance evaluation, we implement the GBC protocol in OMNET++ platform to demonstrate its performance improvement over the state-of-the-art protocols in terms of network stability and control overheads.https://ieeexplore.ieee.org/document/9154377/Cognitive radio mobile ad hoc networkclusteringmulticast routinggame theorynetwork layerOMNET++ |
| spellingShingle | Thong Nhat Tran Toan-Van Nguyen Kyusung Shim Beongku An A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks IEEE Access Cognitive radio mobile ad hoc network clustering multicast routing game theory network layer OMNET++ |
| title | A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks |
| title_full | A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks |
| title_fullStr | A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks |
| title_full_unstemmed | A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks |
| title_short | A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks |
| title_sort | game theory based clustering protocol to support multicast routing in cognitive radio mobile ad hoc networks |
| topic | Cognitive radio mobile ad hoc network clustering multicast routing game theory network layer OMNET++ |
| url | https://ieeexplore.ieee.org/document/9154377/ |
| work_keys_str_mv | AT thongnhattran agametheorybasedclusteringprotocoltosupportmulticastroutingincognitiveradiomobileadhocnetworks AT toanvannguyen agametheorybasedclusteringprotocoltosupportmulticastroutingincognitiveradiomobileadhocnetworks AT kyusungshim agametheorybasedclusteringprotocoltosupportmulticastroutingincognitiveradiomobileadhocnetworks AT beongkuan agametheorybasedclusteringprotocoltosupportmulticastroutingincognitiveradiomobileadhocnetworks AT thongnhattran gametheorybasedclusteringprotocoltosupportmulticastroutingincognitiveradiomobileadhocnetworks AT toanvannguyen gametheorybasedclusteringprotocoltosupportmulticastroutingincognitiveradiomobileadhocnetworks AT kyusungshim gametheorybasedclusteringprotocoltosupportmulticastroutingincognitiveradiomobileadhocnetworks AT beongkuan gametheorybasedclusteringprotocoltosupportmulticastroutingincognitiveradiomobileadhocnetworks |