WO2015080547A1 - Procédé de formation de coalition pour un partage de spectre coopératif dans des réseaux sans fil cognitifs - Google Patents

Procédé de formation de coalition pour un partage de spectre coopératif dans des réseaux sans fil cognitifs Download PDF

Info

Publication number
WO2015080547A1
WO2015080547A1 PCT/MY2014/000112 MY2014000112W WO2015080547A1 WO 2015080547 A1 WO2015080547 A1 WO 2015080547A1 MY 2014000112 W MY2014000112 W MY 2014000112W WO 2015080547 A1 WO2015080547 A1 WO 2015080547A1
Authority
WO
WIPO (PCT)
Prior art keywords
cycle
partition
permutation
coalition
assigning
Prior art date
Application number
PCT/MY2014/000112
Other languages
English (en)
Inventor
Abdurashid Mamadolimov
@ DIN Hafizal Bin MOHAMAD
Nordin Bin RAMLI
Mohammad Tahir
Original Assignee
Mimos Berhad
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mimos Berhad filed Critical Mimos Berhad
Publication of WO2015080547A1 publication Critical patent/WO2015080547A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14—Spectrum sharing arrangements between different networks

Definitions

  • the present invention relates to a method of coalition formation for cooperative spectrum sharing in cognitive wireless networks.
  • the invention relates to methods involving the conversion of a characteristic function with transferable utility to a hedonic coalition and use of an adapted Gale-Shapley algorithm.
  • a partition Pi of the set N is a set of coalitions such that every element in N is in exactly one of these coalitions.
  • the number of different partitions of a set with n elements is a large number when n>20.
  • Spectrum sharing performance depends on formation of coalitions (i.e. a partition). Each pair would like to maximize a value/capacity of its coalition. Using game theory tools a performance of spectrum sharing can be increased by dint of formation of a partition.
  • the invention considers a network with both primary and cognitive radio networks.
  • the cognitive radio network consists of cognitive radio (CR) pairs and is connected in mesh topology.
  • the total spectrum is composed of orthogonal frequency channels.
  • Each primary radio user may operate over one or multiple channels.
  • the primary radio in the network is modelled as an ON/OFF source, where "ON" means that the primary radio user is actively transmitting.
  • the goal of a user in the cognitive radio network is to increase their achievable sum-rate via utilizing the given primary (licensed) spectrum band.
  • the CR users can act either non-cooperatively or cooperatively.
  • game theory has attracted attention.
  • cooperative game theory which deals with the analysis of interaction among a group of rational players when they cooperate in order to improve their overall outcome has become quite popular.
  • Coalition game theory is a particular branch of cooperative game theory, where rational players organize themselves into coalitions in order to improve their performance.
  • a method is proposed which advantageously assists coalition formation so that the performance of a cognitive radio network arranged in mesh topology can be improved.
  • United States Patent No. 7,860,197 relates to spectrum-sensing algorithms and methods for use in cognitive radios and other applications.
  • the spectrum-sensing algorithms and methods may include receiving an input spectrum having a plurality of channels, performing a coarse scan of the plurality of channels of the input spectrum to determine one or more occupied candidate channels and vacant candidate channels, where the coarse scan is associated with a first resolution bandwidth and a first frequency sweep increment, performing a fine scan of the occupied candidate channels and the vacant candidate channels to determine actually occupied channels and actually vacant channels, where the fine scan is associated with a second resolution bandwidth and a second frequency sweep increment, and storing an indication of the actually occupied channels and the actually vacant channels. While spectrum sharing is consider, this document does not consider issues relating to optimization and does not implement game theory methods.
  • United States Patent No. 8,099,057 discusses base stations and mobile devices and the limited radio frequency spectrum through which they may communicate. Moreover, this document identifies that the spectrum is usually owned by a party having proprietary control. In order to allow for spectrum sharing, this document proposes that cognitive base stations (CBS) may be configured to select a radio frequency channel owned by another entity for its own use, and to determine how much additional noise it will create for such other entity. Based on this determination, the additional noise may be monetized, so that spectrum owners may be compensated for the additional noise created by use of their radio frequency channel.
  • CBS cognitive base stations
  • the present invention relates to a method of coalition formation for cooperative spectrum sharing in cognitive wireless networks.
  • the invention relates to methods involving the conversion of a characteristic function with transferable utility to a hedonic coalition and use of an adapted Gale-Shapley algorithm.
  • One aspect of the present invention provides a method (200) of coalition formation for cooperative spectrum sharing in cognitive wireless networks comprising:
  • the invention provide a method (200) wherein said converting of said characteristic function to said hedonic coalition defines a preference relation for mutually disjoint coalitions using values/capacities of said coalitions.
  • the invention provides a method (200) wherein said generating of said preference list defines a preference list for each coalition of a partition and sorts them in non-increasing form.
  • a further aspect of the present invention provides a method (200) wherein said Gale- Shapley algorithm is adapted for use with two equal partition sets.
  • Another aspect of the present invention provides a method (200) wherein said Gale- Shapley algorithm is repeatedly applied to obtain an identity permutation.
  • Yet another aspect of the present invention provides a method (200) wherein said permutation obtained as output of the Gale-Shapley algorithm is decomposed to cycles.
  • a further aspect of the present invention provides a method (200) wherein coalition pairs are matched based on cycle decomposition of the permutation.
  • Still another aspect of the present invention provides a method wherein said joining coalition pairs comprises:
  • a further aspect of the present invention provides a method wherein processing of each cycle of the cycle decomposition comprises:
  • Another aspect of the present invention provides a method wherein said generating a preference list of a partition for each pair of a coalition of the partition comprises:
  • a further aspect of the present invention provides a method wherein said step of generating a cycle decomposition of said permutation comprises:
  • Yet another aspect of the present invention provides a method wherein if said status is equal to UNVISITED said method comprises: assigning a first position number to the next element of the cycle and assigning 1 to the next position number element of the cycle (513);
  • FIG. 1 illustrates the partition of a set N Into a number of coalitions.
  • FIG. 2 illustrates a broad flowchart of a coalition formation method of an embodiment of the present invention.
  • FIG. 3a illustrates a flowchart of the coalition formation method according to an embodiment of the present invention.
  • FIG. 3b illustrates a flowchart of part of the coalition formation method according to an embodiment of the present invention.
  • FIG. 4 illustrates a flowchart of a Preference List (PL) component according to an embodiment of the present invention.
  • FIG. 5 illustrates a flowchart of a Cycle Decomposition of Partition (CDoP) component according to an embodiment of the present invention.
  • the present invention provides a method of coalition formation for cooperative spectrum sharing in cognitive wireless networks.
  • the invention relates to methods involving the conversion of a characteristic function with transferable utility to a hedonic coalition and use of an adapted Gale-Shapley algorithm.
  • Cooperative interactions between distributive spectrum sharing transmitter/receiver pairs can be modelled as a coalition formation among transmitter/receiver pairs.
  • N ⁇ 1, ... , n ⁇ be a set of CR transmitter/receiver pairs.
  • Each non-empty subset S of N is called a coalition.
  • Each coalition S has a real value v(S), called the value of the coalition S. According to the invention the value is defined as a capacity of coalition.
  • the pair (N, v) defines a game.
  • a partition ⁇ of the set N is a set of coalitions such that every CR pair in N is in exactly one of these coalitions ( Figure 1).
  • the number of different partitions of a set with n CR pairs is a large number when n > 20.
  • Network performance depends on formation of coalitions (i.e. a partition). Each CR pair would like to maximize a value/capacity of its coalition.
  • FIG. 2 A general diagram of the proposed method (200) is provided in Figure 2. As illustrated, the method (200) comprises converting a characteristic function with transferrable utility to a hedonic coalition and generating of a preference list of a partition for each pair of a coalition of the partition (210). Gale-Shapley algorithm is then adapted and used to obtain a permutation of coalitions (220) and a cycle of decomposition of a permutation is generated (230). A pair of coalitions is then joined to form a partition (240).
  • Ti(k) be the total noise-plus-interference level, measured by CR pair / over channel k. This vector will be used by CR pair ⁇ to perform dynamic channel selection, power control, and rate allocation.
  • the transmission power vector of CR pair i over various channels is denoted by P,.
  • a set of utilized channels for CR pair i is denoted as S,.
  • W is the wireless channel bandwidth; 0 ⁇ 5, ⁇ lj s the fraction of the band that CR pair uses, and ⁇ Mes is the impulse response of the channel k from the transmitter of CR pair j to the receiver of CR pair with j ⁇ /; is the complement of S in N.
  • N ⁇ 1, ... , « ⁇ be a finite set of CR pairs.
  • Each non-empty subset s (S E iV, S ⁇ 0 " ) of N is called a coalition.
  • the pair (N, v) is called a characteristic function with transferable utility.
  • the characteristic function v(S) is defined in accordance with equation (1) above.
  • a characteristic function with transferable utility is converted to a hedonic coalition.
  • the obtained hedonic coalition is different from hedonic coalition which are studied in - li
  • a man m and woman w are said to block a matching ⁇ , or to be a blocking pair for ⁇ , if w and w are not partners in ⁇ , but m prefers w to PM( to ) and v prefers m to PyC 1 *') .
  • a matching for which there is at least one blocking pair is called unstable, and is otherwise stable.
  • the proposed coalition formation method starts with singletons and consecutively joins pairs of coalitions.
  • the Gale-Shapley algorithm cannot be directly used for partition formation.(N, ⁇ s).
  • the Gale-Shapley algorithm uses two different sets; in the game we have only one set.
  • the output of the Gale-Shapley algorithm is a matching between two sets; in the game we would like to form coalitions.
  • applicant first adapted the Gale- Shapley algorithm and then used it as a component of the present coalition formation method.
  • the men and the women sets are both equal to the same partition ⁇ . As such, some elements can be matched to themselves.
  • the preference list for a coalition S,, i l..k, defines regarding relation 3 ⁇ 43 ⁇ 4:
  • the Gale-Shapley algorithm runs with the same men and women sets ⁇ and the same preference lists for both sets as input.
  • the output of the algorithm will be a stable matching of partition ⁇ to itself.
  • the output is a permutation (p p 2 , ... , pi) of (1 , 2, ... , «).
  • the obtained permutation (p,, p 2 , ... , ⁇ ) is decomposed to disjoint cycles and each cycle is also decomposed to disjoint pairs of neighbours, which may include one singleton. If (p h pj is an obtained pair then Sp, and Sp 2 coalitions are joined and become a new coalition Sp, U Sp 2 and a new partition formed. The whole process is repeated to generate new partitions and preference lists.
  • the method stops when the Gale-Shapley algorithm results in identity matching (i.e. a partner of each coalition is itself).
  • FIGS 3a and 3b a flowchart of the coalition formation method of the invention is illustrated.
  • the method uses an adapted Gale- Shapley algorithm, as mentioned above, Preference List (PL) and Cycle Decomposition of Partition (CDoP) components.
  • PL Preference List
  • CDoP Cycle Decomposition of Partition
  • a set of cognitive radio (CR) pairs and characteristic function are taken as input (310).
  • the number of pairs are assigned to the number of coalitions (311). That is, for each pair i, the i-th pair is assigned to the /-th coalition (311).
  • a set of the obtained coalitions is then assigned to the partition (312).
  • the PL component is then run with partition and characteristic function as input (313).
  • a return of PL function is assigned to the PL of the partition (314) and the adapted Gale-Shapley algorithm run using an input of the partition set, and the preference list of the partition (315).
  • a return of the Gale-Shapley algorithm is assigned to a permutation of coalitions (316) and thereafter the permutation is identified as an identity (317). If the permutation is identified as an identity (317), the partition is complete (323). If not, the CDoP component is run using the permutation as input (318) and the return of the CDoP function assigned to the cycle decomposition of the permutation (319) and 1 is assigned to the number of coalitions (320). Each cycle of the cycle decomposition is then processed further in A (321). This process is illustrated in Figure 3b, discussed below. With regard to Figure 3a, the number of coalitions is decreased by 1 and the process is repeated (322), returning to 1 (step 312), until thereafter returning to partition (323).
  • each odd position element of the next cycle is processed (330). It is determined if the loop number plus 1 is more than length of next cycle (331). If this is more than the length of the next cycle, an empty set is assigned to the coalition indexed with next plus 1 cycle element (332). If not more than the length of the next cycle, the method assigns the joint of coalitions indexed with next and next plus 1 cycle elements to the next coalition (333). The number of coalitions is then increased by 1 (334) and the process repeated by returning back to step (330).
  • FIG 4 a flowchart illustrating the methodology (400) of the Preference List (PL) component is provided.
  • the component uses known Sorting algorithm for reordering of a finite number of real numbers in non-increasing form (412).
  • This methodology (400) also involves calculation of a value of the next two coalitions (411) for each coalition of the partition.
  • a corresponding sequence of coalitions is assigned to the preference list of the next coalition (413) and, a preference list of the coalitions is assigned to the preference list of the partition (414).
  • FIG. 5 a flowchart illustrating the methodology (500) of the Cycle Decomposition of Partition (CDoP) component is provided.
  • the permutation of the set [k] is input (510) and 1 is assigned to the number of cycles and an UNVISITED status assigned to each position of the permutation (511). For each position of the permutation the status of the next position is determined (512). If this is not equal to UNVISITED, the number of cycles is decreased by 1 (518) and the cycle of decomposition of partition returned (519).
  • the methodology (500) includes assigning a first position number to the next element of the cycle and assigning 1 to the next position number element of the cycle (513).
  • the next position number element of the cycle is assigned to the next element of the cycle and a VISITED to status assigned to the next position number of the cycle (514). It is then determined whether the next element of permutation is equal to the first element of the cycle (515). If so, the obtained cycle elements are assigned to the next element and the number of cycles increased by 1 (516) and the process repeated from step (512). If not, the next element of permutation is assigned to the next position number of the cycle and the number of elements of the cycle increased by 1 (517) and the process repeated from step (514).
  • ⁇ 1 ⁇ ⁇ 6 ⁇ , ⁇ 3 ⁇ , ⁇ 7 ⁇ , ⁇ 8 ⁇ , ⁇ 5 ⁇ , ⁇ 1 ⁇ , ⁇ 2 ⁇ , ⁇ 4 ⁇ , ⁇ 9 ⁇ , ⁇ 10 ⁇ ;
  • ⁇ 2 ⁇ ⁇ 6 ⁇ , ⁇ 1 ⁇ , ⁇ 7 ⁇ , ⁇ 4 ⁇ , ⁇ 9 ⁇ , ⁇ 5 ⁇ , ⁇ 8 ⁇ , ⁇ 3 ⁇ , ⁇ 10 ⁇ , ⁇ 2 ⁇ ; ⁇ 3 ⁇ : ⁇ 2 ⁇ , ⁇ 10 ⁇ , ⁇ 8 ⁇ ) ⁇ 9 ⁇ , ⁇ 1 ⁇ , ⁇ 5 ⁇ , ⁇ 7 ⁇ 1 ⁇ 6 ⁇ , ⁇ 3 ⁇ , ⁇ 4 ⁇ ;
  • ⁇ 4 ⁇ ⁇ 2 ⁇ ) ⁇ 10 ⁇ , ⁇ 4 ⁇ , ⁇ 5 ⁇ , ⁇ 3 ⁇ , ⁇ 8 ⁇ , ⁇ 7 ⁇ , ⁇ 1 ⁇ , ⁇ 6 ⁇ , ⁇ 9 ⁇ ;
  • ⁇ 5 ⁇ ⁇ 5 ⁇ , ⁇ 2 ⁇ 1 ⁇ 1 ⁇ , ⁇ 7 ⁇ , ⁇ 6 ⁇ , ⁇ 8 ⁇ , ⁇ 9 ⁇ , ⁇ 10 ⁇ , ⁇ 3 ⁇ , ⁇ 4 ⁇ ;
  • ⁇ 7 ⁇ ⁇ 8 ⁇ , ⁇ 9 ⁇ I ⁇ 2 ⁇ I ⁇ 10 ⁇ , ⁇ 3 ⁇ , ⁇ 7 ⁇ , ⁇ 4 ⁇ , ⁇ 1 ⁇ , ⁇ 5 ⁇ , ⁇ 6 ⁇ ;
  • ⁇ 8 ⁇ ⁇ 7 ⁇ , ⁇ 4 ⁇ , ⁇ 8 ⁇ , ⁇ 2 ⁇ 1 ⁇ 6 ⁇ , ⁇ 10 ⁇ , ⁇ 9 ⁇ , ⁇ 3 ⁇ , ⁇ 1 ⁇ , ⁇ 5 ⁇ ;
  • ⁇ 9 ⁇ ⁇ 6 ⁇ , ⁇ 1 ⁇ , ⁇ 9 ⁇ , ⁇ 4 ⁇ 1 ⁇ 10 ⁇ , ⁇ 3 ⁇ , ⁇ 8 ⁇ , ⁇ 7 ⁇ , ⁇ 2 ⁇ , ⁇ 5 ⁇ ;
  • ⁇ 10 ⁇ ⁇ 9 ⁇ , ⁇ 2 ⁇ , ⁇ 1 ⁇ 1 ⁇ 6 ⁇ , ⁇ 10 ⁇ . ⁇ 8 ⁇ 1 ⁇ 3 ⁇ , ⁇ 7 ⁇ , ⁇ 4 ⁇ , ⁇ 5 ⁇ .
  • ⁇ ⁇ 1,3 ⁇ , ⁇ 6,10 ⁇ , ⁇ 2,4 ⁇ , ⁇ 5 ⁇ , ⁇ 7,8 ⁇ , ⁇ 9 ⁇ .
  • ⁇ 1 ,3 ⁇ ⁇ 9 ⁇ , ⁇ 5 ⁇ , ⁇ 7,8 ⁇ , ⁇ 6,10 ⁇ , ⁇ 1 ,3 ⁇ , ⁇ 2,4 ⁇ ;
  • ⁇ 6,10 ⁇ ⁇ 1 ,3 ⁇ , ⁇ 7,8 ⁇ , ⁇ 5 ⁇ , ⁇ 2,4 ⁇ , ⁇ 9 ⁇ , ⁇ 6,10 ⁇ ;
  • ⁇ 2,4 ⁇ ⁇ 7,8 ⁇ , ⁇ 9 ⁇ , ⁇ 6,10 ⁇ , ⁇ 5 ⁇ , ⁇ 2,4 ⁇ , ⁇ 1 ,3 ⁇ ;
  • ⁇ 5 ⁇ ⁇ 7,8 ⁇ , ⁇ 1 ,3 ⁇ , ⁇ 6,10 ⁇ , ⁇ 2,4 ⁇ , ⁇ 5 ⁇ , ⁇ 9 ⁇ ; ⁇ 7,8 ⁇ : ⁇ 5 ⁇ , ⁇ 9 ⁇ , ⁇ 2,4 ⁇ , ⁇ 6,10 ⁇ , ⁇ 7,8 ⁇ , ⁇ 1,3 ⁇ ;
  • Last column is equivalent to 5 / - 3 ⁇ 4 S 2 - Sj, S 3 - S 3 , S - S 5 , S ⁇ - S 4> S 6 - So.
  • Cycle Decomposition of Partition component decomposes the permutation to disjoint cycles: (1,2)(3)(4,5)(6).
  • ⁇ ⁇ 1,3,6,10 ⁇ , ⁇ 2,4 ⁇ , ⁇ 5,7,8 ⁇ , ⁇ 9 ⁇ .
  • ⁇ 1,3,6,10 ⁇ ⁇ 1,3,6,10 ⁇ , ⁇ 9 ⁇ , ⁇ 2,4 ⁇ , ⁇ 5,7,8 ⁇ ;
  • ⁇ 2,4 ⁇ ⁇ 1,3,6,10 ⁇ , ⁇ 2,4 ⁇ , ⁇ 5,7,8 ⁇ , ⁇ 9 ⁇ ;

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • General Factory Administration (AREA)
  • Position Fixing By Use Of Radio Waves (AREA)
  • Measurement Of Velocity Or Position Using Acoustic Or Ultrasonic Waves (AREA)
  • Silver Salt Photography Or Processing Solution Therefor (AREA)

