Radio Resource Management Scheme for Multi-Agency TEDS Networks

被引:0
|
作者
AlQahtani, Salman A. [1 ]
机构
[1] King Saud Univ, Coll Comp & Informat Sci, Dept Comp Engn, Riyadh, Saudi Arabia
关键词
Dynamic partitioning-based RRM; Performance evaluation; Resource sharing; TETRA;
D O I
10.1007/s13369-013-0628-8
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
This paper contributes to the evolution of public safety communication networks by specifying a solution for managing the radio resources of multi-agency Terrestrial Trunked Radio Enhanced Data Services (TEDS) networks. A TEDS network can be securely partitioned so that different public safety agencies such as police, fire, ambulance, etc. can share a single network's infrastructure including base stations and main switches. This sharing feature offers a cost-effective solution not only for network investment, but it also helps to reduce the costs of network operation, implementation and maintenance. The real implementation of TETRA sharing is not easy because radio resources and other shared resources must be managed among all agencies in an efficient and secure way. Without an efficient radio resource management (RRM) policy, one agency can exhaust the capacity of others. This study proposes a radio resource allocation scheme to provide maximum system throughput and proportional fairness in accordance with agency capacity, which is shared through a dynamic resource allocation scheme. The performance analysis of this scheme in terms of throughput, bounded delay and queue size are obtained. Numerical and simulation results show that the proposed dynamic partitioning-based rate RRM scheme, referred to as DP-RRM, improves both system throughput and average delays.
引用
收藏
页码:3321 / 3330
页数:10
相关论文
共 50 条
  • [31] Ghost Femtocells: a Novel Radio Resource Management Scheme for OFDMA Based Networks
    Strinati, Emilio Calvanese
    De Domenico, Antonio
    Duda, Andrzej
    2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2011, : 108 - 113
  • [32] A Radio Resource Management Scheme in future Ultra-Dense Phantom Networks
    Di Maria, Antonio
    Panno, Daniela
    2017 IEEE 13TH INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB), 2017, : 570 - 575
  • [33] Multi-Agency Regional Transportation Management in San Antonio, TX, USA
    Friebele, John
    Irwin, Patrick L.
    ITE JOURNAL-INSTITUTE OF TRANSPORTATION ENGINEERS, 2009, 79 (06): : 46 - 47
  • [34] A FORMATIVE EVALUATION OF THE VALUE OF COLLABORATION IN A MULTI-AGENCY CASE MANAGEMENT CONSORTIUM
    Giunta, N.
    Johnson, J. K.
    Morano, C.
    GERONTOLOGIST, 2012, 52 : 517 - 517
  • [35] Multi-agency Is Coordination and (Limited) Communication
    Kazmierczak, Piotr
    Agotnes, Thomas
    Jamroga, Wojciech
    PRIMA 2014: PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS, 2014, 8861 : 91 - 106
  • [36] Design and realization of a multi-modal/multi-agency transit management and information system
    Dailey, DJ
    Cathey, FW
    Maclean, SD
    2003 IEEE INTELLIGENT TRANSPORTATION SYSTEMS PROCEEDINGS, VOLS. 1 & 2, 2003, : 1664 - 1669
  • [37] Joint radio resource management algorithm for multi-RAT networks
    Giupponi, L
    Agustí, R
    Pérez-Romero, J
    Sallent, O
    GLOBECOM '05: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6: DISCOVERY PAST AND FUTURE, 2005, : 3851 - 3855
  • [38] Multi-agency Problem in Financial Markets
    Magessi, Nuno Trindade
    Antunes, Luis
    MULTI-AGENT BASED SIMULATION XVIII, MABS 2017, 2018, 10798 : 170 - 183
  • [39] Adaptive Multi-Objective Optimization Scheme for Cognitive Radio Resource Management
    AlQerm, Ismail
    Shihada, Basem
    2014 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2014), 2014, : 857 - 863
  • [40] Life & Times Supporting the 'multi' in multi-agency working: learning with and from each other could enable multi-agency safeguarding
    Dixon, Sharon
    Kendall, Bryony
    Driscoll, Jenny
    Pope, Catherine
    BRITISH JOURNAL OF GENERAL PRACTICE, 2022, 72 (722): : 438 - 439