• Title/Summary/Keyword: Bandwidth re-allocation

Search Result 3, Processing Time 0.016 seconds

Intervenient Stackelberg Game based Bandwidth Allocation Scheme for Hierarchical Wireless Networks

  • Kim, Sungwook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4293-4304
    • /
    • 2014
  • In order to ensure the wireless connectivity and seamless service to mobile users, the next generation network system will be an integration of multiple wireless access networks. In a heterogeneous wireless access system, bandwidth allocation becomes crucial for load balancing to avoid network congestion and improve system utilization efficiency. In this article, we propose a new dynamic bandwidth allocation scheme for hierarchical wireless network systems. First, we derive a multi-objective decision criterion for each access point. Second, a bargaining strategy selection algorithm is developed for the dynamic bandwidth re-allocation. Based on the intervenient Stackelberg game model, the proposed scheme effectively formulates the competitive interaction situation between several access points. The system performance of proposed scheme is evaluated by using extensive simulations. With a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes under widely diverse network environments.

Resource Allocation Schemes for Legacy OFDMA Systems with Two-Way DF Relay (양방향 복호전달 릴레이를 사용하는 레거시 OFDMA 시스템에서의 자원 할당 기법)

  • Seo, Jongpil;Han, Chulhee;Park, Seongho;Chung, Jaehak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.10
    • /
    • pp.593-600
    • /
    • 2014
  • OFDMA systems solves frequency selective fading problem and provides improved performance by optimal allocation of subcarriers and transmit power. Two-way relay systems provide improved spectral efficiency compared to that of the conventional half-duplex relay using bidirectional communications. In legacy OFDMA system such as WiBro, two-way DF relay utilization causes pilot re-assignment and impossibility of channel estimation and decoding at relay nodes by self-interference. In this paper, resource allocation schemes for legacy OFDMA systems with two-way DF relay are proposed. The proposed schemes allocate subcarriers considering destinations nodes which are connected to relay nodes as individual nodes which are directly connected to a base station. Subsequently, the proposed schemes compensate bandwidth loss due to orthogonal allocations by overlapped allocating unused subcarriers at other noes. Numerical simulations show that the proposed resource allocation schemes provide improved performance compared with orthogonal allocation.

Design of Dynamic Buffer Assignment and Message model for Large-scale Process Monitoring of Personalized Health Data (개인화된 건강 데이터의 대량 처리 모니터링을 위한 메시지 모델 및 동적 버퍼 할당 설계)

  • Jeon, Young-Jun;Hwang, Hee-Joung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.187-193
    • /
    • 2015
  • The ICT healing platform sets a couple of goals including preventing chronic diseases and sending out early disease warnings based on personal information such as bio-signals and life habits. The 2-step open system(TOS) had a relay designed between the healing platform and the storage of personal health data. It also took into account a publish/subscribe(pub/sub) service based on large-scale connections to transmit(monitor) the data processing process in real time. In the early design of TOS pub/sub, however, the same buffers were allocated regardless of connection idling and type of message in order to encode connection messages into a deflate algorithm. Proposed in this study, the dynamic buffer allocation was performed as follows: the message transmission type of each connection was first put to queuing; each queue was extracted for its feature, computed, and converted into vector through tf-idf, then being entered into a k-means cluster and forming a cluster; connections categorized under a certain cluster would re-allocate the resources according to the resource table of the cluster; the centroid of each cluster would select a queuing pattern to represent the cluster in advance and present it as a resource reference table(encoding efficiency by the buffer sizes); and the proposed design would perform trade-off between the calculation resources and the network bandwidth for cluster and feature calculations to efficiently allocate the encoding buffer resources of TOS to the network connections, thus contributing to the increased tps(number of real-time data processing and monitoring connections per unit hour) of TOS.