Abstract

L'invention concerne un procédé (200) de formation de coalition pour un partage de spectre coopératif dans des réseaux sans fil cognitifs, ledit procédé consistant à : convertir une fonction caractéristique ayant une utilité transférable en une coalition hédonique (210) ; générer une liste de préférence d'une partition pour chaque paire d'une coalition de la partition (210) ; adapter et utiliser un algorithme de Gale-Shapley pour obtenir une permutation des coalitions (220) ; générer une décomposition cyclique de ladite permutation (230) ; et réunir des paires de coalitions afin de former une partition (240).
PCT/MY2014/000112 2013-11-26 2014-05-23 Procédé de formation de coalition pour un partage de spectre coopératif dans des réseaux sans fil cognitifs WO2015080547A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
MYPI2013004261A MY178093A (en) 2013-11-26 2013-11-26 Method of coalition formation for cooperative spectrum sharing in cognitive wireless networks
MYPI2013004261 2013-11-26

Publications (1)

Publication Number Publication Date
WO2015080547A1 true WO2015080547A1 (fr) 2015-06-04

Family

ID=51589477

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/MY2014/000112 WO2015080547A1 (fr) 2013-11-26 2014-05-23 Procédé de formation de coalition pour un partage de spectre coopératif dans des réseaux sans fil cognitifs

