Demand-aware traffic cooperation for self-organizing cognitive small-cell networks

This article investigates the problem of efficient spectrum access for traffic demands of self-organizing cognitive small-cell networks, using the coalitional game approach. In particular, we propose a novel spectrum and time two-dimensional Traffic Cooperation Coalitional Game model which aims to i...

Full description

Saved in:
Bibliographic Details
Main Authors: Changhua Yao, Lei Zhu, Yongxing Jia, Lei Wang
Format: Article
Language:English
Published: Wiley 2019-01-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1177/1550147718817289
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849702292001914880
author Changhua Yao
Lei Zhu
Yongxing Jia
Lei Wang
author_facet Changhua Yao
Lei Zhu
Yongxing Jia
Lei Wang
author_sort Changhua Yao
collection DOAJ
description This article investigates the problem of efficient spectrum access for traffic demands of self-organizing cognitive small-cell networks, using the coalitional game approach. In particular, we propose a novel spectrum and time two-dimensional Traffic Cooperation Coalitional Game model which aims to improve the network throughput. The main motivation is to complete the data traffics of users, and the main idea is to make use of spectrum resource efficiently by reducing mutual interference in the spectrum dimension and considering cooperative data transmission in the time dimension at the same time. With the approach of coalition formation, compared with the traditional binary order in most existing coalition formation algorithms, the proposed functional order indicates a more flexibly preferring action which is a functional value determined by the environment information. To solve the distributed self-organizing traffic cooperation coalition formation problem, we propose three coalition formation algorithms: the first one is the Binary Preferring Traffic Cooperation Coalition Formation Algorithm based on the traditional Binary Preferring order; the second one is the Best Selection Traffic Cooperation Coalition Formation Algorithm based on the functional Best Selection order to improve the converging speed; and the third one is the Probabilistic Decision Traffic Cooperation Coalition Formation Algorithm based on the functional Probabilistic Decision order to improve the performance of the formed coalition. The proposed three algorithms are proved to converge to Nash-stable coalition structure. Simulation results verify the theoretic analysis and the proposed approaches.
format Article
id doaj-art-1a67e295aafd4e92b9092f3c8e8df866
institution DOAJ
issn 1550-1477
language English
publishDate 2019-01-01
publisher Wiley
record_format Article
series International Journal of Distributed Sensor Networks
spelling doaj-art-1a67e295aafd4e92b9092f3c8e8df8662025-08-20T03:17:43ZengWileyInternational Journal of Distributed Sensor Networks1550-14772019-01-011510.1177/1550147718817289Demand-aware traffic cooperation for self-organizing cognitive small-cell networksChanghua YaoLei ZhuYongxing JiaLei WangThis article investigates the problem of efficient spectrum access for traffic demands of self-organizing cognitive small-cell networks, using the coalitional game approach. In particular, we propose a novel spectrum and time two-dimensional Traffic Cooperation Coalitional Game model which aims to improve the network throughput. The main motivation is to complete the data traffics of users, and the main idea is to make use of spectrum resource efficiently by reducing mutual interference in the spectrum dimension and considering cooperative data transmission in the time dimension at the same time. With the approach of coalition formation, compared with the traditional binary order in most existing coalition formation algorithms, the proposed functional order indicates a more flexibly preferring action which is a functional value determined by the environment information. To solve the distributed self-organizing traffic cooperation coalition formation problem, we propose three coalition formation algorithms: the first one is the Binary Preferring Traffic Cooperation Coalition Formation Algorithm based on the traditional Binary Preferring order; the second one is the Best Selection Traffic Cooperation Coalition Formation Algorithm based on the functional Best Selection order to improve the converging speed; and the third one is the Probabilistic Decision Traffic Cooperation Coalition Formation Algorithm based on the functional Probabilistic Decision order to improve the performance of the formed coalition. The proposed three algorithms are proved to converge to Nash-stable coalition structure. Simulation results verify the theoretic analysis and the proposed approaches.https://doi.org/10.1177/1550147718817289
spellingShingle Changhua Yao
Lei Zhu
Yongxing Jia
Lei Wang
Demand-aware traffic cooperation for self-organizing cognitive small-cell networks
International Journal of Distributed Sensor Networks
title Demand-aware traffic cooperation for self-organizing cognitive small-cell networks
title_full Demand-aware traffic cooperation for self-organizing cognitive small-cell networks
title_fullStr Demand-aware traffic cooperation for self-organizing cognitive small-cell networks
title_full_unstemmed Demand-aware traffic cooperation for self-organizing cognitive small-cell networks
title_short Demand-aware traffic cooperation for self-organizing cognitive small-cell networks
title_sort demand aware traffic cooperation for self organizing cognitive small cell networks
url https://doi.org/10.1177/1550147718817289
work_keys_str_mv AT changhuayao demandawaretrafficcooperationforselforganizingcognitivesmallcellnetworks
AT leizhu demandawaretrafficcooperationforselforganizingcognitivesmallcellnetworks
AT yongxingjia demandawaretrafficcooperationforselforganizingcognitivesmallcellnetworks
AT leiwang demandawaretrafficcooperationforselforganizingcognitivesmallcellnetworks