A sustainable and collaborative strategy for dynamic spectrum management in next generation wireless networks

被引:3
|
作者
Paul, Ayan [1 ]
Maitra, Madhubanti [2 ]
Mandal, Swarup [3 ]
Sadhukhan, Samir K. [4 ]
Saha, Debashis [4 ]
机构
[1] Bharat Sanchar Nigam Ltd, Kolkata 700084, India
[2] Jadavpur Univ, Dept Elect Engn, Kolkata, India
[3] Wipro Technol Ltd, Kolkata, India
[4] Indian Inst Management Calcutta, MIS Grp, Kolkata, India
关键词
Dynamic spectrum management; Decision support system; Cooperative game theory; Bankruptcy game; Shapley value; tau-value; COGNITIVE RADIO NETWORKS; ALLOCATION; ACCESS;
D O I
10.1016/j.engappai.2013.01.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Next generation wireless technologies offer various services from voice call to full motion pictures and even to high speed internet access. Consequently, the service providers (SP) armed with different wireless technologies (like 2.5G/3G/LTE) would require an adequate and significant amount of spectrum bandwidth for satisfying the need of their customers. Hence to achieve complete commercialization, the SPs, operating simultaneously, would demand for more and more spectrum from the regulatory body of the country. The spectrum demand on the part of the SP may vary with time (dynamic) because of varied kind of loads which are generated depending on the nature of the client-base, their requirements and their expected quality of experience. This work has addressed this challenging issue of allocating spectrum dynamically to different technologies under the portfolio of an SP. Here, we have conceived a scenario where service providers (SP) own multiple access networks (ANs) of different technologies. We envisage that an entity, called local spectrum controller (LSC) which is dedicated for managing the common pool of spectrum allocated to each SP. LSC is mainly responsible for distributing the spectrum to individual ANs of an SP in a fair manner. Since the available spectrum may not be sufficient enough to satisfy the aggregate demand from all ANs simultaneously, an LSC may face a situation, where satisfying individual demands from all ANs may result in a compromise between the demand and supply. This demand-supply situation would force an LSC or an SP to adhere to some dynamic spectrum management strategy, where demands of an AN would have to be satisfied depending on the current state of available spectrum and required usage of it. This calls for an adaptive dynamic strategy to be introduced by an SP for efficient spectrum distribution. The dynamic disparity of spectrum allocation can be idealized as a game between LSC and ANs. Hence, in the present work, we have modeled the problem of dynamic spectrum allocation as an n-player cooperative bankruptcy game and have solved the problem with the help of Shapley value and tau-value separately. We have investigated whether the ANs find it beneficial to cooperate with each other to make the solution sustainable enough. To evaluate the performances of the games that the ANs play, we have designed a novel utility function for each AN. We have identified plausible aims of an SP as minimizing overall dissatisfaction (MOD) and maximizing equality of distribution (MED). Next, we have studied performances of the above two solution concepts against max-min fairness algorithm (benchmarked in our case) with respect to the above objectives of LSC. Finally, we have proposed a unique heuristic in order to facilitate the decision making process of dynamic spectrum allocation, which leads to an adaptive yet optimized spectrum allocation strategy. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1620 / 1630
页数:11
相关论文
共 50 条
  • [1] Spectrum Management Framework in Next Generation Wireless Networks
    Mahapatra, Rajarshi
    [J]. 2016 IEEE ANNUAL INDIA CONFERENCE (INDICON), 2016,
  • [2] A dynamic distance based Location management strategy utilizing user profiles for next generation wireless networks
    Sricharan, M. S.
    Vaidehi, V.
    [J]. 2006 INTERNATIONAL CONFERENCE ON INDUSTRIAL AND INFORMATION SYSTEMS, VOLS 1 AND 2, 2006, : 388 - +
  • [3] NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey
    Akyildiz, Ian F.
    Lee, Won-Yeol
    Vuran, Mehmet C.
    Mohanty, Shantidev
    [J]. COMPUTER NETWORKS, 2006, 50 (13) : 2127 - 2159
  • [4] DYNAMIC SPECTRUM MANAGEMENT IN WIRELESS NETWORKS
    Babaei, Alireza
    Park, Jinwoo
    Veque, Veronique
    Trivedi, Gautam
    [J]. IEEE WIRELESS COMMUNICATIONS, 2010, 17 (04) : 4 - 5
  • [5] Spectrum sharing for next generation wireless communication networks
    Kumar, Sanjay
    Costa, Gustavo
    Kant, Shashi
    Frederiksen, Flemming Bjerge
    Marchetti, Nicola
    Mogensen, Preben
    [J]. 2008 FIRST INTERNATIONAL WORKSHOP ON COGNITIVE RADIO AND ADVANCED SPECTRUM MANAGEMENT, 2008, : 30 - 34
  • [6] An intelligent location management strategy for next generation wireless networks: A rule base approach
    Maitra, M
    Bhattacharjee, PS
    Saha, D
    Mukherjee, A
    Esakkiappan, C
    [J]. 2005 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: WCNC 2005: BROADBAND WIRELESS FOR THE MASSES READY FOR TAKE-OFF., 2005, : 1365 - 1370
  • [7] Dynamic Security Architecture for Next Generation Wireless Networks
    Youssef, Khaled Y.
    Hafez, Ahmed A.
    Zekry, Abdel Halim A.
    [J]. 2012 SEVENTH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING & SYSTEMS (ICCES'2012), 2012, : 35 - 40
  • [8] A dynamic hierarchical mobility management protocol for next generation wireless metropolitan area networks
    Zhou, Hairong
    Yeh, Chihsiang
    Mouftah, Hussein T.
    [J]. 2007 4TH IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-3, 2007, : 390 - +
  • [9] Review: Wideband Spectrum Sensing for Next Generation Wireless Networks
    Joshi, Himani
    Darak, Sumit J.
    [J]. 2019 URSI ASIA-PACIFIC RADIO SCIENCE CONFERENCE (AP-RASC), 2019,
  • [10] Fast Spectrum Shaping for Next-Generation Wireless Networks
    Chai, Eugene
    Shin, Kang G.
    Lee, Jeongkeun
    Lee, Sung-Ju
    Etkin, Raul H.
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2014, 13 (01) : 20 - 34