Country Status (2)

Country Link
MY (1) MY178093A (fr)
WO (1) WO2015080547A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107979846A (zh) * 2017-12-29 2018-05-01 中国人民解放军陆军工程大学 一种情景知觉下的重叠联盟博弈模型及空间自适应算法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070150404A1 (en) * 2005-12-28 2007-06-28 Golle Philippe J System and method for providing private stable matchings
US7860197B2 (en) 2006-09-29 2010-12-28 Samsung Electro-Mechanics Spectrum-sensing algorithms and methods
US8099057B2 (en) 2009-04-29 2012-01-17 Empire Technology Development Llc Spectrum sharing using cognitive radios

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070150404A1 (en) * 2005-12-28 2007-06-28 Golle Philippe J System and method for providing private stable matchings
US7860197B2 (en) 2006-09-29 2010-12-28 Samsung Electro-Mechanics Spectrum-sensing algorithms and methods
US8099057B2 (en) 2009-04-29 2012-01-17 Empire Technology Development Llc Spectrum sharing using cognitive radios

Non-Patent Citations (7)

* Cited by examiner, † Cited by third party
Title
AMIR LESHEM ET AL: "Multichannel Opportunistic Carrier Sensing for Stable Channel Access Control in Cognitive Radio Systems", IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, US, vol. 30, no. 1, 1 January 2012 (2012-01-01), pages 82 - 95, XP011391107, ISSN: 0733-8716, DOI: 10.1109/JSAC.2012.120108 *
DUSIT NIYATO ET AL: "Exploiting Mobility Diversity in Sharing Wireless Access: A Game Theoretic Approach", IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 9, no. 12, 1 December 2010 (2010-12-01), pages 3866 - 3877, XP011338550, ISSN: 1536-1276, DOI: 10.1109/TWC.2010.101310.100587 *
ELIAS Z TRAGOS ET AL: "Spectrum Assignment in Cognitive Radio Networks: A Comprehensive Survey", IEEE COMMUNICATIONS SURVEYS, IEEE, NEW YORK, NY, US, vol. 15, no. 3, 1 July 2013 (2013-07-01), pages 1108 - 1135, XP011523260, ISSN: 1553-877X, DOI: 10.1109/SURV.2012.121112.00047 *
LI HUANG ET AL: "Cognitive femtocell networks: an opportunistic spectrum access for future indoor wireless coverage", IEEE WIRELESS COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 20, no. 2, 1 April 2013 (2013-04-01), pages 44 - 51, XP011505961, ISSN: 1536-1284, DOI: 10.1109/MWC.2013.6507393 *
SAAD W ET AL: "Coalitional game theory for communication networks", IEEE SIGNAL PROCESSING MAGAZINE, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 26, no. 5, 1 September 2009 (2009-09-01), pages 77 - 97, XP011276079, ISSN: 1053-5888, DOI: 10.1109/MSP.2009.000000 *
SUNGWOOK KIM: "Cognitive Radio Bandwidth Sharing Scheme Based on the Two-way Matching Game", WIRELESS PERSONAL COMMUNICATIONS, KLUWER ACADEMIC PUBLISHERS, DO, vol. 68, no. 3, 20 December 2011 (2011-12-20), pages 893 - 905, XP035167050, ISSN: 1572-834X, DOI: 10.1007/S11277-011-0488-Z *
ZHONGGUI MA ET AL: "Dynamic Spectrum Allocation with Maximum Efficiency and Fairness in Interactive Cognitive Radio Networks", WIRELESS PERSONAL COMMUNICATIONS, KLUWER ACADEMIC PUBLISHERS, DO, vol. 64, no. 2, 5 December 2010 (2010-12-05), pages 439 - 455, XP035041149, ISSN: 1572-834X, DOI: 10.1007/S11277-010-0208-0 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107979846A (zh) * 2017-12-29 2018-05-01 中国人民解放军陆军工程大学 一种情景知觉下的重叠联盟博弈模型及空间自适应算法

Also Published As

Publication number Publication date
MY178093A (en) 2020-10-02

Similar Documents

Publication Publication Date Title
Eisen et al. Learning optimal resource allocations in wireless systems
Gai et al. Learning multiuser channel allocations in cognitive radio networks: A combinatorial multi-armed bandit formulation
Ding et al. Power allocation strategies in energy harvesting wireless cooperative networks
US9252929B2 (en) Method for achieving rendezvous for cognitive radio networks
Song et al. Multiple multidimensional knapsack problem and its applications in cognitive radio networks
CN106454700A (zh) 基于社交网络的d2d通信内容分发方案
Liu et al. ERP: Edge resource pooling for data stream mobile computing
Mehrjoo et al. Resource allocation in OFDMA networks based on interior point methods
Zhao et al. Joint subchannel and power allocation in multiuser OFDM systems with minimal rate constraints
Li et al. A distributed ADMM approach with decomposition-coordination for mobile data offloading
Huang et al. Spectrum allocation for cognitive radio networks with non-deterministic bandwidth of spectrum hole
Aggarwal et al. Joint energy-bandwidth allocation for multiuser channels with cooperating hybrid energy nodes
WO2015080547A1 (fr) Procédé de formation de coalition pour un partage de spectre coopératif dans des réseaux sans fil cognitifs
Li et al. Markov model bank for heterogenous cognitive radio networks with multiple dissimilar users and channels
Lan et al. Decentralized cognitive MAC protocol design based on POMDP and Q-Learning
CN107580773A (zh) 进行跨节点网络的负载平衡的装置和方法
Murmu A distributed approach to construct minimum spanning tree in cognitive radio networks
Zhang et al. From dynamic spectrum management to smart spectrum management
Li et al. Cognitive radio spectrum sharing using improved quantum genetic algorithm
Wang et al. Optimal cooperative water-filling power allocation for OFDM system
Kowalski et al. Estimating time complexity of rumor spreading in ad-hoc networks
Cristescu et al. Networked slepian-wolf: Theory and algorithms
Kriouile et al. Asymptotically optimal delay-aware scheduling in queueing systems
Kim et al. RL-based transmission completion time minimization with energy harvesting for time-varying channels
Herrera et al. Faster Convergence with Less Communication: Broadcast-Based Subgraph Sampling for Decentralized Learning over Wireless Networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14771963

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14771963

Country of ref document: EP

Kind code of ref document: A1